Article

Free access

Vivaldi: a decentralized network coordinate system

Authors:

Frans Kaashoek,

Robert MorrisAuthors Info & Claims

SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications

Pages 15 - 26

https://doi.org/10.1145/1015467.1015471

Published: 30 August 2004 Publication History

Abstract

Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a simple, light-weight algorithm that assigns synthetic coordinates to hosts such that the distance between the coordinates of two hosts accurately predicts the communication latency between the hosts. Vivaldi is fully distributed, requiring no fixed network infrastructure and no distinguished hosts. It is also efficient: a new host can compute good coordinates for itself after collecting latency information from only a few other hosts. Because it requires little com-munication, Vivaldi can piggy-back on the communication patterns of the application using it and scale to a large number of hosts. An evaluation of Vivaldi using a simulated network whose latencies are based on measurements among 1740 Internet hosts shows that a 2-dimensional Euclidean model with height vectors embeds these hosts with low error (the median relative error in round-trip time prediction is 11 percent).

References

[1]

BitTorrent. http://bitconjurer.org/BitTorrent/protocol.html.

[2]

K. L. Calvert, M. B. Doar, and E. W. Zegura. Modeling Internet topology. IEEE Communications, 35(6):160--163, June 1997.

Digital Library

[3]

M. Costa, M. Castro, A. Rowstron, and P. Key. PIC: Practical Internet coordinates for distance estimation. In International Conference on Distributed Systems, Tokyo, Japan, March 2004.

Digital Library

[4]

R. Cox and F. Dabek. Learning Euclidean coordinates for Internet hosts. http://pdos.lcs.mit.edu/~rsc/6867.pdf, December 2002.

[5]

R. Cox, F. Dabek, F. Kaashoek, J. Li, and R. Morris. Practical, distributed network coordinates. In Proceedings of the Second Workshop on Hot Topics in Networks (HotNets-II), Cambridge, Massachusetts, November 2003.

[6]

F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. 18th ACM Symposium on Operating Systems Principles (SOSP '01), pages 202--205, Oct. 2001.

Digital Library

[7]

F. Dabek, J. Li, E. Sit, J. Robertson, M. F. Kaashoek, and R. Morris. Designing a DHT for low latency and high throughput. In Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI'04), San Francisco, California, March 2004.

Digital Library

[8]

P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, and L. Zhang. IDMaps: A global Internet host distance estimation service. IEEE/ACM Transactions on Networking, Oct. 2001.

Digital Library

[9]

T. Gil, J. Li, F. Kaashoek, and R. Morris. Peer-to-peer simulator, 2003. http://pdos.lcs.mit.edu/p2psim.

[10]

K. P. Gummadi, S. Saroiu, and S. D. Gribble. King: Estimating latency between arbitrary Internet end hosts. In Proc. of SIGCOMM IMW 2002, pages 5--18, November 2002.

Digital Library

[11]

H. Hoppe. Surface reconstruction from unorganized points. PhD thesis, Department of Computer Science and Engineering, University of Washington, 1994.

Digital Library

[12]

KaZaA media dekstop. http://www.kazaa.com/.

[13]

P. Mockapetris and K. J. Dunlap. Development of the Domain Name System. In Proc. ACM SIGCOMM, pages 123--133, Stanford, CA, 1988.

Digital Library

[14]

J. C. Mogul. Efficient use of workstations for passive monitoring of local area networks. Research Report 90/5, Digital Western Research Laboratory, July 1990.

Digital Library

[15]

E. Ng. GNP software, 2003. http://www-2.cs.cmu.edu/~eugeneng/research/gnp/software.html.

[16]

T. E. Ng and H. Zhang. A network positioning system for the Internet. In Proc. USENIX Conference, June 2004.

Digital Library

[17]

T. S. E. Ng and H. Zhang. Predicting Internet network distance with coordinates-based approaches. In Proceedings of IEEE Infocom, pages 170--179, 2002.

[18]

V. Padmanabhan and L. Subramanian. An investigation of geographic mapping techniques for Internet hosts. In Proc. ACM SIGCOMM, pages 173--185, San Diego, Aug. 2001.

Digital Library

[19]

M. Pias, J. Crowcroft, S. Wilbur, T. Harris, and S. Bhatti. Lighthouses for scalable distributed location. In IPTPS, 2003.

[20]

Planetlab. www.planet-lab.org.

[21]

N. Priyantha, H. Balakrishnan, E. Demaine, and S. Teller. Anchor-free distributed localization in sensor networks. Technical Report TR-892, MIT LCS, Apr. 2003.

[22]

N. Priyantha, A. Chakraborty, and H. Balakrishnan. The Cricket Location-Support System. In Proc. 6th ACM MOBICOM Conf., Boston, MA, Aug. 2000.

Digital Library

[23]

A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica. Geographic routing without location information. In ACM MobiCom Conference, pages 96--108, Sept. 2003.

Digital Library

[24]

R. Rinaldi and M. Waldvogel. Routing and data location in overlay peer-to-peer networks. Research Report RZ-3433, IBM, July 2002.

[25]

C. Savarese, J. M. Rabaey, and J. Beutel. Locationing in distributed ad-hoc wireless sensor networks. In ICASSP, pages 2037--2040, May 2001.

[26]

Y. Shavitt and T. Tankel. Big-bang simulation for embedding network distances in Euclidean space. In Proc. of IEEE Infocom, April 2003.

[27]

Y. Shavitt and T. Tankel. On the curvature of the Internet and its usage for overlay construction and distance estimation. In Proc. of IEEE Infocom, April 2004.

[28]

J. Stribling. All-pairs-ping trace of PlanetLab, 2004. http://pdos.lcs.mit.edu/ strib/.

[29]

L. Tang and M. Crovella. Virtual landmarks for the Internet. In Internet Measurement Conference, pages 143--152, Miami Beach, FL, October 2003.

Digital Library

[30]

M. Waldvogel and R. Rinaldi. Efficient topology-aware overlay network. In Hotnets-I, 2002.

[31]

L. Wang, V. Pai, and L. Peterson. The Effectiveness of Request Redirecion on CDN Robustness. In Proceedings of the Fifth Symposium on Operating Systems Design and Implementation, Boston, MA USA, December 2002.

Digital Library

Cited By

艾均(2024)Recommendation Algorithm Based on User Coordinate Distance and Error CorrectionModeling and Simulation10.12677/mos.2024.13318513:03(2000-2010)Online publication date: 2024
https://doi.org/10.12677/mos.2024.133185
Sarma AYoo JSojan JRamachandran ULee M(2024)FEO: Efficient Resource Allocation for FaaS at the EdgeProceedings of the 18th ACM International Conference on Distributed and Event-based Systems10.1145/3629104.3666033(78-89)Online publication date: 24-Jun-2024
https://dl.acm.org/doi/10.1145/3629104.3666033
Zhou MZeng LHan YLi PLong FZhou DBeschastnikh IWu M(2023)Mercury: Fast Transaction Broadcast in High Performance Blockchain SystemsIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10228972(1-10)Online publication date: 17-May-2023
https://doi.org/10.1109/INFOCOM53939.2023.10228972
Show More Cited By

Index Terms

Vivaldi: a decentralized network coordinate system
1. Networks

Recommendations

Vivaldi: a decentralized network coordinate system

Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of ...
Bounds for the Security of the Vivaldi Network Coordinate System
NETSYS '13: Proceedings of the 2013 Conference on Networked Systems

Network coordinate systems have gained much attention as they allow for an elegant estimation of distances between nodes in distributed systems. Their most prominent representative is Vivaldi, which is using a mass-spring-damper system to embed peers ...
Estimation of Data Propagation Time on the Bitcoin Network
AINTEC '19: Proceedings of the 15th Asian Internet Engineering Conference

The goal of this research is to estimate the data propagation time on the Bitcoin network. Using network coordinates, we estimate the communication latency between computers. Such latency estimation contributes future optimization of data propagation. In ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications

August 2004

402 pages

ISBN:1581138628

DOI:10.1145/1015467

General Chair:
Raj Yavatkar
Intel Corporation
,
Program Chairs:
Ellen Zegura
Georgia Institute of Technology
,
Jennifer Rexford
AT&T Labs -- Research

ACM SIGCOMM Computer Communication Review Volume 34, Issue 4
October 2004
385 pages
ISSN:0146-4833
DOI:10.1145/1030194
Issue’s Table of Contents

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 August 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGCOMM04

Sponsor:

SIGCOMM04: ACM SIGCOMM 2004 Conference

August 30 - September 3, 2004

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

937
Total Citations
View Citations
3,965
Total Downloads

Downloads (Last 12 months)268
Downloads (Last 6 weeks)36

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

艾均(2024)Recommendation Algorithm Based on User Coordinate Distance and Error CorrectionModeling and Simulation10.12677/mos.2024.13318513:03(2000-2010)Online publication date: 2024
https://doi.org/10.12677/mos.2024.133185
Sarma AYoo JSojan JRamachandran ULee M(2024)FEO: Efficient Resource Allocation for FaaS at the EdgeProceedings of the 18th ACM International Conference on Distributed and Event-based Systems10.1145/3629104.3666033(78-89)Online publication date: 24-Jun-2024
https://dl.acm.org/doi/10.1145/3629104.3666033
Zhou MZeng LHan YLi PLong FZhou DBeschastnikh IWu M(2023)Mercury: Fast Transaction Broadcast in High Performance Blockchain SystemsIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10228972(1-10)Online publication date: 17-May-2023
https://doi.org/10.1109/INFOCOM53939.2023.10228972
Pozas García NDurán FMoreno Berrocal KPimentel E(2023)Location‐aware scalable service compositionSoftware: Practice and Experience10.1002/spe.326053:12(2408-2429)Online publication date: 24-Aug-2023
https://doi.org/10.1002/spe.3260
Zhang XMin GFan QYin HWu DMa Z(2022)A Light-Weight Statistical Latency Measurement Platform at ScaleIEEE Transactions on Industrial Informatics10.1109/TII.2021.309879618:2(1186-1196)Online publication date: Feb-2022
https://doi.org/10.1109/TII.2021.3098796
Ghandi SReiffers-Masson AVaton SChonavel T(2022)Non-negative Matrix Factorization For Network Delay Matrix CompletionNOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium10.1109/NOMS54207.2022.9789871(1-6)Online publication date: 25-Apr-2022
https://doi.org/10.1109/NOMS54207.2022.9789871
Luo YWang DFu SXu MChen YHuang K(2022)Approximate Shortest Distance Queries with Advanced Graph Analytics over Large-scale Encrypted Graphs2022 18th International Conference on Mobility, Sensing and Networking (MSN)10.1109/MSN57253.2022.00056(287-294)Online publication date: Dec-2022
https://doi.org/10.1109/MSN57253.2022.00056
Wang XJiang XLiu YWang JSun Y(2022)Data Propagation for Low Latency Blockchain SystemsIEEE Journal on Selected Areas in Communications10.1109/JSAC.2022.321333040:12(3631-3644)Online publication date: Dec-2022
https://doi.org/10.1109/JSAC.2022.3213330
Lin HDeng LWang LZheng HFeng X(2022)Robust Spatial-Temporal Graph-Tensor Recovery for Network Latency EstimationGLOBECOM 2022 - 2022 IEEE Global Communications Conference10.1109/GLOBECOM48099.2022.10001361(4202-4207)Online publication date: 4-Dec-2022
https://doi.org/10.1109/GLOBECOM48099.2022.10001361
Savva FAnagnostopoulos CPezaros D(2021)TSMF: Network Latency Estimation using Matrix Factorization and Time Series Forecasting2021 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking52078.2021.9472796(1-9)Online publication date: 21-Jun-2021
https://doi.org/10.23919/IFIPNetworking52078.2021.9472796
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten