2007
DOI: 10.1109/mmul.2007.16
|View full text |Cite
|
Sign up to set email alerts
|

Multiple-Description Coding for Overlay Network Streaming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2009
2009
2012
2012

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 6 publications
0
2
0
Order By: Relevance
“…We consider overlay multicast systems based on multiple distribution trees and the push model, such as the ones in [2][3][4][5][6][10][11][12]. Multiple trees offer two advantages: they ensure graceful quality degradation in dynamic overlays, in which peers can leave during the streaming session and they enable nodes to contribute to the overlay with fractions of the stream bandwidth.…”
Section: Introductionmentioning
confidence: 99%
“…We consider overlay multicast systems based on multiple distribution trees and the push model, such as the ones in [2][3][4][5][6][10][11][12]. Multiple trees offer two advantages: they ensure graceful quality degradation in dynamic overlays, in which peers can leave during the streaming session and they enable nodes to contribute to the overlay with fractions of the stream bandwidth.…”
Section: Introductionmentioning
confidence: 99%
“…To date, the video transmission over wireless networks is still an open problem. [4], [5] and [8] present some wavelet-based encoders that divide the original bit-stream into multiple streams, called multiple description coding (MDC), to tradeoff the error-resilience and coding complexity; [6] and [7] amplify the benefits of using MDC by combining with path diversity, in these approaches each stream is explicitly transmitted over an independent path to the receiver to achieve higher tolerance to packet loss and delay due to network congestion; In [3], the authors propose two flow control algorithms for network with multiple paths between source-destination pair, both are distributed algorithms over the network to maximize aggregate source utility.…”
Section: Introductionmentioning
confidence: 99%