Deterministic many-to-many hot potato routing

IEEE Transactions on Parallel and Distributed Systems

Volumn 8, Issue 6, 1997, Pages 587-596

  Borodin, Allan ^a   Rabani, Yuval ^b   Schieber, Baruch ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

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

Author keywords

Deflection routing; Hypercube; Many to many routing; Mesh; Routing

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; PACKET SWITCHING;

HYPERCUBE NETWORKS; MANY TO MANY HOT POTATO ROUTING; MESH NETWORKS;

INTERCONNECTION NETWORKS;

EID: 0031166958     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.595575     Document Type: Article

References (22)

1. A.S. Acampora and S.I.A. Shah, "Multihop Lightwave Networks: A Comparison of Store-and-Forward and Hot-Potato Routing," Proc. IEEE INFOCOM, pp. 10-19. IEEE CS Press, 1991.
2. A. Bar-Noy, P. Raghavan, B. Schieber, and H. Tamaki, "Fast Deflection Routing for Packets and Worms," Proc. 12th Symp. Principles of Distributed Computing, pp. 75-86, Aug. 1993.
3. P. Baran, "On Distributed Communications Networks," IEEE Trans. Comm., pp. 1-9, 1964.
4. I. Ben-Aroya, T. Eilam, and A. Schuster, "Greedy Hot-Potato Routing on the Two Dimensional Mesh," Distributed Computing, vol. 9, no. 1, pp. 3-19, 1995.
5. A. Ben-Dor, S. Halevi, and A. Schuster, "Potential Function Analysis of Greedy Hot Potato Routing," Proc. 13th Symp. Principles of Distributed Computing, pp. 225-234, Aug. 1994.
6. J.T. Brassil and R.L. Cruz, "Bounds on Maximum Delay in Networks with Deflection Routing," Proc. 29th Allerton Conf. Comm., Control, and Computing, pp. 571-580, 1991.
7. U. Feige, "Observations on Hot Potato Routing," Proc. Third Israel Symp. Theory of Computing and Systems, pp. 30-39, 1995.
8. U. Feige and P. Raghavan, "Exact Analysis of Hot Potato Routing," Proc. 33rd Symp. Foundations of Computer Science, pp. 553-562, Oct. 1992.
9. A.G. Greenberg and J. Goodman, "Sharp Approximate Models of Deflection Routing in Mesh Networks," IEEE Trans. Comm., vol. 41, no. 1, pp. 210-223, Jan. 1993.
10. A.G. Greenberg and B. Hajek, "Deflection Routing in Hypercube Networks," IEEE Trans. Comm., vol. 40, no. 6, pp. 1,070-1,081, June 1992.
11. B. Hajek, "Bounds on Evacuation Time for Deflection Routing," Distributed Computing, vol. 5, pp. 1-6, 1991.
12. C. Kaklamanis, D. Krizanc, and S. Rao, "Hot Potato Routing on Processor Arrays," Proc. Fifth Symp. Parallel Algorithms and Architectures, pp. 273-282, 1993.
13. D.H. Lawrie and D.A. Padua, "Analysis of Message Switching with Shuffle-Exchanges in Multiprocessors," Interconnection Networks. IEEE CS Press, 1984.
14. Y. Mansour and B. Patt-Shamir, "Greedy Packet Scheduling on Shortest Paths," Proc. 10th Symp. Principles of Distributed Computing, pp. 165-175, Aug. 1991.
15. Y. Mansour and B. Patt-Shamir, "Many-to-One Packet Routing on Grids," Proc. 27th ACM Symp. Theory of Computing, pp. 258-267, May 1995.
16. N.F. Maxemchuk, "Comparison of Deflection and Store and Forward Techniques in the Manhattan Street and Shuffle Exchange Networks," Proc. IEEE INFOCOM, pp. 800-809. IEEE CS Press, 1989.
17. R. Prager, "An Algorithm for Routing in Hypercube Networks," master's thesis, Univ. of Toronto, Sept. 1986.
18. B. Smith, "Architecture and Applications of the HEP Multiprocessor Computer System," Proc. Fourth Symp. Real Time Signal Processing, pp. 241-248. SPIE, 1981.
19. A. Symvonis, "A Note on Deflection Routing on Undirected Graphs," Technical Report 493, Univ. of Sydney, Dept. of Computer Science, Nov. 1994.
20. A. Symvonis, private communication, Nov. 1994.
21. T. Szymanski, "An Analysis of 'Hot Potato' Routing in a Fiber Optic Packet Switched Hypercube," Proc. IEEE INFOCOM, pp. 918-925. IEEE CS Press, 1990.
22. Z. Zhang and A.S. Acampora, "Performance Analysis of Multihop Lightwave Networks with Hot Potato Routing and Distance Age Priorities," Proc. IEEE INFOCOM, pp. 1,012-1,021. IEEE CS Press, 1991.