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

Yangyu Wang

dblp:75/6711 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0006-7399-9937ORCID · corroborated

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

Computer networks · 3 · 2 first-author · 3 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
2 papers
Optical networks · 67% Transport protocols and congestion control · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%
Theoretical computer science
1 paper
Quantum computing and quantum information · 100%

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

TopicWeightPapersLastEvidence papers
Optical networks
routing and wavelength assignment
0.812024
Routing and Wavelength Assignment for Entanglement Swapping of Photonic Qubits · INFOCOM 2024
Optical networks › routing and wavelength assignment
wavelength assignment
0.812024
Routing and Wavelength Assignment for Entanglement Swapping of Photonic Qubits · INFOCOM 2024
Emerging computing paradigms › quantum computer architecture
distributed quantum computing
0.812024
An Asynchronous Transport Protocol for Quantum Data Networks · IEEE J. Sel. Areas Commun. 2024
Emerging computing paradigms
quantum computer architecture
0.812024
An Asynchronous Transport Protocol for Quantum Data Networks · IEEE J. Sel. Areas Commun. 2024
Quantum computing and quantum information › quantum network
entanglement routing
0.812024
Routing and Wavelength Assignment for Entanglement Swapping of Photonic Qubits · INFOCOM 2024
Quantum computing and quantum information
quantum network
0.812024
Routing and Wavelength Assignment for Entanglement Swapping of Photonic Qubits · INFOCOM 2024
Emerging computing paradigms
quantum computing and quantum information
0.212024
An Asynchronous Transport Protocol for Quantum Data Networks · IEEE J. Sel. Areas Commun. 2024
Quantum computing and quantum information › quantum network › quantum repeater
entanglement swapping
0.212024
Routing and Wavelength Assignment for Entanglement Swapping of Photonic Qubits · INFOCOM 2024

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

simulation · 1.5heuristic algorithm · 1.5co-path · 1.5
YearPublicationVenuePosition
2026 Purification and Routing for Makespan Minimization in Quantum Networks
Yangyu Wang, Yangming Zhao, Hongli Xu 0001
IWQoS1
2024 Routing and Wavelength Assignment for Entanglement Swapping of Photonic Qubits
abstract
Efficient entanglement routing in Quantum Data Networks (QDNs) is essential in order to concurrently establish as many Entanglement Connections (ECs) as possible, which in turn maximizes the network throughput. In this work, we consider a new class of QDNs with wavelength division multiplexed (WDM) quantum links where each quantum repeater will perform entanglement swapping by measuring two photonic qubits coming from some entangled photon sources directly on the same wavelength. To address unique challenges in achieving a high network throughput in such QDNs, we propose QuRWA to jointly optimize the entanglement routing and wavelength assignment. To this end, we introduce a key concept named Co-Path to improve fault-tolerance: all ELs in a Co-Path set will be assigned the same wavelength and this may serve as backup for some other ELs in the same Co-Path when establishing ECs. We design efficient algorithms to optimize the Co-Path selection and wavelength assignment to maximize resource utilization and fault tolerance. Extensive simulations demonstrate that compared with the methods without introducing Co-Path, QuRWA improves the network throughput by up to 122%.
Yangyu Wang, Yangming Zhao, Liusheng Huang, Chunming Qiao
INFOCOM1
2024 An Asynchronous Transport Protocol for Quantum Data Networks
abstract
Quantum Data Networks (QDNs) are vital to building Distributed Quantum Computing (DQC) systems. Though several communication protocols have been proposed for QDNs, most of them are at the network layer or below. The only transport layer protocol [1] used batch processing of requests for End-to-End (E2E) quantum data transmission. It not only limits the quantum resource utilization, more importantly, it cannot guarantee reliable E2E quantum data transmission. In this paper, we propose the first asynchronous transportation layer protocol, called AQTP, for QDNs to achieve high-speed and reliable E2E quantum data transmission. AQTP has several distinct features: (i) each quantum node locally allocates quantum resources in order to improve scalability; (ii) requests are processed in an asynchronous manner, which results in a higher quantum resource utilization; and (iii) it ensures reliable data transmission even if the teleportation operations fail. Extensive simulations show that compared with a batch processed transport layer protocol, AQTP can increase the network throughput by up to 82.97%, and reduce the Average Task Completion Time (ATCT) of DQC tasks by up to 94.69%.
Yangming Zhao, Yangyu Wang, Enshu Wang, Hongli Xu 0001, Liusheng Huang, Chunming Qiao
IEEE J. Sel. Areas Commun.2