Voice over IP performance monitoring
ACM SIGCOMM Computer Communication Review
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
Network performance monitoring at small time scales
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
The problem of synthetically generating IP traffic matrices: initial recommendations
ACM SIGCOMM Computer Communication Review
Implementation of two Resilience Mechanisms using Multi Topology Routing and Stub Routers
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
IGP link weight assignment for operational Tier-1 backbones
IEEE/ACM Transactions on Networking (TON)
Improving service differentiation in IP networks through dual topology routing
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Making IGP routing robust to link failures
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Identifying and using energy-critical paths
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
| Hi-index | 0.00 |
Modern networks face the daunting task of handling increasingly diverse traffic that is displaying a growing intolerance to disruptions. This has given rise to many initiatives, and in this paper we focus on multiple topology routing as the primary vehicle for meeting those demands. Specifically, we seek routing solutions capable of not just accommodating different performance goals, but also preserving them in the presence of disruptions. The main challenge is computational, i.e., to identify among the enormous number of possible routing solutions the one that yields the best compromise between performance and robustness. This is where our principal contribution lies, as we expand the definition of critical links -- a key concept in improving the efficiency of routing computation -- and develop a precise methodology to efficiently converge on those solutions. Using this new methodology, we demonstrate that one can compute routing solutions that are both flexible in accommodating different performance requirements and robust in maintaining them in the presence of failures and traffic fluctuations.