Sciweavers

Share
STOC
1998
ACM

Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks

8 years 10 months ago
Randomized Protocols for Low Congestion 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 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.
Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where STOC
Authors Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, Berthold Vöcking
Comments (0)
books