Backup Path Allocation Based on a Correlated Link Failure Probability Model in Overlay Networks

نویسندگان

  • Weidong Cui
  • Ion Stoica
  • Randy H. Katz
چکیده

Communication reliability is a desired property in computer networks. One key technology to increase the reliability of a communication path is to provision a disjoint backup path. One of the main challenges in implementing this technique is that two paths that are disjoint at the IP or overlay layer may share the same physical links. As a result, although we may select a disjoint backup path at the overlay layer, one physical link failure may cause the failure of both the primary and the backup paths. In this paper, we propose a solution to address this problem. The main idea is to take into account the correlated link failure at the overlay layer. More precisely, our goal is to find a route for the backup path to minimize the joint path failure probability between the primary and the backup paths. To demonstrate the feasibility of our approach, we perform extensive evaluations under both single and double link failure models. Our results show that, in terms of robustness, our approach is near optimal and is up to 60% better than no backup path reservation and is up to 30% better than using the traditional shortest disjoint path algorithm to select the backup path.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

متن کامل

Spare Capacity Allocation for Non-Linear Link Cost and Failure-Dependent Path Restoration

The design of survivable mesh based communication networks has received considerable attention in recent years. One task is to route backup paths and allocate spare capacity in the network to guarantee seamless communications services survivable to a set of failure scenarios. This is a complex multi-constraint optimization problem, called spare capacity allocation (SCA). This paper presents a m...

متن کامل

A new efficient spare capacity allocation algorithm in self-healing MPLS mesh-based survivable networks

Network survivability gauges the ability of a network to support the committed Quality of Services (QoS) continuously in the presence of various failure scenarios. MPLS Mesh-Based network can be used to provide network survivability in case of link and node failure through predesign path protection techniques. In the Preplanned self-healing networks, we have to provision adequate spare capacity...

متن کامل

Efficient Bandwidth Allocation for Backup Paths

In MPLS networks, failure resilience of a Label Switched Path (LSP) is essential in guaranteeing the QoS of the path. This can be achieved by allocating backup LSPs through which packets can be routed in case of primary LSP failiures. bandwidth efficiency and expeditious path restoration are two desirable features for the design of backup LSPs. This paper tackles the bandwidth efficiency with a...

متن کامل

Using Local Information for WDM Network Protection

Path protection and link protection schemes are the main means of protecting wavelength-division multiplexed (WDM) networks from the losses caused by a link failure such as a fiber cut. We propose a new protection scheme, which we term partial path protection (PPP), to select end-to-end backup paths using local information about network failures. PPP designates a different restoration path for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002