Demo Data from VLDB 2026 / reviewers in the wild / expert
Massimo Girondi
dblp:297/4470
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Computer 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
1 paper |
Internet architecture and protocols · 50% Routing and switching · 50% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Routing and switching › packet switching
packet ordering |
0.6 | 1 | 2022 | Packet Order Matters! Improving Application Performance by Deliberately Delaying Packets · NSDI 2022 |
Internet architecture and protocols
packet scheduling |
0.6 | 1 | 2022 | Packet Order Matters! Improving Application Performance by Deliberately Delaying Packets · NSDI 2022 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Packet Order Matters! Improving Application Performance by Deliberately Delaying Packets
Hamid Ghasemirahni, Tom Barbette, George P. Katsikas, Alireza Farshin, Amir Roozbeh, Massimo Girondi, Marco Chiesa, Gerald Q. Maguire Jr., Dejan Kostic |
NSDI | 6 |
| 2021 | High-speed Connection Tracking in Modern ServersabstractThe rise of commodity servers equipped with high-speed network interface cards poses increasing demands on the efficient implementation of connection tracking, i.e., the task of associating the connection identifier of an incoming packet to the state stored for that connection. In this work, we thoroughly investigate and compare the performance obtainable by different implementations of connection tracking using high-speed real traffic traces. Based on a load balancer use case, our results show that connection tracking is an expensive operation, achieving at most 24 Gbps on a single core. Core-sharding and lock-free hash tables emerge as the only suitable multi-thread approaches for enabling 100 Gbps packet processing. In contrast to recent beliefs, we observe that newly proposed techniques to "lazily" delete connection states are not more effective than properly tuned traditional deletion techniques based on timer wheels. Massimo Girondi, Marco Chiesa, Tom Barbette |
HPSR | 1 |