PLFEC可靠组播解决方案分组长度研究  

Packet lengths of PLFEC-based reliable multicast solutions

作　　者：姜博[1] 曹志刚[1] 晏坚[1] 

机构地区：[1]清华大学电子工程系,北京100084

出　　处：《清华大学学报（自然科学版）》2008年第4期567-570,共4页Journal of Tsinghua University(Science and Technology)

基　　金：国家自然科学基金资助项目(60672106)

摘　　要：分组级前向纠删(packet level forward erasurecorrection,PLFEC)是解决可靠组播问题的一项关键技术。基于该技术的可靠组播解决方案主要包括:基于重复传输的数据轮播解决方案,基于RS码(reed-solomon codes)的分块编码解决方案,以及基于喷泉码的数字喷泉解决方案。该文简要介绍了这些解决方案,并且重点讨论了其中的分组长度选取问题。理论分析和实验仿真表明:在随机误码和忽略分组额外开销的假设下,3种可靠组播解决方案均应选取较短的分组来传输数据文件,这样可以获得较高的成功概率。Packet level forward erasure correction （PLFEC） is a key technology to improve the reliability of multicasting. Reliable multicast solutions based on this technology include data carousels based on multiple transmissions, block encoding based on Reed-Solomon codes, and digital fountains based on fountain codes. This paper introduces these solutions and shows how to select the packet lengths for each method. Simulations indicate that with random errors and while ignoring packet overheads, shorter packets are preferred in all three solutions as to improve the probability of successful data file transmission.

关 键 词：可靠组播 分组级前向纠删 喷泉码 数字喷泉 

分 类 号：TN92[电子电信—通信与信息系统]