16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008) Internet-Scale Simulations of a Peer Selection Algorithm February 13-February 15 ISBN: 978-0-7695-3089-5
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDP.2008.82
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems are even more challenging because participating peers have to discover their closest neigh-bors as quickly as possible. We propose in this paper an approach based on landmarks and a management server. Despite its centralized architecture, this method can scale to a large population of peers. We focus in this paper on challenging this basic idea through intensive simulations, using a large-scale map of the Internet Router (IR) layer in a simulator dedicated to peer-to-peer systems. We compare the results obtained by the new method with a random selection and an optimal selection and we show that this proposal makes sense.
Index Terms:
Peer-to-Peer Overlay, Peer Selection, Large-scale Simulation, Internet graph
Citation:
Ali Boudani, Yiping Chen, Gilles Straub, Gwendal Simon, "Internet-Scale Simulations of a Peer Selection Algorithm," pdp, pp.531-535, 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008), 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||