2016
DOI: 10.1109/cc.2016.7563719
|View full text |Cite
|
Sign up to set email alerts
|

Load balancing-based routing optimization mechanism for power communication networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…The paper establishes a risk assessment index system for the power communication network based on its static structure [28][29][30][31] and dynamic operation [32][33][34].…”
Section: B Construction Of Risk Assessment Index Systemmentioning
confidence: 99%
See 1 more Smart Citation
“…The paper establishes a risk assessment index system for the power communication network based on its static structure [28][29][30][31] and dynamic operation [32][33][34].…”
Section: B Construction Of Risk Assessment Index Systemmentioning
confidence: 99%
“…The risk severity level k of the current operating state of the power communication network is obtained using Equation (25), and the risk value is calculated based on Equation (13),Equation ( 14), Equation (33), and Equation (34). This corresponds to observation case 1 in table 3.…”
Section: ) Comparative Analysismentioning
confidence: 99%
“…Similarly, in reference [14], the authors take the risk of fiber optic links and switching nodes as their weights and use the Dijkstra algorithm to directly obtain the route with the lowest risk value as the service route. Reference [15] uses the KSP algorithm to search for multiple reachable routes for services and selects the route with the lowest network risk balance as the service route. Reference [16] considers the situation of route recovery after communication network failures.…”
Section: Related Workmentioning
confidence: 99%
“…The bandwidth requirements for different services vary, and their importance for the normal operation of the power grid also differs. Assuming the number of types of electricity services is denoted as K, the importance of each type of service can be calculated using the analytic hierarchy process [15]. Furthermore, we define the bandwidth requirement and importance of the k ∈ Π class of services as F k and I k , respectively, where Π = {1, 2, ..., K}.…”
Section: Power Servicementioning
confidence: 99%
“…Literature [17] takes the risk of optical cable link and switching node as its weight, and adopts Dijkstra algorithm to directly obtain the route with the lowest risk value as the service route. Literature [18] uses KSP algorithm to find multiple reachable routes for services, and selects the route with the least network risk balance as the service route. Reference [19] considers the case of route recovery after a communication network failure.…”
Section: Introductionmentioning
confidence: 99%