Pop-level and access-link-level traffic dynamics in a tier-1 POP
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Tabu Search
Internet Routing Architectures, Second Edition
Internet Routing Architectures, Second Edition
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of link failures in an IP backbone
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Network performance monitoring at small time scales
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Measuring the Shared Fate of IGP Engineering and Interdomain Traffic
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Improving service differentiation in IP networks through dual topology routing
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Shadow configuration as a network management primitive
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Load-Balanced IP Fast Failure Recovery
IPOM '08 Proceedings of the 8th IEEE international workshop on IP Operations and Management
On the predictive power of shortest-path weight inference
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Balancing performance, robustness and flexibility in routing systems
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
A Closed-Loop Control Traffic Engineering System for the Dynamic Load Balancing of Inter-AS Traffic
Journal of Network and Systems Management
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
On the feasibility and efficacy of protection routing in IP networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Scalable and systematic Internet-wide path and delay estimation from existing measurements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network architecture for joint failure recovery and traffic engineering
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Network architecture for joint failure recovery and traffic engineering
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Graceful network state migrations
IEEE/ACM Transactions on Networking (TON)
On the feasibility and efficacy of protection routing in IP networks
IEEE/ACM Transactions on Networking (TON)
Stable routing under the Spanning Tree Protocol
Operations Research Letters
Permutation routing for increased robustness in IP networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Joint coverage and link utilization for fast IP local protection
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Intradomain routing protocols, such as IS-IS or OSPF, associate a weight (or cost) with each link to compute traffic routes. Proposed methods for selecting link weights largely ignore two practical issues, that of service-level agreement (SLA) requirements and of failures. Optimizing the routing configuration, without bounding the SLA, could severely violate this requirement, which is one of the most important vehicles used by carriers to attract new customers. Since most failures are short-lived, it is much more practical not to have to change weight settings during these episodes. In this paper we propose a Tabu-search heuristic for choosing link weights that takes into account both SLA requirements and link failures. Our algorithm selects link weights that still perform well, without having to be changed, even under failure events. To validate the heuristic, we develop a lower bound based on a formal integer linear program (ILP) model, and show that our heuristic solution is within 10% of the optimal ILP lower bound. We study the performance of the heuristic using two operational Tier-1 backbones. Our results illustrate two tradeoffs, between link utilization and the SLA provided, and between performance under failures versus performance without failures. We find that performance under transient failures can be dramatically improved at the expense of a small degradation during normal network operation (i.e., no failures), while simultaneously satisfying SLA requirements. We use our algorithm inside a prototype tool to conduct a case study and illustrate how systematic link weight selection can facilitate topology planning.