Results 1  10
of
46
Minimizing Congestion in General Networks
 IN PROCEEDINGS OF THE 43RD IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS
, 2002
"... A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performance of distributed applications. In this paper we introduce a framework for solving online problems that aim to minimize t ..."
Abstract

Cited by 115 (11 self)
 Add to MetaCart
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performance of distributed applications. In this paper we introduce a framework for solving online problems that aim to minimize the congestion (i.e. the maximum load of a network link) in general topology networks. We apply this
Optimal Oblivious Routing in Polynomial Time
, 2003
"... A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a polynomial time construction that guarantee's Räcke's bou ..."
Abstract

Cited by 74 (9 self)
 Add to MetaCart
A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a polynomial time construction that guarantee's Räcke's bounds, and more generally gives the true optimal ratio for any network.
A Practical Algorithm for Constructing Oblivious Routing Schemes
, 2003
"... In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a scheme consists of probability distributions over s t paths for every sourcetarget pair s, t in the network. In a recen ..."
Abstract

Cited by 44 (9 self)
 Add to MetaCart
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a scheme consists of probability distributions over s t paths for every sourcetarget pair s, t in the network. In a recent
Worstcase Traffic for Oblivious Routing Functions
 Computer Architecture Letters
, 2002
"... This paper presents an algorithm to find a worstcase traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channel loading offered by oblivious routing algorithms enables the problem to be mapped to a bipartite maximumweight matching ..."
Abstract

Cited by 37 (6 self)
 Add to MetaCart
This paper presents an algorithm to find a worstcase traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channel loading offered by oblivious routing algorithms enables the problem to be mapped to a bipartite maximumweight matching, which can be solved in polynomial time for routing functions with a polynomial number of paths. Finding exact worstcase performance was previously intractable, and we demonstrate an example case where traditional characterization techniques overestimate the throughput of a particular routing algorithm by 47 %.
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 35 (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.
Chaotic Routing  Design and Implementation of an Adaptive Multicomputer Network Router
, 1993
"... A crucial component of a massively parallel multicomputer is the interconnection network which links all of the nodes of the computer together. This network provides the primary method of communication between the hundreds or thousands of processing nodes and is, thus, critical to the successful o ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
A crucial component of a massively parallel multicomputer is the interconnection network which links all of the nodes of the computer together. This network provides the primary method of communication between the hundreds or thousands of processing nodes and is, thus, critical to the successful operation of the multicomputer. Current stateoftheart interconnection networks use simple, oblivious routing techniques which achieve very good performance when loading is light, but do not perform well in the presence of nonuniform congestion or faults. Chaotic routing, a nonminimal adaptive routing technique, provides a mechanism which takes into account the presence of congestion and faults when choosing a path for a message and can, thus, achieve better performance. Chaot...
Wavelength Requirements of AllOptical Networks
 IEEE/ACM Transactions on Networking
, 1995
"... ..."
(Show Context)
ThroughputCentric Routing Algorithm Design
 Past, Present, and Future,º Proc. 20th Anniversary Conf. Advanced Research in Very Large Systems Intelligence
, 2003
"... The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing algorithm, not just its locality, becomes an important performance metric. We show that the problem of designing oblivious ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing algorithm, not just its locality, becomes an important performance metric. We show that the problem of designing oblivious routing algorithms that have high worstcase or averagecase throughput can be cast as a linear program. Globally optimal solutions to these optimization problems can be efficiently found, yielding provably good oblivious routing algorithms.
Online Oblivious Routing
 In Proceedings of ACM Symposium in Parallelism in Algorithms and Architectures (SPAA
, 2003
"... We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of flows), without knowledge of the traffic or demand between each pair, with the goal of minimizing the maximum congestion on any edge in the gr ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
(Show Context)
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of flows), without knowledge of the traffic or demand between each pair, with the goal of minimizing the maximum congestion on any edge in the graph. In the online version of the problem, we consider a "repeatedgame" setting, in which the algorithm is allowed to choose a new routing each night, but is still oblivious to the demands that will occur the next day. The cost of the algorithm at every time step is its competitive ratio, or the ratio of its congestion to the minimum possible congestion for the demands at that time step.