Advertisement

An Information Theoretic Methodology for QNMs of ATM Switch Architectures

  • Demetres Kouvatsos
Part of the The International Series in Engineering and Computer Science book series (SECS, volume 557)

Abstract

The performance modelling and quantitative analysis of Asynchronous Transfer Mode (ATM) switch architectures constitute a rapidly growing application area due to the their ever expanding usage and the multiplicity of their component parts together with the complexity of their functioning. However, there are inherent difficullties and open issues associated with the cost-effective evaluation of these systems before a global integrated broadband network infrastructure can be established. This is due to the need for derived performance metrics such as queue length and response time distributions, the complexity of traffic characterisation and congestion control schemes and the existence of multiple packet classes with space and time priorities under various blocking mechanisms and buffer management schemes.

Queueing network models (QNMs) are widely recognised as powerful and realistic tools for the performance monitoring and prediction of packet-switched computer communication systems. However, analytic solutions for QNMs are often hindered by the generation of large state spaces requiring further approximations and a considerable (or, even prohibitive) amount of computation. This tutorial paper highlights a cost-effective methodology for the exact and/or approximate analysis of some complex QNMs of ATM networks consisting of multi-buffered, shared buffer, shared medium and space division switch architectures. The methodology has its roots on the information theoretic principle of Maximum Entropy (ME), queueing theoretic concepts and batch renewal traffic processes. Comments on further research work are included.

Keywords

ATM Switch Architectures Queueing Network Models (QNMs) Repetitive Service Blocking with Random Destination (RS-RD) Maximum Entropy (ME) Partial Buffer Sharing (PBS) Head-of-Line (HoL) Batch Renewal Process GGeo GE sGGeo 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Mitra, D., “Stochastic Fluid Models”, Performance’ 87, Brussels, 1987Google Scholar
  2. [2]
    Tobagi, F., “Fast Packet Switch Architectures for Broadband Integrated Services Digital Networks”, Proc. of IEEE, Vol. 78, No. 1, Jan. 1990Google Scholar
  3. [3]
    Jaynes, E.T., “Information Theory and Statistical Mechanics”, II Phys. Rev. 108, pp. 171–190, 1957CrossRefzbMATHMathSciNetGoogle Scholar
  4. [4]
    Kouvatsos, D.D. and Fretwell, R.J., “Batch Renewal Process: Exact Model of Traffic Correlation”, High Speed Networking for Multimedia Application, W. Effelsbery (ed.), Kluwer Academic Press, pp. 285–304, 1996Google Scholar
  5. [5]
    Kouvatsos, D.D., “Entropy Maximisation and Queueing Network Models”, Annals of Operation Research, Vol. 48, pp. 63–126, 1994zbMATHGoogle Scholar
  6. [6]
    Kouvatsos, D.D. and Tabel-Aouel, N.M., “GGeo-Type Approximations for General Discrete-Time Queueing Systems”, Modelling and Performance Evaluation of ATM Technology, IFIP Publication, Perros H. Pujolle, G. and Takahaghi, Y. (eds.), North-Holland, pp. 469–483, 1993Google Scholar
  7. [7]
    Kouvatsos, D.D., Tabel-Aouel, N.M., and Denazis, S.G., “Approximate Analysis of Discrete-Time Networks with or without Blocking”, High Speed Networks and their Performance (C-21), Perros, H.G., and Viniotis, Y. (eds.), North-Holland, pp. 399–424, 1994Google Scholar
  8. [8]
    Shore, J.E. and Johnson, R.W., “Axiomatic Derivation of the Principle of Maximum Entropy and the Principle of Minimum Cross-Entropy”, IEEE Trans. Inf. Theory IT-26, pp. 26–27, 1980MathSciNetGoogle Scholar
  9. [9]
    Kouvatsos, D.D. and Fretwell, R.J., “Discrete Time Batch Renewal Processes with Application to ATM Switch Performance”, Proc. 10th. UK Computer and Telecomms. Performance Eng. Workshop, Jane Hillston et al. (eds.), Edinburgh University Press, pp. 187–192, Sept. 1994Google Scholar
  10. [10]
    Kouvatsos, D.D. and Fretwell, R.J., “Closed Form Performance Distributions of a Discrete Time GIG/D/1/N Queue with Correlated Traffic”, Enabling High Speed Networks, Fdida, S. and Onvural, R.O., (eds.), IFIP publication, Chapman and Hall, pp. 141–163, October, 1995Google Scholar
  11. [11]
    Fretwell, R.J. and Kouvatsos, D.D., “Correlated Traffic Modelling: Batch Renewal and Markov Modulated Processes”, Performance Modelling and Evaluation of ATM Networks, Volume 3, Kouvatsos, D.D. (ed.), IFIP publication, Chapman and Hall, pp. 20–43, Sept. 1997Google Scholar
  12. [12]
    Laevens, K., “The Output Process of a Discrete-time GIG/D/1 Queue”, Proc. 6th. IFIP Workshop on Performance Modelling and Evaluation of ATM Networks, Kouvatsos, D.D. (ed.), pp. 20/1–20/10, July 1998Google Scholar
  13. [13]
    Molnár, S. and Miklós, G., “On Burst and Correlation Structure of Teletraffic Models”, Proc. 5th. IFIP Workshop on Performance Modelling and Evaluation of ATM Networks, Kouvatsos, D.D. (ed.), pp. 22/1–22/10, July 1997Google Scholar
  14. [14]
    Skliros, A., “Optimising Call Admission Control Schemes for NCX-1E6 ATM Multiservice Switches”, ECI Telematics International Ltd, Private Communication, September 1998Google Scholar
  15. [15]
    Kouvatsos, D.D. and Awan, I.U., “Arbitrary Discrete-Time Queueing Networks with Correlated Arrivals and Blocking”, Proc. 6th. IFIP Workshop on Performance Modelling and Evaluation of ATM Networks, UK Performance Eng. Workshop Publishers, Kouvatsos, D.D. (ed.), pp. 109/1–109/8, July 1998Google Scholar
  16. [16]
    Kouvatsos, D.D., Awan, I.U., Fretwell, R.J., Dimakopoulos, G., “A Cost-Effective Approximation for SRD Traffic in Arbitrary Queueing Networks with Blocking”, Research Report RS-01-00, Computing Dept., Bradford University, Jan. 2000Google Scholar
  17. [17]
    Awan, I.U. and Kouvatsos, D.D., “Approximate Analysis of Arbitrary QNMs with Space and Service Priorities”, Performance Analysis of ATM Networks, Kouvatsos, D.D. (ed.), Kluwer Academic Publishers, pp. 497–521, 1999Google Scholar
  18. [18]
    Kouvatsos, D.D. and Tabet-Aouel, N., “Product-Form Approximations for an Extended Class of General Closed Queueing Networks”, Performance’ 90, King, P.J.B., Mitrani, I., and Pooley, R.J., (eds.), pp. 301–315, 1990Google Scholar
  19. [19]
    Williams, A.C. and Bhandiwad, R. A. “A Generating Function Approach to Queueing Network Analysis of Multiprogrammed Computers”, Networks Vol. 6, pp. 1–22, 1976MathSciNetGoogle Scholar
  20. [20]
    Kouvatsos, D.D. and Denazis, S.G., “A Universal Building Block for the Approximate Analysis of a Shared Buffer ATM Switch Architecture”, Annals of OR, Vol. 44, pp. 241–278, 1994Google Scholar
  21. [21]
    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, Vol. 21, pp. 81–109, 1994Google Scholar
  22. [22]
    Devault, M., Cochennec, J.Y. and Servel, M., “The Prelude ATD Experiment: Assessments and Future Prospects”, IEEE JSAC 6(9), pp. 1528–1537, Dec. 1988Google Scholar
  23. [23]
    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 Publications, Chapman and Hall, London, Vol. 1, pp. 365–383, 1995Google Scholar
  24. [24]
    Kouvatsos, D.D. and Wilkinson, J., “Performance Analysis of Buffered Banyan ATM Switch Architectures”, ATM Networks: Performance Modelling and Evaluation, IFIP Publications, Chapman and Hall, London, Vol. 2, pp. 287–323, 1996Google Scholar
  25. [25]
    Skianis, C.A. and Kouvatsos, D.D., “Performance Analysis of a Shared Medium ATM Switch Architecture”, 12th UK Computer and Telecommunications Performance Engineering Workshop, UK Performance Eng. Workshop Publishers, Hillston, J. and Pooley, R. (eds.), The University of Edinburgh, pp. 33–48, Sept. 1996Google Scholar
  26. [26]
    Fretwell, R.J., Dimakopoulos, G. and Kouvatsos, D.D., “Ignoring Count Correlation in SRD Traffic: sGGeo Process vs Batch Bernoulli Process”, Proc. of 15th UK Performance Engineering Workshop, Bradley, J.T. and Davies, N.J. (eds.), UK Performance Eng. Workshop Publishers, pp. 285–294, July 1999Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Demetres Kouvatsos
    • 1
  1. 1.Computer and Communication Systems Modelling Research GroupUniversity of BradfordBradfordUK

Personalised recommendations