Results 1  10
of
34
Universal Algorithms for StoreandForward and Wormhole Routing
 IN PROC. OF THE 28TH ACM SYMP. ON THEORY OF COMPUTING (STOC
, 1996
"... In this paper we present routing algorithms that are universal in the sense that they route messages along arbitrary (simple) paths in arbitrary networks. The algorithms are analyzed in terms of the number of messages being routed, the maximum number of messages that must cross any edge in the netwo ..."
Abstract

Cited by 35 (18 self)
 Add to MetaCart
In this paper we present routing algorithms that are universal in the sense that they route messages along arbitrary (simple) paths in arbitrary networks. The algorithms are analyzed in terms of the number of messages being routed, the maximum number of messages that must cross any edge in the network (edge congestion), the maximum number of edges that a message must cross (dilation), the buffer size, and the bandwidth of the links. We present two main results, both of which have applications to universal storeand forward routing and universal wormhole routing. Our results yield significant performance improvements over all previously known universal routing algorithms for a wide range of parameters, and they even improve many time bounds for standard networks. In addition, we present adaptations of our main results for routing along shortest paths in arbitrary networks, and for routing in leveled networks, nodesymmetric networks, edgesymmetric networks, expanders, butterflies, and ...
Packet Routing In FixedConnection Networks: A Survey
, 1998
"... We survey routing problems on fixedconnection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, krelation routing, routing to random destinations, dynamic routing, isotonic routing ..."
Abstract

Cited by 34 (3 self)
 Add to MetaCart
We survey routing problems on fixedconnection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, krelation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We also provide a list of unsolved problems and numerous references.
Deterministic manytomany hot potato routing
 IEEE Transactions on Parallel and Distributed Systems
, 1997
"... We consider algorithms for manytomany 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 manytomany packet routing in commonly occurrin ..."
Abstract

Cited by 32 (0 self)
 Add to MetaCart
(Show Context)
We consider algorithms for manytomany 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 manytomany 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.
Potential Function Analysis of Greedy HotPotato Routing (Extended Abstract)
 Theory of Computing Systems
, 1994
"... Amir BenDor Shai Halevi y Assaf Schuster z January 21, 1994 Abstract In this work we study the problem of packet routing in synchronous networks of processors, in which at most one packet can traverse any communication link in each time step. We consider a class of algorithms known as hotpo ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
Amir BenDor Shai Halevi y Assaf Schuster z January 21, 1994 Abstract In this work we study the problem of packet routing in synchronous networks of processors, in which at most one packet can traverse any communication link in each time step. We consider a class of algorithms known as hotpotato or deflection routing algorithms. The important characteristic of these algorithms is that they use no buffer space for storing delayed packets. Each packet, unless already arrived to its destination, must leave the processor at the step following its arrival. The main advantage in hotpotato routing is that there is no need to store delayed packets in the processors, and therefore, the processors can be much simpler, and contain less hardware. This work is concerned with greedy routing, in which a packet is bound to use an outgoing link in the direction of its destination, whenever such a link is available. In this way, greediness guarantees that, unless some global congestion forbids...
Minimal Adaptive Routing on the Mesh with Bounded Queue Size
, 1994
"... An adaptive routing algorithm is one in which the path a packet takes from its source to its destination may depend on other packets it encounters. Such algorithms potentially avoid network bottlenecks by routing packets around "hot spots." Minimal adaptive routing algorithms have the a ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
An adaptive routing algorithm is one in which the path a packet takes from its source to its destination may depend on other packets it encounters. Such algorithms potentially avoid network bottlenecks by routing packets around "hot spots." Minimal adaptive routing algorithms have the additional advantage that the path each packet takes is a shortest one. For a large class of minimal adaptive routing algorithms, we present an \Omega# n 2 =k 2 ) bound on the worst case time to route a static permutation of packets on an n 2 n mesh or torus with nodes that can hold up to k 1 packets each. This is the first nontrivial lower bound on adaptive routing algorithms. The argument extends to more general routing problems, such as the hh routing problem. It also extends to a large class of dimension order routing algorithms, yielding an \Omega# n 2 =k) time bound. To complement these lower bounds, we present two upper bounds. One is an O(n 2 =k) time dimension order routing...
ManytoMany Routing on Trees via Matchings
, 1996
"... In this paper we present an extensive study of manytomany routing on trees under the matching routing model. Our study includes online and offline algorithms. We present an asymptotically optimal online algorithm which routes k packets to their destination within d(k \Gamma 1) + d \Delta dist r ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
In this paper we present an extensive study of manytomany routing on trees under the matching routing model. Our study includes online and offline algorithms. We present an asymptotically optimal online algorithm which routes k packets to their destination within d(k \Gamma 1) + d \Delta dist routing steps, where d is the degree of tree T on which the routing takes place and dist is the maximum distance any packet has to travel. We also present an offline algorithm that solves the same problem within 2(k \Gamma 1)+dist steps. The analysis of our algorithms is based on the establishment of a close relationship between the matching and the hotpotato routing models that allows us to apply tools which were previously used exclusively in the analysis of hotpotato routing.
A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms
"... Recently, Chinn, Leighton, and Tompa [10] presented lower bounds for storeandforward permutation routing algorithms on the n × n mesh with bounded buffer size and where a packet must take a shortest (or minimal) path to its destination. We extend their analysis to algorithms that are nea ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Recently, Chinn, Leighton, and Tompa [10] presented lower bounds for storeandforward permutation routing algorithms on the n &times; n mesh with bounded buffer size and where a packet must take a shortest (or minimal) path to its destination. We extend their analysis to algorithms that are nearly minimal. We also apply this technique to the domain of hot potato algorithms, where there is no storage of packets and the shortest path to a destination is not assumed (and is in general impossible). We show that "natural" variants and "improvements" of several algorithms in the literature perform poorly in the worst case. As a result, we identify algorithmic features that are undesirable for worst case hot potato permutation routing. Recent works in hot potato routing have tried to define simple and greedy classes of algorithms. We show that when an algorithm is too simple and too greedy, its performance in routing permutations is poor in the worst case. Specifically, the technique of [10] ...
Overview of Mesh Results
 MAXPLANCK INSTITUT FUR INFORMATIK, SAARBRUCKEN
, 1995
"... This paper provides an overview of lower and upper bounds for algorithms for meshconnected processor networks. Most of our attention goes to routing and sorting problems, but other problems are mentioned as well. Results from 1977 to 1995 are covered. We provide numerous results, references and ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper provides an overview of lower and upper bounds for algorithms for meshconnected processor networks. Most of our attention goes to routing and sorting problems, but other problems are mentioned as well. Results from 1977 to 1995 are covered. We provide numerous results, references and open problems. The text is completed with an index. This is a workedout version of the author's contribution to a joint paper with Miltos D. Grammatikakis, D. Frank Hsu and Miro Kraetzl on multicomputer routing, submitted to the Journal of Parallel and Distributed Computing.
Experimental evaluation of hotpotato routing algorithms on 2dimensional processor arrays
 In EUROPAR: Parallel Processing, 6th International EUROPAR Conference
, 2000
"... Abstract. In this paper we consider the problem of routing packets in twodimensional torusconnected processor arrays. We describe the implementation of four hotpotato routing algorithms and study their performance by experimentation. The algorithms are either greedy in the sense that packets try ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract. In this paper we consider the problem of routing packets in twodimensional torusconnected processor arrays. We describe the implementation of four hotpotato routing algorithms and study their performance by experimentation. The algorithms are either greedy in the sense that packets try to move towards their destination by adaptively using a shortest path, or have the property that the path traversed by any packet approximates the path traversed by the greedy routing algorithm in the storeandforward model. Moreover, they are simple and were implemented according to the one or twopass scheme. In our experiments, we consider the static case of the routing problem where we study permutation and random destination input instances as well as the dynamic case of the problem under the stochastic model for the continuous generation of packets. Our experimental results demonstrate that, although the running time of all the algorithms is close to the optimal for static routing problems, heavy traffic may influence differently the performance of each algorithm in the dynamic case.
Universal Bufferless Routing
, 2004
"... In a routing problem, a set of packets must be routed from their sources to their destinations along specified paths in a connected network. The celebrated result of Leighton, Maggs and Rao (1988) established, nonconstructively, the existence of a routing schedule which uses constant size bffers an ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
In a routing problem, a set of packets must be routed from their sources to their destinations along specified paths in a connected network. The celebrated result of Leighton, Maggs and Rao (1988) established, nonconstructively, the existence of a routing schedule which uses constant size bffers and routes the packets in optimal time. Since then, constructive algorithms, as well as generalizations to distributed, buffered routing schedules have been developed. A long standing open problem...