Issue No.01 - January-December (2002 vol.1)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/L-CA.2002.12
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%.
oblivious routing, worst-case throughput
Brian Towles, William J. Dally, "Worst-case Traffic for Oblivious Routing Functions", IEEE Computer Architecture Letters, vol.1, no. 1, pp. 4, January-December 2002, doi:10.1109/L-CA.2002.12