Answers are grounded in this paper and cite their sources.
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%.
No takes yet. Share an insight, caveat, or question.
Towles et al. (2002) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: