Worst-case traffic for oblivious routing functions

This publication has 8 references indexed in Scilit:

• Universal-stability results and performance bounds for greedy contention-resolution protocols
  Journal of the ACM, 2001
• The case for chaotic adaptive routing
  IEEE Transactions on Computers, 1997
• ROMM routing on mesh and torus networks
  Published by Association for Computing Machinery (ACM) ,1995
• Randomized Routing and Sorting on Fixed-Connection Networks
  Journal of Algorithms, 1994
• Fast algorithms for bit-serial routing on a hypercube
  Theory of Computing Systems, 1991
• Tight bounds for oblivious routing in the hypercube
  Published by Association for Computing Machinery (ACM) ,1990
• Routing, merging, and sorting on parallel models of computation
  Journal of Computer and System Sciences, 1985
• The Hungarian method for the assignment problem
  Naval Research Logistics Quarterly, 1955