基于可靠多播网络下的上下文相关性网络编码方案  

Context Correlation Network Coding Scheme under the Reliable Multicast Network

作　　者：周艳玲[1] 马林山[1] 

机构地区：[1]合肥学院,安徽合肥230601

出　　处：《廊坊师范学院学报（自然科学版）》2017年第3期26-31,共6页Journal of Langfang Normal University(Natural Science Edition)

基　　金：安徽省教育厅自然科学资助项目(KJ2016A609);安徽高校人文社会科学研究重点项目(SK2017A0606)

摘　　要：网络编码可以提高多播网络吞吐量,但传统的网络编码算法中节点的编译码很明显地增加了时间和空间的复杂度。文章给出的方案中,信源节点增加了编码功能,具有编码能力的节点对所接受到的信息进行简单的线性编码,不需要复杂的局部编码矩阵和全局编码向量的计算过程,中间节点和链路对所接受的信息块只提供存储和转发的功能,目的节点不需要考虑网络的拓扑结构和接受到数据块的次序问题,只要能够接收到足够的信息块,就可以在极短的时间内成功译码,恢复原信息。实验证明,基于上下文相关性的网络编码在多播网络中不仅使得多播传输达到理论的传输容量,并且降低了时间和空间复杂度,提高了网络可靠性。Network coding can improve the multicast network throughput,but the encoding nodes and decoding nodes of traditional network coding algorithm obviously increased the complexity of time and space.In this scheme,the source code can encode the blocked packets.The encoding nodes encoded the packets simply and didn＇t need to intricately compute the local encoding matrix and the global coding vector.The middle nodes and links that have no encoding ability only store and forward the data packet.The destination nodes do not need to consider the network topology and the data-block order.As long as they can receive enough packets,they can decode successfully in a very short time and restore the original information.The experiments prove that the scheme can not only make the multicast reach the transmission capacity in theory,but also reduce the time and space complexity and enhance the reliability of multicast network.

关 键 词：上下文相关性 线性网络编码 可靠多播 时间复杂度 空间复杂度 

分 类 号：TP393.01[自动化与计算机技术—计算机应用技术]