How much can hardware help routing?

Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal

Research output: Contribution to journalArticlepeer-review

3 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 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. General Terms: Algorithms, Theory Additional Key Words and Phrases: Multi-port, packet routing, permutation routing, randomized routing algorithms, single-port.

Original languageEnglish (US)
Pages (from-to)726-741
Number of pages16
JournalJournal of the ACM
Volume44
Issue number5
DOIs
StatePublished - Sep 1997
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Information Systems
  • Hardware and Architecture
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'How much can hardware help routing?'. Together they form a unique fingerprint.

Cite this