Advertisement

Approximate Analysis of a Dynamic Priority Queueing Method for ATM Networks

  • Anoop Ghanwani
  • Erol Gelenbe
Chapter
Part of the IFIP — The International Federation for Information Processing book series (IFIPAICT)

Abstract

A scheduling discipline for multiple classes of traffic in an ATM network is discussed and analyzed. The scheduler has the desirable property of providing minimum bandwidth guarantees for each class of traffic. Its simplicity makes it particularly well suited for high speed implementation. The scheme is a modification of static head-of-line priority queueing, and was originally presented in a slightly different form by Huang and Wu. We begin by considering a system with two queues which is analyzed by decoupling the system into separate M/G/1 queues. The analysis is found to provide a very good estimate for the mean response time of customers in each queue. The applicability of the analysis to a system with multiple queues is also demonstrated.

Keywords

Coupled queues ATM networks scheduling disciplines 

References

  1. Gelenbe, E. and Mitrani, I. (1980) Analysis and Synthesis of Computer Systems. Academic Press.Google Scholar
  2. Huang, T.-Y and Wu, J.-L. C. (1993) Performance analysis of a dynamic priority scheduling method in ATM networks. IEE Proceedings-I, 140, 285–290.Google Scholar
  3. Jain, R. (1996) Congestion control and traffic management in ATM networks: Recent advances and a survey. Computer Networks and ISDN Systems, 28, 1723–1738.CrossRefGoogle Scholar
  4. Kleinrock, L. (1976) Queueing systems, Volume II: Computer applications. John Wiley and Sons.Google Scholar
  5. Lee, D.-S. and Sengupta, B. (1993) Queueing analysis of a threshold based priority scheme for ATM networks. IEEE/ACM Transactions on Networking, 1, 709–717.CrossRefGoogle Scholar
  6. Lim, Y. and Kobza, J. (1988) Analysis of a delay-dependent priority discipline in a multiclass traffic packet switching node. in Proc. IEEE INFOCOM.Google Scholar
  7. Ozawa, T. (1990) Alternating service queues with mixed exhaustive and Klimited service. Performance Evaluation, 11, 165–175.MathSciNetCrossRefGoogle Scholar
  8. Zhang, H. (1995) Service disciplines for guaranteed performance service in packet-switching networks. Proceedings of the IEEE, 83, 1374–1396.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Anoop Ghanwani
    • 1
  • Erol Gelenbe
    • 2
  1. 1.Internetworking TechnologyIBM CorporationResearch Triangle ParkUSA
  2. 2.Department of Electrical and Computer EngineeringDuke UniversityDurhamUSA

Personalised recommendations