IMDEA Networks Institute Publications Repository

Improving Resource Location with Locally Precomputed Partial Random Walks

López Millán, Víctor M. and Cholvi, Vicent and López, Luis and Fernández Anta, Antonio (2013) Improving Resource Location with Locally Precomputed Partial Random Walks. In: The 1st International Conference on Networked Systems (NETYS 2013), 2 - 4 May 2013, Marrakech, Morocco.

PDF (Improving Resource Location with Locally Precomputed Partial Random Walks) - Published Version
Download (1094Kb) | Preview


Random walks can be used to search complex networks for a desired resource. To reduce search lengths, we propose a mechanism based on building random walks connecting together partial walks (PW) previously computed at each network node. Resources found in each PW are registered. Searches can then jump over PWs where the resource is not located. However, we assume that perfect recording of resources may be costly, and hence, probabilistic structures like Bloom filters are used. Then, unnecessary hops may come from false positives at the Bloom filters. Two variations of this mechanism have been considered, depending on whether we first choose a PW in the current node and then check it for the resource, or we first check all PWs and then choose one. In addition, PWs can be either simple random walks or self-avoiding random walks. Analytical models are provided to predict expected search lengths and other magnitudes of the resulting four mechanisms. Simulation experiments validate these predictions and allow us to compare these techniques with simple random walk searches, finding very large reductions of expected search lengths.

Item Type: Conference or Workshop Papers (Paper)
Additional Information: V. Gramoli and R. Guerraoui (Eds.): NETYS 2013, LNCS 7853, pp. 144–158, 2013. Springer-Verlag Berlin Heidelberg 2013
Depositing User: Antonio Fernandez
Date Deposited: 10 Sep 2013 12:10
Last Modified: 03 Mar 2014 09:05

Actions (login required)

View Item View Item