2012
DOI: 10.1016/j.comcom.2012.07.005
|View full text |Cite
|
Sign up to set email alerts
|

A delay-based aggregate rate control for P2P streaming systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 16 publications
0
6
0
Order By: Relevance
“…The data source will fragment the video stream in basic units ("chunks") and inject in the overlay only few copies of each chunk. The receiving peers will redistribute those packets to other peers and so on until every peer have received its own copy of the chunks [4].…”
Section: Peerstreamermentioning
confidence: 99%
See 1 more Smart Citation
“…The data source will fragment the video stream in basic units ("chunks") and inject in the overlay only few copies of each chunk. The receiving peers will redistribute those packets to other peers and so on until every peer have received its own copy of the chunks [4].…”
Section: Peerstreamermentioning
confidence: 99%
“…This characteristic, together with the bottom-up, cooperative approach that sustains them, makes them a perfect match for P2P (peer-to-peer) technologies. P2P video streaming attracted a lot of interest in the mid 2000s, but then was mostly abandoned in favor of more traditional techniques, albeit several commercial services still exists 4 .…”
Section: Introductionmentioning
confidence: 99%
“…Intuitively, it should be large enough to fully exploit the peer upload capacity, but it must not be too large to cause the accumulation of chunks to be transmitted adding queuing delay prior to chunk transmissions. We adopt Hose Rate Control (HRC) proposed in [17] to automatically adapt the number of offers to both peer upload capacity and system demand. Simpler trading schemes are less performing and can hide the impact of the overlay on the overall system performance.…”
Section: A Peerstreamer Architecturementioning
confidence: 99%
“…Chunks consists of parts of the video to be streamed (by default, this is one frame of the video). At the beginning of the streaming process, these chunks are all from the same peer (since only one peer is the source), then the source sends m copies of the chunks to random peers (m = 3 by default), creating an overlay topology with all peers [3] in order to exchange chunks between them. The whole architecture and vision of PeerStreamer is described in detail in [4].…”
Section: I I L I V E S T R E a M I N G S E R V I C Ementioning
confidence: 99%