Resource sharing for book-ahead and instantaneous-request calls

被引:82
作者
Greenberg, AG [1 ]
Srikant, R
Whitt, W
机构
[1] AT&T Bell Labs, Shannon Lab, Florham Park, NJ 07932 USA
[2] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
[3] Univ Illinois, Dept Gen Engn, Urbana, IL 61801 USA
关键词
advance reservation; book-ahead calls; integrated services networks; link partitioning; loss networks; quality of service; video teleconferencing;
D O I
10.1109/90.759312
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In order to provide an adequate quality of service to large-bandwidth calls, such as video conference calls, service providers of integrated services networks may want to allow some customers to book their calls ahead, i.e., make advance reservations, We propose a scheme for sharing resources among book-ahead (BA) calls (that announce their call holding times as well as their call initiation times upon arrival) and non-BA calls (that do not announce their holding times). It is possible to share resources without allowing any calls in progress to be interrupted, but in order to achieve a more efficient use of resources. we think that it may be desirable to occasionally allow a call in progress to be interrupted. (In practice, it may be possible to substitute service degradation, such as bit dropping or coarser encoding of video, for interruption.) Thus, we propose an admission control algorithm in which a call is admitted if an approximate interrupt probability (computed in real time) is below a threshold. Simulation experiments show that the proposed admission control algorithm can be better (i.e., yield higher total utilization or higher revenue) than alternative schemes that do not allow interruption, such as a strict partitioning of resources.
引用
收藏
页码:10 / 22
页数:13
相关论文
共 22 条
[1]  
Bertsekas D., 1987, DATA NETWORKS
[2]   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
[3]  
COURTOIS P. J., 1977, DECOMPOSABILITY QUEU
[4]  
Daley D. J., 2002, INTRO THEORY POINT P
[5]  
DEGERMARK M, 1995, NOSSDAV 95
[6]  
DZIONG Z, 1989, P 28 IEEE C DEC CONT
[7]   THE PHYSICS OF THE M(T)/G/IOTA QUEUE [J].
EICK, SG ;
MASSEY, WA ;
WHITT, W .
OPERATIONS RESEARCH, 1993, 41 (04) :731-742
[8]  
FERRARI D, 1995, NOSSDAV 95
[9]   RESOURCE-ALLOCATION FOR BROAD-BAND NETWORKS [J].
HUI, JY .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1988, 6 (09) :1598-1608
[10]   BLOCKING IN A SHARED RESOURCE ENVIRONMENT [J].
KAUFMAN, JS .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1981, 29 (10) :1474-1481