On the capacity of disjointly shared networks
Computer Networks and ISDN Systems
American Mathematical Monthly
IEEE/ACM Transactions on Networking (TON)
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On-line call admission for high-speed networks
On-line call admission for high-speed networks
Greedy dynamic routing on arrays
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
ON THE STABILITY OF A BANDWIDTH PACKING ALGORITHM
Probability in the Engineering and Informational Sciences
Scheduling with conflicts on bipartite and interval graphs
Journal of Scheduling - Special issue: On-line scheduling
The Repacking Efficiency for Bandwidth Packing Problem
IEICE - Transactions on Information and Systems
A bounded item bin packing problem over discrete distribution
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
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.