loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eighth IEEE International Symposium on Multimedia (ISM'06)
Traceroute-Based Fast Peer Selection without Offline Database
San Diego, CA
December 11-December 13
ISBN: 0-7695-2746-9
Lihang Ying, Univ. of Alberta, Canada
Anup Basu, Univ. of Alberta, Canada
The extreme heterogeneity in the P2P Internet environment causes the connections to candidate peers to vary significantly. Thus, selecting good candidate peers is critical to P2P networking performance. While most research in the literature focus on selecting peers with low latency, high uploading bandwidth, and high serving stability by time-consuming end-to-end measurement, we address how to quickly narrow the scope of good candidate peers. In this paper, we proposed to pick out the close peers from the same location or with low round-trip time from each other, by observing that close peers share routers along the traceroute path to the same destination. Our method only maintains online peers?s traceroute records, without any offline database. Experiments with real traceroute records from 352 different IP addresses around the world verify the efficiency of our method.
Citation:
Lihang Ying, Anup Basu, "Traceroute-Based Fast Peer Selection without Offline Database," ism, pp.609-614, Eighth IEEE International Symposium on Multimedia (ISM'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.