Randomized protocols for low-congestion circuit routing in multistage interconnection networks

Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andrea W. Richa, Klaus Schroder, Ramesh K. Sitaraman, Berthold Vocking

Research output: Contribution to journalConference article

Abstract

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.

Original languageEnglish (US)
Pages (from-to)378-388
Number of pages11
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs
StatePublished - 1998
EventProceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA
Duration: May 23 1998May 26 1998

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Randomized protocols for low-congestion circuit routing in multistage interconnection networks'. Together they form a unique fingerprint.

  • Cite this