KIISE Transactions on Computing Practices (정보과학회 컴퓨팅의 실제 논문지)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지
DOI QR코드

DOI QR Code

Fountain Code-based Hybrid P2P Storage Cloud

파운틴 코드 기반의 하이브리드 P2P 스토리지 클라우드

  • 박기석 (포항공과대학교 정보전자융합공학부) ;
  • 송황준 (포항공과대학교 컴퓨터공학과)
  • Received : 2014.09.04
  • Accepted : 2014.10.28
  • Published : 2015.01.15
⟨ Previous Next ⟩

Abstract

In this work, we present a novel fountain code-based hybrid P2P storage system that combines cloud storage with P2P storage. The proposed hybrid storage system minimizes data transmission time while guaranteeing high data retrieval and data privacy. In order to guarantee data privacy and storage efficiency, the user transmits encoded data after performing fountain code-based encoding. Also, the proposed algorithm guarantees the user's data retrieval by storing the data while considering each peer's survival probability. The simulation results show that the proposed algorithm enables fast completion of the upload transmission while satisfying the required data retrieval and supporting the privacy of user data under the system parameters.

본 논문은 높은 데이터 상환율 및 저장된 데이터의 프라이버시를 보장함과 동시에 데이터 전송시간을 최소화하는 클라우드 스토리지와 P2P 스토리지를 결합한 파운틴 코드 기반의 하이브리드 P2P 클라우드 스토리지 시스템을 제안한다. 사용자는 저장 공간의 효율성 및 자신의 데이터 프라이버시를 보장하기 위해 저장하고자 하는 데이터에 대해 파운틴 코드 기반의 인코딩을 시행한 후 인코딩 된 데이터를 분할하여 전송한다. 또한, 제안하는 알고리즘은 각 피어의 생존 확률을 고려하여 데이터를 저장함으로써 사용자의 데이터 상환을 보장한다. 실험 결과는 제안한 알고리즘이 다양한 시스템 안정도에서 사용자의 전송시간을 줄일 수 있음을 보인다.

Keywords

Acknowledgement

Supported by : 한국연구재단

References

  1. R. Spoor, A. Peddemors, "Cloud storage and peerto-peer storage," [Online]. Available: http://www.surf.nl/ binaries/content/assets/surf/en/knowledgebase/2010 /EDS-3R+Cloud+and+p2p+storage-v1.1.pdf/, 2010.
  2. J. Li, Q. Huang, "Erasure resilient codes in peerto- peer storage cloud," Proc. of IEEE International Conference on Acoustics, Speech, and Signal Processing, Vol. 4, 2006.
  3. B. Gaidioz, B. Koblitz, N. Santaos, "Exploring high performance distributed file storage using LDPC codes," Parallel Computing, Vol. 33, pp. 264-274, 2007. https://doi.org/10.1016/j.parco.2007.02.003
  4. J. Li, "Adaptive erasure resilient coding in distributed storage," Proc. of IEEE International Conference on Multimedia and Expo, pp. 561-564, 2006.
  5. R. Rodrigues, B. Liskov, "High Availability in DHTs: Erasure Coding vs. Replication," Peer-to- Peer System IV, Vol. 3640, pp. 226-239, 2005. https://doi.org/10.1007/11558989_21
  6. D. J. C. Mackay, "Fountain codes," Proc. of IEE Proceedings-Communications, Vol. 152, pp. 1062- 1068, 2005.
  7. M. Luby, "LT codes," Proc. of Annual Symposium on Foundation of Computer Science, pp. 271-280, 2002.
  8. A. Shokrollahi, "Raptor codes," IEEE Transactions on Information Theory, pp. 2551-2567, 2006.
  9. N. Ntene, J. H. V. Vuuren, "A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem," Discrete Optimization, Vol. 6, pp. 174-188, 2009. https://doi.org/10.1016/j.disopt.2008.11.002
  10. D. Leonard, Z. Yao, V. Rai, D. Loguinov, "On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks," IEEE/ACM Transactions on Networking, Vol. 15, pp. 644-656, 2007. https://doi.org/10.1109/TNET.2007.893199
  11. N. Cao, S. Yu, Z. Yang, W. Lou, Y. T. Hou, "LT code-based secure and reliable cloud storage service," Proc. of IEEE INFOCOM, pp. 693-701, 2012.
  12. M. Podlesny, C. Williamson, "Improving TCP Performance in Residential Broadband Network: A Simple and Deployable Approach," Proc. of ACM SIGCOMM, Vol. 42, pp. 66-68, 2012.
  13. L. Ping, X. Ge, Y. Wang, J. Fu, "Cloud Storage as the Infrastructure of Cloud Computing," Intelligent Computing and Cognitive Informatics, pp. 380-383, 2010.
  14. W. P. Turner IV, J. H. Seader, V. Renaud, K. G. Brill, "Tier classifications define site infrastructure performance," White Paper, The Uptime Institute, 2006.
  15. Y. Yang, D. Yuan, "A novel cost-effective dynamic data replication strategy for reliability in cloud data centers," Proc. of IEEE Dependable, Autonomic and Secure Computing, pp. 496-502, 2011.