Deterministic many-to-many hot potato routing

Allan Borodin, Yuval Rabani, Baruch Schieber

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

Abstract

We consider algorithms for many-to-many 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 many-to-many 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.

Original languageEnglish (US)
Pages (from-to)587-596
Number of pages10
JournalIEEE Transactions on Parallel and Distributed Systems
Volume8
Issue number6
DOIs
StatePublished - 1997
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Keywords

  • Deflection routing
  • Hypercube
  • Many-to-many routing
  • Mesh
  • Routing

Fingerprint

Dive into the research topics of 'Deterministic many-to-many hot potato routing'. Together they form a unique fingerprint.

Cite this