• Title/Summary/Keyword: P2P-assisted streaming

Search Result 6, Processing Time 0.022 seconds

A Peer Load Balancing Method for P2P-assisted DASH Systems (P2P 통신 병용 DASH 시스템의 피어 부하 분산 방안 연구)

  • Seo, Ju Ho;Kim, Yong Han
    • Journal of Broadcast Engineering
    • /
    • v.25 no.1
    • /
    • pp.94-104
    • /
    • 2020
  • Currently media consumption over fixed/mobile Internet is mostly conducted by adaptive media streaming technology such as DASH (Dynamic Adaptive Streaming over HTTP), which is an ISO/IEC MPEG (Moving Picture Experts Group) standard, or some other technologies similar to DASH. All these heavily depend on the HTTP caches that ISPs (Internet Service Providers) are obliged to provide sufficiently to make sure fast enough Web services. As a result, as the number of media streaming users increases, ISPs' burden for HTTP cache has been greatly increased rather than CDN (Content Delivery Network) providers' server burden. Hence ISPs charge traffic cost to CDN providers to compensate for the increased cost of HTTP caches. Recently in order to reduce the traffic cost of CDN providers, P2P (Peer-to-Peer)-assisted DASH system was proposed and a peer selection algorithm that maximally reduces CDN provides' traffic cost was investigated for this system. This algorithm, however, tends to concentrate the burden upon the selected peer. This paper proposes a new peer selection algorithm that distributes the burden among multiple peers while maintaining the proper reduction level of the CDN providers' cost. Through implementation of the new algorithm in a Web-based media streaming system using WebRTC (Web Real-Time Communication) standard APIs, it demonstrates its effectiveness with experimental results.

A transport-history-based peer selection algorithm for P2P-assisted DASH systems based on WebRTC (WebRTC 기반 P2P 통신 병용 DASH 시스템을 위한 전달 이력 기반 피어 선택 알고리듬)

  • Seo, Ju Ho;Choi, Seong Hyun;Kim, Sang Jin;Jeon, Jae Young;Kim, Yong Han
    • Journal of Broadcast Engineering
    • /
    • v.24 no.2
    • /
    • pp.251-263
    • /
    • 2019
  • Recently the huge demand for Internet media streaming has dramatically increased the cost of the CDN (Content Delivery Network) and the need for a means to reduce it is increasing day by day. In this situation, a P2P-assisted DASH technology has recently emerged, which uses P2P (Peer-to-Peer) communications based on WebRTC (Web Real-Time Communication) standards to reduce the CDN cost. This paper proposes an algorithm that can significantly improve CDN cost savings in this technology by selecting peers based on the transport history. Also we implemented this algorithm in an experimental system and, after setting experimental conditions that emulate the actual mobile network environment, we measured the performance of the experimental system. As a result, we demonstrated that the proposed algorithm can achieve higher CDN cost savings compared to the conventional algorithm where peers are selected at random.

Low Cost Cloud-Assisted Peer to Peer Live Streaming

  • Alghazawy, Bahaa Aldeen;Fujita, Satoshi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1732-1750
    • /
    • 2016
  • Recently, Peer-to-Peer (P2P) live streaming assisted by the cloud computing has attracted considerable attention to improve the reliability of the P2P such as the resilience to peer churn and the shortage of upload capacity. The cost of cloud-assistance is comprised of the number of requests issued to the cloud and the amount of data fetched from the cloud. In this paper, we propose three techniques to reduce the cost of such a cloud-assistance.More concretely, in the proposed method, 1) each peer which lost its parent in the overlay can find a new parent by referring to the information registered in the cloud, 2) several peers which proactively fetch chunks from the cloud are dynamically invested, and 3) the number of requests issued to the cloud is reduced by allowing peers to fetch a collection of chunks using a single request. The performance of the proposed method is evaluated by simulation. The simulation results indicate that it reduces the cost of conventional scheme by 46% while guaranteeing the quality of live streaming service.

An Incentive mechanism for VOD Streaming Under Insufficient System Resources (한정된 자원 환경에서의 주문형 비디오 스트리밍 서비스를 위한 효율적인 인센티브 메커니즘)

  • Shin, Kyuyong;Lee, Jongdeog;Shin, Jinhee;Park, Chanjin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.4
    • /
    • pp.65-77
    • /
    • 2013
  • Recently the ratio of the Internet traffic generated by video streaming applications including video-on-demand (VOD) is getting higher and higher, while P2P-based naive content distribution has been the main source of the Internet traffic in the past. As a result, the paradigm of cooperatively distributed systems (e.g., P2P) is changing to support streaming applications. Most P2P assisted approaches for video streaming today are based on Bit Torrent thanks to its simplicity of implementation and easy adaptability. They, however, have immanent vulnerability to free-riding inherited from Bit Torrent, which inevitably hurts their performance under limited system resources with free-riding. This paper studies the weakness to free-riding of existing Bit Torrent-based video streaming applications and investigates the adaptability of T-Chain (which was originally designed to prevent free-riding in cooperatively distributed systems) to video streaming applications. Our experiment results show that the video streaming approach based on T-Chain outperforms most existing Bit Torrent-based ones by 60% on average under limited system resources with free-riding.

Cloud Assisted P2P Live Video Streaming over DHT Overlay Network (DHT 오버레이 네트워크에서 클라우드 보조의 P2P 라이브 비디오 스트리밍)

  • Lim, Pheng-Un;Choi, Chang-Yeol;Choi, Hwang-Kyu
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.1
    • /
    • pp.89-99
    • /
    • 2017
  • Many works have attempted to solve the scalability, the availability, and the low-latency problems of peer-to-peer (P2P) live video streaming; yet, the problems still remain. While tree-based systems are vulnerable to churn, the mesh-based systems suffer from high delay and overhead. The DHT-aided chunk-driven overlay (DCO) [1] tried to tackle these problems by using the distributed hash table (DHT), which structures into a mesh-based overlay to efficiently share the video segment. However, DCO fully depends on the capacity of the users' device which is small and unstable, i.e., the users' device may leave and join the network anytime, and the video server's bandwidth can be insufficient when the number of users joining the network suddenly increases. Therefore, cloud assist is introduced to overcome those problems. Cloud assist can be used to enhance the availability, the low-latency, and the scalability of the system. In this paper, the DHT is used to maintain the location of the streaming segments in a distributed manner, and the cloud server is used to assist other peers when the bandwidth which required for sharing the video segment is insufficient. The simulation results show that by using the threshold and cloud assist, the availability and the low-latency of the video segments, and the scalability of the network are greatly improved.

A history-based peer selection algorithm for WebRTC-based P2P-assisted DASH systems (WebRTC 기반 P2P 통신 병용 DASH 시스템을 위한 이력 기반 피어 선택 알고리듬)

  • Choi, Seong Hyun;Seo, Ju Ho;Kim, Sang Jin;Jeon, Jae Young;Kim, Yong Han
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2018.11a
    • /
    • pp.110-113
    • /
    • 2018
  • 최근 인터넷 미디어 스트리밍 수요의 증가로 인해 CDN(Content Delivery Network) 서버 비용이 크게 증가하였으며 이를 절감하기 위한 방안의 필요성이 날로 증가하고 있다. 이러한 상황에 맞춰 최근 CDN 서버 비용을 절감할 수 있는 WebRTC(Web Real-Time Communication) 표준 기반의 P2P(Peer-to-Peer) 통신을 병용하는 DASH(Dynamic Adaptive Streaming over HTTP) 기술이 등장하였다. 본 논문에서는 이 기술의 CDN 서버 부하 절감 효과를 크게 개선할 수 있는 알고리듬을 제안한다. 또한 실제 모바일 네트워크 환경과 유사하게 실험 조건을 설정한 후, 이 알고리듬을 구현하여 그 성능을 측정한 결과, 기존과 비교하여 더 높은 절감 효과를 달성할 수 있음을 실험실 내 실험을 통해 보인다.

  • PDF