Direct Routing

Direct routing is a special case of bufferless routing in which packets are not allowed to conflict with each other. The task is to compute the injection times of the packets so that they don’t conflict. A well known lower bound on the routing time of any algorithm is Ω(C + D), where the congestion C is the maximum number of paths that use any edge, and the dilation D is the maximum length of any path. We study the extent to which direct routing algorithms can achieve this lower bound. We present a simple greedy direct routing algorithm for arbitrary routing problems that has routing time O(C · D). We show that this routing time is worst case optimal. In particular, we construct a “hard” routing problem on the mesh, for which any direct routing algorithm has routing time Ω(C · D), while C + D = Θ( √ C · D). We then consider many interesting routing problems on commonly used network topologies. We show that variants of the simple greedy algorithm achieve optimal routing time. The routing problems and corresponding routing times (rt) are: i. Trees: arbitrary routing problems on arbitrary tree topologies (rt = O(C + D)). ii. Mesh with n nodes: permutations (rt = O( √ n)); arbitrary one-bend paths (rt = O(C + D)). iii. Butterfly with n inputs: random destinations and permutations (rt = O(lg n) w.h.p.). iv. Hypercube with n nodes: random destinations and permutations (rt = O(lg n) w.h.p.). Computer Science Department, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180, USA. Email: buschc@cs.rpi.edu Computer Science Department, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180, USA. Email: magdon@cs.rpi.edu Department of Computer Science, University of Cyprus, P. O. Box 20537, Nicosia CY-1678, Cyprus. Email: mavronic@ucy.ac.cy Department of Computer Engineering and Informatics, University of Patras, Rion, 265 00 Patras, Greece, & Computer Technology Institute, P. O. Box 1122, 261 10 Patras, Greece. Email: spirakis@cti.gr

[1]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[2]  Richard Koch Increasing the Size of a Network by a Constant Factor can Increase Performance by more than a Constant Factor , 1992, SIAM J. Comput..

[3]  Christian Scheideler,et al.  Locally efficient on-line strategies for routing packets along fixed paths , 1999, SODA '99.

[4]  Antonios Symvonis,et al.  Many-to-Many Routings on Trees via Matchings , 1997, Theor. Comput. Sci..

[5]  Shai Halevi,et al.  Potential Function Analysis of Greedy Hot-Potato Routing , 1994, PODC '94.

[6]  Rafail Ostrovsky,et al.  Universal O(congestion + dilation + log1+εN) local control packet switching algorithms , 1997, STOC '97.

[7]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..

[8]  Friedhelm Meyer auf der Heide,et al.  Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks , 1995, ESA.

[9]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[10]  Yuval Rabani,et al.  Distributed packet switching in arbitrary networks , 1996, STOC '96.

[11]  Deborah Estrin,et al.  Scalable Coordination in Sensor Networks , 1999, MobiCom 1999.

[12]  Costas Busch,et al.  Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks , 2002, SPAA '02.

[13]  Pierre Fraigniaud,et al.  Routing in Trees , 2001, ICALP.

[14]  Friedhelm Meyer auf der Heide,et al.  Shortest-Path Routing in Arbitrary Networks , 1999, J. Algorithms.

[15]  Noga Alon,et al.  Routing permutations on graphs via matchings , 1993, SIAM J. Discret. Math..

[16]  Uriel Feige,et al.  Exact analysis of hot-potato routing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[17]  Louxin Zhang,et al.  Optimal bounds for matching routing on trees , 1997, SODA '97.

[18]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[19]  Maurice Herlihy,et al.  Hard-Potato routing , 2000, STOC '00.

[20]  Mikkel Thorup,et al.  Direct routing on trees , 1998, SODA '98.