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

Yu Wang 0319

dblp:02/5889-319 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0002-1345-9182ORCID · verified

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

Computer networks · 2 · 2 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 · 44% Software-defined and programmable networks · 44% Internet architecture and protocols · 13%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
knowledge-defined networking
0.812024
Routing Optimization With Deep Reinforcement Learning in Knowledge Defined Networking · IEEE Trans. Mob. Comput. 2024
Routing and switching › traffic engineering
routing optimization
0.812024
Routing Optimization With Deep Reinforcement Learning in Knowledge Defined Networking · IEEE Trans. Mob. Comput. 2024
Internet architecture and protocols
network topology
0.212024
Routing Optimization With Deep Reinforcement Learning in Knowledge Defined Networking · IEEE Trans. Mob. Comput. 2024

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

message passing deep reinforcement learning · 0.8graph neural network · 0.8
YearPublicationVenuePosition
2024 Routing Optimization With Deep Reinforcement Learning in Knowledge Defined Networking
abstract
Traditional routing algorithms cannot dynamically change network environments due to the limited information for routing decisions. Meanwhile, they are prone to performance bottlenecks in the face of increasingly complex business requirements. Some approaches, such as deep reinforcement learning (DRL) have been proposed to address the routing problems. However, they hardly utilize the information about the network environment fully. The Knowledge Defined Networking (KDN) architecture inspires us to develop new learning mechanisms adapted to the dynamic characteristics of the network topology. In this paper, we propose an effective scheme to solve the routing optimization problem by adding a graph neural network (GNN) structure to DRL, called Message Passing Deep Reinforcement Learning (MPDRL). MPDRL uses the characteristics of GNN to interact with the network topology environment and extracts exploitable knowledge through the message passing process of information between links in the topology. The goal is to achieve the load balance of network traffic and improve network performance. We have conducted experiments on three Internet Service Provider (ISP) network topologies. The evaluation results show that MPDRL obtains better network performance than the baseline algorithms.
Qiang He 0002, Yu Wang 0319, Xingwei Wang 0001, Fuliang Li, Kaiqi Yang 0002, Lianbo Ma 0004
IEEE Trans. Mob. Comput.2
2022 IA-DD: An SDN Topological Poisoning Attack Defense Scheme Based on Blockchain
abstract
Software defined networking (SDN) have the advan-tages of centralized control, global visibility, and programmabil-ity, but these features also bring new security issues, such as Topological Poisoning Attack (TPA), where attackers can attack topology discovery services by stealing host locations or forging link information. Considering the three levels of identity, data package and path, this paper designs a chain authentication defense scheme. The scheme includes authentication mechanism, transaction information storage mechanism, source IP authenti-cation mechanism and smart contract notification mechanism. The received packets are authenticated by digital signature algorithm, and the trusted identity and location information are stored securely. At the same time, an improved block storage structure is designed to avoid data redundancy, and malicious information is processed by smart contract notification and stream rule installation. The experimental results show that the defense scheme designed in this paper can effectively defend against TPA attacks. Compared with the benchmark mechanism, the deployment of this scheme has less impact on controller performance and less impact on the delay of topology discovery in SDN.
Xingwei Wang 0001, Kaiqi Yang 0002, Yu Wang 0319, Qiang He 0002
MSN4