Two event-driven simulation tools aimed at testing access control and routing mechanisms in an Asynchronous Transfer Mode (ATM) environment are presented. The first one is dedicated to the behavioural description of an ATM Virtual Circuit (VC) switch. The purpose is to test resource allocation and Call Admission Control (CAC) strategies, so only the relevant events for this objective are considered and some important functions (e.g., the switching element) for a complete description of an ATM switch are not explicitly modeled. The second simulator has been designed to test routing strategies for an ATM network. In such a case, a higher level of abstraction than in the previous one is necessary and, again, only the meaningful events to the aim are taken into account. Some resource allocation, CAC, and routing schemes are also reported, along with the description of the simulation tools. Several simulation results are discussed, in order to assess their performance.
HuiJ.Y.1990. Switching and Traffic Theory for Integrated Broadband Networks. Sage UK: London, England: SAGE Publications.
3.
ITU-T Recommendation 1.610.1993. B-ISDN Operation and Maintenance Principles and Functions. March.
4.
HongD.SudaT.1991. “Congestion control and prevention in ATM networks.” IEEE Network Mag. vol. 5, no. 4, July, pp. 10–16.
5.
BollaR.DavoliF.LombardoA.PalazzoS.PannoD.1994. “Hierarchical dynamic control of multiple traffic classes in ATM networks.” Europ. Trans. Telecommun. vol. 5, no. 6, November, pp. 747–755.
6.
ShimC.RyooI.LeeJ.LeeS.B.1994. “Modelling and call admission control algorithm of variable bit rate video in ATM networks.” IEEE J. Select. Areas Commun. vol. 12, no. 2, February, pp. 332–344.
7.
GuérinR.AhmadiH.NaghshinehM.1991.“Equivalent capacity and its application to bandwidth allocation in high-speed networks.” IEEE J. Select. Areas Commun. vol. 9, no. 7, September, pp. 968–981.
8.
BollaR.DavoliF.MarcheseM.1996. “Simple schemes for traffic integration at call set-up level in ATM networks.” Computer Communications vol. 19, pp. 645–652.
9.
BollaR.DanovaroF.DavoliF.MarcheseM.1993. “An integrated dynamic resource allocation scheme for ATM networks.” Proc. IEEE Infocom '93, San Francisco, CA, March, vol. 3, pp. 1289–1297.
10.
KulkarniV.G.GunL.ChimentoP.F.1995. “Effective bandwidth vectors for multiclass traffic multiplexed in a partitioned buffer.” IEEE J. Select. Areas Commun. vol. 13, no. 6, August.
11.
SidhuI.JordanS.1995. “Multiplexing gains in bit stream multiplexors.” IEEE/ACM Trans. Networking vol. 3, no. 6, December, pp. 785–797.
12.
WuG.-L.MarkJ.W.1995. “A buffer allocation scheme for ATM networks: Complete sharing based on virtual partitions.” IEEE/ACM Trans. Networking vol. 3, no. 6, December, pp. 660–670.
13.
RosbergZ.1996. “Cell multiplexing in ATM networks.” IEEE/ACM Trans. Networking vol. 4, no. 1, February, pp. 112–122.
14.
ChangC.-S.ThomasJ.A.1995. “Effective bandwidth in high-speed digital networks.” IEEE J. Select. Areas Commun. vol. 13, no. 6, August, pp. 1091–1100.
15.
de VecianaG.KesidisG.WalrandJ.1995. “Resource management in wide-area ATM networks using effective bandwidths.” IEEE J. Select. Areas Commun. vol. 13, no. 6, August, pp. 1081–1090.
16.
TseD.N.C.GallagerR.G.TsitsiklisJ.N.1995. “Statistical multiplexing of multiple time-scale Markov streams.” IEEE J. Select. Areas Commun. vol. 13, no. 6, August, pp. 1028–1038.
17.
ElwalidA.I.MitraD.WentworthR.H.1995. “A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node.” IEEE J. Select. Areas Commun. vol. 13, no. 6, August, pp. 1115–1127.
18.
ChoudhuryG.L.LucantoniD.M.WhittW.1996. “Squeezing the most out of ATM.” IEEE Trans. Commun. vol. 44, no. 2, February, pp. 203–217.
19.
BollaR.DavoliF.MarcheseM.1995. “A distributed strategy for CAC and routing in ATM networks.” Proc. First IFIP Workshop on ATM Traffic Management (WATM'95), Paris, France, December, pp. 357–363.
20.
GuptaS.RossK.W.Ei ZarkiM.1992. “Routing in virtual path based ATM networks.” Proc. IEEE Clobecom'92, Orlando, FL, December, pp. 571–575.
21.
GuptaS.GandhiP.P.1994. “Dynamic routing in multi-class non-hierarchical networks.” Proc. IEEE Internal. Conf. Commun. (ICC '94), New Orleans, LA, May, pp. 1390–1394.
22.
HymanJ.M.LazarA.A.PacificiG.1994. “A methodology for Virtual Path and Virtual Network bandwidth assignment in broadband networks with QOS guarantees.” Proc. IEEE Internat. Conf. Commun. (ICC '94), New Orleans, LA, May, pp. 165–169.
23.
MaunderA.MinP.S.1994. “Routing for multirate traffic with multiple qualities of service.” Proc. Internat. Conf. on Computer Commun. and Networks (ICCCN’94), San Francisco, CA, September, pp. 104–108.
24.
ChenW.-T.LiuU.-J.1994. “Routing problem with performance requirement translation for multimedia communications in an ATM wide-area network.” Proc. IEEE Internat. Conf. Commun. (ICC '94), New Orleans, LA, May, pp. 1490–1493.
25.
PlotkinS.1995. “Competitive routing of virtual circuits in ATM networks.” IEEE J. Select. Areas Commun. vol. 13, August, pp. 1128–1136.
26.
MurakamiK.KimH.S.1996. “Virtual Path routing for survivable ATM networks.” IEEE/ACM Trans. Networking vol. 4, February, pp. 22–39.
27.
AlqaedA.M.ChangC.H.1994. “Simulation driven resource allocation in ATM networks.” Simulation Digest vol. 24, no. 2, pp. 2–19.
28.
FreebersyserJ.A.TownsendJ.K.1996. “Efficient simulation of cell loss probability in ATM networks with heterogeneous connection traffic descriptor.” Proc. IEEE Internat. Conf. Commun. (ICC’96), Dallas, TX, June, pp. 320–327.
29.
AlyK.A.DowdP.V.V.1991. “Simulation of fast packet-switched photonic networks for interprocessor communication.” 24th Annual Simulation Symp., New Orleans, LA, April, pp. 301–311.
30.
LinY.-B.1994. “Parallel independent replicated simulation on a network of workstations.” Proc. 8th Workshop on Parallel and Distributed Simulation (PADS’94), Edinburgh, Scotland, U.K., July, pp. 73–80.
31.
HuangC.DevetsikiotisM.LambadarisI.KayeA.R.1995. “Fast simulation for self-similar traffic in ATM networks.” Proc. IEEE Internat. Conf. Commun. (ICC’95), Seattle, WA, June, pp. 438–444.
32.
KumarA.SinghS.1992. “Simulation based performance study of a dynamic routing algorithm.” Simulation Digest vol. 22, no. 1, pp. 28–38.
33.
PittsJ.M.SchormansJ.A.1996. Introduction to ATM Design and Performance. Sage UK: London, England: SAGE Publications.
34.
GarziaM.R.1990. “Discrete event simulation methodologies and formalisms.” Simulation Digest vol. 21, no. 1, pp. 3–13.
35.
PollaciaL.F.1989. “A survey of discrete event simulation and state-of-the-art discrete event languages.” Simulation Digest vol. 20, no. 3, pp. 8–25.
RossK.W.1995. Multiservice Loss Models for Broadband Telecommunication Networks. Sage UK: London, England: SAGE Publications.
40.
CosmasJ.P., et al. 1994. “A review of voice, data and video traffic models for ATM.” Europ. Trans. Telecommun. vol. 5, no. 2, March-April, pp. 11–26.
41.
YangT.TsangH.K.1995. “A novel approach to estimating the cell loss probability in an ATM multiplexer loaded with homogeneous on-off sources.” IEEE Trans. Commun. vol. 43, no. 1, January, pp. 117–126.
42.
BollaR.DavoliF.MarcheseM.1996. “Evaluation of a cell loss rate computation method in ATM multiplexers with multiple bursty sources and different traffic classes.” Proc. IEEE Globecom’96, London, U.K., November, pp. 437–441.
