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

Yinchuan Cong

dblp:388/9985 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0001-5487-2814ORCID · corroborated

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

Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 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
Network measurement and analytics · 39% Software-defined and programmable networks · 30% Internet architecture and protocols · 30%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › packet processing
network processor
0.812024
Per-Packet Traffic Measurement in Storage, Computation and Bandwidth Limited Data Plane · IEEE/ACM Trans. Netw. 2024
Software-defined and programmable networks
programmable data plane
0.812024
Per-Packet Traffic Measurement in Storage, Computation and Bandwidth Limited Data Plane · IEEE/ACM Trans. Netw. 2024
Network measurement and analytics › network telemetry
data plane measurement
0.212024
Per-Packet Traffic Measurement in Storage, Computation and Bandwidth Limited Data Plane · IEEE/ACM Trans. Netw. 2024

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

p4 · 0.8compression algorithms · 0.8
YearPublicationVenuePosition
2025 Low Energy Consumption Hierarchical Federated Learning
Shengaocheng Zhang, Jigang Wen, Xiaofan Zhou, Kun Xie 0001, Yinchuan Cong, Tianxiong Liu
SecureComm (5)5
2024 Per-Packet Traffic Measurement in Storage, Computation and Bandwidth Limited Data Plane
abstract
Packet level measurement in the data plane provides a microscopic view of the network’s state. Although advances in programmable switches and routers make it possible to measure the Sequence of Packet Lengths and Arrival Times (SPLT) in the data plane, collecting this information remains challenging due to limited storage, processing resources, and bandwidth. To address this issue, we propose MES, which Measures and Encodes Simultaneously the packet length and timestamp when each packet passes through the Network Processor (NP) in the switch/router. We design the packet length compression and timestamp compression algorithms to be lightweight and implement the designed algorithms using simple operations supported by the network processor, while taking into account the computation constraints of the NP. Through extensive experiments on five packet traces, we demonstrate that our MES achieves high precision SPLT measurements (up to 99.82% cosine similarity) while reducing storage and bandwidth overhead by up to 87%. Simulations conducted on the BMV2 P4 software switch demonstrate that our designed SPLT measurement mechanism imposes little impact on network throughput and delay.
Yinchuan Cong, Kun Xie 0001, Jigang Wen, Jiwei Zhang 0018, Yansong Yin, Gaogang Xie, Wei Liang 0005
IEEE/ACM Trans. Netw.1