Worst-case traffic for oblivious routing functions
- 10 August 2002
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Universal-stability results and performance bounds for greedy contention-resolution protocolsJournal of the ACM, 2001
- The case for chaotic adaptive routingIEEE Transactions on Computers, 1997
- ROMM routing on mesh and torus networksPublished by Association for Computing Machinery (ACM) ,1995
- Randomized Routing and Sorting on Fixed-Connection NetworksJournal of Algorithms, 1994
- Fast algorithms for bit-serial routing on a hypercubeTheory of Computing Systems, 1991
- Tight bounds for oblivious routing in the hypercubePublished by Association for Computing Machinery (ACM) ,1990
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955