COPE: traffic engineering in dynamic networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
On the placement of infrastructure overlay nodes
IEEE/ACM Transactions on Networking (TON)
Coordinated control of multiple mobile robots in pursuit-evasion games
ACC'09 Proceedings of the 2009 conference on American Control Conference
Stable and robust multipath oblivious routing for traffic engineering
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Adaptive multi-topology IGP based traffic engineering with near-optimal network performance
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
R3: resilient routing reconfiguration
Proceedings of the ACM SIGCOMM 2010 conference
Rehoming edge links for better traffic engineering
ACM SIGCOMM Computer Communication Review
Cluster-based back-pressure routing algorithm
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this paper, we consider the problem of finding an "efficient" and "robust" set of routes in the face of changing/ uncertain traffic. The changes/uncertainty in exogenous traffic are characterized by multiple traffic matrices. Our goal is to find a set of routes that results 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 [1], or the worst case performance [2]. For a given set of traffic matrices, different sets of routes offer a different tradeoff between the average case and the worst case performance. In this paper, we quantify the performance of a routing configuration at both network level and link level. We propose a simple metric - a weighted sum of the average case and the worst case performance - to control the tradeoff between these two considerations. Despite of its simple form, this metric is very effective. We prove that optimizing routing using this metric has desirable properties, such as the average case performance being a decreasing, convex and differentiable function to the worst case performance. By extending previous work [1][3], we derive methods to find the optimal routes with respect to the proposed metric for two classes of intradomain routing protocols: MPLS and OSPF/IS-IS. We evaluate our approach with data collected from an operational tier-1 ISP. For MPLS, we find that there exists significant tradeoff (e.g., 15% - 23% difference) between optimizing solely on the average case performance and solely on the worst case performance. Our approach can identify solutions that can dramatically improve the worst case performance (13% - 15%) while only slightly sacrificing the average case performance (2.2% - 3%), in comparison to that by optimizing solely on the average case performance. For OSPF/IS-IS, we still find a significant difference between the two optimization objectives, however, a fine-grained tradeoff is difficult to achieve due to the limited control that OSPF/ISIS provide.