Switching White Papers
Optimal Routing With Multiple Traffic Matrices Tradeoff Between Average Case and Worst Case Performance
Overview This paper considers the problem of finding an "Efficient" and "Robust" set of routes in the face of changing/uncertain traffic. The changes/uncertainty in exogenous traffic is characterized by multiple traffic matrices. Goal of this paper is to find a set of routes that result in good average case performance over the set of traffic matrices, while avoiding bad worst case performance for any single traffic matrix. With multiple traffic matrices, previous work aims solely to optimize the average case performance, or the worst case performance. For a given set of traffic matrices, different sets of routes offer a different tradeoff between the average case and the worst case performance. This paper quantifies the performance of a routing configuration at both network level and link level.
| Publisher | University of Massachusetts | File Format | |
|---|---|---|---|
| Date Published | January 2008 | ||
| Format | White Papers | ||
| Topics | |||


