Advertisement

Numerical Evaluation of the Random Walk Search Algorithm

  • Arkadiusz Biernacki
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 59)

Abstract

In the paper we propose numerical evaluation of Random Walk Search Algorithm (RWSA) which is one of the algorithms used for resource localization in peer-to-peer overlay networks. As a tool for the evaluation we choseMarkov Chain. Each state of the chain represents a single random walker residing in particular network node. Using Markov Chain theory it is relatively simple to calculate basic statistical property of the RWSA for a single walker i.e. mean search time. In the analysis we included several scenarios using different network topology parameters and variable number of resource copies placed in network nodes. The calculated statistic may be useful in tuning the RWSA parameters to a given network topology.

Keywords

contend delivery networks P2P networks information retrieval 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bisnik, N., Abouzeid, A.: Modeling and analysis of random walk search algorithms in P2P networks. In: Proceedings of the 2nd International Workshop on Hot Topics in Peer-to-Peer Systems, pp. 95–103. IEEE Computer Society, Washington (2005)CrossRefGoogle Scholar
  2. 2.
    Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1 (2004)Google Scholar
  3. 3.
    Gkantsidis, C., Mihail, M., Saberi, A.: Hybrid search schemes for unstructured peer-to-peer networks. In: Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3 (2005)Google Scholar
  4. 4.
    Grinstead, C.M., Snell, J.L.: Introduction to Probability. American Mathematical Society (1997)Google Scholar
  5. 5.
    Kaj, I., Gaigalas, R.: Waxman topology generator (2005), http://www.math.uu.se
  6. 6.
    Kalogeraki, V.: A local search mechanism for Peer-to-Peer networks. In: Proceedings of the 11th International Conference on Information and Knowledge Management, p. 300. Association for Computing Machinery (2002)Google Scholar
  7. 7.
    Knuth, D.E.: The Art Of Computer Programming, 3rd edn., vol. 1. Addison-Wesley, Boston (1997)Google Scholar
  8. 8.
    Risson, J., Moors, T.: Survey of research towards robust peer-to-peer networks: Search methods. Computer Networks 50(17), 3485–3521 (2006)zbMATHCrossRefGoogle Scholar
  9. 9.
    Tsoumakos, D., Roussopoulos, N.: Adaptive probabilistic search for peer-to-peer networks. In: Proceedings of the 3rd International Conference on Peer-to-Peer Computing, pp. 102–109 (2003)Google Scholar
  10. 10.
    Tsoumakos, D., Roussopoulos, N.: A comparison of Peer-to-Peer search methods. In: WebDB (2003)Google Scholar
  11. 11.
    Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (1988)CrossRefGoogle Scholar
  12. 12.
    Wu, B., Kshemkalyani, A.D.: Modeling message propagation in random graph networks. Computer Communications (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Arkadiusz Biernacki
    • 1
  1. 1.Institute of InformaticsSilesian University of TechnologyGliwicePoland

Personalised recommendations