This Article 
 Bibliographic References 
 Add to: 
Deterministic Many-to-Many Hot Potato Routing
June 1997 (vol. 8 no. 6)
pp. 587-596

Abstract—We consider algorithms for many-to-many hot potato routing. In hot potato (deflection) routing, a packet cannot be buffered, and is therefore always moving until it reaches its destination. We give optimal and nearly optimal deterministic algorithms for many-to-many packet routing in commonly occurring networks such as the hypercube, meshes, and tori of various dimensions and sizes, trees, and hypercubic networks such as the butterfly. All these algorithms are analyzed using a charging scheme that may be applicable to other algorithms as well. Moreover, all bounds hold in a dynamic setting in which packets can be injected at arbitrary times.

[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, B. Schieber, P. Raghavan, and H. Tamaki, "Fast Deflection Routing for Packets and Worms," Proc. 12th Ann. ACM Sump. Principles of Distributed Computing (PODC 93), pp. 75-86,Ithaca, N.Y., Aug. 1993.
[3] P. Baran, "On Distributed Communication Networks," IEEE Trans. Comm. Systems, vol. 12, nos. 1-2, pp. 1-9, Mar. 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 ACM Symp. Principles Distributed Computing, pp. 225-234, 1993.
[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. 33rd Ann. 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. 35, 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. INFORCOM '89, vol. 3, pp. 800-809, Apr. 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. Syzmanski,“An analysis of hot-potato routing in a fiber-optic packet switched hypercube,” IEEE INFOCOM’90 Proc., vol. 1, pp. 918-925, June 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.

Index Terms:
Routing, many-to-many routing, deflection routing, mesh, hypercube.
Allan Borodin, Yuval Rabani, Baruch Schieber, "Deterministic Many-to-Many Hot Potato Routing," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 6, pp. 587-596, June 1997, doi:10.1109/71.595575
Usage of this product signifies your acceptance of the Terms of Use.