Abstract
The principle of Maximum Entropy (ME) and the notion of system decomposition are combined towards the creation of an iterative cost-effective approximation algorithm for the performance analysis of packet-switched buffered Banyan Multistage Interconnection Network (MIN) based Asynchronous Transfer Mode (ATM) switch architectures with arbitrary buffer sizes, multiple input/output ports and Repetitive Service (RS) internal blocking.
Traffic entering and flowing in the MIN is assumed to be bursty and it is modelled by a Compound Poisson Process (CPP) with geometrically distributed bulk sizes and Generalised Exponential (GE) interarrival times. The GE distribution is also adopted to represent the random nature of the effective service times of packets due to the combined effects of traffic burstiness and RS blocking
Entropy maximisation implies decomposition of the Banyan network into individual building block queues of switching elements, represented by shared buffer cross bars, under revised GE-type interarrival and service times. Each building block queue is analysed in isolation by applying ME techniques and classical queueing theory, subject to marginal mean value constraints, in order to obtain a product form solution for the joint queue length distribution and typical performance metrics of the network.
Numerical results are included to validate the credibility of the ME approximation against simulation, define experimental performance bounds and perform a buffer capacity optimisation across the entire network.
Supported by the Engineering and Physical Sciences Research Council (EPSRC), UK, under grant GR/K/67809.
Chapter PDF
Similar content being viewed by others
Keywords
References
Boyer P, Lehnert M R and Kuehn P J, “Queueing in an ATM basic switch element”, Technical Report CNET–123–030–CD–CC, CNET, France, 1988.
Eng K Y, Karol M K and Yeh Y-S, “A Growable Packet (ATM)Switch Architecture: Design Principles and Applications,” IEEE Trans. Comm., 40, no. 2, pp. 423–430, Feb. 1992.
Gelenbe, E. and Pujolle, G., The Behaviour of a single Queue in a General Queueing Network, Acta Informatica, 7, pp. 123–160, 1976.
Harrison P G and Pinto A de C, “Blocking in Asynchronous, Buffered Banyan Networks,” In Proc. of the IFIP WG 7.3 International Conference on the Performance of Distributed Systems and Integrated Communication Networks, Kyoto, Japan, ed. T Hasegawa, H Takagi and Y Takahashi, North-Holland, pp. 169–188, 1992.
Harrison P G and Pinto A de C, “An Approximate Analysis of Asynchronous, Packet-switched Buffered Banyan Networks with Blocking,” Performance Evaluation, 19, pp. 223–258, 1994.
Hong S, Perros H G and Yamashita H, “A discrete-time queueing model of the shared buffer switch with bursty arrivals,” Research Report, Computer Science Department, North Carolina State University, 1992.
Jaynes, Prior probabilities, IEEE Trans. Syst. Sci. Cybern. SSC–4, pp. 227–241, 1968.
Karol M J and C-L I, “Performance Analysis of a Growable Architecture for Broad-Band Packet (ATM) Switch,” IEEE Trans. Comm., 40, no. 2, pp. 431–439, Feb. 1992.
Kleinrock, Queueing Systems, Vol. 1: Theory, John Wiley and Sons, Inc., 1975.
Kouvatsos, A Universal Maximum Entropy Algorithm for the Analysis of General Closed Networks, Computing Networking and Performance Evaluation, IFIP WG 7.3, T. Hasegawa, et al (Eds.), pp. 113–124, North Holland, 1986.
Kouvatsos, A Maximum Entropy Analysis of and the G/G/1 Queue at Equilibrium, J. Opl. Res. Soc., Vo1. 39, pp. 183–200, 1988.
Kouvatsos D and Xenios N, “MEM for Arbitrary Queueing Networks with Multiple General Servers and Repetitive-service Blocking,” Performance Evaluation, 10, pp. 169–195. Sep. 1989.
Kouvatsos and N. Tabet-Aouel, Product-Form Approximations for an Extended Class of General Closed Queueing Network, Performance’90, IFIP WG 7.3 and BCS, P. King et al (Eds.), North-Holland, pp. 301–315, 1990.
Kouvatsos D and Denazis S G, “A Universal Building Block for the Approximate Analysis of a Shared Buffer ATM Switch Architecture,” Annals of OR, 44, pp. 241–278, 1994.
Kouvatsos, D. D., Tabet-Aouel, N. and Denazis, S. G., “ME-Based Approximations for General Discrete-Time Queueing Models”, Performance Evaluation, Special Issue on Discrete-Time Models and Analysis Methods of Performance Evaluation, Vol. 21, pp 81–109, 1994.
Kouvatsos, Entropy Maximisation and Queueing Network Models, Annals of Operations Research, Special Issue on Queueing Networks, Vol. 48, pp. 63–126, 1994.
Kouvatsos, D.D. and Wilkinson, J., “A Product-Form Approximation for Discrete-Time Arbitrary Networks of ATM Switch Architectures”, Performance Modelling and Evaluation of ATM Networks, IFIP Publication, Chapman and Hall, London, Vol. 1, pp. 365–383, 1995.
Kouvatsos, D. D. and Fretwell, R. “Closed Form Performance Distributions of a Discrete Time GIG/D/ 1/N Queue with Correlated Traffic”, Data Communications and their Performance, IFIP Publication, Fdida, S. and Onvural, R. O. (eds.), Chapman and Hall, London pp. 142–163, 1995.
Kuwahara H, Endo N, Ogino M and Kozaki T, “A Shared Buffer Memory Switch for an ATM Exchange,” In Proc. Int. Conf. on Communications, Boston, MA, pp. 441–444, June 1989.
Lin, T., and Kleinrock L, “Performance Analysis of Finite-Buffered Multistage Interconnection Networks with a General Traffic Pattern,” In Proc. ACM SIG METRICS’91, pp. 68–89, 1991.
Nojo and Watanabe H, A New Stage Method Getting Arbitrary Coefficient of Variation by two stages, Trans. IEICE 70, pp. 33–36, 1987.
Shore, J. E., and Johnson, R. W., Axiomatic derivation of the principle of ME and the principle of minimum cross-entropy, IEEE Trans. Info. Theory IT–26, 1980.
Sauer, Configuration of Computing Systems: An Approach Using Queueing Network Models, PhD Thesis, University of Texas, 1975.
Szymanski T and Shaikh S, “Markov Chain Analysis of Packet-Switched Banyans with arbitrary Switch Sizes, Queue Sizes, Link Multiplicities and Speedups,” 1989 IEEE INFOCOM, pp. 960–971, 1989.
Tobagi F, “Fast Packet Switch Architectures for Broadband Integrated Services Digital Networks,” Proc. of the IEEE, vol. 78, no. 1, Jan. 1990.
Yamashita H, Perros H G and Hong S, “Performance modelling of shared buffer ATM switch architecture,” In Teletraffic and Datatraffic in a Period of Change, eds. Jensen and Iversen, North-Holland, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Kouvatsos, D., Wilkinson, J., Harrison, P., Bhabuta, M. (1996). Performance Analysis of Buffered Banyan ATM Switch Architectures. In: Kouvatsos, D.D. (eds) ATM Networks. ATM 1995. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35068-4_16
Download citation
DOI: https://doi.org/10.1007/978-0-387-35068-4_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2902-2
Online ISBN: 978-0-387-35068-4
eBook Packages: Springer Book Archive