Performance of random walks in one-hop replication networks

Computer Networks

Volumn 54, Issue 5, 2010, Pages 781-796

  Rodero Merino, Luis ^a   Anta, Antonio Fernández ^b   López, Luis ^b   Cholvi, Vicent ^c  

^a TELEFONICA RESEARCH   (Spain)

^b UNIVERSIDAD REY JUAN CARLOS   (Spain)

^c UNIVERSITAT JAUME I   (Spain)

Author keywords

Average search length; Average search time; Look ahead networks; Random walk

Indexed keywords

AVERAGE COVERAGE; AVERAGE SEARCH LENGTHS; AVERAGE SEARCH TIME; DEGREE DISTRIBUTIONS; LOCAL INFORMATION; LOOK-AHEAD; NETWORK CONSTRUCTION; NETWORK COVERAGE; NETWORK TOPOLOGY; PROCESSING POWER; QUEUING THEORY; RANDOM NETWORK; RANDOM SAMPLING; RANDOM WALK; RESEARCH COMMUNITIES; RESOURCE LOCATION; ROUTING DECISIONS; SEARCH MECHANISM; STATISTICAL PROPERTIES;

ELECTRIC NETWORK TOPOLOGY; ESTIMATION; GAME THEORY; PROBABILITY DENSITY FUNCTION; QUEUEING THEORY;

SAMPLING;

EID: 77549085256     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2009.10.006     Document Type: Article

References (35)

1. C. Gkantsidis, M. Mihail, A. Saberi, On the random walk method for p2p networks, in: Proceedings of the Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2004, vol. 1, Hong Kong, 2004, pp. 148-159.
2. Y. Chawathe, S. Ratnasamy, N. Lanham, S. Shenker, Making Gnutella-like P2P systems scalable, in: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2003), Karlsruhe, Germany, 2003, pp. 407-418.
3. Q. Lv, P. Cao, E. Cohen, K. Li, S. Shenker, Search and replication in unstructured peer-to-peer networks, in: Proceedings of the Sixteenth International Conference on Supercomputing, New York, New York, United States, 2005, pp. 84-95.
4. Q. Lv, S. Ratnasamy, S. Shenker, Can heterogeneity make Gnutella scalable? in: Revised Papers from the First International Workshop on Peer-to-Peer Systems, Cambridge, United States, 2002, pp. 94-103.
5. N. Bisnik, A. Abouzeid, Modeling and analysis of random walk search algorithms in p2p networks, in: Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P 2005), IEEE Computer Society, 2005, pp. 95-103.
6. I. Mabrouki, X. Lagrange, G. Froc, Random walk based routing protocol for wireless sensor networks, in: Proceedings of the Second International Conference on Performance Evaluation Methodologies and Tools (ValueTools '07), ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), 2007, pp. 1-10.
7. M. Alanyali, V. Saligrama, O. Savas, A random-walk model for distributed computation in energy-limited networks, in: Proceedings of the First Workshop on Information Theory and its Application, 2006.
8. Dolev S., Schiller E., and Welch J.L. Random walk for self-stabilizing group communication in ad hoc networks. IEEE Transactions on Mobile Computing 5 7 (2006) 893-905
9. C. Law, K.-Y. Siu, Distributed construction of random expander networks, in: Proceedings of the Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), vol. 3, 2003, pp. 2133-2143.
10. Sadagopan N., Krishnamachari B., and Helmy A. Active query forwarding in sensor networks. Ad Hoc Networks 3 (2005) 91-113
11. Feige U. A tight lower bound on the cover time for random walks on graphs. Random Structures and Algorithms 6 (1995) 433-438
12. Kahn J.D., Linial N., Nisan N., and Saks M.E. On the cover time of random walks on graphs. Journal of Theoretical Probability 2 1 (1989) 121-128
13. D. Zuckerman, A technique for lower bounding the cover time, in: Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing, 1990, pp. 254-259.
14. Aldous D.J. Lower bounds for covering times for reversible markov chains and random walks. Journal of Theoretical Probability 2 1 (1989) 91-100
15. Motwani R., and Raghavan P. Markov Chains and Random Walks (1995), Cambridge University Press pp. 127-160, (Chapter 6)
16. G. Barnes, U. Feige, Short random walks on graphs, in: Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing (STOC 93), ACM Press, 1993, pp. 728-737.
17. Brightwell G., and Winkler P. Maximum hitting time for random walks on graphs. Random Structures and Algorithms 1 (1989) 263-276
18. L. Lovász, Random walks on graphs: A survey.
19. C. Gkantsidis, M. Mihail, A. Saberi, Random walks in peer-to-peer networks, in: Proceedings of the Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2004, vol. 1, Hong Kong, 2004, pp. 120-130.
20. Adamic L.A., Huberman B.A., Lukose R.M., and Puniyani A.R. Search in power law networks. Physical Review E 64 (2001) 46135-46143
21. Newman M.E.J., Strogatz S.H., and Watts D.J. Random graphs with arbitrary degree distributions and their applications. Physical Review E 64 2 (2001) 026118-1,026118-17
22. G.S. Manku, M. Naor, U. Wieder, Know thy neighbor's neighbor: the power of lookahead in randomized p2p networks, in: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), ACM Press, 2004, pp. 54-63.
23. V. Cholvi, P.A. Felber, E.W. Biersack, Efficient search in unstructured peer-to-peer networks, in: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, Barcelona, Spain, 2004, pp. 271-272.
24. M. Mihail, A. Saberi, P. Tetali, Random walks with lookahead in power law random graphs, Internet Mathematics 3.
25. A. Sinclair, Improved bounds for mixing rates of marked chains and multicommodity flow, in: Lecture Notes in Computer Science, Proceedings of the 1st Latin American Symposium on Theoretical Informatics (LATIN 92), vol. 583, Springer-Verlag, 1992, pp. 474-487.
26. A. Tahbaz-Salehi, A. Jadbabaie, Small world phenomenon, rapidly mixing markov chains, and average consensus algorithms, in: Proceedings of the 46th IEEE Conference on Decision and Control, IEEE Computer Society, 2007, pp. 276-281.
27. Gkantsidis C., Mihail M., and Saberi A. Conductance and congestion in power law graphs. ACM SIGMETRICS Performance Evaluation Review 31 (2003) 148-159
28. Broder A., Kumar R., Maghoul F., Raghavan P., Rajagopalan S., Stata R., Tomkins A., and Wiener J. Graph structure in the web. Computer Networks: The International Journal of Computer and Telecommunications Networking 33 (2000) 309-320
29. Krapivsky P.L., and Redner S. Organization of growing random networks. Physical Review E 63 (2001) 066123
30. Bollobás B. Random Graphs. second ed. (2001), Cambridge University Press
31. Barabási A.-L., and Albert R. Emergence of scaling in random networks. Science 286 (1999) 509,51
32. Albert R., and Barabási A.-L. Statistical mechanics of complex networks. Reviews of Modern Physics 74 (2002) 47-97
33. W. Stallings, A practical guide to queuing analysis, 2000. ; URL .
34. Giambene G. Queuing Theory and Telecommunications: Networks and Applications (2005), Springer
35. S. Saroiu, P.K. Gummadi, S.D. Gribble, A measurement study of peer-to-peer file sharing systems, in: Proceedings of SPIE Multimedia Computing and Networking 2002, MMCN'02, vol. 4673, 2002, pp. 156-170.