18. Routing Algorithms on WDM Optical Networks

  1. Amiya Nayak B.Math., Ph.D. Adjunct Research Professor Associate Editor Full Professor2 and
  2. Ivan Stojmenović Ph.D. Chair Professor founder editor-in-chief2,3
  1. Qian-Ping Gu

Published Online: 1 MAR 2007

DOI: 10.1002/9780470175668.ch18

Handbook of Applied Algorithms: Solving Scientific, Engineering and Practical Problems

Handbook of Applied Algorithms: Solving Scientific, Engineering and Practical Problems

How to Cite

Gu, Q.-P. (2008) Routing Algorithms on WDM Optical Networks, in Handbook of Applied Algorithms: Solving Scientific, Engineering and Practical Problems (eds A. Nayak and I. Stojmenović), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470175668.ch18

Editor Information

  1. 2

    SITE, University of Ottawa, 800 King Edward Ave., Ottawa, ON K1N 6N5, Canada

  2. 3

    EECE, University of Birmingham, UK

Author Information

  1. Department of Computing Science, Simon Fraser University, Burnaby, BC V5A 1S6, Canada

Publication History

  1. Published Online: 1 MAR 2007
  2. Published Print: 14 FEB 2008

ISBN Information

Print ISBN: 9780470044926

Online ISBN: 9780470175668

SEARCH

Keywords:

  • WDM optical networks - routing algorithms;
  • logical topology design problem;
  • traffic grooming problem

Summary

With the tremendous growth of bandwidth-intensive networking applications, the demand for bandwidth over data networks is increasing rapidly. Wavelength division multiplexing (WDM) optical networks provide promising infrastructures to meet the information networking demands and have been widely used as the backbone networks in the Internet, metropolitan area networks, and high-capacity local area networks. Efficient routing on WDM networks is challenging and involves hard optimization problems. This chapter introduces efficient algorithms with guaranteed performance for fundamental routing problems on WDM networks.