Fast deflection routing for packets and worms
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Routing Permutations on Graphs Via Matchings
SIAM Journal on Discrete Mathematics
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
Universal algorithms for store-and-forward and wormhole routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Distributed packet switching in arbitrary networks
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
IEEE Transactions on Parallel and Distributed Systems
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Time-constrained scheduling of weighted packets on trees and meshes
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Shortest-path routing in arbitrary networks
Journal of Algorithms
Optimal bounds for matching routing on trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Locally efficient on-line strategies for routing packets along fixed paths
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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
Õ(congestion + dilation) hot-potato routing on leveled networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Bounds on Maximum Delay in Networks with Deflection 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
Bounds on evacuation time for deflection routing
Distributed Computing
Exact analysis of hot-potato routing
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
The fat-stack and universal routing in interconnection networks
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
Efficient bufferless routing on leveled networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees (routing time close to the lower bound Ω(C + D)). Our main result is a new deterministic technique that constructs a universal bufferless algorithm by emulating a universal buffered algorithm. The heart of the emulation is to replace packet buffering with packet circulation on regions of the network. The cost of the emulation on the routing time is proportional to the square of the node buffer size used by the buffered algorithm. We apply this emulation to a simple randomized buffered algorithm to obtain a distributed, universal bufferless algorithm with routing time O((C + D) · log3(n + N)), which is within poly-logarithmic factors from the optimal, where n is the size of the network and N is the number of packets. The bufferless competitive ratio is the ratio of the best achievable bufferless routing time, to the best achievable buffered routing time. We give the first non-trivial bound of O(log3(n + N)) for the bufferless competitive ratio for arbitrary routing problems.