General dynamic routing with per-packet delay guarantees of O(distance + 1/session rate)

SIAM Journal on Computing

Volumn 30, Issue 5, 2000, Pages 1594-1623

  Andrews, Matthew ^a   Fernández, Antonio ^b   Harchol Balter, Mor ^c   Leighton, Tom ^d   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSIDAD REY JUAN CARLOS   (Spain)

^c Carnegie Mellon University   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Communication networks; Delay bounds; Packet routing; Scheduling

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); PACKET NETWORKS; PACKET SWITCHING; QUEUEING NETWORKS; TELECOMMUNICATION LINKS; TOPOLOGY;

DELAY BOUNDS; PACKET ROUTING; PACKET SCHEDULING;

BOUNDARY CONDITIONS;

EID: 0035183395     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979935061X     Document Type: Article

References (19)

1. M. ANDREWS, B. AWERBUCH, A. FERNÁNDEZ, J. KLEINBERG, T. LEIGHTON, AND Z. LIU, Universal stability results for greedy contention-resolution protocols, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, VT, 1996, pp. 380-389.
2. M. ANDREWS AND L. ZHANG, Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule, in Proceedings of the IEEE Computer and Communication Societies, INFOCOM, IEEE Computer Society, Los Alamitos, CA, 1999, pp. 380-388.
3. J. BECK, An algorithmic approach to the Lovasz Local Lemma I, Random Structures Algorithms, 2 (1991), pp. 343-365.
4. A. BORODIN, J. KLEINBERG, P. RAGHAVAN, M. SUDAN, AND D. WILLIAMSON, Adversarial queueing theory, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Philadelphia, PA, 1996, pp. 376-385.
5. H. CHERNOFF, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Stat., 23 (1952), pp. 493-509.
6. R. L. CRUZ, A calculus for network delay, Part I: Network elements in isolation, IEEE Trans Inform. Theory, 37 (1991), pp. 114-131.
7. R. L. CRUZ, A calculus for network delay, Part II: Network analysis, IEEE Trans. Inform. Theory, 37 (1991), pp. 132-141.
8. A. DEMERS, S. KESHAV, AND S. SHENKER, Analysis and simulation of a fair queueing algorithm, J. Internetworking: Research and Experience, 1 (1990), pp. 3-26.
9. A. ELWALID, D. MITRA, AND R. H. WENTWORTH, A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node, IEEE J. Selected Areas in Communications, 13 (1995), pp. 1115-1127.
10. F. T. LEIGHTON, B. M. MAGGS, AND S. B. RAO, Packet routing and job-shop scheduling in O(congestion + dilation) steps, Combinatorica, 14 (1994), pp. 167-186.
11. F. T. LEIGHTON, B. M. MAGGS, AND A. W. RICHA, Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules, Technical report CMU-CS-96-152, Carnegie Mellon University, Pittsburgh, PA, 1996.
12. F. T. LEIGHTON AND G. PLAXTON, Hypercubic sorting networks, SIAM J. Comput., 27 (1998), pp. 1-47.
13. 1+ε N) local control packet switching algorithm, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 644-653.
14. A. K. PAREKH AND R. G. GALLAGER, A generalized processor sharing approach to flow control in integrated services networks: The single-node case, IEEE/ACM Trans. Networking, 1 (1993), pp. 344-357.
15. A. K. PAREKH AND R. G. GALLAGER, A generalized processor sharing approach to flow control in integrated services networks: The multiple-node case, IEEE/ACM Trans. Networking, 2 (1994), pp. 137-150.
16. Y. RABANI AND E. TARDOS, Distributed packet switching in arbitrary networks, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Philadelphia, PA, 1996, pp. 366-375.
17. J. SPENCER, Ten Lectures on the Probabilistic Methods, Capital City Press, Philadelphia, PA, 1994.
18. J. S. TURNER, New directions in communications, or which way to the information age, IEEE Communications Magazine, 24 (1986), pp. 8-15.
19. L. ZHANG, An Analysis of Network Routing and Communication Latency, Ph.D. thesis, MIT, Cambridge, MA, 1997.