The search functionality is under construction.

Keyword Search Result

[Keyword] P2P video streaming(5hit)

1-5hit
  • Peer-to-Peer Video Streaming of Non-Uniform Bitrate with Guaranteed Delivery Hops Open Access

    Satoshi FUJITA  

     
    PAPER-Information Network

      Pubricized:
    2019/08/09
      Vol:
    E102-D No:11
      Page(s):
    2176-2183

    In conventional video streaming systems, various kind of video streams are delivered from a dedicated server (e.g., edge server) to the subscribers so that a video stream of higher quality level is encoded with a higher bitrate. In this paper, we consider the problem of delivering those video streams with the assistance of Peer-to-Peer (P2P) technology with as small server cost as possible while keeping the performance of video streaming in terms of the throughput and the latency. The basic idea of the proposed method is to divide a given video stream into several sub-streams called stripes as evenly as possible and to deliver those stripes to the subscribers through different tree-structured overlays. Such a stripe-based approach could average the load of peers, and could effectively resolve the overloading of the overlay for high quality video streams. The performance of the proposed method is evaluated numerically. The result of evaluations indicates that the proposed method significantly reduces the server cost necessary to guarantee a designated delivery hops, compared with a naive tree-based scheme.

  • Multi-Tree-Based Peer-to-Peer Video Streaming with a Guaranteed Latency Open Access

    Satoshi FUJITA  

     
    PAPER-Fundamentals of Information Systems

      Pubricized:
    2019/06/10
      Vol:
    E102-D No:9
      Page(s):
    1707-1714

    This paper considers Peer-to-Peer (P2P) video streaming systems, in which a given video stream is divided into b stripes and those stripes are delivered to n peers through b spanning trees under the constraint such that each peer including the source can forward at most b stripes. The delivery of a stripe to n peers is said to be a k-hop delivery if all peers receive the stripe through a path of length at most k. Let Bk=∑i=0k-1bi. It is known that under the above constraint, k-hop delivery of b stripes to n peers is possible only if n≤Bk. This paper proves that (k+1)-hop delivery of b stripes to n peers is possible for any n≤Bk; namely, we can realize the delivery of stripes with a guaranteed latency while it is slightly larger than the minimum latency. In addition, we derive a necessary and sufficient condition on n to enable a k-hop delivery of b stripes for Bk-b+2≤n≤Bk-1; namely for n's close to Bk.

  • Cloud-Assisted Peer-to-Peer Video Streaming with Minimum Latency

    Satoshi FUJITA  

     
    PAPER-Fundamentals of Information Systems

      Pubricized:
    2018/11/02
      Vol:
    E102-D No:2
      Page(s):
    239-246

    In this paper, we consider cloud-assisted Peer-to-Peer (P2P) video streaming systems, in which a given video stream is divided into several sub-streams called stripes and those stripes are delivered to all subscribers through different spanning trees of height two, with the aid of cloud upload capacity. We call such a low latency delivery of stripes a 2-hop delivery. This paper proves that if the average upload capacity of the peers equals to the bit rate of the video stream and the video stream is divided into a stripes, then 2-hop delivery of all stripes to n peers is possible if the upload capacity assisted by the cloud is 3n/a. If those peers have a uniform upload capacity, then the amount of cloud assistance necessary for the 2-hop delivery reduces to n/a.

  • Boosting P2P Streaming Performance via Adaptive Chunk Selection

    Choonhwa LEE  Eunsam KIM  

     
    LETTER

      Vol:
    E94-B No:10
      Page(s):
    2755-2758

    This paper presents a novel chunk selection strategy for peer-to-peer video streaming, called enr-first selection policy, which simultaneously considers both block rarity and playback deadline. The policy intends to boost overall network-wide streaming performance, while ensuring good playback continuity of individual peers. The efficacy of the proposed scheme is validated through our performance evaluation study that demonstrates a substantial gain.

  • Hybrid Fault Tolerant Peer to Peer Video Streaming Architecture

    Kasm ÖZTOPRAK  Gözde Bozdai AKAR  

     
    PAPER-Network

      Vol:
    E91-B No:11
      Page(s):
    3627-3638

    In this paper, we propose a fault tolerant hybrid p2p-CDN video streaming arhitecture to overcome the problems caused by peer behavior in peer-to-peer (P2P) video streaming systems. Although there are several studies modeling and analytically investigating peer behaviors in P2P video streaming systems, they do not come up with a solution to guarantee the required Quality of the Services (QoS). Therefore, in this study a hybrid geographical location-time and interest based clustering algorithm is proposed to improve the success ratio and reduce the delivery time of required content. A Hybrid Fault Tolerant Video Streaming System (HFTS) over P2P networks conforming the required QoS and Fault Tolerance is also offered. The simulations indicate that the required QoS can be achieved in streaming video applications using the proposed hybrid approach.