Thumbnail
Access Restriction
Subscribed

Author Borodin, Allan ♦ Raghavan, Prabhakar ♦ Schieber, Baruch ♦ Upfal, Eli
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1997
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Multi-port ♦ Packet routing ♦ Permutation routing ♦ Randomized routing algorithms ♦ Single-port
Abstract We study the extent to which complex hardware can speed up routing. Specifically, we consider the following questions. How much does adaptive routing improve over oblivious routing? How much does randomness help? How does it help if each node can have a large number of neighbors? What benefit is available if a node can send packets to several neighbors within a single time step? Some of these features require complex networking hardware, and it is thus important to investigate whether the performance justifies the investment. By varying these hardware parameters, we obtain a hierarchy of time bounds for worst-case permutation routing.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1997-09-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 44
Issue Number 5
Page Count 16
Starting Page 726
Ending Page 741


Open content in new tab

   Open content in new tab
Source: ACM Digital Library