Abstract
Network Coordinates are a basic building block for most peer-to-peer applications nowadays. They optimize the peer selection process by allowing the nodes to preferably attach to peers to whom they then experience a low round trip time. Albeit there has been substantial research effort in this topic over the last years, the optimization of the various network coordinate algorithms has not been pursued systematically yet. Analyzing the well-known Vivaldi algorithm and its proposed optimizations with several sets of extensive Internet traffic traces, we found that in face of current Internet data most of the parameters that have been recommended in the original papers are a magnitude too high. Based on this insight, we recommend modified parameters that improve the algorithms’ performance significantly.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Cox, R., Dabek, F., Kaashoek, F., Li, J., Morris, R.: Practical, distributed network coordinates. In: Proceedings of the Second Workshop on Hot Topics in Networks (HotNets-II), Cambridge, Massachusetts (2003)
Cohen, B.: Incentives build robustness in bittorrent. In: Proceedings of the first Workshop on Economics of peer-to-peer systems, Berkley, California (2003)
Ledlie, J., Gardner, P., Seltzer, M.: Network coordinates in the wild. In: Proceedings of USENIX NSDI 2007, Cambridge, Massachusetts (2007)
Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: A decentralized network coordinate system. In: Proceedings of the ACM SIGCOMM 2004 Conference, Portland, Oregon (2004)
Choffnes, D.R., Bustamante, F.B.: What’s Wrong with Network Positioning and Where Do We Go From Here? Technical Report NW-EECS-09-03 (2009), http://www.eecs.northwestern.edu/research/tech_reports/number
Syrah: King-Blog-Dataset (2006), http://www.eecs.harvard.edu/~syrah/nc (accessed December 30, 2008); Variant with at least 8 neighbors was picked
Förschler, A.: Einbettung von Peer-to-Peer-Netzwerkgraphen zur Vorhersage von Paketumlaufzeiten, Diplomarbeit, Universität Karlsruhe (2009)
Ng, T.S.E., Zhang, H.: Predicting Internet Network Distance with Coordinates-Based Approaches. In: Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2002 (2002)
Wong, B., Slivkins, A., Sirer, E.G.: Meridian: a lightweight network location service without virtual coordinates. In: Proceedings of the ACM SIGCOMM 2005 Conference, Philadelphia, Pennsylvania (2005)
Pietzuch, P., Ledlie, J., Seltzer, M.: Supporting network coordinates on PlanetLab. In: WORLDS 2005: Proceedings of the 2nd conference on Real, Large Distributed Systems, Berkeley, California (2005)
Choffnes, D.R., Bustamante, F.E.: Taming the torrent: a practical approach to reducing cross-isp traffic in peer-to-peer systems. Comput. Commun. Rev. 38(4), 363–374 (2008)
Aggarwal, V., Feldmann, A., Scheideler, C.: Can ISPS and P2P users cooperate for improved performance?. Comput. Commun. Rev. 37(3), 29–40 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Elser, B., Förschler, A., Fuhrmann, T. (2009). Tuning Vivaldi: Achieving Increased Accuracy and Stability. In: Spyropoulos, T., Hummel, K.A. (eds) Self-Organizing Systems. IWSOS 2009. Lecture Notes in Computer Science, vol 5918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10865-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-10865-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10864-8
Online ISBN: 978-3-642-10865-5
eBook Packages: Computer ScienceComputer Science (R0)