Scheduled Hot-Potato Routing

This paper is concerned with fast, hot-potato routing, performed according to a predetermined schedule. At each time period each node selects an outgoing link, through which an incoming packet is sent. No buffers are used. We investigate first the problem of how to route a network-wide demand of packets, given the predetermined schedule. We show that certain versions of the problem have efficient solutions, while other versions are intractable. We then consider the problem of finding an optimal schedule given a network-wide demand of packets. We indicate that the problem is tractable for either a single source or single destination. However for the multi-source multi-destination case we show that it is an NP-complete problem. The problem remains intractable even for a simple topology of nodes arranged on a bidirectional line. We present an efficient heuristic for directed tree-networks, and adapt it to general topologies through a recursive scheme, for which an efficient performance bound is shown.

[1]  N. S. Barnett,et al.  Private communication , 1969 .

[2]  Alon Itai,et al.  Two-Commodity Flow , 1978, JACM.

[3]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[4]  Shay Kutten,et al.  New models and algorithms for future networks , 1988, PODC '88.

[5]  Alejandro A. Schäffer,et al.  Graph spanners , 1989, J. Graph Theory.

[6]  Nicholas F. Maxemchuk,et al.  Comparison of deflection and store-and-forward techniques in the Manhattan Street and Shuffle-Exchange Networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  J. Gechter,et al.  Conceptual issues for ATM , 1989, IEEE Network.

[8]  Shamkant B. Navathe,et al.  Scheduling data redistribution in distributed databases , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[9]  Ted H. Szymanski.  An analysis of 'hot-potato' routing in a fiber optic packet switched hypercube , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[10]  Alexander Schrijver,et al.  Paths, Flows, and VLSI-Layout , 1990 .

[11]  Chak-Kuen Wong,et al.  Incremental time-slot assignment in SS/TDMA satellite systems , 1991, IEEE Trans. Commun..

[12]  Suresh Chalasani,et al.  Efficient time-slot assignment algorithms for SS/TDMA systems with variable-bandwidth beams , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[13]  Zhensheng Zhang,et al.  Performance analysis of multihop lightwave networks with hot potato routing and distance-age-priorities , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[14]  Tatsuya Suda,et al.  Survey of traffic control schemes and protocols in ATM networks , 1991, Proc. IEEE.

[15]  Anthony S. Acampora,et al.  Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[16]  Anthony S. Acampora,et al.  Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing , 1992, IEEE Trans. Commun..

[17]  Albert G. Greenberg,et al.  Deflection routing in hypercube networks , 1992, IEEE Trans. Commun..

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

[19]  Hot-potato routing on processor arrays , 1993, SPAA '93.

[20]  Yechiam Yemini,et al.  Isochronets: a high-speed network switching architecture , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[21]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[22]  Boaz Patt-Shamir,et al.  Greedy Packet Scheduling on Shortest Paths , 1993, J. Algorithms.

[23]  Albert G. Greenberg,et al.  Sharp approximate models of deflection routing in mesh networks , 1993, IEEE Trans. Commun..

[24]  Baruch Schieber,et al.  Fast deflection routing for packets and worms , 1993, PODC '93.

[25]  Thomas G. Robertazzi,et al.  Sharp Approximate Models of Deflection Routing in Mesh Networks , 1993 .

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

[27]  Zhensheng Zhang,et al.  Performance analysis of multihop lightwave networks with hot potato routing and distance-age-priorities , 1994, IEEE Trans. Commun..

[28]  Craig Partridge,et al.  Gigabit networking , 1993, Addison-Wesley professional computing series.

[29]  Assaf Schuster,et al.  Hot-Potato Algorithms for Permutation Routing , 1995, IEEE Trans. Parallel Distributed Syst..

[30]  Shay Kutten,et al.  New models and algorithms for future networks , 1995, IEEE Trans. Inf. Theory.

[31]  Mario Gerla,et al.  Deadlock-free routing in an optical interconnect for high-speed wormhole routing networks , 1996, Proceedings of 1996 International Conference on Parallel and Distributed Systems.

[32]  Antonios Symvonis,et al.  An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method , 1996, IEEE Trans. Computers.