Deterministic many-to-many hot potato routing

Author

Borodin, Allan ; Rabani, Yuval ; Schieber, Baruch

Author_Institution

Dept. of Comput. Sci., Toronto Univ., Ont., Canada

Volume

8

Issue

6

fYear

1997

fDate

6/1/1997 12:00:00 AM

Firstpage

587

Lastpage

596

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

Keywords

deterministic algorithms; hypercube networks; message passing; multiprocessor interconnection networks; butterfly; charging scheme; deflection routing; deterministic many-to-many hot potato routing; hypercube; hypercubic networks; many-to-many packet routing; meshes; nearly optimal deterministic algorithms; optimal deterministic algorithms; tori; Algorithm design and analysis; Communication networks; Communication switching; Hardware; Hypercubes; Optical fiber networks; Optical packet switching; Packet switching; Parallel machines; Routing;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.595575

Filename

595575