NDLI: An optimum paths-finding algorithm for ±+1 path protection

Content Provider	IEEE Xplore Digital Library
Author	Ming-Lee Gan Soung-Yue Liew
Copyright Year	2010
Description	Author affiliation: Faculty of Information and Communication Technology, Universiti Tunku Abdul Rahman, Malaysia (Ming-Lee Gan; Soung-Yue Liew)
Abstract	A challenge towards Quality of Service (QoS) is to provide uninterrupted network services in the event of link failure. Path protection is a promising solution by employing a link-disjoint secondary backup path to protect the primary path to ensure the continuity of network services. Existing path protection schemes are classified into dedicated-path protection (e.g., 1+1 protection) and shared-path protection (e.g., 1:N protection, M:N protection). However, these schemes either consume substantial network resource, or cannot respond to link failure quickly enough for real-time services. This paper focuses on an end-to-end partial bandwidth protection scheme denoted as ±+1 protection. In ±+1 protection, only critical or real-time information of the primary path is duplicated and transferred through the secondary path. The ratio of the protection bandwidth (of secondary path) to the full bandwidth (of primary path) is defined as ±. The benefit of ±+1 protection is twofold. Firstly, since only a portion of the primary bandwidth is protected, it reduces the redundancy of data transmission, and hence improves the efficiency of resource utilization. Secondly, ± is a flexible parameter that can be adjusted according to the requirements of different services or networks, as long as minimum protection for uninterrupted services is guaranteed. However, finding the optimal pair of primary-secondary paths for ±+1 protection remains challenging. In this paper, we study the optimality conditions of the pair of paths with respect to any given value of ±, and devise a new optimum paths-finding algorithm for ±+1 protection.
Starting Page	531
Ending Page	537
File Size	1355823
Page Count	7
File Format	PDF
ISBN	9781424472857
ISSN	2157023X
e-ISBN	9781424472864
DOI	10.1109/ICUMT.2010.5676586
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-10-18
Publisher Place	Russia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Radio frequency Algorithm design and analysis Real time systems QOS Bandwidth Quality of service Optical fiber networks Path protection Resource management Reliable routing Link-disjoint paths
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An exact optimum paths-finding algorithm for α+1 path protection

A link-disjoint paths algorithm for reliable qos routing.

k -Maximally Disjoint Path Routing Algorithms for SDN

Effective algorithms for finding optimum pairs of link-disjoint paths in α+1 path protection

Toggling dual label: an exact algorithm for finding the optimal pair of link-disjoint paths in $$\alpha +1$$ path protection

Link–disjoint paths for reliable QoS routing (2003)

An efficient exact algorithm for finding two link-disjoint paths with related path cost and QoS constraint

A multi-layer disjoint path selection algorithm for highly reliable carrier services

Maximizing Bandwidth Using Disjoint Paths

An optimum paths-finding algorithm for ±+1 path protection

Similar Documents

An exact optimum paths-finding algorithm for α+1 path protection

A link-disjoint paths algorithm for reliable qos routing.

k -Maximally Disjoint Path Routing Algorithms for SDN

Effective algorithms for finding optimum pairs of link-disjoint paths in α+1 path protection

Toggling dual label: an exact algorithm for finding the optimal pair of link-disjoint paths in $$\alpha +1$$ path protection

Link–disjoint paths for reliable QoS routing (2003)

An efficient exact algorithm for finding two link-disjoint paths with related path cost and QoS constraint

A multi-layer disjoint path selection algorithm for highly reliable carrier services

Maximizing Bandwidth Using Disjoint Paths

An optimum paths-finding algorithm for ±+1 path protection