NDLI: Linear formulation for path shared protection

Content Provider	IEEE Xplore Digital Library
Author	Pin-Han Ho Tapolcai, J. Mouftah, H.T. Chi-Hsiang Yeh
Copyright Year	2004
Description	Author affiliation: University of Waterloo (Pin-Han Ho)
Abstract	This paper investigates the problem of optimal diverse routing for shared path-based protection in the complete routing information scenario on mesh optical networks, where a novel Integer Linear Programming (ILP) formulation is introduced such that the least-cost link-disjoint working and protection path-pair can be derived in a single step. The proposed ILP formulation is characterized by the facts that it is solvable with the commercially available Linear Programming (LP) solvers and that it can deal with the dependency between working and spare capacity in the network, which is a step ahead of the most state-of-the-art techniques in the design of diverse routing algorithms for shared protection. To verify the proposed ILP, an experiment is conducted to compare it with four reported schemes for end-to-end shared protection on two network topologies, namely APFPBC, MLR, ITSA, and ILP-2S, where blocking probability is taken as the performance metric with connection requests being dynamically launched into the networks. The simulation results show that the ILP formulation yields the best performance while the ILP-2S scheme investigating less network states yields the worst. We also use the results by the proposed ILP to evaluate the four heuristic-based schemes adopted in the simulation in terms of two performance indexes – the percentage of optimality (denoted as %opti) and the offset of optimality (denoted as Q).
Starting Page	1622
Ending Page	1627
File Size	535441
Page Count	6
File Format	PDF
ISBN	0780385330
DOI	10.1109/ICC.2004.1312784
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-06-20
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Protection Routing Integer linear programming Linear programming Heuristic algorithms Information technology Optical fiber networks Algorithm design and analysis Network topology Measurement spare link-state survivable routing shared protection Integer Linear Programming (ILP)
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

Survivable Virtual Topology Routing under Shared Risk Link Groups in WDM Networks

Survivable virtual topology routing under shared risk link groups in wdm networks.

Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

Diverse routing for shared protection in survivable optical networks

ILP-based design of survivable broadcast trees

On Diverse Routing for Shared Risk Link Groups (SRLGs) in Optical Mesh Networks

Heuristic Survivable Routing Algorithm for Multiple Failures in WDM Networks

A HEURISTIC ALGORITHM FOR SURVIVABLE MAPPING IN IP-OVER-WDM NETWORKS

Building dependable Next Generation Networks (NGNs): A new BlueGreen design philosophy

Linear formulation for path shared protection

Similar Documents

Survivable Virtual Topology Routing under Shared Risk Link Groups in WDM Networks

Survivable virtual topology routing under shared risk link groups in wdm networks.

Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

Diverse routing for shared protection in survivable optical networks

ILP-based design of survivable broadcast trees

On Diverse Routing for Shared Risk Link Groups (SRLGs) in Optical Mesh Networks

Heuristic Survivable Routing Algorithm for Multiple Failures in WDM Networks

A HEURISTIC ALGORITHM FOR SURVIVABLE MAPPING IN IP-OVER-WDM NETWORKS

Building dependable Next Generation Networks (NGNs): A new BlueGreen design philosophy

Linear formulation for path shared protection