Using Shared Risk Link Groups to enhance backup path computation

نویسندگان

  • Mohand Yazid Saidi
  • Bernard Cousin
  • Jean-Louis Le Roux
چکیده

To cope quickly with all types of failure risks (link, node and Shared Risk Link Group (SRLG)), each router detecting a failure on an outgoing interface activates locally all the backup paths protecting the primary paths which traverse the failed interface. With the observation that upon a SRLG failure, some active backup paths are inoperative and do not really participate to the recovery (since they do not receive any traffic flow), we propose a new algorithm (SRLG structure exploitation algorithm or SSEA) exploiting the SRLG structures to enhance the admission control and improve the protection rate. With our algorithm, more flexibility is provided for the backup path selection since a backup path which protects against the failure of a link belonging to a SRLG does not systematically bypass all the links of that SRLG. Moreover, our algorithm permits to save more bandwidth because it does not allocate the bandwidth for the inoperative backup paths even if they are activated. Simulations show that our algorithm SSEA decreases the ratio of rejected backup paths and, it reduces in distributed environments the average number of messages sent to manage the bandwidth information necessary for the backup path computation. 2009 Elsevier B.V. All rights reserved.

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

ثبت نام

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

منابع مشابه

Backup Path Classification Based on Failure Risks for Efficient Backup Path Computation

We propose a new approach exploiting the failure risk (node, link or Shared Risk Link Group) structures to enhance the backup path computation. Upon failure, our approach classifies the backup paths into two categories: operative backup paths and inoperative backup paths. An operative backup path is an active backup path which really receives traffic of some affected communications while an ino...

متن کامل

Capacity efficient distributed routing of mesh-restored lightpaths in optical networks

A mesh-restored lightpath in an optical network has a primary route and a diversely routed backup route. The wavelength channels on the primary route of a mesh-restored lightpath are dedicated for that lightpath whereas the wavelength channels on the backup route are shared among different mesh-restored lightpaths. Wavelength channels are shared in a way that ensures restoration of all lightpat...

متن کامل

A Cost Effective Approach for WDM Network Protection under Critical Duct Constraints

-In this paper, protection strategies of WDM networks are viewed from a cost perspective. The goal is to minimize the network cost while ensuring the network survivability. In WDM networks, multi fibers are kept in a duct and that duct can be treated as a link SRLG (shared risk link group). With the increase in size and number of shared risk link groups, capacity efficiency of shared-path prote...

متن کامل

PLR-based heuristic for backup path computation in MPLS networks

To ensure service continuity in networks, local protection pre-configuring the backup paths is preferred to global protection. Under the practical hypothesis of single physical failures in the network, the backup paths which protect against different logical failure risks (node, link and shared risk link group (SRLG)) cannot be active at the same time. Thus, sharing bandwidth between such backu...

متن کامل

Path-based protection for surviving double-link failures in mesh-restorable optical networks

we consider path-based protection methods for twolink failures in mesh optical networks. Two link-disjoint backup paths are pre-computed for each source and destination node pair. We identify the scenarios where the backup paths can share their wavelengths without violating 100% restoration guarantee (backup multiplexing). We use integer programming to optimize the total capacity requirement fo...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Computer Networks

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2009