Abstract
Performance of ATM networks will depend on switch performance and architectures. The main problem when designing a switch is due to the fact that the future traffic is unknown. Traffics are expected to be bursty. Input processes into one switch are not mostly source processes (voice, data or video traffic), they are mostly output processes from other switches. So when studying a switch performance, it is necessary to verify whether the assumptions on input processes still hold for output processes.
Performance of an ATM switch based on a three-stage Clos Network with output buffers is studied under “Bursty Geometric” arrivals. The aim of the analysis is to dimension the output buffers of each of the three stages of the considered ATM switch. The output traffic is studied. It is well approximated by a bursty geometric process. The interstage traffic and the output traffic of the switch can consequently be approximated by such processes. It validates the input assumptions. An approximate model of the switch is presented. Discrete event simulations are used to validate our model. Analysis of the results shows that the switch dimensioning is important. The use of non-symmetric switching elements reveals itself efficient for bursty traffic. The burstiness has an influence on the cell loss probability but it has no influence on the cell delay and no influence on the best memory repartition for a given global memory size and a given architecture.
This work was supported by a CNET Grant
Chapter PDF
References
CCITT, Draft Recom. L121 “On the broadband aspect of ISDN”, Seoul, February 1988.
F. Tobagi “Fast Packet Switch Architectures for Broadband Integrated Service Digital Networks”, Proceedings of the IEEE, vol 78, n°1, January 1990.
D. Meliksetian, C.R. Chen “A MMBP Approximation for the Analysis of Banyan Networks”, ACM Sigmetrics Conference, May 1993, Santa Clara California.
T. Morris, H. Perros, “Performance Modelling of a multi-buffered Banyan Switch under Bursty Traffic”, IEEE Infocom’92, paper 3D.2, Florence 1992.
A. Nilsson, F. Lai, H. Perros “An approximate analysis of a bufferless NxN Synchronous Clos ATM Switch”, ITC’13, Copenhagen June 1991.
H. Yamashita, H. Perros, S. Hong “Performance analysis of a shared buffer ATM switch under bursty arrivals”, ITC’13, Copenhagen, June 1991.
C. Clos “A study of non-blocking switching networks” Bell Syst. Tech. T. 32 406–424, 1953
A.-L. Beylot, M. Becker “Performance Analysis of an ATM Clos Switch with non-symmetric Switching elements and Output Buffers”, ITC Seminar, Bangalore, Nov 1993
F. Bonomi, S. Montagna, R. Paglino, “Busy period for an ATM switching element output line”, IEEE Infocom’92, Paper 4C.2, Florence 1992.
C. Blondia, O. Casals, “Statistical Multiplexing of VBR Sources: A Matrix-Analytic Approach”, Performance Evaluation Vol 16, n°1–3, pp 5–20, Nov. 1992.
Y. Jenq “Performance analysis of packet switch based on single-buffered Banyan network”, IEEE JSAC, vol. sac-1, n°6, December 1983.
A-L. Beylot, I. Kohlenberg, M. Becker “Performance Analysis of three-stage Clos Interconnection Network under non-uniform Traffic Patterns” IFIP Conference Broadband Communications’94, Paris, March 1994.
M. Becker, P. Douillet “Hierarchical Importance Sampling a Self-Adjusting Tool for the Simulation of Rare Events”. ORSA/TIMS/SMAI Conference on Applied probabilities in Engineering, June 1993, Paris.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Beylot, AL., Kohlenberg, I., Becker, M. (1995). A Performance Evaluation of a 3-stage ATM Clos Switch under bursty traffic. In: Kouvatsos, D.D. (eds) Performance Modelling and Evaluation of ATM Networks. ATM 1994. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34881-0_13
Download citation
DOI: https://doi.org/10.1007/978-0-387-34881-0_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6164-1
Online ISBN: 978-0-387-34881-0
eBook Packages: Springer Book Archive