DocumentCode :
3543510
Title :
Raptor Codes for P2P Streaming
Author :
Eittenberger, Philipp M. ; Mladenov, Todor ; Krieger, Udo R.
Author_Institution :
Fac. of Inf. Syst. & Appl. Comput. Sci., Otto-Friedrich Univ., Bamberg, Germany
fYear :
2012
fDate :
15-17 Feb. 2012
Firstpage :
327
Lastpage :
332
Abstract :
In this paper, we present a first analysis of the application of Raptor codes in the domain of P2P streaming. With the help of fountain codes, such as Raptor codes, it is possible to completely omit content reconciliation in P2P networks. Hereby, the scheduling complexity of the data dissemination is greatly reduced. The contributions of the paper are the following: First, we present our implementation of the Raptor code used in the performed experiments and elaborate the application of the Raptor code in the scenario of P2P streaming. Second, we investigate the choice of the prevalent parameters, necessary to achieve the best trade-off between performance, computational complexity and resilience of the Raptor code. We use the obtained results to evaluate the general feasibility of using Raptor codes to improve the performance of P2P streaming networks. In addition, we report some insights arising from the practical experience with Raptor codes.
Keywords :
codes; computational complexity; media streaming; peer-to-peer computing; P2P streaming networks; Raptor codes; computational complexity; content reconciliation; data dissemination; fountain codes; Decoding; Delay; Encoding; Maintenance engineering; Receivers; Streaming media; Throughput; Fountain Code; P2P; P2P Streaming; Raptor Code;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel, Distributed and Network-Based Processing (PDP), 2012 20th Euromicro International Conference on
Conference_Location :
Garching
ISSN :
1066-6192
Print_ISBN :
978-1-4673-0226-5
Type :
conf
DOI :
10.1109/PDP.2012.80
Filename :
6169568
Link To Document :
بازگشت