Chapter 18. Routing Algorithms on WDM Optical Networks
- Amiya Nayak B.Math., Ph.D. Adjunct Research Professor Associate Editor Full Professor2,
- Ivan Stojmenović Ph.D. Chair Professor founder editor-in-chief2,3
Published Online: 1 MAR 2007
DOI: 10.1002/9780470175668.ch18
Copyright © 2008 John Wiley & Sons, Inc.
Book Title
Handbook of Applied Algorithms: Solving Scientific, Engineering and Practical Problems
Additional Information
How to Cite
Gu, Q.-P. (2007) 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
- 2
SITE, University of Ottawa, 800 King Edward Ave., Ottawa, ON K1N 6N5, Canada
- 3
EECE, University of Birmingham, UK
Publication History
- Published Online: 1 MAR 2007
- Published Print: 14 FEB 2008
ISBN Information
Print ISBN: 9780470044926
Online ISBN: 9780470175668
- Summary
- Chapter
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.