Greedy Dynamic Routing on Arrays

Journal of Algorithms

Volumn 29, Issue 2, 1998, Pages 390-410

  Kahale, Nabil ^a   Leighton, Tom ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003571709     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0958     Document Type: Article

References (11)

1. N. Alon and J. H. Spencer, "The Probabilistic Method," Wiley-Interscience, New York, 1991.
2. H. Chernoff, A measure for asymptotic efficiency of a hypothesis based on the sum of observations, Ann. Math. Statist. 23 (1952), 493-507.
3. E. G. Coffman, E. N. Gilbert, A. G. Greenberg, F. T. Leighton, P. Robert, and A. L. Stolyar, Queues served by a rotating ring, Stochastic Models 11 (1995), 371-394.
4. B. Hajek, Hitting-time and occupation-time bounds implied by drift analysis with applications, Adv. Appl. Prob. 14 (1982), 502-525.
5. M. Harchol-Balter and P. Black, Queueing analysis of oblivious packet routing networks, in "Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1994," pp. 583-592.
6. M. Harchol-Balter and D. Wolfe, Bouding delays in packet-routing networks, in "Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, May 1995," pp. 248-257.
7. N. Kahale and T. Leighton, Greedy dynamic routing on arrays, in "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, January 1995," SIAM Press, pp. 558-566.
8. L. Kleinrock, "Queueing Systems," Vol. I, Wiley, New York, 1975.
9. T. Leighton, Average case analysis of greedy routing algorithms on arrays, in "Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures, July 1990," pp. 2-10.
10. M. Mitzenmacher, Bounds on the greedy algorithm for array networks, in "Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architecutre, June 1994," pp. 346-353.
11. 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, July 1991," pp. 248-259.