Bounds on the greedy routing algorithm for array networks

Journal of Computer and System Sciences

Volumn 53, Issue 3, 1996, Pages 317-327

  Mitzenmacher, Michael ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ONR

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER NETWORKS; DATA COMMUNICATION SYSTEMS; DELAY CIRCUITS;

GREEDY ROUTING ALGORITHM; LOADED HYPERCUBE NETWORKS; POISSON PROCESS;

PACKET NETWORKS;

EID: 0030415619     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0072     Document Type: Article

References (14)

1. M. Harchol-Balter and P. Black, Queueing analysis of oblivious packet-routing networks, in "Proceedings of the Fifth Annual ACM/ SIAM Symposium on Discrete Algorithms," pp. 583-592, 1993.
2. J. Jackson, Jobshop-like queueing systems, Management Sci. 10 (1963), 131-142.
3. N. Kahale and T. Leighton, Greedy dynamic routing on arrays, in "Proceedings of the Sixth Annual ACM/SIAM Symposium on Discrete Algorithms," pp. 558-566, 1995.
4. F. P. Kelly, "Reversibility and Stochastic Networks," Wiley, New York, 1979.
5. L. Kleinrock, "Communication Nets," McGraw-Hill, New York, 1964.
6. L. Kleinrock, "Queueing Systems, Volume I: Theory," Wiley, New York, 1976.
7. L. Kleinrock, "Queueing Systems, Volume II: Computer Applications," Wiley, New York, 1976.
8. F. T. Leighton, Average case analysis of greedy routing algorithms on arrays, in "Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures," pp. 2-10, 1990.
9. F. T. Leighton, "Introduction to Parallel Algorithms and Architectures," Morgan Kaufmann, San Mateo, CA, 1992.
10. J. D. C. Little, A proof of the queueing formula l= λw, Oper. Res. 9 (1961), 383-387.
11. M. Mitzenmacher, Bounds on the greedy routing algorithm for array networks, in "Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architectures," pp. 248-259, 1994.
12. G. D. Stamoulis and J. N. Tsitsiklis, The efficiency of greedy routing in hypercubes and butterflies, in "Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures," pp. 248-259, 1990.
13. D. Stoyan, "Comparison Method for Queues and Other Stochastic Models," Wiley, New York, 1983.
14. J. Walrand, "An Introduction to Queueing Networks," Prentice-Hall, New York, 1988.