STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The interval packing process of linear networks
ACM SIGMETRICS Performance Evaluation Review
Average-case analyses of first fit and random fit bin packing
Random Structures & Algorithms
On Deciding Stability of Constrained Homogeneous Random Walks and Queueing Systems
Mathematics of Operations Research
Linear waste of best fit bin packing on skewed distributions
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
ON THE STABILITY OF A BANDWIDTH PACKING ALGORITHM
Probability in the Engineering and Informational Sciences
A large-scale service system with packing constraints: minimizing the number of occupied servers
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
| Hi-index | 0.00 |
We consider the following stochastic bandwidth packing process: the requests for communication bandwidth of different sizes arrive at times t=0,1,2,… and are allocated to a communication link using “largest first” rule. Each request takes a unit time to complete. The unallocated requests form queues. Coffman and Stolyar [6] introduced this system and posed the following question: under which conditions do the expected queue lengths remain bounded over time (queueing system is stable)? We derive exact constructive conditions for the stability of this system using the Lyapunov function technique. The result holds under fairly general assumptions on the distribution of the arrival processes.