DocumentCode
3226054
Title
Traceroute-Based Fast Peer Selection without Offline Database
Author
Ying, Lihang ; Basu, Anup
Author_Institution
Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.
fYear
2006
fDate
Dec. 2006
Firstpage
609
Lastpage
614
Abstract
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
Keywords
IP networks; Internet; peer-to-peer computing; telecommunication network routing; IP address; traceroute-based fast peer selection; Bandwidth; Cost function; Delay; Internet; Multimedia databases; Network servers; Network topology; Peer to peer computing; Streaming media; Web server;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia, 2006. ISM'06. Eighth IEEE International Symposium on
Conference_Location
San Diego, CA
Print_ISBN
0-7695-2746-9
Type
conf
DOI
10.1109/ISM.2006.152
Filename
4061221
Link To Document