CAJ | 학술논문

针对不相关路由路径之间可能存在特定关键节点问题,提出一种特定节点不相关多路路由算法,通过寻找关键节点,使数据报文经单路径到达关键节点的上一跳节点后,向多条不相关路径的节点进行转发,使数据报文可以同时在多条节点不相关的路径上路由到达目的节点.仿真实验结果表明,如果存在关键节点,该算法能够提高分组投递率、降低端到端延迟;如果不存在关键节点,该算法的性能与节点不相关算法相当.
침대불상관로유로경지간가능존재특정관건절점문제,제출일충특정절점불상관다로로유산법,통과심조관건절점,사수거보문경단로경도체관건절점적상일도절점후,향다조불상관로경적절점진행전발,사수거보문가이동시재다조절점불상관적로경상로유도체목적절점.방진실험결과표명,여과존재관건절점,해산법능구제고분조투체솔、강저단도단연지;여과불존재관건절점,해산법적성능여절점불상관산법상당.
A new algorithm called Special Node Node-Disjoint Multipath Routing(SNNDMR) is proposed to calculate the key node that may exist among the node-disjoint routing paths. The algorithm makes the data packets via a unipath to reach at the former node of the key node. The data packets are routed to multiple node-disjoint paths. In this way, data packets can be routed to the destination node by node-disjoint multipath at the same time. Simulation experimental results show that, compared with the existed Node-Disjoint Multipath Routing(NDMR) algorithm, the new algorithm improves the packet delivery ratio and reduces end-to-end delay time. If there are no key nodes, the performance of this algorithm is almost as same as NDMR's.