Performance of random walks in one-hop replication networks

DOI10.1016/j.comnet.2009.10.006zbMath1213.68095arXiv0908.0601OpenAlexW2097007251MaRDI QIDQ975046

B. E. Eshmatov

Publication date: 8 June 2010

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.0601

zbMATH Keywords

random-walkaverage search lengthaverage search timelook-ahead networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

Improving resource location with locally precomputed partial random walks ⋮ A model of self‐avoiding random walks for searching complex networks

This page was built for publication: Performance of random walks in one-hop replication networks