Predicting Internet network distance with coordinates-based approaches

By T. Ng, Hui Zhang. Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002

1,262 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

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

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

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]”
iPlane: an information plane for distributed services (2006, background): “However, Internet behavior is well-known to be .ckle, with local hot spots, transient (and partial) disconnectivity, and triangle inequality violations all being quite common [41, 2].”
Characterizing residential broadband networks (2007, background): “Similarly, network coordinate systems [16,37] use latency estimates to assign a set of coordinates to their participating hosts.”
On the Embeddability of Random Walk Distances (2013, methodology): “used to approximate delays between machines on a network, in the form of network coordinate systems [31, 28, 10, 27].”
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.”
Constraint-Based Geolocation of Internet Hosts (2006, neutral): “In recent years, several propositions, such as GNP [ 7 ], Virtual”
Network-Aware Operator Placement for Stream-Processing Systems (2006, background): “The latency dimensions of a cost space form a latency space [16], where the distance between two coordinates is a reasonable prediction of the latency between the nodes.”
Meridian: a lightweight network location service without virtual coordinates (2005, background): “GNP [42] determines the coordinates of a node by measuring its latency to a ﬁxed set of landmarks and then solving a multidimensional, iterative, nonlinear minimization problem.”
PIC: practical Internet coordinates for distance estimation (2004, methodology): “We use the Simplex Downhill [16] algorithm to compute coordinates as in [17].”
Network Coordinates in the Wild (2007, background): “Researchers propose acquiring these measurements using various techniques, from proxy measurement [13] [26] to landmark binning [23] to decentralized network embeddings (e.g., [11] [19] [21] [24] [28]).”
Designing a DHT for Low Latency and High Throughput (2004, background): “A number of synthetic coordinate systems have been proposed [10, 24, 27, 30, 33, 39].”
Rainbow: architecture-based self-adaptation with reusable infrastructure (2004, methodology): “At the system level, we use the global network positioning (GNP) approach [23] for estimating network latency, the Remos tool [9] for measuring bandwidth, and the network-sensitive service discovery (NSSD) mechanism [18] for resource discovery.”
King: estimating latency between arbitrary internet end hosts (2002, background): “The primary architectural dif- ference between them is that GNP shifts the complexity of computing distances between landmarks and end hosts from the landmark servers to the end hosts themselves.”
Internet indirection infrastructure (2002, background): “was shown to approximate the Internet latency well [20]—onto the one-dimensional Chord identifier space.”