A peer-to-peer network for live media streaming using a push-pull approach

Zhang, Meng; Luo, Jian-Guang; Zhao, Li; Yang, Shiqiang

doi:10.1145/1101149.1101206

Cited by 115 publications

(63 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The main objective of this system resides in minimizing the effects of bandwidth and content bottleneck. GridMedia [7] is well known system offering P2P-based IPTV services. It organizes the peers in unstructured overlay networks and implements a push-pull based approach to fetch the media contents from the neighbor peers.…”

Section: Related Workmentioning

confidence: 99%

K-overlay: A Kautz Tree Structure for Video on Demand System

Abbasi

Ahmed

2010

2010 Ninth IEEE International Symposium on Network Computing and Applications

View full text Add to dashboard Cite

Abstract-In order to improve scalability and reduce maintenance overhead for Peer-to-Peer system, several architecture with constant degree and optimal diameter are proposed. However, the expected topology doesn't effectively utilize the bandwidth capacity of peers. In this work, we propose K-overlay, an overlay scheme based on unbalanced Kautz graph with logd n diameter and constant in-degree. We define the degree of a digraph as the maximum number of arcs arriving at or leaving from any vertex. The diameter of a graph is the number of arc traversals that is sufficient to reach any vertex from any other vertex. K-overlay structure is based on two-fold mechanism. (1) Organization of peers in concentric circles to maximize the outgoing bandwidth of peers (2) Content delivery through parent as well as neighboring peers. Through formal analysis and comprehensive simulations, we show that our proposed architecture achieves optimal diameter and good connectivity as compared to existing overlay architecture like P2Cast.

show abstract

Section: Related Workmentioning

confidence: 99%

K-overlay: A Kautz Tree Structure for Video on Demand System

Abbasi

Ahmed

2010

2010 Ninth IEEE International Symposium on Network Computing and Applications

View full text Add to dashboard Cite

show abstract

“…However, we believe that such feedback is feasible in P2P VoD application. Indeed, this push-pull approach has been successfully used in P2P live streaming [18], [19]. Compared with the most popular pure mesh-pull approach [6], [15]- [17], the overhead of feedback can be suppressed by using the push-pull.…”

Section: Redundancy-free Md-fec Schemementioning

confidence: 99%

Efficient substream encoding and transmission for P2P video on demand

Liu¹,

Shen²,

Panwar³

et al. 2007

Packet Video 2007

View full text Add to dashboard Cite

Abstract-In a P2P VoD system, the rate at which peers receive video fluctuates due to peer churn. Although scalable video coding has the potential to adapt to long-term rate variations, existing scalable video schemes have not been tailored for P2P systems for which substreams emanate from churning peers. In this paper we propose a new multi-stream coding and transmission scheme, Redundancy-Free Multiple Description (RFMD) Coding and Transmission, that has been designed for P2P VoD systems. Unlike layered video, with RFMD all substreams have equal importance. Thus, video quality gracefully degrades as substreams are lost, independently of which particular substreams are lost. Furthermore, only the source bits are collectively transmitted by the supplying peers. Thus, all transmitted bits contribute to improve video quality. Finally, RFMD can be used to create any number of descriptions. We conduct an extensive simulation study, comparing single layer coding with highrate erasure codes, layered coding, multiple description coding (MD-FEC) and RFMD. The simulations show that RFMD performs best in a variety of representative scenarios.

show abstract

“…A number of solutions have been proposed that address problems such as creation and maintaining the underlying network structure and data dissemination among the peers [1,2,3,4,5].…”

Section: Introductionmentioning

confidence: 99%

Peer Assisted Streaming of Scalable Video via Optimized Distributed Caching

Harmanci¹,

Kanumuri²,

Kozat³

et al. 2009

2009 6th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

In this paper, we propose a method for peer assisted on demand delivery of scalable video using an optimal, distributed caching algorithm for cache constrained peers. We assume that there are one or more content delivery servers that are provisioned to support delivery of the base layer for all of the peers, and the enhancement layer is only supported for a fraction of peers. It has been shown that in such an application, peer assisted content distribution improves the delivery of the content. In this paper, we use peer assisted delivery of the enhancement layer and show that in a cache constrained video-on-demand environment, availability of the cached content becomes a bottleneck. By using peer arrival rates and supply-demand analysis of the peers, we propose better caching policies at each peer. One proposed policy (referred to as "static optimal") optimizes the utility of the currently available caching opportunities. The other proposed policy (referred to as "dynamic programming" solution) on the other hand performs utility optimization by further considering the future caching opportunities during the streaming operation. Experimental results show that the proposed methods allow more peers to access the enhancement layer; hence, more peers experience improved video quality compared to traditional caching methods.

show abstract

A peer-to-peer network for live media streaming using a push-pull approach

Cited by 115 publications

References 9 publications

K-overlay: A Kautz Tree Structure for Video on Demand System

K-overlay: A Kautz Tree Structure for Video on Demand System

Efficient substream encoding and transmission for P2P video on demand

Peer Assisted Streaming of Scalable Video via Optimized Distributed Caching

Contact Info

Product

Resources

About