Characteristics of Random Walk Search on Embedded Tree Structure for Unstructured P2Ps

@article{Hieungmany2010CharacteristicsOR,
  title={Characteristics of Random Walk Search on Embedded Tree Structure for Unstructured P2Ps},
  author={Phouvieng Hieungmany and Shigeo Shioda},
  journal={2010 IEEE 16th International Conference on Parallel and Distributed Systems},
  year={2010},
  pages={782-787}
}
We propose a random-walk-based file search for unstructured P2P networks. In the proposal, each node keeps two pieces of information, one is on the hop-limited shortest path tree rooted at itself and the other is on the indexes of files owned by neighbor nodes, referred to as the file list. A random-walk search is conducted along the concatenation of hop limited shortest path trees. To find a file, a node first checks its file list. If the requested file is found in the list, the node sends the… CONTINUE READING

Similar Papers

Loading similar papers…