Reconfiguration of spare capacity for MPLS-based recovery in the Internet backbone networks

This paper introduces a novel approach, called Short Leap Shared Protection with spare capacity Reallocation (SLSP-R), to deal with dynamic reconfiguration of spare capacity for MPLS-based recovery in the Internet backbone networks. SLSP-R is based on the SLSP framework and is designed to quantify t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2004-02, Vol.12 (1), p.73-84
Main Authors: Pin-Han Ho, Mouftah, H.T.
Format: Article
Language:English
Subjects:
Algorithms
Associate members
Backbone
Communication system traffic control
Computation
Computer networks
Computer simulation
Integer programming
Intelligent networks
Internet
IP networks
Mathematical models
Network topology
Networks
Protection
Recovery
Routing protocols
Spine
Strategy
Studies
Telecommunication traffic
Transport protocols
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper introduces a novel approach, called Short Leap Shared Protection with spare capacity Reallocation (SLSP-R), to deal with dynamic reconfiguration of spare capacity for MPLS-based recovery in the Internet backbone networks. SLSP-R is based on the SLSP framework and is designed to quantify the impact of computation complexity on network performance. The basic idea for SLSP-R is to subdivide a lengthy optimization process into several subtasks in order to trade the optimization quality with computation time. For this purpose, we compare three strategies for grouping working paths before an integer programming (InP) formulation is solved, namely, the Most Overlapped, Most Diverse, and Randomly Distributed. Analytical modeling of the problem is provided to show the feasibility of the subgrouping strategy. A numerical experiment as well as simulation-based study are conducted on four networks with different topology to evaluate the SLSP-R algorithm. The design methodology to determine the size of each subset of working paths is verified in the simulation.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2003.822660