Designing operational WDM networks

Network design tools are routinely used in practice to design optical networks that can carry a given set of traffic demands at the least cost The criteria used to route demands during design are often different from those used while routing in the operational network. As a result, the routes computed may be different during design and operations, leading to over- or under- utilization of portions of the network and even failure to route some demands. In this paper, we propose a general solution for this problem, which handles any combination of routing criteria. It works by enhancing the designed network with minimal additional capacity such that it can carry the demands during operations. We also provide experimental results evaluating the performance of this technique and the operational effectiveness of various design algorithms.

[1]  Gang Liu,et al.  SPIDER: A simple and flexible tool for design and provisioning of protected lightpaths in optical networks , 2001, Bell Labs Technical Journal.

[2]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[3]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

[4]  T. V. Lakshman.  Capacity design of fast path restorable optical networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Biswanath Mukherjee,et al.  Some principles for designing a wide-area optical network , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[6]  David Peleg,et al.  An approximation algorithm for minimum-cost network design , 1994, Robust Communication Networks: Interconnection and Survivability.

[7]  Thomas E. Stern,et al.  Multiwavelength Optical Networks: A Layered Approach , 1999 .

[8]  Brunilde Sansò,et al.  Telecommunications Network Planning , 1998 .

[9]  Byrav Ramamurthy,et al.  Wavelength conversion in WDM networking , 1998, IEEE J. Sel. Areas Commun..

[10]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .