King: estimating latency between arbitrary internet end hosts

By Krishna P. Gummadi, Stefan Saroiu, S. Gribble. International Memory Workshop, 2002

636 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/d7b0c9f213ca816809a2fddd89ed417dc8dc3c88

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Encore: Lightweight Measurement of Web Censorship with Cross-Origin Requests (2014, background): “This paper considers all three aspects of the adversary.”
Eclipse Attacks on Overlay Networks: Threats and Defenses (2006, methodology): “Two different physical network topology models were used in the simulations: The GT-ITM transitstub network topology model, consisting of 5050 routers [41], and a set of measured pair-wise latency values for up to 10,000 real Internet host, obtained with the King tool [19].”
PeerSim: A scalable P2P simulator (2009, background): “For example, the King dataset is supported, which models the latency among a collection of geographically distributed nodes [3].”
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload (2003, methodology): “Through the use of topological distance estimation techniques such as GNP [25], IDMaps [13],or King [ 17 ],it may be possible to infuse supernodes with locality awareness,resulting in a fully distributed redirection architecture.”
' s personal copy T-MAN : Gossip-based fast overlay topology construction q (2009, methodology): “The applied transport layer emulates end-to-end delays between pairs of nodes based on the traces of the King data set [28].”
Virtual landmarks for the internet (2003, background): “Categories and Subject Descriptors C.2.1 [Computer-Communication Networks]: Network Architecture and Design; C.2.4 [Computer-Communication Networks]: Distributed Systems Distributed applications General Terms Algorithms, Measurement, Performance Keywords Network Distance, Principal Component…”
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies (2009, methodology): “We consider a WAN setting, where latencies between each pair of nodes are estimated using the King data set [20].”
Network Coordinates in the Wild (2007, methodology): “We generate a dense latency matrix of a subset of Azureus and compare it to PlanetLab and to the MIT King data set, a square matrix containing the median latencies between 1740 DNS servers collected using the King method [8] [13].”
Meridian: a lightweight network location service without virtual coordinates (2005, methodology): “The latency measurements between DNS servers on the Internet were performed using the King measurement technique [20].”
Survey of research towards robust peer-to-peer networks: Search methods (2006, background): “Storage Consistency & Replication [101-112] Eventual consistency Trade-offs Distribution [39, 42, 90, 92, 113-131] Epidemics, Bloom Filters Fault Tolerance [40, 105, 132-139] Erasure Coding Byzantine Agreement Locality [24, 43, 47, 140-160] Load Balancing [37, 86, 100, 107, 151, 161-171]”
Designing a DHT for Low Latency and High Throughput (2004, background): “The measurements focus on DHT operations that require low latency or high throughput.”