Results 1  10
of
32
Adaptive Packet Routing for Bursty Adversarial Traffic
, 1998
"... One of the central tasks of networking is packetrouting when edge bandwidth is limited. Tremendous progress has been achieved by separating the issue of routing into two conceptual subproblems: path selection and congestion resolution along the selected paths. However, this conceptual separatio ..."
Abstract

Cited by 65 (8 self)
 Add to MetaCart
One of the central tasks of networking is packetrouting when edge bandwidth is limited. Tremendous progress has been achieved by separating the issue of routing into two conceptual subproblems: path selection and congestion resolution along the selected paths. However, this conceptual separation has a serious drawback: each packet's path is fixed at the source and cannot be modified adaptively enroute. The problem is especially severe when packet injections are modeled by an adversary, whose goal is to cause "trafficjams".
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 (17 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 ...
Exploiting Locality for Data Management in Systems of Limited Bandwidth
 IN PROCEEDINGS OF THE 38TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1997
"... This paper deals with data management in computer systems in which the computing nodes are connected by a relatively sparse network. We consider the problem of placing and accessing a set of shared objects that are read and written from the nodes in the network. These objects are, e.g., global varia ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
This paper deals with data management in computer systems in which the computing nodes are connected by a relatively sparse network. We consider the problem of placing and accessing a set of shared objects that are read and written from the nodes in the network. These objects are, e.g., global variables in a parallel program, pages or cache lines in a virtual shared memory system, shared files in a distributed file system, or pages in the World Wide Web. A data management strategy consists of a placement strategy that maps the objects (possibly dynamically and with redundancy) to the nodes, and an access strategy that describes how reads and writes are handled by the system (including the routing). We investigate static and dynamic data management strategies. In the static model, we assume that we are given an application for which the rates of read and write accesses for all nodeobject pairs are known. The goal is to calculate a static placement of the objects to the nodes in the ne...
Universal Continuous Routing Strategies
 IN PROC. OF THE 8TH ACM SYMP. ON PARALLEL ALGORITHMS AND ARCHITECTURES (SPAA
, 1996
"... In this paper we present routing protocols that are universal in the sense that they route messages along arbitrary (simple or shortest) paths in arbitrary networks. We study these protocols under a stochastic model of continuous message generation. The performance of such protocols is characterized ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
In this paper we present routing protocols that are universal in the sense that they route messages along arbitrary (simple or shortest) paths in arbitrary networks. We study these protocols under a stochastic model of continuous message generation. The performance of such protocols is characterized by three parameters: the maximum message generation rate for which the protocol is stable, the expected delay of a message from generation to service, and the time the protocol needs to recover from worst case scenarios. Our main results are a universal continuous storeandforward routing protocol and a universal continuous wormhole routing protocol. Both protocols yield significant performance improvements over all previously known continuous routing protocols. In addition, we present adaptations of our main results to continuous routing in nodesymmetric networks, butterflies, and meshes.
Fast Algorithms for Finding O(Congestion+Dilation) Packet Routing Schedules
 Combinatorica
, 1995
"... In 1988, Leighton, Maggs, and Rao showed that for any network and any set of packets whose paths through the network are fixed and edgesimple, there exists a schedule for routing the packets to their destinations in O(c + d) steps using constantsize queues, where c is the congestion of the paths ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
(Show Context)
In 1988, Leighton, Maggs, and Rao showed that for any network and any set of packets whose paths through the network are fixed and edgesimple, there exists a schedule for routing the packets to their destinations in O(c + d) steps using constantsize queues, where c is the congestion of the paths in the network, and d is the length of the longest path. The proof, however, used the Lovdsz Local Lemma and was not constructive. In this paper, we show how to find such a schedule in O(NE + E 1og’E) time, for any fixed 6> 0, where N is the total number of packets, and E is the number of edges in the network. We also show how to parallelize the algorithm so that it runs in NC. The method that we use to construct eficient packet routing schedules is based on the algorithmic form of the Lovdsz Local Lemma discovered by Beck. 1
Randomized Protocols for LowCongestion Circuit Routing in Multistage Interconnection Networks
"... In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circuits (or paths) for the messages with small congestion, dilation, and setup time. Our algorithms are based on the idea of h ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circuits (or paths) for the messages with small congestion, dilation, and setup time. Our algorithms are based on the idea of having each message choose a route from two possibilities, a technique that has previously proven successful in simpler load balancing settings. As an application of our techniques, we propose a novel design for a data server.
Routing with Bounded Buffers and HotPotato Routing in VertexSymmetric Networks
 Proceedings of the Third Annual European Symposium on Algorithms, volume 979 of LNCS
, 1995
"... . In this paper we present and analyze online routing schemes with contant buffer size and hotpotato routing schemes for vertexsymmetric networks. In particular, we prove that for any vertexsymmetric network with n vertices, degree d, and diameter D =\Omega (log n), a randomly chosen function a ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
. In this paper we present and analyze online routing schemes with contant buffer size and hotpotato routing schemes for vertexsymmetric networks. In particular, we prove that for any vertexsymmetric network with n vertices, degree d, and diameter D =\Omega (log n), a randomly chosen function and any permutation can be routed in time  O(log n \Delta D), with high probability (w.h.p.), if constant size buffers are available for each edge,  O(log n \Delta D log 1+ffl D) for any ffl ? 0, w.h.p., if for each vertex buffers of size 3, independent of the degree of the network, are available. The schedule for the second result can be converted into a hotpotato routing schedule, if a selfloop is added to each vertex. E.g., for any bounded degree vertexsymmetric network with selfloops and diameter O(log n) (among them expanders) we obtain a hotpotato routing protocol that needs time O(log 2 n(log log n) 1+ffl ) for any ffl ? 0 to route a randomly chosen function and any pe...
Shortest paths routing in arbitrary networks
 JOURNAL OF ALGORITHMS
, 1999
"... We introduce an online protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in OC � Ž D � log N. steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for bo ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
We introduce an online protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in OC � Ž D � log N. steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for boundeddegree leveled networks. Further, we show that the preceding bound holds also for random routing problems with C denoting the maximum expected congestion over all links. Based on this result, we give applications for random routing in Cayley networks, general node symmetric networks, edge symmetric networks, and de Bruijn networks. Finally, we examine the problems arising when our approach is applied to routing along nonshortest paths, deterministic routing, or routing with bounded buffers.
From Static to Dynamic Routing: Efficient Transformations of StoreandForward Protocols
 SIAM JOURNAL ON COMPUTING, TO APPEAR
, 1999
"... ..."
(Show Context)
Locally Efficient OnLine Strategies for Routing Packets along Fixed Paths
 In Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms
, 1999
"... Most of the work done in the area of static routing concentrates on minimizing the runtime of the whole schedule rather than minimizing the runtime of individual packets, using global parameters such as the congestion and dilation of a path collection. In this paper, we study the problem of minim ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
Most of the work done in the area of static routing concentrates on minimizing the runtime of the whole schedule rather than minimizing the runtime of individual packets, using global parameters such as the congestion and dilation of a path collection. In this paper, we study the problem of minimizing the routing time of individual packets, using local parameters. In fact, we present the first (up to a log log factor) optimal, truly online routing protocols for the following problems: Packet switching: Assume that a fixed collection of paths is given. For every path p in this collection, let c p denote the maximum number of paths that share an edge with p, and let d p denote the length of p. Find a schedule (that does not require to know c p and d p ) such that the routing time of a packet following a path p merely depends on c p and d p . Virtual circuit switching: Assume that a fixed set of sessions is given. For every session i, packets are injected at a rate r i to f...