Abstract
The scale-free topology of power communication network leads to more data flow in less hub nodes, which can cause local congestion. Considering the differences of the nodes’ delivery capacity and cache capacity, an integrated routing based on the communication service classification is proposed to reduce network congestion. In the power communication network, packets can be classified as key operational services (I-level) and affairs management services (II-level). The shortest routing, which selects the path of the least hops, is adopted to transmit I-level packets. The load-balanced global dynamic routing, which uses the node’s queue length and delivery capacity to establish the cost function and chooses the path with minimal cost, is adopted to transmit II-level packets. The simulation results show that the integrated routing has a larger critical packet generation rate and can effectively reduce congestion.
Highlights
The power communication network is a private communication network that meets the effective operation and management of the power system [1]
With the amount of data in the power communication network increasing explosively, the bottleneck nodes of the network are prone to congestion, resulting in that it is difficult to process the critical data in a timely manner, which endangers the safe operation of the power system [4,5,6]
In order to effectively balance the data flow and obtain a larger network capacity, as well as reduce network congestion in the power communication network, an integrated routing strategy based on service classification with the reasonable allocation of nodes’ delivery capacity and cache capacity is proposed
Summary
The power communication network is a private communication network that meets the effective operation and management of the power system [1]. The work in [8] proposed a low risk routing method based on the fact that different types of traffic have different service importance levels to reduce the risk of the power communication network. In [10], a routing algorithm based on a complex network was proposed, and the relationship between node congestion level and betweenness centrality was studied. Strategy them, composed of shortest path routing and global is proposed. Thethe cost function is set by considering queue length and capacity function is set by considering the queue length and delivery capacity information of nodes in the path, information of nodes in the path, and the path with the minimal cost is selected to transmit the and the path with minimal cost is selected to transmit the packets under the global dynamic routing.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
