CFP last date
22 April 2024
Reseach Article

Knowledge and Cache based Adaptive Query Searching in Unstructured P2P Networks

by G. Ramachandran, K. Selvakumar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 48 - Number 11
Year of Publication: 2012
Authors: G. Ramachandran, K. Selvakumar
10.5120/7390-0247

G. Ramachandran, K. Selvakumar . Knowledge and Cache based Adaptive Query Searching in Unstructured P2P Networks. International Journal of Computer Applications. 48, 11 ( June 2012), 4-12. DOI=10.5120/7390-0247

@article{ 10.5120/7390-0247,
author = { G. Ramachandran, K. Selvakumar },
title = { Knowledge and Cache based Adaptive Query Searching in Unstructured P2P Networks },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 48 },
number = { 11 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 4-12 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume48/number11/7390-0247/ },
doi = { 10.5120/7390-0247 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:43:47.648393+05:30
%A G. Ramachandran
%A K. Selvakumar
%T Knowledge and Cache based Adaptive Query Searching in Unstructured P2P Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 48
%N 11
%P 4-12
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Efficient search is a challenging task in unstructured peer-to-peer networks. In this paper, Knowledge and Cache based Adaptive Query Searching (KCAQS) is proposed that adaptively performs a query searching through either directed flooding or biased random walk based on the number of hop counts in query message. In addition, knowledge intended forwarding is deployed for forwarding a query to the high quality peers through probabilistic knowledge predicted from the previously requested queries. Searched results are properly cached in the peers along the returning path. Synchronized caching is performed to properly update the responses of each peer to its connected corresponding high degree connectivity peer in the overlay network. Due to caching of the same files in many peers, most of the cached responses may become redundant. In order to avoid redundant data, cache consistency is sustained through the flexible polling mechanism where a proper cache update is performed through Additive Decrease Multiplicative Increase (ADMI) algorithm based on file utility. Our experimental study shows that the proposed searching scheme significantly reduces the network search traffic and communication overhead. Performance metrics such as success rate, access latency, network traffic response time and cache hit ratio are evaluated for the proposed scheme.

References
  1. Dejan S. Milojicic, Vana Kalogeraki, Rajan Lukose, Kiran Nagaraja, Jim Pruyne, Bruno Richard, Sami Rollins , Zhichen Xu, 2003. Peer-to-Peer Computing, Technical Report, Hewlett-Packard.
  2. Choon Hoong Ding, Sarana Nutanong, and Rajkumar Buyya, 2003. Peer-to-Peer Networks for Content Sharing, Technical Report on Grid Computing and Distributed Systems Laboratory, University of Melbourne, Australia.
  3. Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, 2003. Making Gnutella like P2P Systems Scalable, Proceedings of the International conference on Applications, technologies, architectures, and protocols for computer communications, New York, NY, USA.
  4. S Schmid, R Wattenhofer, 2007. Structuring unstructured peer-to-peer networks, Proceedings of the 14th Annual IEEE International Conference on High Performance Computing (HiPC).
  5. William Acosta Surendar Chandra, 2005. Unstructured Peer­to­Peer Networks ­ Next Generation of Performance and Reliability, Proceedings of the Twenty-fourth Annual Joint Conference of the IEEE Computer and Communications Societies.
  6. Özgür Ulusoy, 2007. Research Issues in Peer-to-Peer Data Management, Proceedings of 22nd International symposium on computer and information sciences.
  7. Qin Lv, Pei Cao, Edith Cohen, Kai Li ,Scott Shenker, 2002. Search and Replication in Unstructured Peer-to-Peer Networks, Proceedings of the 16th international conference on Supercomputing.
  8. Christos Gkantsidis, Milena Mihail, and Amin Saberi, 2004. Random Walks in Peer-to-Peer Networks, Proceedings of the Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies.
  9. Ming Zhong, Kai Shen, 2009. Popularity Biased Random Walks for PeertoPeer Search under the Square Root Principle, In the proceedings of 5th International Workshop on Peer to Peer Systems.
  10. Gang Chen, Chor Ping Low, and Zhonghua Yang, 2008. Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest, IEEE Transactions on Parallel and Distributed Systems, Volume 19, Issue: 6 , pp: 821 - 836.
  11. Kai-Hsiang Yang, Chi-Jen Wu and Jan-Ming Ho, 2006. Ant Search: An Ant Search Algorithm in Unstructured Peer-to- Peer Networks, Proceedings of 11th IEEE Symposium on Computers and Communications.
  12. Lakshmish Ramaswamy and Jianxia Chen, 2008. The CoQUOS Approach to Continuous Queries in Unstructured Overlays, IEEE Transactions on Parallel and Distributed Systems, Volume 19, Issue: 6 , pp: 821 - 836.
  13. Song Jiang, Lei Guo, Xiaodong Zhang, and Haodong Wang, 2008. Light Flood: Minimizing Redundant Messages and Maximizing the Scope of Peer-to-Peer Search, IEEE Transactions on Parallel and Distributed Systems, Volume 19, Issue: 5, pp: 601-614.
  14. Vicent Cholvi, Pascal Felber and Ernst Biersack, 2004. Efficient search in unstructured peer-to-peer networks, Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures.
  15. Lada A. Adamic, Rajan M. Lukose, Amit R. Puniyani and Bernardo A. Huberman, 2001. Search in power-law networks, International Journal on Networking and Internet Architecture, Volume: 64, Issue: 4.
  16. Tsungnan Lin, Pochiang Lin, Hsinping Wang, and Chiahung Chen, 2008. Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks, IEEE Transactions on Parallel and Distributed Systems, Volume 20, Issue: 5, pp: 654 – 666.
  17. Dimitrios Tsoumakos, Nick Roussopoulos, 2003. Adaptive Probabilistic Search (APS) for Peer-to-Peer Networks, Proceedings of the Third International Conference on Peer-to-Peer Computing.
  18. Chen Wang, Li Xiao, Yunhao Liu, and Pei Zheng, 2006. DiCAS: An Efficient Distributed Caching Mechanism for P2P Systems, IEEE Transactions on Parallel and Distributed Systems, Volume 7, Issue: 10, pp: 1097- 1109.
  19. Haiying Shen, 2010. IRM: Integrated File Replication and Consistency Maintenance in P2P Systems, IEEE Transactions On Parallel And Distributed Systems, Volume 21, Issue 5, pp:100-113.
  20. Matei Ripeanu, Ian Foster, 2001. Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems, Proceedings of the Revised Papers from the First International Workshop on Peer-to-Peer Systems.
  21. Hsinping Wang' and Tsungnan Lin, 2005. On Efficiency in Searching Networks, Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Index Terms

Computer Science
Information Sciences

Keywords

Unstructured Peer To Peer Networks Blind Search Caching Technique Efficient Search