An Enhanced Random-walk Method for Content Locating in P2P Networks

Abstract

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.

Bacterial foraging search in unstructured P2P networks

“…In Local Index (LI) algorithm, each node is aware of the available contents of all nodes within radius r from itself and answers the query if it has any information about it. In [28] a variation of LI is proposed in which each node knows its distance from the content source and the query is forwarded to a neighbor that is closer to the source. Routing Index (RI) algorithm is a method in which files are classified into a number of categories.…”

A Robust Unstructured Mobile Peer-to-Peer Files Sharing System under Higher Peer Churn Rate

“…Reference [5][6][7][8][9][10][11] proposed an adaptive probabilistic search algorithm. This method computes each peer's forward probability using the peer's index value for a specific query object.…”

Link Delay Estimation via Expander Graphs

“…For example, active tools such as a ping or a trace route, measure and report attributes of the round-trip path from a sender to the internal node based on probe packets [7]. Beside complexity, the challenges of such methods arise from the fact that service providers do not own the entire network that is being probed and hence do not have access to the desired internal nodes for appropriate configuration [8], [9], [10]. • End-to-End: In networks with a defined boundary, it is assumed that access is available to nodes at the edge (but not to any in the interior).…”

“…An example of 1-identifiable network whose corresponding bipartite graph is not left regular. (a) Network topology (b) Bipartite graph corresponding to the routing matrix R in Eq (10).…”