Traffic Grooming In Flexible Optical Network

In recent years, with the rapid growth of network traffic flow, high-definition digital TV, cloud computing and other network resources needed to grow. Faced with the explosive growth of traffic demand, how to improve the current bandwidth and flexibility of optical networks has become an important topic in current research.This paper mainly studies the routing and spectrum allocation issue and traffic grooming issue in the flexible optical network. Routing and spectrum allocation problem can be divided into two sub-problems: routing and spectrum allocation. Problem-based routing through K-shortest path algorithm to calculate the number of nodes, identify K candidate paths between each pair of nodes. For the spectrum allocation problem, path maximize frequency slot connection number algorithm(PMSC) was proposed. Then traffic grooming of virtual topology was proposed based on this proposed strategy, namely path maximize frequency slot connection number algorithm on traffic grooming(TG-PMSC).The performance evaluation software of the proposed algorithm is implemented via C++ programming. Finally, in NSFNet and USNet physical network topology, according to the simulation results, analyzed the network blocking probability under different conditions. that the K value, the smaller rate network congestion; whether or not satisfy the continuity of the spectrum greater influence on network blocking probability. By comparing the proposed algorithm with the existing heuristic algorithm, authentication path maximize frequency slot connection number algorithm(PMSC) and path maximize frequency slot connection number algorithm on traffic grooming(TG-PMSC) excellence. As can be seen, there can be more effectively decrease the network congestion rate based on path maximize frequency slot connection number algorithm on traffic grooming(TG-PMSC).