IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0317564.html
   My bibliography  Save this article

Intelligent tuning method for service scheduling in electric power communication networks based on operational risk and QoS guarantee

Author

Listed:
  • Yang Yu
  • YueLin Jiang
  • Zeng Dou
  • Li Cong
  • Wei Huang
  • Qiang Zhang
  • Yang Hu
  • YanJun Bi

Abstract

In the operational planning of electric power communication networks, a well-structured service scheduling scheme based on the established network topology can significantly enhance the risk prevention capabilities of these networks. Since routing policies directly influence data transmission paths, routing optimization serves as an effective strategy for improving network performance by mitigating transmission risks and threats. This paper introduces an Intelligent Tuning Method for Service Scheduling in Electric Power Communication Networks Based on Operational Risk and Quality of Service (QoS) Guarantee. Based on a comprehensive assessment of service transmission reliability and time costs, a route satisfaction evaluation function model has been developed. Utilizing this model, an enhanced Risk-Time Ant Colony Optimization (RT-ACO) routing algorithm is proposed, which builds upon the traditional ant colony algorithm. The improvements to the ant colony algorithm are made in four key areas: the definition of heuristic information, the weighting of parameters, the state selection strategy, and the pheromone update strategy. These enhancements aim to achieve optimal routing scheduling based on risk information. At the same time, a reconfiguration algorithm for power optical communication networks, based on service priority, is proposed for specific service requests. This algorithm provides both a primary routing path and an alternate routing path for service transmission, ensuring the delivery of high-priority services even when both the primary and standby paths are unavailable. Simulation results from an actual power business communication network demonstrate that the algorithm outputs the main and alternate paths with the lowest risk costs. Additionally, the path satisfaction of the proposed algorithm is improved by 7.4% compared to the traditional ant colony algorithm. This improvement validates the accuracy and superiority of the proposed algorithm and offers a valuable reference for ensuring the reliable operation of power optical fiber communication network systems.

Suggested Citation

  • Yang Yu & YueLin Jiang & Zeng Dou & Li Cong & Wei Huang & Qiang Zhang & Yang Hu & YanJun Bi, 2025. "Intelligent tuning method for service scheduling in electric power communication networks based on operational risk and QoS guarantee," PLOS ONE, Public Library of Science, vol. 20(2), pages 1-18, February.
  • Handle: RePEc:plo:pone00:0317564
    DOI: 10.1371/journal.pone.0317564
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0317564
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0317564&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0317564?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0317564. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.