| Peer-Reviewed

Textual Based Retrieval System with Bloom in Unstructured Peer-to-Peer Networks

Received: 11 May 2013     Published: 20 June 2013
Views:       Downloads:
Abstract

P2P network is the best and popular network sharing of contents by the user through internet. Bloom Cast is an efficient technique used for full-text retrieval scheme in unstructured P2P networks. By using the fullest of a hybrid P2P protocol, Bloom Cast makes copies of the contents in the network uniformly at a random across the P2P networks in order to achieve a guaranteed recall at a communication cost of the network. Bloom Cast model works only when the two constraints are met: 1) the query replicas and document replicas are randomly and uniformly distributed across the P2P network; and 2) every peer knows N, the size of the network. To support random node sampling and network size estimation, Bloom Cast mixes a lightweight DHT into an unstructured P2P network. Further to reduce the replication cost, Bloom Cast utilizes Bloom Filters to encode the entire document. Bloom Cast hybridizes a lightweight DHT with an unstructured P2P overlay to support random node sampling and network size estimation. Since P2P networks are self-configuring networks with minimal or no central control, P2P networks are more vulnerable to malwares, malicious code, viruses, etc., than the traditional client-server networks, due to their lack of structure and unmanaged nature. All peers in a P2P network is identified by its identity certificates (aka identity). The identity here is attached to the repudiation of a given peer. Self-certification helps us to generate the identity certificate, thus here all the peers maintain their own and hence trusted certificate authority which issues the identity certificate to the peer.

Published in American Journal of Networks and Communications (Volume 2, Issue 3)
DOI 10.11648/j.ajnc.20130203.12
Page(s) 62-66
Creative Commons

This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.

Copyright

Copyright © The Author(s), 2013. Published by Science Publishing Group

Keywords

Bloom Cast, Bloom Filters, Self-Certification, Self-Configuring Networks, Unstructured P2P Network

References
[1] E. Cohen and S. Shenker, "Replication Strategies in Unstructured Peer-to-Peer Networks," Proc. ACM SIGCOMM ’02. pp. 177-190, 2002.
[2] H. Shen, Y. Shu, and B. Yu, "Efficient Semantic-Based Content Search in P2P Network," IEEE Trans. Knowledge and Data Eng., vol. 16, no. 7, pp. 813-826, July 2004
[3] R.A. Ferreira, M.K. Ramanathan, A. Awan, A. Grama, and S.Jagannathan, "Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks," Proc. IEEE Fifth Int’l Conf. Peer to Peer Computing (P2P ’05), pp. 165-172, 2005.
[4] S. Robertson, "Understanding Inverse Document Frequency: On Theoretical Arguments for IDF," J. Documentation, vol. 60, pp. 503- 520, 2004.
[5] P. Reynolds and A. Vahdat, "Efficient Peer-to-Peer Keyword Searching," Proc. ACM/IFIP/USENIX 2003 Int’l Conf. Middleware (Middleware ’03), pp. 21-40, 2003.
[6] D. Li, J. Cao, X. Lu, and K. Chen, "Efficient Range Query Processing in Peer-to-Peer Systems," IEEE Trans. Knowledge and Data Eng., vol. 21, no. 1, pp. 78-91, Jan. 2008. 7. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H.Balakrishnan, "Chord: A Scalable peer-to-Peer Lookup Service for Internet Applications," Proc. ACM SIGCOMM ’01, pp. 149-160, 2001.
[7] J.P.C. Jie Lu, "Content-Based Retrieval in Hybrid Peer-to-Peer Networks," Proc. 12th Int’l Conf. Information and Knowledge Management (CIKM), pp. 199-206, 2003.
[8] E.M. Voorhees, "Overview of Trec-2009," Proc. 16th Text Retrieval Conf. (TREC-11), 2009.
[9] A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters: A Survey," Internet Math., vol. 1, no. 4, pp. 485-509, 2004.
Cite This Article
  • APA Style

    E. Mohan, S. Uvaraj, S. Suresh, U. Helen Monisha, N. Kannaiya Raja. (2013). Textual Based Retrieval System with Bloom in Unstructured Peer-to-Peer Networks. American Journal of Networks and Communications, 2(3), 62-66. https://doi.org/10.11648/j.ajnc.20130203.12

    Copy | Download

    ACS Style

    E. Mohan; S. Uvaraj; S. Suresh; U. Helen Monisha; N. Kannaiya Raja. Textual Based Retrieval System with Bloom in Unstructured Peer-to-Peer Networks. Am. J. Netw. Commun. 2013, 2(3), 62-66. doi: 10.11648/j.ajnc.20130203.12

    Copy | Download

    AMA Style

    E. Mohan, S. Uvaraj, S. Suresh, U. Helen Monisha, N. Kannaiya Raja. Textual Based Retrieval System with Bloom in Unstructured Peer-to-Peer Networks. Am J Netw Commun. 2013;2(3):62-66. doi: 10.11648/j.ajnc.20130203.12

    Copy | Download

  • @article{10.11648/j.ajnc.20130203.12,
      author = {E. Mohan and S. Uvaraj and S. Suresh and U. Helen Monisha and N. Kannaiya Raja},
      title = {Textual Based Retrieval System with Bloom in Unstructured Peer-to-Peer Networks},
      journal = {American Journal of Networks and Communications},
      volume = {2},
      number = {3},
      pages = {62-66},
      doi = {10.11648/j.ajnc.20130203.12},
      url = {https://doi.org/10.11648/j.ajnc.20130203.12},
      eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajnc.20130203.12},
      abstract = {P2P network is the best and popular network sharing of contents by the user through internet. Bloom Cast is an efficient technique used for full-text retrieval scheme in unstructured P2P networks. By using the fullest of a hybrid P2P protocol, Bloom Cast makes copies of the contents in the network uniformly at a random across the P2P networks in order to achieve a guaranteed recall at a communication cost of the network. Bloom Cast model works only when the two constraints are met: 1) the query replicas and document replicas are randomly and uniformly distributed across the P2P network; and 2) every peer knows N, the size of the network. To support random node sampling and network size estimation, Bloom Cast mixes a lightweight DHT into an unstructured P2P network. Further to reduce the replication cost, Bloom Cast utilizes Bloom Filters to encode the entire document. Bloom Cast hybridizes a lightweight DHT with an unstructured P2P overlay to support random node sampling and network size estimation. Since P2P networks are self-configuring networks with minimal or no central control, P2P networks are more vulnerable to malwares, malicious code, viruses, etc., than the traditional client-server networks, due to their lack of structure and unmanaged nature. All peers in a P2P network is identified by its identity certificates (aka identity). The identity here is attached to the repudiation of a given peer. Self-certification helps us to generate the identity certificate, thus here all the peers maintain their own and hence trusted certificate authority which issues the identity certificate to the peer.},
     year = {2013}
    }
    

    Copy | Download

  • TY  - JOUR
    T1  - Textual Based Retrieval System with Bloom in Unstructured Peer-to-Peer Networks
    AU  - E. Mohan
    AU  - S. Uvaraj
    AU  - S. Suresh
    AU  - U. Helen Monisha
    AU  - N. Kannaiya Raja
    Y1  - 2013/06/20
    PY  - 2013
    N1  - https://doi.org/10.11648/j.ajnc.20130203.12
    DO  - 10.11648/j.ajnc.20130203.12
    T2  - American Journal of Networks and Communications
    JF  - American Journal of Networks and Communications
    JO  - American Journal of Networks and Communications
    SP  - 62
    EP  - 66
    PB  - Science Publishing Group
    SN  - 2326-8964
    UR  - https://doi.org/10.11648/j.ajnc.20130203.12
    AB  - P2P network is the best and popular network sharing of contents by the user through internet. Bloom Cast is an efficient technique used for full-text retrieval scheme in unstructured P2P networks. By using the fullest of a hybrid P2P protocol, Bloom Cast makes copies of the contents in the network uniformly at a random across the P2P networks in order to achieve a guaranteed recall at a communication cost of the network. Bloom Cast model works only when the two constraints are met: 1) the query replicas and document replicas are randomly and uniformly distributed across the P2P network; and 2) every peer knows N, the size of the network. To support random node sampling and network size estimation, Bloom Cast mixes a lightweight DHT into an unstructured P2P network. Further to reduce the replication cost, Bloom Cast utilizes Bloom Filters to encode the entire document. Bloom Cast hybridizes a lightweight DHT with an unstructured P2P overlay to support random node sampling and network size estimation. Since P2P networks are self-configuring networks with minimal or no central control, P2P networks are more vulnerable to malwares, malicious code, viruses, etc., than the traditional client-server networks, due to their lack of structure and unmanaged nature. All peers in a P2P network is identified by its identity certificates (aka identity). The identity here is attached to the repudiation of a given peer. Self-certification helps us to generate the identity certificate, thus here all the peers maintain their own and hence trusted certificate authority which issues the identity certificate to the peer.
    VL  - 2
    IS  - 3
    ER  - 

    Copy | Download

Author Information
  • Pallavan College of Engineering, Kanchipuram

  • Arulmigu Meenakshi Amman College of Engineering, Kanchipuram

  • Sri Venkateswara College of Engineering, Chennai

  • Jei Mathaajee College of Engineering, Kanchipuram

  • Defence Engineering College, Ethiopia

  • Sections