AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (11 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

An overlay multicast routing method based on network situational awareness and hierarchical multi-agent reinforcement learning

Miao Ye1Yanye Chen1Yong Wang2Cheng Zhu1,3Qiuxiang Jiang4( )Gai Huang1Feng Ding1
School of Information and Communication, Guilin University of Electronic Technology, Guilin 541000, China
School of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541000, China
Information Center, Guilin Medical University, Guilin 541000, China
School of Optoelectronic Engineering, Guilin University of Electronic Technology, Guilin 541000, China
Show Author Information

Abstract

Compared with IP multicast, Overlay Multicast (OM) trees constructed at the application layer offer superior compatibility and flexible deployment advantages in heterogeneous, cross-domain networks. However, OM implementations under traditional network architectures suffer from weak adaptability to highly dynamic traffic due to their lack of awareness of underlying physical resource states. Moreover, reinforcement learning-based approaches fail to decouple the multi-objective tightly coupled nature of OM, resulting in high computational complexity, slow policy convergence, and insufficient stability. To address these challenges, we proposed a MA-DHRL-OM routing method. First, leveraging the centralized topological view provided by Software-Defined Networking (SDN), the method collected link-state information and constructed a traffic-aware feature model to provide multi-dimensional decision support for OM path planning. Second, within a unified framework that integrates multi-agent reinforcement learning and hierarchical reinforcement learning, MA-DHRL-OM solves for the optimal OM tree as follows: The hierarchical learning architecture decomposes the construction of the OM tree into a two-stage subtask framework. By designing tailored decision logic and reward signal feedback mechanisms for upper- and lower-layer agents, it achieved hierarchical decoupling of the high-dimensional OM problem, effectively reducing the action space dimensionality and enhancing policy convergence stability. Moreover, the multi-agent collaboration mechanism enabled each agent to make independent decisions based on its local observations, thereby balancing multi-objective optimization while improving the algorithm's overall scalability and adaptability. Extensive simulation experiments demonstrated that, compared with existing methods, MA-DHRL-OM achieves superior performance in optimizing key metrics such as delay, bandwidth utilization, and packet loss rate while exhibiting more stable convergence behavior and greater flexibility in OM routing decisions.

References

【1】
【1】
 
 
Electronic Research Archive
Pages 3447-3480

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Ye M, Chen Y, Wang Y, et al. An overlay multicast routing method based on network situational awareness and hierarchical multi-agent reinforcement learning. Electronic Research Archive, 2026, 34(5): 3447-3480. https://doi.org/10.3934/era.2026154

1

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 27 December 2025
Revised: 23 March 2026
Accepted: 02 April 2026
Published: 15 May 2026
©2026 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)