Adversarial queueing theory

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 376-385

  Borodin, Allan ^a   Kleinberg, Jon ^b   Raghavan, Prabhakar ^c   Sudan, Madhu ^d   Williamson, David P ^d  

^a UNIVERSITY OF TORONTO   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

^d IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER NETWORKS; GRAPH THEORY; MATHEMATICAL MODELS; PACKET SWITCHING; PARALLEL PROCESSING SYSTEMS; PROBABILITY; PROBLEM SOLVING; SYNCHRONIZATION; TELECOMMUNICATION NETWORKS; THEOREM PROVING;

PACKET ROUTING; POISSON INJECTION PROCESS; ROUTING ALGORITHMS; STATIC MODEL;

QUEUEING THEORY;

EID: 0029722958     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237984     Document Type: Conference Paper

References (13)

1. B. AWERBUCH AND F. T. LEIGHTON. Improved approximations for the multi-commodity flow problem and local competitive routing in networks. Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994.
2. B. AWERBUCH AND F. T. LEIGHTON. personal communication.
3. M. HARCHOL-BALTER AND P. E. BLACK. Queueing analysis of oblivious packet-routing algorithms. Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994.
4. M. HARCHOL-BALTER AND D. WOLFE. Bounding delays in packet-routing networks. Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995.
5. K. MANI CHANDY, J. HOWARD AND D. TOWSLEY. Product form and local balance in queuing networks Journal of the ACM, April 1977, pp 250-263.
6. L. KLEINROCK. Queueing systems. Wiley, New York, 1975.
7. F. P. KELLY. Reversibility and Stochastic Networks. Wiley, New York, 1979.
8. N. KAHALE AND T. LEIGHTON. Greedy dynamic routing on arrays. Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995.
9. T. LEIGHTON. Average case analysis of greedy routing algorithms on arrays. Prooceeding of the Second Annual ACM Symposium on Parallel Algorithms and Architectures, 1990.
10. Y. MANSOUR, B. PATT-SHAMIR. Greedy packet scheduling on shortest paths. Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991.
11. D. MITRA AND R. CIESLAK. Randomized parallel communications. Proceedings of the International Conference on Parallel Processing, 1986.
12. M. MRRZENMACHER. Bounds on the Greedy Routing Algorithm for Array Networks. Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architectures, 1994.
13. G. D. STAMOULIS AND J. N. TSITSIKLIS. The efficiency of greedy routing in hypercubes and butterflies. Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, 1991.