CAJ | 학술논문

针对XOR选择重传ARQ协议,提出了一种基于网络编码的多播路由算法,有效地恢复链路传输错误.该算法分为两种情况:一是信源发送正常的数据包,在信源节点与各接收节点之间建立多播路径族,并考虑不同路径族之间链路的共享;二是信源发送XOR数据包,搜索信源节点到各接收节点的最短路径,并考虑最短路径之间的链路共享.仿真结果表明,该算法有效地提高了网络吞吐量,在资源消耗方面较传统的多播路由算法有更好的表现,非常接近基于网络编码的最小费用多播算法.数学分析表明,该算法的复杂度远小于最小费用多播算法.
침대XOR선택중전ARQ협의,제출료일충기우망락편마적다파로유산법,유효지회복련로전수착오.해산법분위량충정황:일시신원발송정상적수거포,재신원절점여각접수절점지간건립다파로경족,병고필불동로경족지간련로적공향;이시신원발송XOR수거포,수색신원절점도각접수절점적최단로경,병고필최단로경지간적련로공향.방진결과표명,해산법유효지제고료망락탄토량,재자원소모방면교전통적다파로유산법유경호적표현,비상접근기우망락편마적최소비용다파산법.수학분석표명,해산법적복잡도원소우최소비용다파산법.
A new multicast routing algorithm with network coding to deal with transmission errors in the data links is proposed, which is based on XOR selective repeat ARQ. More specifically, this scheme contains two cases: when the source transmits the normal data packets, the routing groups from source to each sink are searched, and link-sharing between different path groups is considered in the process of searching; when the source transmits the XOR data packets, the shortest paths from source to each sink are searched, and link-sharing between different shortest paths is also considered. Simulation results show that this algorithm increases the network throughput effectively. Meanwhile, compared with traditional multicast routing algorithms, the performances of the routing algorithm are improved at a great extent in resource consumption, and closer to the minimum-cost multicast algorithm based on network coding. Mathematic analysis indicates that the complexity of the proposed algorithm is much lower than that of the minimum-cost multicast algorithm.