Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zien Wang

dblp:412/7294 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Routing and switching · 56% Cellular and mobile networks · 28% Content delivery and video streaming · 8%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
6g
1.012026
Graph Neural Network-Based Multicast Routing for On-Demand Streaming Services in 6G Networks · IEEE Trans. Mob. Comput. 2026
Routing and switching
multicast routing
1.012026
Graph Neural Network-Based Multicast Routing for On-Demand Streaming Services in 6G Networks · IEEE Trans. Mob. Comput. 2026
Routing and switching › multicast routing
multicast tree construction
1.012026
Graph Neural Network-Based Multicast Routing for On-Demand Streaming Services in 6G Networks · IEEE Trans. Mob. Comput. 2026
Internet architecture and protocols › quality of service
quality-of-service differentiation
0.312026
Graph Neural Network-Based Multicast Routing for On-Demand Streaming Services in 6G Networks · IEEE Trans. Mob. Comput. 2026
Content delivery and video streaming
video-on-demand
0.312026
Graph Neural Network-Based Multicast Routing for On-Demand Streaming Services in 6G Networks · IEEE Trans. Mob. Comput. 2026

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 1.0long short-term memory · 1.0graph neural network · 1.0graph attention network · 1.0
YearPublicationVenuePosition
2026 Graph Neural Network-Based Multicast Routing for On-Demand Streaming Services in 6G Networks
abstract
The increase of bandwidth-intensive applications in sixth-generation (6 G) wireless networks, such as real-time volumetric streaming, and multi-sensory extended reality, demands intelligent multicast routing solutions capable of delivering differentiated quality-of-service (QoS) at scale. Traditional shortest-path and multicast routing algorithms are either computationally prohibitive or structurally rigid, and they often fail to support heterogeneous user demands, leading to suboptimal resource utilization. Neural network-based approaches, while offering improved inference speed, typically lack topological generalization and scalability. To address these limitations, this paper presents a graph neural network (GNN)-based multicast routing framework that jointly minimizes total transmission cost and supports user-specific video quality requirements. The routing problem is formulated as a constrained minimum-flow optimization task, and a reinforcement learning algorithm is developed to sequentially construct efficient multicast trees by reusing paths and adapting to network dynamics. A graph attention network (GAT) is employed as the encoder to extract context-aware node embeddings, while a long short-term memory (LSTM) module models the sequential dependencies in routing decisions. Extensive simulations demonstrate that the proposed method closely approximates optimal dynamic programming-based solutions while significantly reducing computational complexity. The results also confirm strong generalization to large-scale and dynamic network topologies, highlighting the method's potential for real-time deployment in 6 G multimedia delivery scenarios. Code is available athttps://github.com/UNIC-Lab/GNN-Routing.
Xiucheng Wang, Zien Wang, Nan Cheng 0001, Wenchao Xu 0001, Wei Quan 0001, Xuemin Shen
IEEE Trans. Mob. Comput.2