An enhanced random-walk method for content locating in P2P networks

Ronasi, K ; Sharif University of Technology | 2007

200 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICDCSW.2007.21
  3. Publisher: 2007
  4. Abstract:
  5. The important problem of content location in an unstructured distributed network (such as P2P, with no central searching system, graph construction control or file placement regulation) is addressed. The existing methods that are based on either flooding or random walk impose a large traffic load on the network or require a long time to search. In this work, we propose a method that outperforms the existing methods in both of these measures. These advantages are achieved by publishing traces of the contents of each node in its nearby nodes, so that the closer nodes to the target have a stronger trace of it. Such traces are used to rapidly locate the desired content. The superb performance of our method, both in time and bandwidth, is demonstrated by simulations whose results are reported. © 2007 IEEE
  6. Keywords:
  7. Bandwidth ; Computational methods ; Computer simulation ; Distributed computer systems ; Graph theory ; Graph construction ; Traffic load ; Network protocols
  8. Source: 27th International Conference on Distributed Computing Systems Workshops, ICDCSW'07, Toronto, ON, 22 June 2007 through 29 June 2007 ; 2007 ; 0769528384 (ISBN); 9780769528380 (ISBN)
  9. URL: https://ieeexplore.ieee.com/document/4279015