NDLI: A Minimum Cost Active and Backup Path Algorithm with SRLG Constraints

Content Provider	IEEE Xplore Digital Library
Author	Jianhui Zhang Bin Wang Binqiang Wang Jinqiu Ren
Copyright Year	2009
Abstract	As more and more mission critical service are now transported over high-speed networks, It becomes an important issue to make use of the relativity of multiple link/node failures and improve transport performance for high-speed networks. In this paper, we propose a novel algorithm called Low cost an S disjoint paths algorithm (LCSD for short) to Establish a SRLG disjoint active path and backup path pair for network protection. Based on the TF algorithm, LCSD algorithm introduces the number of links which relate to the SRLG as a new constraint. Through link weight adjustment before the second time SPF calculate, the backup path can avoid the risk sharing with active path. Theoretical analysis and experiment results have shown that LCSD algorithm resolved the trap problem and path pair total cost non-optimal problem under SRLG disjoint constraint. Compared with RF and TF algorithms, LCSD algorithm is significantly superiority in the successful ratio to find feasible solution and can guarantee minimum total cost of active and backup path.
Starting Page	396
Ending Page	400
File Size	386033
Page Count	5
File Format	PDF
ISBN	9780769536149
DOI	10.1109/PACCS.2009.146
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-05-16
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	S disjoint Costs Switching systems Heuristic algorithms Mission critical systems Circuits Low cost S disjoint paths algorithm minimal total cost Radio frequency High-speed networks Network topology SRLG constraint Computer networks Protection active and backup path
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

A Minimum Cost Active and Backup Path Algorithm with SRLG Constraints

An heuristic for maximally SRLG-disjoint path pairs calculation

Imsh: an iterative heuristic for srlg diverse routing in wdm mesh networks (2004)

Finding disjoint paths with different path costs: Complexity and algorithms (1992)

Obtaining a SRLG-disjoint path pair of min-sum cost

Imsh: an iterative heuristic for srlg diverse routing in wdm mesh networks (2004)

A Heuristic to Generate All Best Partially Disjoint Paths in a Communication Networks (2000)

A Heuristic to Generate All Best Partially Disjoint Paths in a Communication Networks (2002)

SRLG failure-disjoint path pair of min-sum cost in GMPLS networks

A Minimum Cost Active and Backup Path Algorithm with SRLG Constraints

Similar Documents

A Minimum Cost Active and Backup Path Algorithm with SRLG Constraints

An heuristic for maximally SRLG-disjoint path pairs calculation

Imsh: an iterative heuristic for srlg diverse routing in wdm mesh networks (2004)

Finding disjoint paths with different path costs: Complexity and algorithms (1992)

Obtaining a SRLG-disjoint path pair of min-sum cost

Imsh: an iterative heuristic for srlg diverse routing in wdm mesh networks (2004)

A Heuristic to Generate All Best Partially Disjoint Paths in a Communication Networks (2000)

A Heuristic to Generate All Best Partially Disjoint Paths in a Communication Networks (2002)

SRLG failure-disjoint path pair of min-sum cost in GMPLS networks

A Minimum Cost Active and Backup Path Algorithm with SRLG Constraints