2 search results - page 1 / 1 » Worst-case Traffic for Oblivious Routing Functions |
CAL
2002
13 years 10 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
SODA
2008
ACM
14 years 8 days ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...