Prioritized resource allocation for stressed networks

被引:35
作者
Beard, CC [1 ]
Frost, VS
机构
[1] Univ Missouri, Sch Interdisciplinary Comp & Engn, Kansas City, MO 64110 USA
[2] Univ Kansas, Dept Elect Engn & Comp Sci, Lawrence, KS 66044 USA
[3] Univ Kansas, Informat & Telecommun Technol Ctr, Lawrence, KS 66044 USA
关键词
computer network performance; resource management;
D O I
10.1109/90.958330
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Overloads that occur during times of network stress result in blocked access to all users, independent of importance. These overloads can occur because of degraded resource availability or abnormally high demand. Public broadband networks must dynamically recognize some multimedia connections as having greater importance than others and allocate resources accordingly. A new approach to connection admission control is proposed that uses an upper limit policy to optimize the admission of connections based on the weighted sum of blocking across traffic classes. This results in a simple algorithm suitable for multimedia and packet networks. This work is also the first to demonstrate that the use of an upper limit policy is superior to traditional approaches of adding extra capacity or partitioning capacity, both in terms of the amount of resources required and sensitivity to load variations. An upper limit policy can also be deployed much faster when a large overload occurs from a disaster event.
引用
收藏
页码:618 / 633
页数:16
相关论文
共 39 条
[1]  
ADAMSON SC, 1993, COMMUNICATIONS ON THE MOVE - MILCOM 93: 1993 IEEE MILITARY COMMUNICATIONS CONFERENCE, CONFERENCE RECORD, VOLS 1-3, P902
[2]  
ALFRED P, 1996, CITY OKLAHOMA CITY
[3]   ASYMPTOTIC ANALYSIS OF SINGLE RESOURCE LOSS SYSTEMS IN HEAVY TRAFFIC, WITH APPLICATIONS TO INTEGRATED NETWORKS [J].
BEAN, NG ;
GIBBENS, RJ ;
ZACHARY, S .
ADVANCES IN APPLIED PROBABILITY, 1995, 27 (01) :273-292
[4]  
BEARD C, 1999, THESIS U KANSAS LAWR
[5]  
BEARD C, 1999, 1999 IEEE INT C COMM
[6]  
BEARD C, 2001, P SOC COMP SIM 2001, P74
[7]   Effective bandwidths with priorities [J].
Berger, AW ;
Whitt, W .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1998, 6 (04) :447-460
[8]   Extending the effective bandwidth concept to networks with priority classes [J].
Berger, AW ;
Whitt, W .
IEEE COMMUNICATIONS MAGAZINE, 1998, 36 (08) :78-83
[9]  
Biswas SK, 1997, IEEE INFOCOM SER, P649, DOI 10.1109/INFCOM.1997.644517
[10]   Virtual partitioning for robust resource sharing: Computational techniques for heterogeneous traffic [J].
Borst, SC ;
Mitra, D .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1998, 16 (05) :668-678