Extending the effective bandwidth concept to networks with priority classes

被引:32
作者
Berger, AW [1 ]
Whitt, W [1 ]
机构
[1] AT&T Bell Labs, Lucent Technol, Naperville, IL 60566 USA
关键词
D O I
10.1109/35.707820
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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 an different priority levels is becoming a realistic possibility. Thus, we need new methods to do connection admission control and capacity planning that take account of the priority structure. In this article 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 far 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 do dimensioning.
引用
收藏
页码:78 / 83
页数:6
相关论文
共 13 条
[1]  
BERGER AW, 1998, IEEE ACM T NETWORKIN
[2]   EFFECTIVE BANDWIDTH IN HIGH-SPEED DIGITAL NETWORKS [J].
CHANG, CS ;
THOMAS, JA .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1995, 13 (06) :1091-1100
[3]   Squeezing the most out of ATM [J].
Choudhury, GL ;
Lucantoni, DM ;
Whitt, W .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1996, 44 (02) :203-217
[4]   EFFICIENTLY PROVIDING MULTIPLE GRADES OF SERVICE WITH PROTECTION AGAINST OVERLOADS IN SHARED RESOURCES [J].
CHOUDHURY, GL ;
LEUNG, KK ;
WHITT, W .
AT&T TECHNICAL JOURNAL, 1995, 74 (04) :50-63
[5]   INVERSION ALGORITHM TO COMPUTE BLOCKING PROBABILITIES IN LOSS NETWORKS WITH STATE-DEPENDENT RATES [J].
CHOUDHURY, GL ;
LEUNG, KK ;
WHITT, W .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1995, 3 (05) :585-601
[6]   RESOURCE-MANAGEMENT IN WIDE-AREA ATM NETWORKS USING EFFECTIVE BANDWIDTHS [J].
DEVECIANA, G ;
KESIDIS, G ;
WALRAND, J .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1995, 13 (06) :1081-1090
[7]   Bandwidth allocation for multiple qualities of service using generalized processor sharing [J].
deVeciana, G ;
Kesidis, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (01) :268-272
[8]  
ELWALID A, 1995, IEEE INFOCOM SER, P463, DOI 10.1109/INFCOM.1995.515910
[9]  
Feldmann A., 1998, Computer Communication Review, V28, P5, DOI 10.1145/279345.279346
[10]  
Kelly F.P., 1996, Stochastic Networks: Theory and Applications, P141