A new and improved algorithm for dynamic survivable routing in optical WDM networks

Authors:
Lei Guo
Affiliations:
College of Information Science and Engineering, Northeastern University, Shenyang 11004, China and Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electro ...
Venue:
Computer Communications
Year:
2007

Citing 4
Cited 5

Ant-based survivable routing in dynamic WDM networks with shared backup paths

The Journal of Supercomputing
Optical layer survivability: a services perspective

IEEE Communications Magazine
Shared protection in mesh WDM networks

IEEE Communications Magazine
Survivability in optical networks

IEEE Network: The Magazine of Global Internetworking

Network congestion avoidance strategy with particle filter

Computer Communications
An improved lightpath allocation for grade of services in survivable WDM mesh networks

Computer Communications
Network survivability modeling

Computer Networks: The International Journal of Computer and Telecommunications Networking
Survivability modeling with stochastic reward nets

Winter Simulation Conference
GigaManP2P: an overlay network for distributed QoS management and resilient routing

International Journal of Network Management

Quantified Score

Hi-index	0.24

Visualization

Abstract

The survivability in optical WDM networks is an important issue and has been studied for many years. This paper addresses the protection for the single-link failure in optical WDM networks and proposes a new and improved algorithm called Near Optimal Routing (NOR). For each connection request, the previous algorithm first computes one primary path and follows to compute one link-disjoint backup path. In our proposed algorithm, NOR can obtain the near optimal solutions by re-computing the primary or backup paths based on the rerouting policy. Simulation results show that the performances of NOR can be significantly improved compared to the previous algorithm.