NDLI: An heuristic for maximally SRLG-disjoint path pairs calculation

Content Provider	IEEE Xplore Digital Library
Author	Silva, J. Gomes, T. Fernandes, L. Simoes, C. Craveirinha, J.
Copyright Year	2011
Description	Author affiliation: Polytechnic Institute of Viseu, INESC Coimbra, Portugal (Simoes, C.) \|\| Dept. of Electrical Engineering and Computers, University of Coimbra / INESC Coimbra, 3030-290 Coimbra, Portugal (Silva, J.; Gomes, T.; Fernandes, L.; Craveirinha, J.)
Abstract	Most network operators seek to offer reliable connections. The use of Shared Risk Link Groups allows an upper layer to select adequate protection paths. When path protection is used, routing algorithms seek to obtain SRLG-disjoint path pairs (or set of paths). When no totally SRLG-disjoint paths can be found one may try to obtain the SRLG least coupled (or maximally disjoint) path pair. An heuristic for maximally SRLG-disjoint path pairs calculation, considering a min-min formulation, designated TA-max, is proposed, which is a modification of the Trap Avoidance (TA) algorithm. Expressions are derived for estimating sufficient shared backup bandwidth (BBW) and for minimal BBW allocation and deallocation for partially SRLG-disjoint path pairs. The heuristic performance is evaluated using a virtual topology built over the NSFNET network and is compared with another heuristic (Modified-CoSE). Several network performance measures were considered, with and without backup bandwidth sharing, considering dynamic traffic. Results show TA-max is adequate for on-line routing and that it has better performance than Modified-CoSE regarding CPU time.
Starting Page	1
Ending Page	8
File Size	226776
Page Count	8
File Format	PDF
ISBN	9781457706820
ISSN	2157023X
e-ISBN	9789638111777
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-10-05
Publisher Place	Hungary
Access Restriction	Subscribed
Rights Holder	HTE
Subject Keyword	Algorithm design and analysis Maximally disjoint Network topology Heuristic algorithms Bandwidth SRLG-disjoint Routing Topology Reliability Protection
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

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

OpenRoutes: Multi-operator cooperative routing over maximally disjoint paths for the survivability of wireless backhaul

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

Sticky 1+1 path protection method by dynamic disjoint path discovery

Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks

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

An enhanced algorithm for multiple constraints optimal path calculation

A Minimum Cost Active and Backup Path Algorithm with SRLG Constraints

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

An heuristic for maximally SRLG-disjoint path pairs calculation

Similar Documents

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

OpenRoutes: Multi-operator cooperative routing over maximally disjoint paths for the survivability of wireless backhaul

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

Sticky 1+1 path protection method by dynamic disjoint path discovery

Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks

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

An enhanced algorithm for multiple constraints optimal path calculation

A Minimum Cost Active and Backup Path Algorithm with SRLG Constraints

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

An heuristic for maximally SRLG-disjoint path pairs calculation