Efficient bufferless routing on leveled networks

Authors:
Costas Busch;Shailesh Kelkar;Malik Magdon-Ismail
Affiliations:
Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY;Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY;Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY
Venue:
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Year:
2005

Citing 12
Cited 1

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Randomized routing and sorting on fixed-connection networks

Journal of Algorithms
On Bufferless Routing of Variable Length Messages in Leveled Networks

IEEE Transactions on Computers
Dynamic deflection routing on arrays (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Direct routing on trees

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hard-Potato routing

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Hot-potato routing on processor arrays

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Deterministic Many-to-Many Hot Potato Routing

IEEE Transactions on Parallel and Distributed Systems
Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks

Theory of Computing Systems
Exact analysis of hot-potato routing

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Universal bufferless routing

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms

The fat-stack and universal routing in interconnection networks

Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give near optimal bufferless routing algorithms for leveled networks. N packets with preselected paths are given, and once injected, the packets may not be buffered while in transit to their destination. For the preselected paths, the dilationD is the maximum path length, and the congestionC is the maximum number of times an edge is used. We give two bufferless routing algorithms for leveled networks: (i) a centralized algorithm with routing time O((C+D)log(DN)); (ii) a distributed algorithm with routing time O((C+D)log2(DN)). The distributed algorithm uses a new technique, reverse-simulation, which is used to obtain a distributed emulation of the centralized algorithm. Since a well known lower bound on the routing time is Ω(C+D), our results are at most one or two logarithmic factors from optimal.