Real-time video delivery using peer-to-peer bartering networks and multiple description coding

Pouwelse, Johan; Taal, Jacco; Lagendijk, R.L.; Epema, Dick; Sips, Henk

doi:10.1109/icsmc.2004.1401257

Cited by 16 publications

(11 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although content delivery networks often explicitly consider congestion in the design of the network (Huang and Abdelzaher 2005), congestion is seldom considered important in conventional applications of P2P networks. This has changed recently, however, with various P2P applications for distributing general-purpose content, often with relatively tight delay constraints, e.g., news stories, streamed content (Xu et al 2006), and multicasting (Pouwelse et al 2004, Parameswaran et al 2001.…”

Section: Introductionmentioning

confidence: 99%

Analyzing Sharing in Peer-to-Peer Networks Under Various Congestion Measures

Johar

Menon

Mookerjee

2011

Information Systems Research

View full text Add to dashboard Cite

H istorically, the use of peer-to-peer (P2P) networks has been limited primarily to user-initiated exchanges of (mostly music) files over the Internet. This traditional view of P2P networks is changing, however, and the use of P2P networks has been suggested for delivering general-purpose content over the Web (or corporate intranets), even in real time. We analyze sharing in a P2P community in this new context under three different congestion measures: delay, jitter, and packet loss. Sharing is important to study in the presence of congestion because most existing research on P2P networks views congestion in the network as a relatively insignificant criterion. However, when delivering general-purpose content, congestion and its relationship to sharing is a critical factor that influences end-user performance. This paper looks at P2P networks from this new perspective by explicitly considering the effects of congestion on user incentives for sharing. We also propose a simple incentive mechanism that induces socially optimal sharing.

show abstract

Section: Introductionmentioning

confidence: 99%

Analyzing Sharing in Peer-to-Peer Networks Under Various Congestion Measures

Johar

Menon

Mookerjee

2011

Information Systems Research

View full text Add to dashboard Cite

show abstract

“…Second, the clients are encouraged to participate in sharing the downloaded data with other peers, which effectively combats the freeriding problem. 3 The underlying P2P network takes care of downloading all missing chunks from other nodes, and forwarding available chunks of data to nodes that still miss that data.…”

Section: Introductionmentioning

confidence: 99%

Fair rate allocation of scalable multiple description video for many clients

Taal

Lagendijk

2005

SPIE Proceedings

View full text Add to dashboard Cite

Peer-to-peer networks (P2P) form a distributed communication infrastructure that is particularly well matched to video streaming using multiple description coding. We form M descriptions using MDC-FEC building on a scalable version of the "Dirac" video coder. The M descriptions are streamed via M different application layer multicast (ALM) trees embedded in the P2P network. Client nodes (peers in the network) receive a number of descriptions m < M that is dependent on their bandwidth. In this paper we consider the optimization of the received video qualities, taking into account the distribution of the clients' bandwidth. We propose three "fairness" criteria to define the criterion to be optimized. Numerical results illustrate the effects of the different fairness criteria and client bandwidth distributions on the rates allocated to the compressed video layers and multiple descriptions.

show abstract

“…The idea of using MDC [8] in ALM has been proposed before [4,11,14]. Pouwelse et al [11] propose the use of a bartering mechanism, but do not provide an algorithm.…”

Section: Related Workmentioning

confidence: 99%

“…Pouwelse et al [11] propose the use of a bartering mechanism, but do not provide an algorithm. SplitStream [4] uses MDC to create interior-node-disjoint trees, but does not provide mechanisms to enforce a fair resource contribution.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

The Orchard Algorithm: P2P Multicasting without Free-Riding

Mol

Epema

Sips

Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06)

Self Cite

View full text Add to dashboard Cite

The main purpose of many current peer-to-peer (P2P) networks is off-line file sharing. However, a potentially very promising use of such networks is to share video streams (e.g., TV programs) in real time. In order to do so, the peers in a P2P network who are interested in the same video stream may employ Application Level Multicasting (ALM). In existing P2P networks, peers may exhibit behaviour which is problematic for ALM: peers tend not to donate any resources (free-riding), and they arrive and depart at a high rate (churn). In this paper we propose the Orchard algorithm for ALM of video streams in P2P systems, which deals with both these problems. By employing a technique called Multiple Description Coding, we split a video stream into several substreams. Orchard creates a dynamic spanning tree for each of these substreams in such a way that in the resulting forest, no peer has to forward more substreams than it receives. Our experiments show that Orchard is capable of providing a good quality of service to every peer, even when peers join and leave the forest at a high rate.

show abstract

Real-time video delivery using peer-to-peer bartering networks and multiple description coding

Cited by 16 publications

References 22 publications

Analyzing Sharing in Peer-to-Peer Networks Under Various Congestion Measures

Analyzing Sharing in Peer-to-Peer Networks Under Various Congestion Measures

Fair rate allocation of scalable multiple description video for many clients

The Orchard Algorithm: P2P Multicasting without Free-Riding

Contact Info

Product

Resources

About