Loading...
Please wait, while we are loading the content...
Similar Documents
A quicker way to discover nearby peers.
| Content Provider | CiteSeerX |
|---|---|
| Author | Simon, Gwendal Chen, Yiping Boudani, Ali Straub, Gilles |
| Abstract | 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 neighbors as quickly as possible. We propose in this paper an approach based on landmarks and a management server in order to discover, as quickly as possible, its closest neighbors among a large population of peers. 1. CONTEXT Designers of peer-to-peer systems are usually concerned by the match between logical overlay and physical infrastructure: a peer should preferentially be connected with the peers that are the closest in Internet [10]. However determining its closest neighbors in a wide population spread on a large-scale network as Internet is still a challenge. Among the most promising ideas, coordinate-based schemes aim to fix the location of any host on Internet in a Euclidean space, so to allow two peers to estimate their latency by a basic distance computation [7, 3]. Previous works show that these virtual coordinates can be obtained by active probing, i.e. by collecting round-trip-time (RTT) measurements between peers and a small set of landmarks [5]. Unfortunately, network coordinate systems require a substantial amount of time before to deliver accurate information. This time is actually an issue. Consider live streaming peer-to-peer systems [11]: when a newcomer joins, it first experiences a setup delay before the video becomes actually visible. During this time, the peer has to set up many parameters including the playback delay. In typical mesh-based applications [9], the 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. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. |
| File Format | |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
