Distributed dynamic lightpath allocation in survivable WDM networks

  • Authors:
  • A. Jaekel;Y. Chen

  • Affiliations:
  • University of Windsor, Windsor, Ont, Canada;University of Windsor, Windsor, Ont, Canada

  • Venue:
  • IWDC'05 Proceedings of the 7th international conference on Distributed Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

There has been considerable research interest in the use of path protection techniques for the design of survivable WDM networks. In this paper, we present a distributed algorithm for dynamic lightpath allocation, using both dedicated and shared path protection. The objective is to minimize the amount of resources (wavelength-links) needed to accommodate the new connection. We have tested our algorithms on a number of well-known networks and compared their performance to “optimal” solutions generated by ILPs. Experimental results show that our algorithm generates solutions that are comparable to the optimal, but are significantly faster and more scalable than corresponding ILP formulations.