Advertisement

The Journal of Supercomputing

, Volume 74, Issue 1, pp 183–204 | Cite as

A churn-aware durable data storage scheme in hybrid P2P networks

  • Xianfu Meng
Article

Abstract

Durable P2P data storage is a research focus in recent years. It aims at providing data for requesters anytime and anywhere. Considering the fact that any peer could join and leave P2P network freely and randomly, how to improve the data availability is a crucial issue when implementing a P2P data storage scheme. To guarantee data availability, data replication and replica management have been found as the effective strategies by distributing the replicas in different nodes. However, how to determine the data redundancy is a key issue which should be solved carefully. In this paper, according to the existing researches, we first calculate peers’ online probabilities in each time interval, and then we group the peers which have the complementary online patterns to create the so-called generalized peers with high online probability in each time interval. With the created generalized peers, we present the durable P2P data storage scheme. The simulation results show that our P2P data storage scheme outperforms the existing strategies in terms of the data retrieval success rate and the response time in dynamic P2P networks.

Keywords

Hybrid P2P network Durable data storage Super peer Online time interval Online probability Generalized peer 

References

  1. 1.
    DellAmico M, Michiardi P, Toka L, Cataldi P (2015) Adaptive redundancy management for durable P2P backup. Comput Netw 83:136–148CrossRefGoogle Scholar
  2. 2.
  3. 3.
    Google Drive [EB/OL]. http://drive.google.com/
  4. 4.
    Aliyun [EB/OL]. http://www.aliyun.com/
  5. 5.
    Meng X, Wang Y, Gong Y (2015) Perspective of space and time based replica population organizing strategy in unstructured peer-to-peer networks. J Netw Comput Appl 49(3):1–14CrossRefGoogle Scholar
  6. 6.
    Zhou J, Wang YJ, Li SK (2007) A multi-replica clustering management method based on limited-coding. J Softw 18(6):1456–1467Google Scholar
  7. 7.
    Zhou JY, Song AB, Luo JZ (2013) Evolutionary game theoretical resource deployment model for P2P networks. J Softw 24(3):526–539MathSciNetCrossRefGoogle Scholar
  8. 8.
    Tian J, Dai Y (2007) Study on durable peer-to-peer storage techniques. J Softw 18(6):1379–99CrossRefGoogle Scholar
  9. 9.
    Stoica I, Morris R, Karger D, Kaashoek M, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 SIGCOMM Conference, 31(4):149–160Google Scholar
  10. 10.
    Zhao B, Kubiatowicz J, Joseph A (2001) Tapestry: an infrastructure for fault-tolerant wide-area location and routing. Technical Report, UCB//CSD-01-1141, Berkeley Computer Science Division, University of CaliforniaGoogle Scholar
  11. 11.
    Ratnasamy S, Francis P, Handley M, Karp R, Schenker S (2001) A scalable content-addressable network. In: Proceedings of the ACM SIGCOMM Symposium on Communication, Architecture, and Protocols. ACM SIGCOMM, pp 161–172. http://www.acm.org/sigs/sigcomm/sigcomm/sigcomm2001/p13-ratnasamy.pdf
  12. 12.
    Rowstron A, Druschel P (2001) Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of the IFIP/ACM Int’l Conference on Distributed Systems Platforms (Middleware). pp 329–350. http://citeseer.ist.psu.edu/rowstron01pastry.html
  13. 13.
    Maymounkov P, Mazieres D (2002) Kademlia: a peer-to-peer information system based on the XOR metric. In: Proceedings of the 1st Int’l Workshop on Peer-to-Peer Systems, pp 258–263. http://citeseer.ist.psu.edu/maymounkov02kademlia.html
  14. 14.
    Pamies-Juarez L, Sanchez-Artigas M, García-López P, Mondéjar R, Chaabouni R (2014) On the interplay between data redundancy and retrieval times in P2P storage systems. Comput Netw 59:1–16CrossRefGoogle Scholar
  15. 15.
    Rodrigues R, Liskov B (2005) High availability in DHTs: erasure coding vs. replication. In: Proceedings of the 4th International Workshop on Peer-To-Peer Systems (IPTPS), pp 226–239Google Scholar
  16. 16.
    Zhang X, Wang N, Vassilakis VG, Howarth MP (2015) A distributed in-network caching scheme for P2P-like content chunk delivery. Comput Netw 91:577–592CrossRefGoogle Scholar
  17. 17.
    Trifa Z, Khemakhem M (2016) A novel replication technique to attenuate churn effects. Peer-to-peer Netw Appl 9(2):344–355CrossRefGoogle Scholar
  18. 18.
    Saroiu S, Gummad PK, Gribble SD (2002) A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimeida Conferencing and Networking. Springer, Sna Jose, USA, pp 18–25Google Scholar
  19. 19.
    Chu J, Labonte K, Levine BN (2002) Availability and locality measurements of peer-to-peer file systems. In: Proceedings of ITCom: Scalability and Traffic Control in IP Network. SPIE, Boston, USA, pp 310–321Google Scholar
  20. 20.
    Gummadi KP, Dunn RJ, Saroiu S et al (2003) Measurement, modeling, and analysis of a peer-to-peer file-sharing work load. In: Proceedings ACM SOSP Network. ACM, USA, pp 314–329Google Scholar
  21. 21.
    Bhagwan R, Savage S, and Voelker G (2003) Understanding availability. In: Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS’03)Google Scholar
  22. 22.
    Sen S, Wang J (2002) Analyzing peer-to-peer traffic across large networks. In: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet Measurement Workshop. http://citeseer.ist.psu.edu/sen02analyzing.html
  23. 23.
    Zhang YF, Lei LH, Chen CJ (2004) Characterizing peer-to-peer traffic across Internet. In: Li M et al (eds) Proceedings of the GCC 2003. LNCS 3032. Springer, Heidelberg, pp 388–395Google Scholar
  24. 24.
    Ohzahata S, Kawashima K (2011) An experimental study of peer behavior in a pure P2P network. J Syst Softw 84(1):21–8CrossRefGoogle Scholar
  25. 25.
    Liu HY (2005) Analysis of resource characteristics and user behavior in P2P file sharing system maze [MS. Thesis]. Peking University, Beijing (in Chinese with English abstract)Google Scholar
  26. 26.
    Joo SD, Lee CW, Chung YH (2004) Analysis and modeling of traffic from residential high speed Internet subscribers. In: Kahng HK, Goto S (eds) Proceedings of the ICOIN 2004. LNCS 3090. Springer, Heidelberg, pp 410–419Google Scholar
  27. 27.
    Liu G, Hu MZ, Fang BX, Zhang HL (2004) Explaining BitTorrent traffic self-similarity. In: Liew KM, Shen H, See S et al (eds) Proceedings of the PDCAT 2004. LNCS 3320. Springer, Heidelberg, pp 839–843Google Scholar
  28. 28.
    Gao Q, Yang Z, Tian J, Dai YF (2007) A hierarchically differential P2P storage architecture. J Softw 18(10):2481–2494 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/18/2481.htm
  29. 29.
    Liu HY, Xiao MZ, Dai YF, Li XM (2006) Impact of availability in P2P file sharing system caused by active peers. J Softw 17(10):2087–2095 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/17/2087.htm
  30. 30.
    Klemm A, Lindemann C, Vernon MK et al (2004) Characterizing the query behavior in peer-to-peer file sharing systems. In: Proceedings of ACM Internet Measurement Conference (IMC). ACM, New YorkGoogle Scholar
  31. 31.
    Tutschku K (2004) A measurement-based traffic profile of the eDonkey file sharing service. In: 5th International Workshop. Springer, France, pp 12–21Google Scholar
  32. 32.
    Jin Y, Liu Y, Zhao HW (2010) Trust-Based supernode selection in Peer-to-Peer Systems. In: 2nd International Conference on ICFCC Future Computer and Communication 2010. IEEE, Wuhan, pp V1-285–V1-289Google Scholar
  33. 33.
    Luo HF, Deng L (2013) Research on a P2P supper node selection mechanism based on trust model. In: ICCSE The 8th International Conference on Computer Science and Education. IEEE, Colombo, pp 851–854Google Scholar
  34. 34.
    Han J, Park D (2003) A lightweight personal grid using a supernode network. In: P2P’03 Proceedings of the Third International Conference on Peer-to-Peer Computing. IEEE, pp 168–175Google Scholar
  35. 35.
    Dell’Amico M, Filippone M, Michiardi P, Roudier Y (2014) On user availability prediction and network applications. IEEE/ACM Trans Netw 23:1300–1313CrossRefGoogle Scholar
  36. 36.
    Meng X, Chen X, Ding Y (2013) Using the complementary nature of node joining and leaving to handle churn problem in P2P networks. Comput Electr Eng 39(2):326–337CrossRefGoogle Scholar
  37. 37.

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.School of Computer Science and TechnologyDalian University of TechnologyDalianChina

Personalised recommendations