Framework of spare capacity re-allocation with S-SLSP for mesh WDM networks

Authors:
Pin-Han Ho;H. T. Mouftah
Affiliations:
Department of Electrical and Computer Engineering, Queen's University at Kingston, Kingston, Ont., Canada;Department of Electrical and Computer Engineering, Queen's University at Kingston, Kingston, Ont., Canada
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
Year:
2002

Citing 5
Cited 1

On the Complexity of Finding a Minimum Cycle Cover of a Graph

SIAM Journal on Computing
Survivable Networks: Algorithms for Diverse Routing

Survivable Networks: Algorithms for Diverse Routing
A framework for service-guaranteed shared protection in WDM mesh networks

IEEE Communications Magazine
Protection cycles in mesh WDM networks

IEEE Journal on Selected Areas in Communications
Survivability in optical networks

IEEE Network: The Magazine of Global Internetworking

A Local Fast-Reroute mechanism for single node or link protection in hop-by-hop routed networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on solving the problem of spare capacity re-allocation in WDM mesh networks with dynamic traffic. Based on the framework of short leap shared protection (SLSP), an approach called static SLSP (S-SLSP) for achieving optimal deployment of spare capacity is introduced. Optimization is conducted in an interleaved manner according to topological distribution and the restoration speed requirement of each working path in order to initiate a compromise between computation time and quality of spare capacity reallocation. Simulation is conducted on four networks with different topology, which examines the S-SLSP algorithm by deriving the best mileage (in hops) in each subset of working paths to be optimized together.