Improving the Search Mechanism for Unstructured Peer-to-Peer Networks Using the Statistical Matrix Form

@article{Lin2015ImprovingTS,
  title={Improving the Search Mechanism for Unstructured Peer-to-Peer Networks Using the Statistical Matrix Form},
  author={Chia-Hung Lin and Jing-Jia Zseng and Sun-Yuan Hsieh},
  journal={IEEE Access},
  year={2015},
  volume={3},
  pages={926-941}
}
In a traditional file search mechanism, such as flooding, a peer broadcasts a query to its neighbors through an unstructured peer-to-peer (P2P) network until the time-to-live decreases to zero. A major disadvantage of flooding is that, in a large-scale network, this blind-choice strategy usually incurs an enormous traffic overhead. In this paper, we propose a method, called the statistical matrix form (SMF), which improves the flooding mechanism by selecting neighbors according to their… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

Fuzzy Query Routing in Unstructured Mobile Peer-to-Peer Networks

2016 IEEE Tenth International Conference on Semantic Computing (ICSC) • 2016
View 5 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 66 references

Searching with Multiple Random Walk Queries

2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications • 2007
View 13 Excerpts
Highly Influenced

On the Benefits of Cooperative Proxy Caching for Peer-to-Peer Traffic

IEEE Transactions on Parallel and Distributed Systems • 2010
View 4 Excerpts
Highly Influenced

Directional-random-walkbased contents search for unstructured P2P systems

P. Hieungmany, T. Souma, S. Shioda
IEICE Trans. Commun., vol. J98-B, no. 2, pp. 132–140, 2015. • 2015
View 1 Excerpt

Clustering for distributing cached contents in P2P file sharing application

K. Yokota, T. Nakagawa, T. Isogai, T. Asaka, T. Takahashi
IEICE Trans. Commun., vol. J95-B, no. 2, pp. 178–187, 2012. • 2012
View 1 Excerpt

Similar Papers

Loading similar papers…