Demo Data from VLDB 2026 / reviewers in the wild / expert
Mingchen Zhao
dblp:117/4241
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 5 · 3 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 networks
3 papers |
Routing and switching · 60% Content delivery and video streaming · 21% Network management and operations · 18% | |
| Network and information security
2 papers |
Network security · 73% Cryptographic protocols and secure computation · 27% | |
| Computer architecture, parallel and distributed computing, and storage systems
3 papers |
Distributed systems · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 100% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network security
routing security |
0.4 | 2 | 2016 | Private and Verifiable Interdomain Routing Decisions · IEEE/ACM Trans. Netw. 2016 Private and verifiable interdomain routing decisions · SIGCOMM 2012 |
Routing and switching
inter-domain routing |
0.2 | 1 | 2016 | Private and Verifiable Interdomain Routing Decisions · IEEE/ACM Trans. Netw. 2016 |
Routing and switching › inter-domain routing
BGP |
0.2 | 2 | 2016 | Private and verifiable interdomain routing decisions · SIGCOMM 2012 Private and Verifiable Interdomain Routing Decisions · IEEE/ACM Trans. Netw. 2016 |
Distributed systems
peer-to-peer systems |
0.2 | 2 | 2013 | Reliable Client Accounting for P2P-Infrastructure Hybrids · NSDI 2012 Peer-assisted content distribution in Akamai netsession · Internet Measurement Conference 2013 |
Distributed systems
distributed debugging |
0.2 | 1 | 2014 | Diagnosing missing events in distributed systems with negative provenance · SIGCOMM 2014 |
Content delivery and video streaming
content delivery network |
0.2 | 1 | 2013 | Peer-assisted content distribution in Akamai netsession · Internet Measurement Conference 2013 |
Network management and operations › network verification
routing policy verification |
0.1 | 1 | 2012 | Private and verifiable interdomain routing decisions · SIGCOMM 2012 |
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
0.1 | 1 | 2012 | Private and verifiable interdomain routing decisions · SIGCOMM 2012 |
Program analysis
provenance analysis |
0.1 | 1 | 2014 | Diagnosing missing events in distributed systems with negative provenance · SIGCOMM 2014 |
Distributed systems
fault tolerance |
0.0 | 1 | 2012 | Reliable Client Accounting for P2P-Infrastructure Hybrids · NSDI 2012 |
Methods — techniques the papers use, named apart from their topics
cryptographic commitment · 0.5zero-knowledge proofs · 0.4zero-knowledge proof · 0.4provenance · 0.4measurement study · 0.3client accounting · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Private and Verifiable Interdomain Routing DecisionsabstractExisting secure interdomain routing protocols can verify validity properties about individual routes, such as whether they correspond to a real network path. It is often useful to verify more complex properties relating to the route decision procedure - for example, whether the chosen route was the best one available, or whether it was consistent with the network's peering agreements. However, this is difficult to do without knowing a network's routing policy and full routing state, which are not normally disclosed. In this paper, we show how a network can allow its peers to verify a number of nontrivial properties of its interdomain routing decisions without revealing any additional information. If all the properties hold, the peers learn nothing beyond what the interdomain routing protocol already reveals; if a property does not hold, at least one peer can detect this and prove the violation. We present SPIDeR, a practical system that applies this approach to the Border Gateway Protocol, and we report results from an experimental evaluation to demonstrate that SPIDeR has a reasonable overhead. Mingchen Zhao, Wenchao Zhou, Alexander J. T. Gurney, Andreas Haeberlen, Micah Sherr, Boon Thau Loo |
IEEE/ACM Trans. Netw. | 1 |
| 2014 | Diagnosing missing events in distributed systems with negative provenanceabstractWhen debugging a distributed system, it is sometimes necessary to explain the absence of an event - for instance, why a certain route is not available, or why a certain packet did not arrive. Existing debuggers offer some support for explaining the presence of events, usually by providing the equivalent of a backtrace in conventional debuggers, but they are not very good at answering 'Why not?' questions: there is simply no starting point for a possible backtrace. Mingchen Zhao, Andreas Haeberlen, Wenchao Zhou, Boon Thau Loo |
SIGCOMM | 2 |
| 2013 | Peer-assisted content distribution in Akamai netsessionabstractContent distribution systems have traditionally adopted one of two architectures: infrastructure-based content delivery networks (CDNs), in which clients download content from dedicated, centrally managed servers, and peer-to-peer CDNs, in which clients download content from each other. The advantages and disadvantages of each architecture have been studied in great detail. Recently, hybrid, or 'peer-assisted', CDNs have emerged, which combine elements from both architectures. The properties of such systems, however, are not as well understood. Mingchen Zhao, Paarijaat Aditya, Ang Chen 0001, Yin Lin, Andreas Haeberlen, Peter Druschel, Bruce M. Maggs, Bill Wishon, Miroslav Ponec |
Internet Measurement Conference | 1 |
| 2012 | Reliable Client Accounting for P2P-Infrastructure Hybrids
Paarijaat Aditya, Mingchen Zhao, Yin Lin, Andreas Haeberlen, Peter Druschel, Bruce M. Maggs, Bill Wishon |
NSDI | 2 |
| 2012 | Private and verifiable interdomain routing decisionsabstractExisting secure interdomain routing protocols can verify validity properties about individual routes, such as whether they correspond to a real network path. It is often useful to verify more complex properties relating to the route decision procedure - for example, whether the chosen route was the best one available, or whether it was consistent with the network's peering agreements. However, this is difficult to do without knowing a network's routing policy and full routing state, which are not normally disclosed. In this paper, we show how a network can allow its peers to verify a number of nontrivial properties of its interdomain routing decisions without revealing any additional information. If all the properties hold, the peers learn nothing beyond what the interdomain routing protocol already reveals; if a property does not hold, at least one peer can detect this and prove the violation. We present SPIDeR, a practical system that applies this approach to the Border Gateway Protocol, and we report results from an experimental evaluation to demonstrate that SPIDeR has a reasonable overhead. Mingchen Zhao, Wenchao Zhou, Alexander J. T. Gurney, Andreas Haeberlen, Micah Sherr, Boon Thau Loo |
SIGCOMM | 1 |