Demo Data from VLDB 2026 / reviewers in the wild / expert
D. K. Lee
dblp:80/6492
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 2 first-authorSecurity and privacy · 2
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
2 papers |
Physical-layer communications · 50% Network measurement and analytics · 32% Internet architecture and protocols · 19% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications › signal processing for communications › statistical signal processing › estimation theory
delay estimation |
0.2 | 2 | 2010 | Path Stitching: Internet-Wide Path and Delay Estimation from Existing Measurements · INFOCOM 2010 Internet Sibilla: utilizing DNS for delay estimation service · CoNEXT 2008 |
Network measurement and analytics › latency measurement
end-to-end delay estimation |
0.1 | 1 | 2010 | Path Stitching: Internet-Wide Path and Delay Estimation from Existing Measurements · INFOCOM 2010 |
Physical-layer communications › channel estimation
path estimation |
0.1 | 1 | 2010 | Path Stitching: Internet-Wide Path and Delay Estimation from Existing Measurements · INFOCOM 2010 |
Internet architecture and protocols
domain name system |
0.1 | 1 | 2008 | Internet Sibilla: utilizing DNS for delay estimation service · CoNEXT 2008 |
Network measurement and analytics › latency measurement
round-trip time measurement |
0.1 | 1 | 2008 | Internet Sibilla: utilizing DNS for delay estimation service · CoNEXT 2008 |
Internet architecture and protocols › network topology
autonomous system topology |
0.0 | 1 | 2010 | Path Stitching: Internet-Wide Path and Delay Estimation from Existing Measurements · INFOCOM 2010 |
Methods — techniques the papers use, named apart from their topics
DNS querying · 0.2measurement data fusion · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Unmasking the Growing UDP Traffic in a Campus Network
D. K. Lee, Sue B. Moon |
PAM | 2 |
| 2011 | Operating a Network Link at 100%
D. K. Lee, Yung Yi, Sue B. Moon |
PAM | 2 |
| 2011 | Scalable and systematic Internet-wide path and delay estimation from existing measurements
D. K. Lee, Keon Jang, Gianluca Iannaccone, Sue B. Moon |
Comput. Networks | 1 |
| 2010 | Path Stitching: Internet-Wide Path and Delay Estimation from Existing MeasurementsabstractMany measurement systems have been proposed in recent years to shed light on the internal performance of the Internet. Their common goal is to allow distributed applications to improve end-user experience. A common hurdle they face is the need to deploy yet another measurement infrastructure. In this work, we demonstrate that without any new measurement infrastructure or active probing we obtain composite performance estimates from AS-by-AS segments and the estimates are as good as (or even better than) those from existing estimation methodologies that use on-demand, customized active probing. The main contribution of this paper is an estimation algorithm that breaks down measurement data into segments, identifies relevant segments efficiently, and, by carefully stitching segments together, produces delay and path estimates between any two end points. Fittingly, we call our algorithm path stitching. Our results show remarkably good accuracy: error in delay is below 20 ms in 80% of end-to-end paths. D. K. Lee, Keon Jang, Gianluca Iannaccone, Sue B. Moon |
INFOCOM | 1 |
| 2008 | Internet Sibilla: utilizing DNS for delay estimation serviceabstractMassively distributed applications are popular in today's Internet. To improve the end-user experience, they require constantly updated information about the network-internal performance characteristics, such as RTT, effective bandwidth, IP hop count, and loss rate. Knowledge of network-internal characteristics allow distributed applications to solve commonly encountered problems, such as nearest neighbor discovery, leader node selection, and optimal distribution tree organization. Today's Internet does not provide any such information, and applications and new services resort often perform their own measurement to obtain necessary information. Keon Jang, D. K. Lee, Sue B. Moon, Gianluca Iannaccone |
CoNEXT | 2 |