IEEE/ACM Transactions on Networking (TON)
Restoration strategies and spare capacity requirements in self-healing ATM networks
IEEE/ACM Transactions on Networking (TON)
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Trajectory sampling for direct traffic observation
IEEE/ACM Transactions on Networking (TON)
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Experience in measuring backbone traffic variability: models, metrics, measurements and meaning
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
COPE: traffic engineering in dynamic networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Making routing robust to changing traffic demands: algorithms and evaluation
IEEE/ACM Transactions on Networking (TON)
Oblivious routing for fat-tree based system area networks with uncertain traffic demands
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Reliability as an interdomain service
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Locally restorable routing of highly variable traffic
IEEE/ACM Transactions on Networking (TON)
Guaranteed performance routing of unpredictable traffic with fast path restoration
IEEE/ACM Transactions on Networking (TON)
Oblivious routing in fat-tree based system area networks with uncertain traffic demands
IEEE/ACM Transactions on Networking (TON)
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
Demand-oblivious routing: distributed vs. centralized approaches
INFOCOM'10 Proceedings of the 29th conference on Information communications
R3: resilient routing reconfiguration
Proceedings of the ACM SIGCOMM 2010 conference
Providing survivability against jamming attack for multi-radio multi-channel wireless mesh networks
Journal of Network and Computer Applications
Evaluation of Routing with Robustness to the Variation in Traffic Demand
Journal of Network and Systems Management
End-to-end restorable oblivious routing of hose model traffic
IEEE/ACM Transactions on Networking (TON)
Rehoming edge links for better traffic engineering
ACM SIGCOMM Computer Communication Review
DECOR: a distributed coordinated resource monitoring system
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
| Hi-index | 0.00 |
Link and node failures in IP networks pose a challenge for network control algorithms. Routing restoration, which computes new routes that avoid failed links, involves fundamental tradeoffs between efficient use of network resources, complexity of the restoration strategy and disruption to network traffic. In order to achieve a balance between these goals, obtaining routings that provide good performance guarantees under failures is desirable.In this paper, building on previous work that provided performance guarantees under uncertain (and potentially unknown) traffic demands, we develop algorithms for computing optimal restoration paths and a methodology for evaluating the performance guarantees of routing under failures. We then study the performance of route restoration on a diverse collection of ISP networks. Our evaluation uses a competitive analysis type framework, where performance of routing with restoration paths under failures is compared to the best possible performance on the failed network. We conclude that with careful selection of restoration paths one can obtain restoration strategies that retain nearly optimal performance on the failed network while minimizing disruptions to traffic flows that did not traverse the failed parts of the network.