Extending the effective bandwidth concept to networks with priority classes

ATM switches are now being designed to allow connections to be partitioned into priority classes, with packets being emitted for higher priority classes before packets are emitted for lower priority classes. Accordingly, allocation of network resources based on different priority levels is becoming a realistic possibility. Thus, we need new methods for connection admission control and capacity planning that take account of the priority structure. We show that the notion of effective bandwidths can be used for these purposes when appropriately extended. The key is to have admissibility of a set of connections determined by a linear constraint for each priority level, involving a performance criterion for each priority level. For this purpose, connections are assigned more than one effective bandwidth, one for its own priority level and one for each lower priority level. Candidate effective bandwidths for each priority level can be determined by using previous methods associated with the first-in first-out discipline. The proposed effective bandwidth structure makes it possible to apply product-form stochastic loss network models to perform dimensioning.

[1]  Anja Feldmann,et al.  The changing nature of network traffic: scaling phenomena , 1998, CCRV.

[2]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[3]  Gustavo de Veciana,et al.  Bandwidth allocation for multiple qualities of service using generalized processor sharing , 1996, IEEE Trans. Inf. Theory.

[4]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

[5]  Richard J. Gibbens,et al.  Effective bandwidths for the multi-type UAS channel , 1991, Queueing Syst. Theory Appl..

[6]  Cheng-Shang Chang,et al.  Effective bandwidths of departure processes from queues with time varying capacities , 1995, Proceedings of INFOCOM'95.

[7]  Anwar Elwalid,et al.  Fluid models for the analysis and design of statistical multiplexing with loss priorities on multiple classes of bursty traffic , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[8]  Ward Whitt,et al.  Efficiently providing multiple grades of service with protection against overloads in shared resources , 1995, AT&T Technical Journal.

[9]  Debasis Mitra,et al.  Analysis, approximations and admission control of a multi-service multiplexing system with priorities , 1995, Proceedings of INFOCOM'95.

[10]  Ward Whitt,et al.  Tail probabilities with statistical multiplexing and effective bandwidths in multi-class queues , 1993, Telecommun. Syst..

[11]  Vidyadhar G. Kulkarni,et al.  Effective Bandwith Vectors for Multiclass Traffic Multiplexed in a Partitioned Buffer , 1995, IEEE J. Sel. Areas Commun..

[12]  Ward Whitt,et al.  Effective bandwidths with priorities , 1998, TNET.

[13]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[14]  Jean C. Walrand,et al.  Effective bandwidths for multiclass Markov fluids and other ATM sources , 1993, TNET.

[15]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[16]  Vidyadhar G. Kulkarni,et al.  Admission control of multi-class traffic with service priorities in high-speed networks , 1997, Queueing Syst. Theory Appl..

[17]  Cheng-Shang Chang,et al.  Stability, queue length, and delay of deterministic and stochastic queueing networks , 1994, IEEE Trans. Autom. Control..

[18]  Kin K. Leung,et al.  An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates , 1995, TNET.

[19]  Frank P. Kelly,et al.  Effective bandwidths at multi-class queues , 1991, Queueing Syst. Theory Appl..

[20]  Ji Zhang,et al.  Performance study of Markov modulated fluid flow models with priority traffic , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[21]  T Itu,et al.  Traffic control and congestion control in b-isdn , 1993 .

[22]  Kin K. Leung,et al.  An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models , 1994, Fifth IEEE International Workshop on Computer-Aided Modeling, Analysis, and Design of Communication Links and Networks.

[23]  Joseph Y. Hui Resource allocation for broadband networks , 1988, IEEE J. Sel. Areas Commun..

[24]  Ward Whitt,et al.  Squeezing the Most Out of ATM , 1995, IEEE Trans. Commun..

[25]  C H Chang,et al.  EFFECTIVE BANDWIDTH IN HIGHSPEED DIGITAL NETWORKS , 1995 .

[26]  Jean C. Walrand,et al.  Resource Management in Wide-Area ATM Networks Using Effective Bandwiths , 1995, IEEE J. Sel. Areas Commun..