Loading in 2 Seconds...
Loading in 2 Seconds...
Chameleon : Adaptive Peer-to-Peer Streaming with Network Coding Anh Tuan Nguyen, Baochun Li, and Frank Eliassen Department of Informatics, University of Oslo, Oslo, Norway IEEE INFOCOM 2010 Outlines Introduction Chameleon : Adaptive P2P Streaming with Network Coding Performance Evaluation
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Anh Tuan Nguyen, Baochun Li, and Frank Eliassen
Department of Informatics, University of Oslo, Oslo, Norway
IEEE INFOCOM 2010
Single layer Video
All peers receive the same video quality
PPStream, PPLive, CoolStreaming
A video is encoded into several layers
More layers introduce better video quality
Nested dependence between layers
A higher layer can bedecoded only if all the lower layers are available
Higher upload contribution results in better received video quality
Video encoding/decoding technology
Video content is encoded into several descriptions
Each description can be decoded independently
Even receiver only receives one description, the video is displayed with low quality
The more descriptions received, the better video quality
Compatible for transmitting video streaming in the Internet
# of description
Fig. 1. An example of the SVC structure. (a) An AU consisting of 4 LRs. (b) A GOP consisting of 8 pictures (AUs) and coded with hierarchical B-pictures. The symbols Tk specify the temporal layers with k representing the corresponding T_ID. The numbers below specify the coding order. (c) A coded video sequence.
Fig. 3. An example of the segmentation method where the stream has 3 quality levels and is divided into segments of 2 GOPs. The symbols QL(quality level) k specify Q_ID = k.
Fig. 4. An example of the combination of network coding and SVC. Packet 1, 2, and 3 are divided into n, m, and k blocks, respectively. Network coding with different number of unknowns (n, m, and k) is used for different quality levels.
Fig. 7. The playback buffer in Chameleon: The dark shade indicates the receiving status of each segment.
Ex: we set drop_threshold = 6, and add_threshold =drop_threshold+δ, δ=2, ..., 12.
Fig. 9. An example of the playback graph of a typical peer.
(1): playback skip
(2): buffering effect
Aurora Workshop, Oslo 24-26
Fig. 11. The performance of Chameleon and FABALAM in different network sizes.
Fig. 12. The effects of peer dynamics on Chameleon.