DocumentCode :
2766088
Title :
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Author :
Filali, Imen ; Huet, Fabrice
Author_Institution :
INRIA Sophia-Antipolis, Univ. de Nice Sophia-Antipolis, Sophia-Antipolis, France
fYear :
2010
fDate :
17-20 May 2010
Firstpage :
438
Lastpage :
447
Abstract :
Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorithms used in such systems. Blind flooding is not scalable because of its high communication cost. On the other hand, the performance of random walks approaches largely depends on the random choice of walks. Some informed mechanisms use additional information, usually obtained from previous queries, for routing. Such approaches can reduce the traffic overhead but they limit the query coverage. Furthermore, they usually rely on complex protocols to maintain information at each peer. In this paper, we propose two schemes which can be used to improve the search performance in unstructured peer-to-peer networks. The first one is a simple caching mechanism based on resource descriptions. Peers that offer resources send periodic advertisement messages. These messages are stored into a cache and are used for routing requests. The second is a dynamic Time-To-Live (TTL) which enables messages to break their horizon. Instead of decreasing the query TTL by 1 at each hop, it is decreased by a value v such as 0
Keywords :
Clouds; Costs; Distributed computing; Floods; Grid computing; Network topology; Peer to peer computing; Protocols; Routing; Telecommunication traffic; Dynamic-TTL; P2P computing; Resource discovery; Unstructured Peer-to-Peer networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cluster, Cloud and Grid Computing (CCGrid), 2010 10th IEEE/ACM International Conference on
Conference_Location :
Melbourne, Australia
Print_ISBN :
978-1-4244-6987-1
Type :
conf
DOI :
10.1109/CCGRID.2010.66
Filename :
5493453
Link To Document :
بازگشت