How much can hardware help routing?

Authors:
Allan Borodin;Prabhakar Raghavan;Baruch Schieber;Eli Upfal
Affiliations:
Univ. of Toronto, Toronto, Ont., Canada;IBM Almaden Research Center, San Jose, CA;IBM T.J. Watson Research Center;IBM Almaden Research Center San Jose, CA/ and Weizmann Institute, Rehovot, Israel
Venue:
Journal of the ACM (JACM)
Year:
1997

Citing 11
Cited 2

Efficient Schemes for Parallel Communication

Journal of the ACM (JACM)
Routing, merging, and sorting on parallel models of computation

Journal of Computer and System Sciences
Sorting in c log n parallel steps

Combinatorica
Tight bounds on the complexity of parallel sorting

IEEE Transactions on Computers
The token distribution problem

SIAM Journal on Computing
The Future of Fiber-Optic Computer Networks

Computer
An O(log N) deterministic packet-routing scheme

Journal of the ACM (JACM)
How much can hardware help routing?

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A Theory of Wormhole Routing in Parallel Computers

IEEE Transactions on Computers
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Randomized parallel communication (Preliminary Version)

PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing

A polynomial-time tree decomposition to minimize congestion

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Online Permutation Routing in Partitioned Optical Passive Star Networks

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

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.