This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Worst-case Traffic for Oblivious Routing Functions
January-December 2002 (vol. 1 no. 1)
pp. 4
This paper presents an algorithm to find a worst-case trafficpattern for any oblivious routing algorithm on an arbitrary interconnectionnetwork topology. The linearity of channel loading offered by obliviousrouting algorithms enables the problem to be mapped to a bipartitemaximum-weight matching, which can be solved in polynomial time forrouting functions with a polynomial number of paths. Finding exact worstcaseperformance was previously intractable, and we demonstrate an examplecase where traditional characterization techniques overestimate thethroughput of a particular routing algorithm by 47%.
Index Terms:
oblivious routing, worst-case throughput
Citation:
Brian Towles, William J. Dally, "Worst-case Traffic for Oblivious Routing Functions," IEEE Computer Architecture Letters, vol. 1, no. 1, pp. 4, Jan.-Dec. 2002, doi:10.1109/L-CA.2002.12
Usage of this product signifies your acceptance of the Terms of Use.