Abstract

The Peer-to-Peer system has the potential capacity in building an efficient unified network structure for location based secure data transfer with information sharing and minimizing the failure factor. In this study we define the data transfer with certain futuristic characters that will provide data sharing strength for the users to understand the efficiency with which the data reaches the end node or users. For this purpose we have used specific QoS metric tools like, bandwidth, lookup time, delay, response time and trip time that will help in data sharing. This study concentrates on the search operation on the P2P network for data retrieval. Replication strategy is used in order to increase the probability of successful search. The lookup search employed in this regard uses two type of search namely ring and binary search. The efficiency aspect of data transfer in this study raises the importance of the system compared with the earlier system. The performance analysis will clearly chat out the quality of this system of data sharing and searching. Evaluations have shown a positive sign in the functioning of the proposed system.

Keywords:

Content shared model, data sharing, peer-to-peer, QoS, replication, retrieval,

References

1. Agosti, M., M. Amoretti, F. Zanichelli and G. Conte, 2008. P2PPAM: A framework for peer-to-peer architecture modeling based on PeerSim. Proceeding of 1st ICST/ACM International Conference on Simulation Tools and Techniques for Communications, Networks and Systems (SIMUTools 2008), pp: 1-10.
   CrossRef    
2. Aleksandra, K., L. Nicolas and S. Ralf, 2007. Globase.KOM-A P2P overlay for fully retrievable location-based search. Proceeding of the 7th IEEE International Conference on Peer-to-Peer Computing, pp: 87-94.
   
3. Alex, F., K. Eliasn and H.P. Crististos, 2002. Heuristically optimized trade- offs: A new paradigm for power laws in the internet. Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP '02), pp: 110-122.
   
4. Chyouhwa, C. and T. Kun-Cheng, 2008. The server reassignment problem for load balancing in structured P2P systems. IEEE T. Parall. Distr., 19(2): 234-246.
   CrossRef    
5. Ea, Q., L. Pei and C. Edith, 2002. Search and replication in unstructured peer-to-peer networks. Proceedings of the 16th International Conference on Supercomputing (ICS'02), pp: 84-95.
   
6. Fina, E.C. and S. Shenker, 2002. Replication strategies in unstructured peer-to-peer networks. Proceedings of the 2002 Conference on Applications, Technologies, Architectures and Protocols for Computer Communications (SIGCOMM'02), pp: 177-190.
   
7. Gang, C., P.L. Chor and Y. Zhonghua, 2008. Coordinated service provision in peer-to-peer environments. IEEE T. Parall. Distr., 1(4): 433-446.
   CrossRef    
8. Gian, P.J., 2006. Peer-Sim HOWTO: Build a Topology for PeerSim1.0. Retrieved form: http://peersim. sourceforge.net. pp: 1-11.
   
9. Hai, Z. and F. Liang, 2008. Distributed suffix tree overlay for peer-to-peer search. IEEE T. Knowl. Data En., 20(2): 276-285.
   CrossRef    
10. Hai, J., Y. Hong, L. Xiaofei, Y. Sirui and L.Y.J. Wei, 2007. PKTown: A peer-to-peer middleware to support multiplayer online games. Proceeding of IEEE International Conference on Multimedia and Ubiquitous Engineering (MUE'07), pp: 54-59.
    
11. Haiying, S., 2009. Efficient and effective file replication in structured P2P file sharing systems. Proceeding of IEEE 9th International Conference on Peer-to-Peer Computing (P2P '09), pp: 159-162.
    
12. Ioannis, K., T. Dimitrios and K. Nectarios, 2009. Measuring the cost of online load-balancing in distributed range-queriable systems. Proceeding of 9th IEEE International Conference on Peer-to-Peer Computing (P2P'09), pp: 135-138.
    
13. Kalman, G., S. Dominik, R. Julius and K.R.S. Aleksandra, 2009. Monitoring and management of structured peer-to-peer systems. Proceeding of 9th IEEE International Conference on Peer-to-Peer Computing (P2P'09), pp: 311-320.
    
14. Keno, A., A. Auedi, G. Michael and W. Roger, 2004. Aggregating information in peer-to-peer systems for improved join and leave. Proceedings of the 4th IEEE International Conference on Peer-to-Peer Computing (P2P'04), pp: 227-234.
    
15. Michalis, F., F. Petros and F. Christos, 1999. On power-law relationships of the internet topology. Proceedings of the Conference on Applications, Technologies, Architectures and Protocols for Computer Communication (SIGCOMM '99), pp: 251-262.
    
16. Miguel, C., C. Manuel and R. Antony, 2004. Performance and dependability of structured peer-to-peer overlays. Proceeding of the IEEE International Conference on Dependable Systems and Networks (DSN'04), pp: 9-18.
    
17. Moritz, S., E. Taoufik and W.B. Ernst, 2007. Analyzing Peer Bebavior in KAD. Eurecom Sophia Antipolis. pp: 1-14. Retreieved form: http://research. microsoft.com/.
    Direct Link
18. Noam, B., B. Bela, B. Christian, C. Jennifer and R. Oliver, 2007. Degree distribution of the FKP network model. J. Theor. Comput. Sci., 379(3): 306-316.
    CrossRef    
19. Sergio, B.M., E. Correia and B. Pedro, 2007. Storage and retrieval on P2P networks: A DHT based protocol. Proceeding of 12th IEEE Symposium on Computers and Communications (ISCC, 2007), pp: 623-629.
    
20. Tian, J., L. Yang, J. Li and Z. Liu, 2009. A Distributed and Monitoring-based Mechanism for Discouraging Free Riding in P2P Network. Proceeding of Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns (COMPUTATIONWORLD '09), pp: 379-384.
    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is 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, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.