Research On Congestion Control Routing Strategy For Hierarchical Load In Complex Network

Complex network is the abstraction of many real networks.The transportation network,the power network,the Internet and other real networks can be studied by complex network theory.The congestion control algorithm of the network is the key that affects the network performance.However,the complex network congestion control algorithms proposed by scholars all consider that the network load is uniform,ignoring the difference of load in the real network,such as the motor vehicles,non-motor vehicles,pedestrians,etc.in the transportation network.More specially,the existing routing algorithm cannot meet the transmission requirements of the hierarchical load,and the existing network traffic model cannot represent the hierarchical load,either.Aiming at this problem,this paper re-abstracted the different load of a network and defined them as hierarchical load.The transmission demand of the hierarchical load is proportional to its grade.In order to meet the transmission requirements of different loads,this paper designed a complex network congestion control strategy for hierarchical load(Congestion Control Routing Strategy for Hierarchical Load in Complex Network,CRHL).The main research works are as follows:Firstly,the existing network traffic model was improved to establish a hierarchical load traffic model: every packet that generated at each time step is given a lifecycle attribute to represent the hierarchy of load.Moreover,we redefined the packet deletion rules.Secondly,under the condition of guaranteeing the network throughput performance,this paper designed the congestion control strategy based on hierarchical load.By dynamically adjusting the packet buffering at the node and the order of load processing,the transmission requirements of high-priority packets are given priority.Thus,the transmission demand of high-grade load can be satisfied preferentially.At the same time,a ladder-style selection method is applied in the routing planning module to reduce the node's maximum betweenness centrality.Thirdly,a hierarchical traffic model was built based on MATLAB.The congestion control algorithm proposed in this paper was simulated to verify the effectiveness of the ladder-style selection method and the network performance.Besides,we compared the efficiency of the algorithm proposed in this paper with classical algorithms.Experiments show that the proposed algorithm can allocate network pressure and improve the effectiveness of traffic transmission,while ensuring the transmission demand of hierarchical load.