Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-27T11:38:52.187Z Has data issue: false hasContentIssue false
  • English
  • Français

COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS

Published online by Cambridge University Press:  01 October 1999

E. G. Coffman ,
Anja Feldmann ,
Nabil Kahale  and
Bjorn Poonen
E. G. Coffman
Affiliation:
Bell Labs, Lucent Technologies, Murray Hill, New Jersey 07974
Anja Feldmann
Affiliation:
AT&T Labs—Research, Florham Park, New Jersey 07932
Nabil Kahale
Affiliation:
AT&T Labs—Research, Florham Park, New Jersey 07932
Bjorn Poonen
Affiliation:
Department of Mathematics, University of California, Berkeley, California 94720
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 13 , Issue 4 , October 1999 , pp. 387 - 406
Copyright
© 1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)