Raptor Codes for P2P Streaming
|Professorship/Faculty:||Communication Services and Networks||Authors:||Mladenov, Todor; Krieger, Udo R. ; Eittenberger, Philipp||Title of the compilation:||Proceedings of the 20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), 2012, Garching, Germany, 15-17 February 2012||Publisher Information:||IEEE Xplore Digital Library||Year of publication:||2012||Pages / Size:||30 S. : graph. Darst.||ISBN:||978-1-4673-0226-5||Language(s):||English||URL:||http://www.pdp2012.org/presentations/Feb15/Feb1...
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.
|SWD Keywords:||Streaming ; Kommunikationstechnik ; Netzwerk ; Online-Publikation||Keywords:||Raptor codes, P2P Video Streaming||DDC Classification:||004 Computer science||RVK Classification:||ST 200||URI:||https://fis.uni-bamberg.de/handle/uniba/416||Release Date:||26. July 2012|