Switching/merging node placement in survivable optical networks with SSP

Authors:
JáNos Tapolcai;Pin-Han Ho;Hsiang-Fu Yu
Affiliations:
Department of Electrical and Computer Engineering, University of Waterloo, Canada N2L3G1 and Department of Computer Science and Information Theory, Budapest University of Technology and Economics, ...;Department of Electrical and Computer Engineering, University of Waterloo, Canada N2L3G1;Department of Computer Science, National Taipei University of Education, Taiwan
Venue:
Computer Communications
Year:
2010

Citing 6
Cited 0

Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

IEEE/ACM Transactions on Networking (TON)
Traffic recovery time constrained shared sub-path protection algorithm in survivable WDM networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Intelligent shared-segment protection

Computer Networks: The International Journal of Computer and Telecommunications Networking
A framework for service-guaranteed shared protection in WDM mesh networks

IEEE Communications Magazine
Novel algorithms for shared segment protection

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Shared Segment Protection (SSP) has been proved to serve as a viable approach in achieving better flexibility and capacity efficiency than that by the conventional link and path shared protection. The superiority of SSP is nonetheless at the expense of taking more signaling efforts and requiring higher hardware precision in switching and merging restoration optical flows at core nodes. Therefore, the switching and merging capability of a network node is a kind of network resource that should be subject to manipulative planning. This paper investigates the performance impact by allocating the switching/merging (S/M) capable nodes in optical networks employing SSP. Two novel performance metrics, Average Increase in Blocking Probability (AIBP) and Average Increase of Total Cost (AITC), are devised to define the importance of being S/M capable for each node. A novel recursive algorithm is developed to evaluate the proposed performance metrics, in which both a brute force method and an enhanced method for reducing computation complexity are discussed. Simulation is conducted on two network topologies to verify the proposed approaches in evaluating the two performance metrics.