Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing

In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, 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 a most disjoint path from the primary path, or in the network level, backup paths are computed for all links (e.g., IPRFF). The validity of this straightforward choice is based on 1) all the links may fail with equal probability; and 2) facing the high protection requirement today, having links not protected or sharing links between the primary and backup paths just simply look weird. Nevertheless, indications from many research studies have confirmed that the vulnerability of the links in the Internet is far from equality. In addition, we have seen that full protection schemes may introduce high costs . In this paper, we argue that such approaches may not be cost effective. We first analyze the failure characteristics based on r...

• Type: Journal
• Year: 2009
• Where: ICDCS
• Authors: Meijia Hou, Dan Wang, Mingwei Xu, Jiahai Yang
• Keywords: Backup Path, Distributed And Parallel Computing, ICDCS 2009, Network Level, Protection Scheme