Abstract
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.
This research was supported in part by Comunidad de Madrid grant S2009TIC-1692, Spanish MICINN grant TEC2011-29688-C02-01, Spanish MEC grant TIN2011-28347-C02-01 and Bancaixa grant P11B2010-28.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lada, A., Adamic, R.M., Lukose, A.R.: Puniyani, and Bernardo A. Huberman. Search in power-law networks. Physical Review E 64(046135) (2001)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th International Conference on Supercomputing, ICS 2002, pp. 84–95. ACM, New York (2002)
Yang, S.-J.: Exploring complex networks by walking on them. Physical Review E 71(016107) (2005)
Gkantsidis, C., Mihail, M., Saberi, A.: Random-walks in peer-to-peer networks: algorithms and evaluation. Performance Evaluation 63, 241–263 (2006)
Rodero-Merino, L., Fernández Anta, A., López, L., Cholvi, V.: Performance of random walks in one-hop replication networks. Computer Networks 54(5), 781–796 (2010)
Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N., Braynard, R.: Networking named content. Commun. ACM 55(1), 117–124 (2012)
Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. Internet Mathematics 1(4), 485–509 (2004)
Sarma, A.D., Nanongkai, D., Pandurangan, G., Tetali, P.: Distributed random walks. J. ACM 2, 2:1–2:31 (2013)
Hieungmany, P., Shioda, S.: Characteristics of random walk search on embedded tree structure for unstructured p2ps. In: International Conference on Parallel and Distributed Systems, pp. 782–787 (2010)
Millán, V.M.L., Cholvi, V., López, L., Fernández Anta, A.: Resource location based on partial random walks in networks with resource dynamics. In: Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems, TADDS 2012, pp. 26–31. ACM, New York (2012)
Millán, V.M.L., Cholvi, V., López, L., Fernández Anta, A.: Improving resource location with locally precomputed partial random walks. arXiv:1304.5100 (2013)
Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications. Physical Review E 64(026118) (2001)
Millán, V.M.L., Cholvi, V., López, L., Fernández Anta, A.: A model of self-avoiding random walks for searching complex networks. Networks 60(2), 71–85 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López Millán, V.M., Cholvi, V., López, L., Fernández Anta, A. (2013). Improving Resource Location with Locally Precomputed Partial Random Walks. In: Gramoli, V., Guerraoui, R. (eds) Networked Systems. NETYS 2013. Lecture Notes in Computer Science, vol 7853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40148-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-40148-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40147-3
Online ISBN: 978-3-642-40148-0
eBook Packages: Computer ScienceComputer Science (R0)