Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks

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 r...

• Type: Conference
• Year: 2010
• Where: CCGRID
• Authors: Imen Filali, Fabrice Huet
• Keywords: Blind Flooding, CCGRID 2010, Distributed And Parallel Computing, Random Walks, Unstructured Peer-to-peer Networks