Packet Transmission Network Planning And Technology Research And Implementation

With the explosive increase of Internet traffic, customers call for higher requirements to transport the traffic. PTN(Packet Transport Network) not only has maintained the traditional advantages of SDH(Synchronous Digital Hierarchy) transmission network, but also has added features to adapt data services, such as packet switching, statistical multiplexing, connect oriented labeled switch, etc. With these characteristics, PTN possesses very strong transport abilities, and can be well applied for different Internet traffic. So, PTN has got more and more attention by the researchers. At the same time, in order to meet the QoS(Quality of Service) requirement in the next generation network, Diff-Serv(differential services) architecture is proposed by IETF(Internet Engineering Task Force). BCM(Bandwidth Constraints Model) is one of the most important key techniques to support Diff-Serv in PTN, and the studies of network planning problems in different bandwidth constraints models have important significances.In this dissertation, the network planning problems focus on two widely deployed bandwidth constraints models: MAM(Maximum Allocation Model) and RDM(Russion Doll Model).First, a network capacity design algorithm called MC-NCD(Minimum Cost-Network Capacity Design) is proposed. With the network uncapacitated, and according to the inherent characteristics of MAM and RDM, the proposed algorithm makes full use of the existing resource of the network to optimize LSP(Label Switched Paths) resource allocation and route distribution, and finally achieve the goal to minimize the total cost of the network.Suppose the network is capacitated, we also propose a network capacity distribution algorithm MB-NCD(Maximum Bandwidth-Network Capacity Distribution) to make more traffic bandwidth configure successfully in the network. By designing the link cost reasonably, the preferential distributed traffic demands reserve more available links for these traffic demands which are not distributed. Thus, the success rate of traffic bandwidth distribution is improved a lot.At last, as the double link failures can not be avoided in the network already, this dissertation also discusses the network planning problem that can protect double link failures. In order to improve the resource utilization, we use the 1+1+Shared model to protect double link failures. According to the characteristics of MAM and RDM, we propose an optimization algorithm called OSBP(Optimal Shared Backup Path) to compute the shared backup path. And the total cost of the network is decreased a lot.This dissertation also presents simulations for the proposed three algorithms, and makes comparison with other algorithms. Numerous simulation results for a variety of physical networks indicate that the performances of our proposed algorithms are close to the optimal results, and can be well applied to network planning.