Demo Data from SIGIR 2026 / reviewers in the wild / expert
Diego Ximenes Mendes
dblp:195/8051
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author
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 architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 50% Performance modeling and evaluation · 50% | |
| Computer networks
1 paper |
Network performance modeling · 77% Content delivery and video streaming · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network performance modeling
scaling laws |
0.3 | 1 | 2017 | An experimental reality check on the scaling laws of swarming systems · INFOCOM 2017 |
Distributed systems
peer-to-peer systems |
0.3 | 1 | 2017 | An experimental reality check on the scaling laws of swarming systems · INFOCOM 2017 |
Performance modeling and evaluation › performance model construction
throughput modeling |
0.3 | 1 | 2017 | An experimental reality check on the scaling laws of swarming systems · INFOCOM 2017 |
Content delivery and video streaming
peer-to-peer content distribution |
0.1 | 1 | 2017 | An experimental reality check on the scaling laws of swarming systems · INFOCOM 2017 |
Methods — techniques the papers use, named apart from their topics
closed-loop modeling · 0.6controlled experiments · 0.3controlled experiment · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | An experimental reality check on the scaling laws of swarming systemsabstractSwarming systems, such as BitTorrent, are one of the most common solutions for scalable, robust and inexpensive content distribution. Although the service capacity of swarming systems has been studied for decades through modeling and analysis, there is a lack of experimental evidence about how the throughput of such systems behaves in under-provisioned regimes. The aim of this paper is to fill this gap. In this paper, we consider a closed-loop model to assess the throughput of peer-to-peer systems. Then, we show through controlled experiments using BitTorrent clients that some analytical findings recently reported in the literature, such as the missing piece syndrome, occur in practice. In particular, we indicate that when seeds have a small effective service capacity, or when seeds are intermittent, the throughput saturates as the population size grows. Finally, we discuss the implications of such findings on the modeling and design of swarming systems. Diego Ximenes Mendes, Edmundo de Souza e Silva, Daniel Sadoc Menasché, Rosa Maria Meri Leão, Don Towsley |
INFOCOM | 1 |