Study On Traffic Grooming In The Networking Of OTN And PTN

With the rapid development of the IP networks, the Optical Transport Network (OTN) andPacket Transport Network (PTN) become the two trends in the core networks, aggregationnetworks and access networks. Deploying networks at different levels can not only make use ofbig OTN containers to implement grooming of high granularity traffic, but also take advantageof the PTN technology to do fine management for traffic streams. Because of the low efficiencyof resource utilization and its traffic switching are not flexible in OTN networks, how toallocate resources of OTN networks to carry PTN traffic reasonably become the urgent problemthat needs to be solved.This paper focuses on the research of the problem that how to allocate resources of OTNnetworks to carry PTN traffic reasonably and proposes a program with OTN and PTNnetworking. First, the paper gives a grooming model of networking, then on the basis of thetraffic grooming model, it brings up the ILP algorithm and it's suitable for solving the trafficgrooming problems in small and medium-sized network and also give the ILP formula,including constraints and the objective function.This paper simulates the traffic grooming problem respectively in the uniform andnon-uniform traffic model in OTN ring networks. In order to measure the effect of the trafficgrooming, we take consider of the optimality of the optical channel and the number of hops andother network performance parameters. At the end of this paper, the program of OTN and PTNnetworking is simulating in NSFNET actual network. The simulation results show that thenumber of optical channels is optimized and the network performance parameters also provethe feasibility of the algorithm.