NDLI: Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

Content Provider	IEEE Xplore Digital Library
Author	Pin-Han Ho Tapolcai, J. Cinkler, T.
Copyright Year	1993
Abstract	This paper focuses on the problem of dynamic survivable routing for segment shared protection (SSP) in mesh communication networks provisioning bandwidth guaranteed tunnels. With SSP, a connection is settled by concatenating a series of protection domains, each of which contains a working and protection segment pair behaving as a self-healing unit for performing local restoration whenever the working segment is subject to any unexpected interruption. We first discuss the advantages of using SSP-the ability to shorten the restoration time as well as achieve a higher throughput by saving spare capacity required for 100% restorability; then the survivable routing problem is formulated into an Integer Linear Programming (ILP), where the switching/merging node pair of each protection domain along with the corresponding least-cost working and protection segment pair can be jointly determined for a dynamically arrived connection request. A novel approach of arc-reversal transformation is devised to deal with the situation that the working segments of two neighbor protection domains may overlap with each other by more than a single node. Due to a very high computation complexity induced in solving the ILP, a novel heuristic algorithm is proposed, named Cascaded Diverse Routing (CDR), to allocate protection domains for a connection request by performing diverse routing across a set of predefined candidate switching/merging node pairs. Experiments are conducted on five two-connected network topologies to verify the ILP and the CDR algorithm. We first determine the best diameter of protection domains for the CDR scheme in each network topology. Using the results of best diameters, CDR is compared with two reported schemes, namely PROMISE and OPDA. We demonstrate in the simulation results that the path-shared protection schemes are outperformed by the SSP schemes in terms of blocking probability under all possible arrangements in the experiment and that CDR yields better performance than PROMISE and OPDA due to the extra efforts in manipulating the location of working segments at the expense of longer computation time.
Sponsorship	IEEE Computer Society IEEE Communications Society Association for Computing Machinery (ACM)
Starting Page	1105
Ending Page	1118
Page Count	14
File Size	772867
File Format	PDF
ISSN	10636692
Volume Number	12
Issue Number	6
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-12-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Protection Communication networks Bandwidth Routing Merging Network topology Throughput Integer linear programming High performance computing Heuristic algorithms working and protection paths Integer linear programming (ILP) segment shared protection (SSP) shared risk link group (SRLG) survivable routing
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Electrical and Electronic Engineering Computer Science Applications Software

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

Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

Comments on “Segment Shared Protection in Mesh Communication Networks With Bandwidth Guaranteed Tunnels”

Dynamic survivable routing for shared segment protection

Comments on "segment shared protection in mesh communication networks with bandwidth guaranteed tunnels"

Linear formulation for path shared protection

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

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

A New Shared Segment Protection Method for Survivable Networks with Guaranteed Recovery Time

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

Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

Similar Documents

Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

Comments on “Segment Shared Protection in Mesh Communication Networks With Bandwidth Guaranteed Tunnels”

Dynamic survivable routing for shared segment protection

Comments on "segment shared protection in mesh communication networks with bandwidth guaranteed tunnels"

Linear formulation for path shared protection

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

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

A New Shared Segment Protection Method for Survivable Networks with Guaranteed Recovery Time

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

Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels