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

Jinchao Ma

dblp:178/5985 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0005-3754-2967ORCID · corroborated

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

Systems, architecture and hardware · 1 · 1 since 2021Computer 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
2 papers
Datacenter networks · 66% Routing and switching · 25% Internet architecture and protocols · 9%

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

TopicWeightPapersLastEvidence papers
Datacenter networks
lossless network
1.012026
Efficient Headroom Allocation With Two-Level Flow Control for Lossless Datacenter Networks · IEEE Trans. Netw. 2026
Datacenter networks › lossless ethernet
priority flow control
1.012026
Efficient Headroom Allocation With Two-Level Flow Control for Lossless Datacenter Networks · IEEE Trans. Netw. 2026
Routing and switching
switch buffer management
0.912025
Occamy: A Preemptive Buffer Management for On-chip Shared-memory Switches · EuroSys 2025
Internet architecture and protocols
buffer management
0.312026
Efficient Headroom Allocation With Two-Level Flow Control for Lossless Datacenter Networks · IEEE Trans. Netw. 2026

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

two-level flow control · 1.0
YearPublicationVenuePosition
2026 Efficient Headroom Allocation With Two-Level Flow Control for Lossless Datacenter Networks
abstract
In datacenters, lossless network is very attractive as it can achieve ultra-low latency. In commodity Ethernet, lossless forwarding is achieved by hop-by-hop Priority-based Flow Control (PFC). To avoid buffer overflow, PFC-enabled switches need to reserve some buffer asheadroom, absorbing in-flight packets during the delay for backpressure messages to take effect. However, with the growing link speed in production networks, the buffer becomes increasingly insufficient, and the headroom can occupy a considerable fraction of buffer. As a result, the remaining buffer for absorbing normal traffic bursts is significantly squeezed, leading to frequent PFC messages that degrade the network performance. Worse yet, we find that the current static and queue-independent headroom allocation scheme is quite inefficient, resulting in significant buffer wastage. In light of this, we propose Dynamic and Shared Headroom allocation scheme (DSH), which dynamically allocates headroom to congested queues and enables sharing of allocated headroom among different queues. To achieve this, DSH first introduces port-level flow control, which performs flow control at the granularity of individual ports, guaranteeing lossless forwarding with a small fraction of per-port headroom. With this lossless guarantee, the switch is liberated for dynamic headroom adjustment. DSH dynamically allocates per-queue headroom based on the congestion status of each queue. Meanwhile, DSH preserves the queue-level flow control to protect the non-congested queues from being paused by congested queues, ensuring performance isolation on buffer sharing. Extensive experiments show that DSH can reduce the flow completion time by up to ~78.8%.
Danfeng Shan, Jinchao Ma, Yunguang Li, Boxuan Hu, Tong Zhang 0018, Yazhe Tang, Hao Li 0011, Jinyu Wang 0002, Peng Zhang 0011
IEEE Trans. Netw.2
2025 Occamy: A Preemptive Buffer Management for On-chip Shared-memory Switches
abstract
Today's high-speed switches employ an on-chip shared packet buffer. The buffer is becoming increasingly insufficient as it cannot scale with the growing switching capacity. Nonetheless, the buffer needs to face highly intense bursts and meet stringent performance requirements for datacenter applications. This imposes rigorous demand on the Buffer Management (BM) scheme, which dynamically allocates the buffer across queues. However, the de facto BM scheme, designed over two decades ago, is ill-suited to meet the requirements of today's network.
Danfeng Shan, Yunguang Li, Jinchao Ma, Xinyu Wen, Hao Li 0011, Wanchun Jiang, Nan Li 0047, Fengyuan Ren
EuroSys3