Bandwidth packing

Algorithmica (New York)

Volumn 29, Issue 1-2, 2001, Pages 70-88

  Coffman Jr , E G ^a   Stolyar, A L ^b,c,d  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c AT AND T LABS RESEARCH   (United States)

^d NONE

Author keywords

Average case analysis; Bin packing; Communication networks; Fluid limits; Stability analysis

Indexed keywords

ALGORITHMS; PROBABILITY; QUEUEING THEORY; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS; THEOREM PROVING;

BANDWIDTH PACKING;

FREQUENCY ALLOCATION;

EID: 0043162307     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02679614     Document Type: Article

References (12)

1. S. Albers and M. Mitzenmacher. Average-Case Analysis of First Fit and Random Fit Bin Packing. Proceedings of the Ninth Annual ACM-SIAM Symosium on Discrete Algorithms (1998), pp. 290-299.
2. H. Chen. Fluid Approximations and Stability of Multiclass Queueing Networks: Work-Conserving Disciplines. Annals of Applied Probability, Vol. 5 (1995), pp. 637-665.
3. E. G. Coffman, Jr., A. Feldmann, N. Kahale, and B. Poonen. Computing Call Admission Capacities in Linear Networks. Bell Labs, Lucent Technologies, Murray Hill, NJ 07974 (1997), submitted for publication.
4. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation Algorithms for Bin Packing: A Survey. In Approximation Algorithms for NP-Complete Problems, D. S. Hochbaum (ed.). PWS, Boston, MA (1995), pp. 46-93.
5. E. G. Coffman, Jr., S. Halfin, A. Jean-Marie, and P. Robert. Stochastic Analysis of a Slotted, FIFO Communication Channel. IEEE Transactions on Information Theory, Vol. 39 (1993), pp. 1555-1566.
6. [61 E. G. Coffman, Jr., D. S. Johnson, P. W. Shor, and R. R. Weber. Bin Packing with Discrete Item Sizes, Part II: Tight Bounds on First Fit. Random Structures and Algorithms, Vol. 10 (1997), pp. 69-101.
7. J. G. Dai. On the Positive Harris Recurrence for Open Multiclass Queueing Networks: A Unified Approach via Fluid Limit Models. Annals of Applied Probability, Vol. 5 (1995), pp. 49-77.
8. J. G. Dai and S. P. Meyn. Stability and Convergence of Moments for Open Multiclass Queueing Networks via Fluid Limit Models. IEEE Transactions on Automatic Control, Vol. 40 (1995), pp. 1889-1904.
9. C. Kipnis and P. Robert. A Dynamic Storage Process. Stochastic Processes and Their Applications, Vol. 34 (1990), pp. 155-169.
10. V. A. Malyshev and M. V. Menshikov. Ergodicity, Continuity, and Analyticity of Countable Markov Chains. Transactions of Moscow Mathematical Society, Vol. 39 (1979), pp. 3-48.
11. A. N. Rybko and A. L. Stolyar. Ergodicity of Stochastic Processes Describing the Operation of Open Queueing Networks. Problems of Information Transmission, Vol. 28 (1992), pp. 199-220.
12. A. L. Stolyar. On the Stability of Multiclass Queueing Networks: A Relaxed Sufficient Condition via Limiting Fluid Processes. Markov Processes and Related Fields, Vol. 1, No. 4 (1995), pp. 491-512.