4 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.DB2020
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…
cs.PF2019
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…
cs.NI2017★ 4 cited
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…