COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS

We study call admission rates in a linear communication network with each call identified by an arrival time, duration, bandwidth requirement, and origin-destination pair. Network links all have the same bandwidth capacity, and a call can be admitted only if there is sufficient bandwidth available on every link along the call's path. Calls not admitted are held in a queue, in contrast to the protocol of loss networks. We determine maximum admission rates (capacities) under greedy call allocation rules such as First Fit and Best Fit for several baseline models and prove that the natural necessary condition for stability is sufficient. We establish the close connections between our new problems and the classic problems of bin packing and interval packing. In view of these connections, it is surprising to find that Best Fit allocation policies are inferior to First Fit policies in the models studied.

[1]  Sean P. Meyn,et al.  Stability and convergence of moments for multiclass queueing networks via fluid limit models , 1995, IEEE Trans. Autom. Control..

[2]  Edward G. Coffman,et al.  Parking Arcs on the Circle with Applications to One-Dimensional Communication Networks , 1994 .

[3]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, TNET.

[4]  Philippe Robert,et al.  ON THE STABILITY OF A BANDWIDTH PACKING ALGORITHM , 2000, Probability in the Engineering and Informational Sciences.

[5]  J. Keilson.  Markov Chain Models--Rarity And Exponentiality , 1979 .

[6]  Amos Fiat,et al.  Lower bounds for on-line graph problems with application to on-line circuit and optical routing , 1996, STOC '96.

[7]  B. Hajek.  Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.

[8]  Edward G. Coffman,et al.  Stochastic analysis of a slotted FIFO communication channel , 1993, IEEE Trans. Inf. Theory.

[9]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[10]  Frank Thomson Leighton,et al.  Greedy dynamic routing on arrays , 1995, SODA '95.

[11]  Anja Feldmann,et al.  On-line Call Admission for High-Speed Networks , 1995 .

[12]  Edward R. Scheinerman,et al.  Random intervals , 1990 .

[13]  Anja Feldmann,et al.  Competitive Analysis of Call Admission Algorithms that Allow Delay. , 1995 .

[14]  Jeffrey C. Lagarias,et al.  On the Capacity of Disjointly Shared Networks , 1986, Comput. Networks.

[15]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[16]  Ph. Robert,et al.  A dynamic storage process , 1990 .