4 citations · 10 across the 4 of their papers we have counts for
4 papers
Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)
Long Gong, Ziheng Liu, Liang Liu +3
Set reconciliation is a fundamental algorithmic problem that arises in many networking, system, and database applications. In this problem, two large sets A and B of objects (bitco…
QPS-r: A Cost-Effective Crossbar Scheduling Algorithm and Its Stability and Delay Analysis
Long Gong, Jun Xu, Liang Liu +1
In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing swi…
Better Algorithms for Hybrid Circuit and Packet Switching in Data Centers
Liang Liu, Long Gong, Sen Yang +2
Hybrid circuit and packet switching for data center networking (DCN) has received considerable research attention recently. A hybrid-switched DCN employs a much faster circuit swit…
SERENADE: A Parallel Randomized Algorithm Suite for Crossbar Scheduling in Input-Queued Switches
Long Gong, Liang Liu, Sen Yang +3
Most of today's high-speed switches and routers adopt an input-queued crossbar switch architecture. Such a switch needs to compute a matching (crossbar schedule) between the input…