Dynamic protection using integrated-routing approach in IP-over-WDM networks

Authors:
Q. Zheng;G. Mohan
Affiliations:
Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore 117576, Singapore;Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore 117576, Singapore
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2003

Citing 7
Cited 0

Generalized multiprotocol label switching: an overview of routing and management enhancements

IEEE Communications Magazine
Multiprotocol lambda switching: combining MPLS traffic engineering control with optical crossconnects

IEEE Communications Magazine
Generalized multiprotocol label switching: an overview of signaling enhancements and recovery techniques

IEEE Communications Magazine
A simple dynamic integrated provisioning/protection scheme in IP over WDM networks

IEEE Communications Magazine
Building reliable MPLS networks using a path protection mechanism

IEEE Communications Magazine
Data-centric optical networks and their survivability

IEEE Journal on Selected Areas in Communications
Lightpath restoration in WDM optical networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient protection scheme to dynamically allocate restorable bandwidth-guaranteed paths in integrated IP-over-wavelength division multiplexing (WDM) networks. A restorable bandwidth-guaranteed path implies an active path and another link-disjoint backup path both with the required bandwidth. In this paper: we propose two integrated-routing algorithms: hop-based integrated-routing algorithm (HIRA) and bandwidth-based integrated-routing algorithm (BIRA) to allocate the paths. We use connection blocking probability and number of optical-electrical-optical (o-e-o) conversions as performance metrics. Through extensive simulation experiments, we demonstrate that our algorithms perform better than other existing approaches.