How much can hardware help routing?

Allan Borodin; Prabhakar Raghavan; Baruch Schieber; Eli Upfal

doi:10.1145/167088.167237

How much can hardware help routing?

Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

20 Scopus citations

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 thus it is 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. We develop a nearly complete taxonomy of the complexity of routing.

Original language	English (US)
Title of host publication	Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993
Publisher	Association for Computing Machinery
Pages	573-582
Number of pages	10
ISBN (Electronic)	0897915917
DOIs	https://doi.org/10.1145/167088.167237
State	Published - Jun 1 1993
Externally published	Yes
Event	25th Annual ACM Symposium on Theory of Computing, STOC 1993 - San Diego, United States Duration: May 16 1993 → May 18 1993

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
Volume	Part F129585
ISSN (Print)	0737-8017

Conference

Conference	25th Annual ACM Symposium on Theory of Computing, STOC 1993
Country/Territory	United States
City	San Diego
Period	5/16/93 → 5/18/93

All Science Journal Classification (ASJC) codes

Software

Access to Document

10.1145/167088.167237

Cite this

@inproceedings{8abf9c0677e74854a25e8f3a7d9a2ec0,

title = "How much can hardware help routing?",

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 thus it is 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. We develop a nearly complete taxonomy of the complexity of routing.",

author = "Allan Borodin and Prabhakar Raghavan and Baruch Schieber and Eli Upfal",

note = "Publisher Copyright: {\textcopyright} 1993 ACM.; 25th Annual ACM Symposium on Theory of Computing, STOC 1993 ; Conference date: 16-05-1993 Through 18-05-1993",

year = "1993",

month = jun,

day = "1",

doi = "10.1145/167088.167237",

language = "English (US)",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "573--582",

booktitle = "Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993",

}

Borodin, A, Raghavan, P, Schieber, B & Upfal, E 1993, How much can hardware help routing? in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F129585, Association for Computing Machinery, pp. 573-582, 25th Annual ACM Symposium on Theory of Computing, STOC 1993, San Diego, United States, 5/16/93. https://doi.org/10.1145/167088.167237

How much can hardware help routing? / Borodin, Allan; Raghavan, Prabhakar; Schieber, Baruch et al.
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Association for Computing Machinery, 1993. p. 573-582 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129585).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution