NDLI: FoF-R Ant: Ant-Based Survivable Routing Scheme for Shared Path Protection

Content Provider	IEEE Xplore Digital Library
Author	Liu, W. Sirisena, H. Pawlikowski, K.
Copyright Year	2008
Description	Author affiliation: Electr. & Comput. Eng., Univ. of Canterbury, Christchurch (Liu, W.; Sirisena, H.) \|\| Comput. Sci. & Software Eng., Univ. of Canterbury, Christchurch (Pawlikowski, K.)
Abstract	This paper proposes a novel framework to solve the survivable routing problem with shared path protection in a distributed control environment. The work mainly concerns how to dynamically determine a protection cycle (i.e., two link-disjoint paths between a source-destination node pair) and allocate spare capacity for a connection establishment request so as to minimize total bandwidth consumption in the network. This is known as the spare capacity allocation (SCA) problem and its resulting integer linear programming (ILP) formulation is known to be NP-hard. This paper tackles the SCA problem using a new matrix-based model and a heuristic algorithm, termed friend or foe-resilient (FoF-R) ant-based routing algorithm. First, a new concept of resilience matrix (RM) is introduced to capture the local bandwidth usage information and investigate the relationship between a failed link and other links with protection capacity allocated. Next, based on the special link cost derived from the RM, the novel FoF-R ant-based routing algorithm, which is inspired by the principle of ant colony optimization, is developed to find the optimal protection cycles and explore the sharing ability among protection paths using a headroom-dependent attraction/repulsion function. By keeping a suitable number of mobile agents (i.e., FoF-R ants) in a network to continually and proactively update the RMs, the survivable routing solution for a connection request can be obtained within a reasonable computation time.
Starting Page	332
Ending Page	337
File Size	448647
Page Count	6
File Format	PDF
ISBN	9781424426027
DOI	10.1109/ATNAC.2008.4783346
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-12-07
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Ant colony optimization attraction/repulsion Heuristic algorithms Routing heuristic ILP Resilience SCA ant colony optimization Mobile agents Bandwidth Distributed control Integer linear programming Cost function protection cycle resilience matrix 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

FoF-R ant-based survivable routing using distributed resilience matrix

Linear formulation for path shared protection

A novel resilience matrix for survivable routing in a distributed control architecture

Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

A novel distributed resilience matrix for arbitrary failures in spare capacity allocation problem

Dynamic survivable routing for shared segment protection

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

The Distributed Multicast Routing Scheme with Delay Constraint using Ant Colony Optimization

An ultra-fast shared path protection scheme - distributed partial information management, part II

FoF-R Ant: Ant-Based Survivable Routing Scheme for Shared Path Protection

Similar Documents

FoF-R ant-based survivable routing using distributed resilience matrix

Linear formulation for path shared protection

A novel resilience matrix for survivable routing in a distributed control architecture

Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

A novel distributed resilience matrix for arbitrary failures in spare capacity allocation problem

Dynamic survivable routing for shared segment protection

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

The Distributed Multicast Routing Scheme with Delay Constraint using Ant Colony Optimization

An ultra-fast shared path protection scheme - distributed partial information management, part II

FoF-R Ant: Ant-Based Survivable Routing Scheme for Shared Path Protection