Worst-case Traffic for Oblivious Routing Functions

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 channel loading offered by oblivious routing algorithms enables the problem to be mapped to a bipartite maximum-weight matching, which can be solved in polynomial time for most practical routing functions. Finding exact worst-case performance was previously intractable, and we demonstrate an example case where traditional characterization techniques overestimate the throughput of a particular routing algorithm by 47%. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Non

• Type: Journal
• Year: 2002
• Where: CAL
• Authors: Brian Towles, William J. Dally
• Keywords: CAL 2002, CAL 2008, Oblivious Routing Algorithms, Practical Routing Functions, Worst-case Traffic Pattern