Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Friendships that last: peer lifespan and its role in P2P protocols
Web content caching and distribution
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
mTreebone: A Hybrid Tree/Mesh Overlay for Application-Layer Live Video Multicast
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
A Self-Organized Clustering Scheme for Overlay Networks
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
The FastTrack overlay: A measurement study
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Internet routing policies and round-trip-times
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
A Survey on Network Coordinates Systems, Design, and Security
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
Internet Coordinate Systems (ICS) provide easy and practical latency predictions in the Internet. However, peer dynamics (i.e , churn), which is an inherent property of peer-to-peer (P2P) systems, affects the accuracy of such systems. This paper addresses the problem of churn in an ICS without landmarks, like Vivaldi. We propose a framework to assess the robustness of such an ICS in the presence of churn, and evaluate two models for handling churn. The key idea is to reactively recover lost neighbours, either by picking new nodes at random, or by selecting a new one among the node's two-hop neighbours, while maintaining high reliability and low communication overhead. We then show by simulations that our models mitigate the impact of churn, and lead to a good accuracy compared to an instance of an ICS running without churn.