Research On MPLS Network Topology Aggregation Algorithm With The Connected Dominating Sets

The aggregation of MPLS network topology based on the connected dominating sets isresearched in this paper. First the developing situation, research status and the technicalproblems of the MPLS are introduced, then the basic knowledge about the multi-protocollabel switching (MPLS) is briefly illustrated.Focusing on a method of constructing connected dominating sets for based on bandwidthand the path constraint is proposed. This method can be used for solving expansibility ofMPLS network. And the algorithm with O(n) computation complexity and O(Δnlogn)message complexity can be used for the effective aggregation of the MPLS.This algorithm is a kind of construction method based on multi-objective connecteddominating sets, it first considers the path length between the dominator and dominates forselecting the optimal path.Then considers the bandwidth, using the weight, the dominating sethas the optimal weighted feature and can satisfy the path and bandwidth requirements at thesame time. And using this method of aggregation can reduce the amount of the egress nodesand the path information that participate in switching. As the result, the consumption of theLSPs in MPLS networks is decreased accordingly and the validity of the network is notaffected. After such aggregation scheme, MPLS virtual topology is simplified.The basic information about MPLS, including the network architecture and workingprinciple is introduced in this paper. Then the dominating set of the optimal path based on thebreadth first search is proposed. Considering the bandwidth factors, the MPLS networktopology is aggregated, and the completion of the main algorithm and the realization of theprogram are completed. At last the least dominating sets algorithm and the minimumcomplexity algorithm and the algorithm in this paper are analysed roundly.