Potential function analysis of greedy hot-potato routing

Theory of Computing Systems

Volumn 31, Issue 1, 1998, Pages 41-61

  Ben Dor, A ^a   Halevi, S ^b   Schuster, A ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MESH GENERATION;

BUFFER SPACE; HOT-POTATO ROUTING; INTERMEDIATE NODE; PACKET ROUTING; POTENTIAL FUNCTION; ROUTING PROBLEMS; RUNNING TIME; SYNCHRONOUS NETWORKS;

FOOD STORAGE;

EID: 0032351305     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000076     Document Type: Article

References (33)

1. A.S. Acampora and S.I.A. Shah. Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing. In Proc. IEEE INFOCOM, pages 10-19, 1991.
2. P. Baran. On distributed communications networks. IEEE Transactions on Communications, 12:1-9, 1964.
3. J.T. Brassil and R.L. Cruz. Bounds on maximum delay in networks with deflection routing. In Proc. 29th Allerton Conf. on Communication, Control, and Computing, pages 571-580, 1991.
4. I. Ben-Aroya, D.D. Chinn, and A. Schuster. A lower bound for nearly minimal adaptive and hot potato routing algorithms. To appear in Algorithmica. Preliminary version appeared in Proc. 4th European Symp. on Algorithms, Barcelona, Sept. 1996, pages 471-485.
5. A. Borodin and J.E. Hopcroft. Routing, merging, and sorting on parallel models of computation. Journal of Computer and System Sciences, 30:130-145, 1985.
6. A. Ben-Dor, S. Halevi, and A. Schuster. Potential function analysis of greedy hot-potato routing. In Proc. 13th Symp. on Principles of Distributed Computing, pages 225-234, Los Angeles, August 1994. ACM, New York. (Also Technion/LPCR TR #9303, January 1993.)
7. I. Ben-Aroya, I. Newman, and A. Schuster. Randomized single target hot potato routing. Journal of Algorithms, 23:101-120, 1997. (Also in Proc. 3rd Israeli Symp. on Theory of Computing and Systems, January 1995, pp. 20-29.)
8. I. Ben-Aroya, I. Newman, and A. Schuster. Randomized single target hot potato routing. Journal of Algorithms, 23:101-120, 1997. (Also in Proc. 3rd Israeli Symp. on Theory of Computing and Systems, January 1995, pp. 20-29.)
9. A. Borodin. Private communication.
10. A. Borodin, Y. Rabani, and B. Schieber. Deterministic many-to-many hot potato routing. Manuscript, 1994.
11. A. Bar-Noy, P. Raghavan, B. Schieber, and H. Tamaki. Fast deflection routing for packets and worms. In Proc. 12th Symp. on Principles of Distributed Computing, pages 75-86. ACM, New York, 1993.
12. I. Ben-Aroya, E. Tamar, and A. Schuster. Greedy hot-potato routing on the two-dimensional mesh. Distributed Computing, 9(1):3-19, 1995. (Also in Proc. 2nd European Symp. on Algorithms, Utrecht, pages 365-376, 1994.)
13. I. Ben-Aroya, E. Tamar, and A. Schuster. Greedy hot-potato routing on the two-dimensional mesh. Distributed Computing, 9(1):3-19, 1995. (Also in Proc. 2nd European Symp. on Algorithms, Utrecht, pages 365-376, 1994.)
14. F.R.K. Chung, R.L. Graham, P. Frankl, and J.B. Shearer. Some intersection theorems for ordered sets and graphs. Journal of Combinatorial Theory, Series A, 43:23-37, 1986.
15. U. Feige. Observations on hot potato routing. In Proc. 3rd Israeli Symp. on Theory of Computing and Systems, pages 30-39, January 1995.
16. U. Feige and P. Raghavan. Exact analysis of hot-potato routing. In Proc. 33rd Symp. on of Foundations of Computer Science, pages 553-562. IEEE, New York, November 1992.
17. A.G. Greenberg and J. Goodman. Sharp approximate models of adaptive routing in mesh networks. In O.J. Boxma, J.W. Cohen, and H.C. Tijms, editors, Teletraffic Analysis and Computer Performance Evaluation, pages 255-270. Elsevier, Amsterdam, 1986. Revised 1988.
18. A.G. Greenberg and B. Hajek. Deflection routing in hypercube networks. IEEE Transactions on Communications, June 1992.
19. B. Hajek. Bounds on evacuation time for deflection routing. Distributed Computing, 5:1-6, 1991.
20. Shai Halevi. On greedy hot potato routing. Master's thesis (in Hebrew), Computer Science Department, Technion, July 1993.
21. W.D. Hillis. The Connection Machine. MIT Press, Cambridge, MA, 1985.
22. C. Kaklamanis, D. Krizanc, and S. Rao. Hot-potato routing on processor arrays. In Proc. 5th Symp. on Parallel Algorithms and Architectures, pages 273-282. ACM, New York, 1993.
23. M. Kaufmann, H. Lauer, and H. Schröder. Fast deterministic hot-potato routing on meshes. In Proc. 5th Symp. on Algorithms and Computation (ISAAC), pages 333-341. LNCS, volume 834. Springer-Verlag, Berlin, 1994.
24. D.H. Lawrie and D.A. Padua. Analysis of message switching with shuffle-exchanges in multiprocessors. In Proc. Workshop on Interconnection Networks for Parallel and Distributed Computing, pages 116-123, 1980.
25. N.F. Maxemchuk. Comparison of deflection and store and forward techniques in the manhattan street and shuffle exchange networks. In Proc. IEEE INFOCOM, pages 800-809, 1989.
26. J.Y. Ngai and C.L. Seitz. A framework for adaptive routing in multicomputer networks. In Proc. 1st Symp. on Parallel Algorithms and Architectures, pages 1-9. ACM, New York, 1989.
27. I. Newman and A. Schuster. Hot-potato algorithms for permutation routing. IEEE Transactions on Parallel and Distributed Systems, 6(11):1168-1176, 1995.
28. R. Prager. An algorithm for routing in hypercube networks. Master's thesis, Computer Science Department, University of Toronto, 1986.
29. C.L. Seitz. The Caltech Mosaic C: an experimental, fine-grain multicomputer. In Proc. 4th Symp. on Parallel Algorithms and Architectures, San Diego, June 1992. ACM, New York. Keynote Speech.
30. B. Smith. Architecture and applications of the HEP multiprocessor computer system. In Proc. (SPIE) Real Time Signal Processing IV, pages 241-248, 1981.
31. A. Symvonis. Private communication.
32. T. Szymanski. An analysis of hot potato routing in a fiber optic packet switched hypercube. In Proc. IEEE INFOCOM, pages 918-926, 1990.
33. Z. Zhang and A.S. Acampora. Performance analysis of multihop lightwave networks with hot potato routing and distance age priorities. In Proc. IEEE INFOCOM, pages 1012-1021, 1991.