Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
Universal packet routing with arbitrary bandwidths and transit times
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Packet routing: complexity and algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Hi-index | 0.00 |
Direct routing is the special case ofbufferless routing whereN packets, once injected into the network, must be delivered to their destinations without collisions. We give a general treatment of three facets of direct routing: 1. Algorithms. We present a polynomial-timegreedy direct algorithm which is worst-case optimal. We improve the bound of the greedy algorithm for special cases, by applying variants of this algorithm to commonly used network topologies. In particular, we obtainnear-optimal routing time for thetree, mesh, butterfly, andhypercube. 2. Complexity. By a reduction from Vertex Coloring, we show that optimal Direct Routing is inapproximable, unless P=NP. 3. Lower Bounds for Buffering. We show that certain direct routing problems cannot be solved efficiently; in order to solve these problems,any routing algorithm needs buffers. We give non-trivial lower bounds on such buffering requirements for general routing algorithms.