This Article 
 Bibliographic References 
 Add to: 
A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms
August 1997 (vol. 8 no. 8)
pp. 781-789

Abstract—In this paper, we consider the deflection worm routing problem on n×n meshes. In deflection routing, a message cannot be queued and it is always moving until it reaches its destination. In worm routing, the message is considered to be a worm, a sequence of k flits which, during the routing, follow the head of the worm, which knows the destination address. We show how to derive a deflection worm routing algorithm from a packet routing algorithm which uses queues of size O(f(N)) (N is the side-length of the mesh in which the packet routing algorithm is applied). Our result generalizes the method of Newman and Schuster in which only packet routing algorithms with a maximum queue of four packets can be used.

[1] 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.
[2] P. Baran, "On Distributed Communication Networks," IEEE Trans. Comm. Systems, vol. 12, nos. 1-2, pp. 1-9, Mar. 1964.
[3] T. Han and D.F. Stanat, "Move-and-Smooth Routing Algorithm on Mesh-Connected Computers," Proc. 18th Allerton Conf., pp. 236-245, 1990.
[4] M. Kaufmann, H. Lauer, and H. Schroder, "Fast Deterministic Hot-Potato Routing on Processor Arrays," Proc. Fifth Int'l Symp. Algorithms and Computation ISAAC '94, D.Z. Du and X.S. Zhang, eds., LNCS 834, pp. 333-341,Beijing, Aug. 1994.
[5] Kunde, "Packet Routing on Grids of Processors," Algorithmica, vol. 9, pp. 32-46, 1993.
[6] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[7] F.T. Leighton, "Methods for Message Routing in Parallel Machines," Proc. 24th ACM Symp. Theory of Computing, pp. 77-96, May 1992.
[8] F.T. Leighton,F. Makedon, and I.G. Tollis,"A 2n - 2 Algorithm for Routing in an n×n Array With Constant Size Queues," Proc. ACM Symp. Parallel Algorithms and Architectures, SPAA'89, pp. 328-335, June 1989.
[9] F. Makedon and A. Symvonis, "Optimal Algorithms for the Many-to-One Routing Problem on Two-Dimensional Meshes," Microprocessors and Microsystems, vol. 17, no. 6, pp. 361-367, 1993.
[10] Newman and Schuster, "Hot Potato Worm Routing via Store-and-Forward Packet Routing," J. Parallel and Distributed Computing, vol. 30, 1995.
[11] S. Rajasekaran and R. Overholt,"Constant Queue Routing on a Mesh," J. Parallel and Distributed Computing, vol. 15, pp. 160-166, 1992.
[12] A. Roberts and A. Symvonis, "On Deflection Worm Routing on Meshes," Proc. First IEEE Int'l Conf. Algorithms and Architecture for Parallel Processing, pp. 375-378,Brisbane, Australia, Apr. 1995 (also Technical Report 490, Basser Dept. of Computer Science, Univ. of Sydney, Oct. 1994).
[13] C. Schnorr and A. Shamir,“An optimal sorting algorithm for mesh connected computers,”inProc. 18th ACM Symp. on Theory of Comput., 1986, pp. 263–271.
[14] J.F. Sibeyn and M. Kaufmann, "Deterministic 1−k Routing on Meshes," Proc. 11th Ann. Symp. Theoretical Aspects of Computer Science, LNCS 775, pp. 237-248,Caen, France, Feb. 1994.
[15] A. Symvonis and J. Tidswell, "An Empirical Study of Off-Line Permutation Packet Routing on 2-Dimensional Meshes Based on the Multistage Routing Method," Technical Report TR-477, Basser Dept. of Computer Science, Univ. of Sydney, Feb. 1994. Also appears in IEEE Trans. on Computers, vol. 45, no. 5, pp. 619-625, May 1996.
[16] M. Tompa, "Lecture Notes on Message Routing in Parallel Machines," Technical Report 94-06-05, Dept. of Computer Science and Eng., Univ. of Washington, June 1994.

Index Terms:
Deflection routing, mesh connected computer, on-line routing algorithm, packet routing, permutation routing, worm routing.
Alan Roberts, Antonios Symvonis, "A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 8, pp. 781-789, Aug. 1997, doi:10.1109/71.605765
Usage of this product signifies your acceptance of the Terms of Use.