The complexity of finding two disjoint paths with min-max objective function
Discrete Applied Mathematics
Finding Hamiltonian circuits in arrangements of Jordan curves is NP-complete
Information Processing Letters
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Analysis of link failures in an IP backbone
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
IEEE/ACM Transactions on Networking (TON)
Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS
Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS
Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels
IEEE/ACM Transactions on Networking (TON)
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
On the complexity of and algorithms for finding the shortest path with a disjoint counterpart
IEEE/ACM Transactions on Networking (TON)
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Fast local rerouting for handling transient link failures
IEEE/ACM Transactions on Networking (TON)
On improving the efficiency and manageability of NotVia
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
A New Link-Based Hamiltonian Cycle Protection in Survivable WDM Optical Networks
AICT '08 Proceedings of the 2008 Fourth Advanced International Conference on Telecommunications
Xl: an efficient network routing algorithm
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Characterization of failures in an operational IP backbone network
IEEE/ACM Transactions on Networking (TON)
Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
A New Differentiated Hamiltonian Cycle Protection Algorithm in Survivable WDM Mesh Networks
ICSPS '09 Proceedings of the 2009 International Conference on Signal Processing Systems
BGP-RCN: improving BGP convergence through root cause notification
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Communications
R-BGP: staying connected In a connected world
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Information-centric networking: seeing the forest for the trees
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
Shared protection in mesh WDM networks
IEEE Communications Magazine
Feasibility of IP restoration in a tier 1 backbone
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
In recent years, there are substantial demands to reduce packet loss on the Internet. Among the proposed schemes, finding backup paths in advance is considered to be an effective method to reduce the reaction time. Very commonly, a backup path is chosen to be the most disjoint path from the primary path, or on the network level, a backup path is computed for each link (e.g., IPFRR). The validity of this straightforward choice is based on two things. The first thing is all the links may have the equal likelihood to fail; the second thing is, facing the high protection requirement today, it just looks weird to have links not protected or to share links between the primary and backup paths. Nevertheless, many studies have confirmed that the individual vulnerability of the links on the Internet is far from being equal. In addition, we have observed that full protection schemes (In this paper, full protection schemes means schemes (1) in which backup path is a most disjoint path from the primary path; or (2) which compute backup path for each link.) may introduce high cost (e.g., computation). In this paper, we argue that such approaches may not be cost-efficient and therefore propose a novel critical protection scheme based on link failure characteristics. Firstly, we analyze the link failure characteristics based on real world traces of CERNET2 (China Education and Research NETwork 2). The analysis results clearly show that the failure probabilities of the links in CERNET2 backbone are heavy-tailed, i.e., a small set of links causing most of the failures. Based on this observation, we find out two key parameters which strongly impact link criticality and propose a critical protection scheme for both single link failure situation and multi-link failure situation. We carefully analyze the implementation details and overhead for backup path schemes of the Internet today; the problem is formulated as an optimization problem to guarantee the routing performance and minimize the backup cost. This cost is special as it involves computational overhead. Based on this, we propose a novel Critical Protection Algorithm which is fast itself for both the single link failure and the multi-link failure versions. A comprehensive set of evaluations with randomly generated topologies, real world topologies and the real traces from CERNET2, shows that our scheme gains significant achievement over full protection in both single link failure situation and multi-link failure situation. It costs only about 30-60% of the full protection cost when the network relative availability increment is 90% of the full protection scheme.