Wavelength selective WDM network design: How bad is shortest path routing?

Mohamed Saad, Zhi Quan Luo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

Given a collection of lightpath requests, we consider the problem of allocating fibers to the links of a WDM network at minimum cost, such that all lightpath requests can be simultaneously realized. It is known that, under modular fiber capacity assumptions, shortest path routing may not minimize the total fiber cost. In this paper, we extend our previous work for wavelength convertible networks [8, 9], and theoretically quantify the increase in fiber cost due to shortest path routing in networks without wavelength converters. In particular, we prove that shortest path routing is asymptotically cost-optimal in heavily loaded networks, and asymptotically near-optimal in large, sparse networks that support all-to-all communication.

Original languageEnglish (US)
Title of host publicationICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications
Pages532-535
Number of pages4
DOIs
StatePublished - 2007
Event2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007 - Dubai, United Arab Emirates
Duration: Nov 14 2007Nov 27 2007

Publication series

NameICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications

Other

Other2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007
CountryUnited Arab Emirates
CityDubai
Period11/14/0711/27/07

Keywords

  • Approximation algorithms
  • Capacity planning
  • Shortest path
  • WDM networks

Fingerprint Dive into the research topics of 'Wavelength selective WDM network design: How bad is shortest path routing?'. Together they form a unique fingerprint.

Cite this