Performance analysis of a dynamic priority scheduling method in ATM networks

Broadband ISDN using asynchronous transfer mode as the transport mode carries traffic of several different classes, including one or more real-time traffic classes, each with its own set of traffic characteristics and performance requirements. To support multiple classes of traffic in ATM networks, multiple priority levels are provided, and different priority levels are given to different classes of traffic. A dynamic priority scheme is proposed as an efficient scheduling method at a switching node in an ATM network serving multiple classes of delay-sensitive traffic. The advantage of this protocol lies in that, by properly adjusting the control parameters, it can meet the average delay requirement for different classes and thus guarantee the quality of service. In addition, each class of service can be guaranteed a minimum of bandwidth, which can prevent the low priority class from starvation.

[1]  Luigi Fratta,et al.  ATM: bandwidth assignment and bandwidth enforcement policies , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[2]  Henry M. Goldberg Analysis of the Earliest Due Date Scheduling Rule in Queueing Systems , 1977, Math. Oper. Res..

[3]  A.E. Eckberg,et al.  Controlling congestion in B-ISDN/ATM: issues and strategies , 1991, IEEE Communications Magazine.

[4]  Alexander Gersht,et al.  A congestion control framework for ATM networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Joseph Y. Hui,et al.  A Broadband Packet Switch for Integrated Transport , 1987, IEEE J. Sel. Areas Commun..

[6]  Tatsuya Suda,et al.  Survey of traffic control schemes and protocols in ATM networks , 1991, Proc. IEEE.

[7]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[8]  P. S. Richards,et al.  A congestion control framework for high-speed integrated packetized transport , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[9]  Lars Dittmann,et al.  Statistical multiplexing of identical bursty sources in an ATM network , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[10]  Leonard Kleinrock,et al.  A delay dependent queue discipline , 1964 .

[11]  M. Hirano,et al.  Characteristics of a cell multiplexer for bursty ATM traffic , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[12]  K. Nakamaki,et al.  Traffic control for ATM networks , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[13]  Y. Lim,et al.  Analysis of a delay-dependent priority discipline in a multi-class traffic packet switching node , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[14]  Ward Whitt,et al.  Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data , 1986, IEEE J. Sel. Areas Commun..

[15]  Leonard Kleinrock,et al.  Time Dependent Priority Queues , 1967, Oper. Res..

[16]  Jean C. Walrand,et al.  Dynamic priority protocols for packet voice , 1989, IEEE J. Sel. Areas Commun..