TY - GEN
T1 - AntSearch
T2 - 11th IEEE Symposium on Computers and Communications, ISCC 2006
AU - Wu, Chi Jen
AU - Yang, Kai Hsiang
AU - Ho, Jan Ming
PY - 2006
Y1 - 2006
N2 - The most prevalent peer-to-peer (P2P) application till today is file sharing, and unstructured P2P networks can support, inherent heterogeneity of peers, are highly resilient to peers' failures, and incur low overhead at peer arrivals and departures. Dynamic querying (DQ) is a new flooding technique which could estimate a proper time-to-live (TTL) value for a query flooding by estimating the popularity of the searched files, and retrieve sufficient results under controlled flooding range for reducing network traffic. Recent researches show that a large amount of peers in the P2P file sharing system are the free-riders, and queries are seldom hit by those peers. The free-riders problem causes a large amount of ? redundant messages in the DQ-like search algorithm. In this paper, we proposed a new search algorithm, called "AntSearch", to solve the problem. In AntSearch, each peer maintains its hit rate of previous queries, and records a list of pheromone values of its immediate neighbors. Based on the pheromone values, a query is only flooded to those peers which are not likely to be the free-riders. Our simulation results show that, compared with DQ and its enhanced algorithm DQ+, the AntSearch algorithm averagely reduces 50% network traffic at almost the same search latency as DQ+, while retrieving sufficient results for a query with a given required number of results.
AB - The most prevalent peer-to-peer (P2P) application till today is file sharing, and unstructured P2P networks can support, inherent heterogeneity of peers, are highly resilient to peers' failures, and incur low overhead at peer arrivals and departures. Dynamic querying (DQ) is a new flooding technique which could estimate a proper time-to-live (TTL) value for a query flooding by estimating the popularity of the searched files, and retrieve sufficient results under controlled flooding range for reducing network traffic. Recent researches show that a large amount of peers in the P2P file sharing system are the free-riders, and queries are seldom hit by those peers. The free-riders problem causes a large amount of ? redundant messages in the DQ-like search algorithm. In this paper, we proposed a new search algorithm, called "AntSearch", to solve the problem. In AntSearch, each peer maintains its hit rate of previous queries, and records a list of pheromone values of its immediate neighbors. Based on the pheromone values, a query is only flooded to those peers which are not likely to be the free-riders. Our simulation results show that, compared with DQ and its enhanced algorithm DQ+, the AntSearch algorithm averagely reduces 50% network traffic at almost the same search latency as DQ+, while retrieving sufficient results for a query with a given required number of results.
UR - http://www.scopus.com/inward/record.url?scp=34547239339&partnerID=8YFLogxK
U2 - 10.1109/ISCC.2006.38
DO - 10.1109/ISCC.2006.38
M3 - 会议稿件
AN - SCOPUS:34547239339
SN - 0769525881
SN - 9780769525884
T3 - Proceedings - IEEE Symposium on Computers and Communications
SP - 429
EP - 434
BT - Proceedings - 11th IEEE Symposium on Computers and Communications, ISCC 2006
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 26 June 2006 through 29 June 2006
ER -