Dynamic TTL-Based Search In Unstructured Peer-to-Peer Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

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


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 scheme is a dynamic Time-To-Live (TTL) enabling 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
Fichier principal
Vignette du fichier
main.pdf (477.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00485790 , version 1 (21-05-2010)


  • HAL Id : inria-00485790 , version 1


Imen Filali, Fabrice Huet. Dynamic TTL-Based Search In Unstructured Peer-to-Peer Networks. CCGrid 2010, May 2010, Melbourne, Australia. 10 p. ⟨inria-00485790⟩
163 View
288 Download


Gmail Facebook Twitter LinkedIn More