Research Article Open Access

Improving Computation Power by Reducing Query Response Time in Peer-to-Peer Environment

Velvizhi Nandagopal1 and D. Manjula1
  • 1 ,
Journal of Computer Science
Volume 7 No. 3, 2011, 434-439

DOI: https://doi.org/10.3844/jcssp.2011.434.439

Submitted On: 24 February 2011 Published On: 9 March 2011

How to Cite: Nandagopal, V. & Manjula, D. (2011). Improving Computation Power by Reducing Query Response Time in Peer-to-Peer Environment. Journal of Computer Science, 7(3), 434-439. https://doi.org/10.3844/jcssp.2011.434.439

Abstract

Problem statement: The Peer-to-Peer (P2P) was an emerging model and was being widely adopted in today’s internet computing.P2P traffic contributes the largest portion of the internet traffic which was unnecessary and led to delay. In existing Scalable Bipartite Overlay (SBO) network, Out of “N” peers, one group of peers were probing the messages (or) queries whereas the other group of peers were computing. This resulted in high query response time .Since the system was bipartite all peers were not capable of computing and probing, resulting in increased computation time. Approach: To overcome the above issue we propose a system RQR (Reduction on query response time) which is decentralized and unstructured where each and every peer can perform both probing and computing with no restrictions. Results: Optimal path finding algorithm is designed to find all possible path existing in the P2P network along with the optimal path. Conclusion: Our comparison with earlier approaches show that less than 60% of reduction on query response time which increases the system performance.

  • 959 Views
  • 1,653 Downloads
  • 0 Citations

Download

Keywords

  • Unstructured Peer-to-Peer (P2P)
  • query response time
  • decentralized architecture
  • Scalable Bipartite Overlay (SBO)
  • optimal path