Research On The Algorithm For The Dynamic Traffic Grooming Of Neighbor Zone Expansion In IP Over WDM Networks

IP over WDM optical network architecture effectively combines Internet andoptical-switching network based on wavelength division multiplexing(WDM) together,providing bandwidth on demand, and presenting an important development aspect in thefuture communication networks. The transmission bandwidth in WDM networks isusually supplied at the wavelength granularity, but the traffic bandwidth of a single userrequested between the source and destination nodes pair is far smaller than that of awavelength granularity, so traffic grooming is an important issue to improve thebandwidth utilization.In this dissertation, the traffic grooming methods of optical networks and keytechniques are summarized with reviewing the development and status of IP over WDMoptical networks. This dissertation adopts a practical network model of two-layered IPover WDM networks as its study subject, and discusses the layered network model of IPover WDM. In order to solve the problem of the dynamic traffic routing, a mathematicalmodel is thus constructed. Then, an expansion method based on neighbor zone with bestcandidate path algorithm, abbreviated as EMNZ-BCP, is proposed on the basis ofnetwork maximum traffic and load balance.The performance evaluation software of the proposed algorithm is implemented viaC programming. Under NSFnet, the comparison of simulation results from theevaluation software for the proposed algorithm with those obtained from some exitingalgorithms shows that EMNZ-BCP algorithm can efficiently reduce the computationalcomplexity and presents good performance suitable to solve the grooming problem inlarge scale WDM networks. Then, EMNZ-BCP may help to avoid long paths underUSAnet, so it could utilize network resources more efficiently and reduce the blockingprobability. Finally, some aspects for future research are given after the summarizationof this dissertation.