Vivaldi: a decentralized network coordinate system
By Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 2004
1,347 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/424909ea3e4e5a8cfe5363420926c1b10fbbf034
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
- Paul Gardner
- Jonathan Ledlie
- Margo I. Seltzer
- T. Anderson
- David Wetherall
- Arvind Krishnamurthy
- Emin Gün Sirer
- Bernard Wong
Citations in the corpus
- CS2P: Improving Video Bitrate Selection and Adaptation with Data-Driven Throughput Prediction (2016, background): “Seen in a broader context, CS2P can be regarded as a middle ground between centralized video control platforms (e.g., C3 [23], CFA [29]) and decentralized player-based bi-trate adaptation (e.g., BB [27], FESTIVE [30], MPC [47]).”
- 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].”
- Meridian: a lightweight network location service without virtual coordinates (2005, methodology): “Most notably, we do not assume that the metric is Euclidean, since recent experimental results suggest that approximating Internet latencies by Euclidean metrics, although a useful heuristic in some cases, incurs significant relative errors [42, 15, 40, 57, 52, 44, 12, 43, 39].”
- Walkie-Markie: Indoor Pathway Mapping Made Easy (2013, background): “Distance vs Displacement: Previous node embedding work has unanimously assumed scalar distances (e.g., via direct distance measurement or the shortest path) between nodes [9] [23] [30].”
- Volley: Automated Data Placement for Geo-Distributed Cloud Services (2010, methodology): “This iterative update step incorporates two earlier ideas: a weighted spring model as in Vivaldi [9] and spherical coordinates as in Htrae [36].”
- Network-Aware Operator Placement for Stream-Processing Systems (2006, background): “However , simulation results suggest that network coordinates, even with low dimensionality, have a small prediction error with a median of 11% [12].”
- 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]”
- Constraint-Based Geolocation of Internet Hosts (2006, neutral): “Landmarks [8], and Vivaldi [ 9 ], have addressed the evaluation of network proximity between Internet hosts using coordinate systems.”
- 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].”
- Towards IP geolocation using delay and topology measurements (2006, methodology): “Vivaldi: A decentralized network coordinate system.”
- Network Coordinates in the Wild (2007, methodology): “Previous large matrices were between DNS servers and did not capture latencies between actual nodes [8] [29].”
- Versatile, scalable, and accurate simulation of distributed applications and platforms (2014, neutral): “Solutions have been proposed to realize such embedding in practice, such as the well-known decentralized Vivaldi [25] system.”
- Wi-Fi Fingerprint-Based Indoor Positioning: Recent Advances and Comparisons (2016, methodology): “VC is based on Vivaldi algorithm [81] to find the coordinates such that all the linked users’ locations satisfy their pairwise distance.”
- Optimized IoT service placement in the fog (2017, methodology): “To be able to calculate estimations of according factors of data transfers between services in an application, as necessary for (8)–(11), we use the notion of triangular inequality in the network [9], which helps to find an approximate distance and according delay between two network locations, whic”
- 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.”