Wdm Optical Network Virtual Topology Robust Programming Algorithm

With the development of information society, it is a great challenge for backbone network to provide huge available bandwidth to support various services such as Video on Demand, Multimedia and Internet Entertainment which have been greatly exploited and cause rapid increase in Internet traffic. Thus, it requires reasonable configuration and ultimate utilization of backbone network. Recently, a lot of novel methods for network design and configuration have been proposed. These design methods aim to make best use of the whole network resources by properly configuring routing schema and distributing bandwidth robust to traffic demand uncertainties and thus are termed as"robust design"method. As a typical backbone network, WDM optical network has been the important fundamental infrastructure and can provide bandwidth capability in terms of Gigabits or Terabits. In this thesis, the robust design of virtual topology for WDM optical network will be explicitly explored. The main focus of this thesis includes following two parts:(1) Robust design of virtual topology under traffic demand of Gauss distribution.This topic includes two parts: one is to design virtual topology in order to minimize the network congestion and the other aims to minimize the time delay and jitter. In the past, the virtual topology design based on stable traffic matrix has been explicitly analyzed. However, it is not suitable to apply such traditional methods to the uncertain traffic matrix. In chapter 2, each user's traffic demand is identically characterized by a certain probability distribution and independent on each other. Thus, the traffic demand between node pairs in backbone network can be characterized by Gauss distribution according to"central limit theorem". Additionally, p percentile is applied to describe the traffic load on light-path. Consequently, based on minimizing network congestion, a novel heuristic algorithm called ID-MLTDA is presented. In chapter 3, we propose another heuristic algorithm called WLDA on the basis of minimizing time delay and delay jitter to accommodate the requirement of IP services. Compared to traditional algorithm, WLDA uses the product of traffic demand and distance between node pairs in descending order to determine the light-path and the product of hop-count and distance between node pairs to determine the shortest path on physical topology. Applying WLDA to determine virtual topology, we can get smaller time delay and delay jitter.(2) Robust design of virtual topology under Hose traffic model.Hose model gives the traffic upper bound of node pairs and not detail the traffic demand between each node pair. Recently, the load balance proposed by L.G Valiant can efficiently support the dynamic IP service and can provide guarantee on network survivability and service recoverability. However, it is nearly impossible to set up full-connected light-path in WDM network due to limited resources when applying Valiant's Load Balance. In chapter 4, we investigate the problem of building cost-effective virtual topology under the hose uncertain model. Based on special double-hop routing network architecture, we propose a robust design algorithm of virtual topology called ISRLB, which is developed from SRLB. ISRLB maintains the resilience properties of Valiant's RLB, and has the advantage in terms of delay and jitter. Additionally, ISRLB achieves the cost reduction compared to SRLB on the simulation network topology.In chapter 5 we briefly introduce simulation programs. Finally, we summarize the paper.