Abstract
The explosive growth of Web-related services over the Internet is bringing millions of new users online, thus creating a growing demand for bandwidth. Wavelength Division Multiplexed (WDM) networks, employing wavelength routing has emerged as the dominant technology to satisfy this growing demand for bandwidth. As the amount of traffic carried is larger, any single failure can be catastrophic. Survivability becomes indispensable in such networks. Therefore, it is imperative to design networks that can quickly and efficiently recover from failures. In this dissertation, we explore the design and operation of survivable optical networks. We study several survivability paradigms for surviving single link failures. A restoration model is developed based on a combination of these paradigms. We propose an optimal design and upgrade scheme for WDM backbone networks. We formulate an integer programming-based design problem to minimize the total facility cost. This framework provides a cost effective way of upgrading the network by identifying how much resources to budget at each stage of network evolution. This results in significant cost reductions for the network service provider. As part of network operation, we capture multiple operational phases in survivable network operation as a single integer programming formulation. This common framework incorporates service disruption and includes a service differentiation model based on lightpath protection. However, the complexity of the optimization problem makes the formulation applicable only for network provisioning and o2ine reconfiguration. The direct use of such methods for online reconfiguration remains limited to small networks with few tens of wavelengths. We develop a heuristic algorithm based on LP relaxation technique for fast, near optimal, online reconfiguration. Since the ILP variables are relaxed, we provide a way to derive a feasible solution from the relaxed problem. Most of the current approaches assume centralized information. They do not scale well as they rely on per-flow information. This motivates the need for developing dynamic algorithms based on partial information. The partial information we use can be easily obtained from traffic engineering extensions to routing protocols. Finally, the performance of partial information routing algorithms is compared through simulation studies.
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2018
Volume 2018, 2018
DOI: 10.31274/rtd-180813-144
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?