Loading…
Congestion control method for overloaded service of smart substation under high concurrent users
Overload service in the communication network of smart substation will cause congestion, resulting in low overload service throughput, high congestion rate and long congestion control time in the average smart substation. A congestion control method for overloaded services in smart substations with...
Saved in:
Published in: | Journal of intelligent & fuzzy systems 2024-02, Vol.46 (2), p.3895-3906 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Overload service in the communication network of smart substation will cause congestion, resulting in low overload service throughput, high congestion rate and long congestion control time in the average smart substation. A congestion control method for overloaded services in smart substations with high concurrent users is proposed. According to the characteristics of overload service request of smart substation, the mathematical model of the algorithm is defined by describing the overload service request of smart substation on the basis of network topology model. Combined with the wavelength rotation strategy, the congestion rate of overloaded services in smart substations is reduced, and the throughput rate of overloaded services in smart substations is improved. Considering the factors of high concurrent users, by judging and feeding back the congestion of the overloaded services of smart substations, the congestion control of overloaded services of smart substations under high concurrent users is realized. The experimental results show that the proposed method has better effect and scalability in the congestion control of the overloaded service of the smart substation, and can effectively shorten the congestion control time of the overloaded service of the smart substation. |
---|---|
ISSN: | 1064-1246 1875-8967 |
DOI: | 10.3233/JIFS-224276 |