Journal of Digital Contents Society (디지털콘텐츠학회 논문지)

Digital Contents Society (한국디지털콘텐츠학회)
권호 표지
DOI QR코드

DOI QR Code

Time-based DHT Peer Searching Scheme for P2P VOD Service

P2P VOD 서비스를 위한 시간 기반 DHT 피어 탐색 기법

  • Received : 2014.02.07
  • Accepted : 2014.04.16
  • Published : 2014.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

In the typical P2P VOD system, it is very important to develop the fast and efficient peer searching scheme since the peers frequently join and leave to/from P2P system. This paper proposes a new peer searching scheme for P2P VOD system based on DHT network environment. The proposed scheme constructs DHT network by managing the peers having close playback starting times and close network locations into a peer all together. The peer information is mapped onto DHT nodes by hashing the key values each of which consists of the starting time and network location of the peer. From the simulation results, the number of messages required to search the partner peers are decreased, and the number of buffer maps exchanging among the peers are also decreased. The proposed scheme can reduce the average network distances among the partner peers. As a result, the proposed scheme makes routing more efficient and it saves the network resources by decreasing communication traffic overhead.

일반적으로 P2P VOD 시스템은 잦은 피어의 이탈과 참여로 인하여 빠르게 피어를 탐색하는 기법이 주요 연구 과제이다. 본 논문은 P2P VOD 시스템에서 피어를 빠르게 탐색하기 위한 새로운 기법을 제안한다. 제안된 기법은 DHT 기반의 P2P VOD 시스템에서 피어 탐색 시 시간 및 지역 정보를 해시 킷값으로 하여 인접한 재생 시작시간과 네트워크 위치상 근접한 피어들을 동일한 DHT 노드에 저장, 관리하여 데이터를 전송해 줄 서버피어를 탐색하는 시간을 단축시킨다. 시뮬레이션 실험 결과에서 제안된 기법은 파트너 피어 검색에 필요한 메시지 개수와 피어간 버퍼맵 교환 횟수를 감소시키고, 데이터의 교환이 이루어지는 피어들 사이의 거리를 줄일 수 있음을 확인하였다. 이에 따라 제안하는 기법은 효율적인 라우팅을 할 수 있게 하여 네트워크 트래픽 오버헤드에 따른 자원 낭비를 줄일 수 있다.

Keywords

References

  1. Y. Huang, T. Z. Fu, D.-M. Chiu, J. C. Lui, and C. Huang, "Challenges, Design and Analysis of a Larg e-Scale P2P-VOD System," SIGCOMM '08, pp.375-388, 2008.
  2. Y. Lin, Y. Guo, and C. Liang, "A Survey on Peer-to- Peer Video Streaming Systems," Peer-to-Peer Networking and Applications, Vol. 1, No. 1, pp.18-28, Mar. 2008. https://doi.org/10.1007/s12083-007-0006-y
  3. H. K. Choi, Y. Q. Gui, S. H. Seo, C. H. Ko, J. H. Seo, "TDM: Time-Driven Mesh Overlay Network for Peer-to-Peer Video-on-Demand Services," 2011 Int. Conf. on Cyber-Enabled Distributed Computing and Knowledge Discovery, pp.100-106, Oct. 2011.
  4. A. Vlavianos, M. Iliofotou, and M. Faloutsos, "Bitos: Enhancing Bittorrent for Supporting Streaming Applications," 9th IEEE Global Internet Symposium, Apr. 2006.
  5. C. P. Hong, J. G. Kim and S. D. Kim, "An Adaptive Buffering Scheme for P2P Live Streaming Systems," Journal of Digital Contents Society, Vol. 13, No.4, Dec. 2012.
  6. X. Zhang, J. Liu, and B. Li, "CoolStreaming: a Data-driven Overlay Network for Live Media Streaming," Proc. of IEEE INFOCOM, 2005.
  7. A. Rowstron and P. Druschel, "Pastry: Scalable, Dist ributed Object Location and Routing for Large-Scale Peer-to-Peer Systems," Proc. of IFIP/ ACM Int'l Conf. Distributed Systems Platforms (Middleware), pp. 329-350, 2001.
  8. W. P. Yiu, X. Jin, and S. H. Chan. "Vmesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming," IEEE Journal on Selected Areas in Communications, Vol. 25, No. 5, pp.1717-1731, Dec. 2007. https://doi.org/10.1109/JSAC.2007.071210
  9. T.T. Do, K.A. Hua, and M.A. Tantaoui, "P2VoD: Pro viding Fault Tolerant Video-on-Demanad Streaming in Peer-to-Peer Environment," Proc. of IEEE Int'l Conf. on Comm., pp.1467-1472, 2004.
  10. C. H. Ko, "Time-based DHT Peer Searching Scheme for P2P VoD Service on Mesh Overlay Network," Master Thesis, Kangwon National Univ., 2012.
  11. M. Zhang, L. Zhao, J. Tang, and S. Yang, "A Peer-to-Peer Network for Streaming Multicast through the Internet," Proc. of ACM multimedia, 2005.
  12. I. Stoica et al., "Chord: A Scalable Peer-to-Peer Loo kup Protocol for Internet Applications," IEEE/ACM Trans. on Networking, Vol. 11, No. 1, pp.17-32, 2003. https://doi.org/10.1109/TNET.2002.808407
  13. T. Asano, D. Ranjan, T. Roos, E. Welzl, and P. Wid maier, "Space Filling Curves and Their Use in Geometric Data Structures," Theoretical Computer Science, Vol. 181, No. 1, pp.3-15, July 1997. https://doi.org/10.1016/S0304-3975(96)00259-9
  14. AR Butz, "Alternative Algorithm for Hilbert's Space Filling Curve," IEEE Trans. on Computers, Vol. 20, No. 4, pp.24-42, Apr. 1971.
  15. E. Y. Hwang, "Adaptive Anchor Point Overlay to Support User Interactivity for Peer-to-Peer VoD Streaming," Master Thesis, Hanyang Univ., Aug. 2011.
  16. E. W. Zegura, K. Calvent, and S. Bhattacharjee, "How to Model an Internet," Proc. of IEEE INFOCOM, San Francisco, CA, 1996.
  17. C. P. Hong, J. G. Kim and S. D. Kim, "A Locality based Resource Management Scheme for Hierarchical P2P Overlay Network in Ubiquitous Computing," Journal of Digital Contents Society, Vol. 14, No. 1, Mar. 2013.