A novel MPR approach based on inverse-traversing of Multi-Labeled Tree
A novel MPR approach based on inverse-traversing of Multi-Labeled Tree
复制标题
DOI：
10.1109/iciss.2010.5657149
复制
发表时间：
2010-12
期刊：
影响因子：
--
通讯作者：
Wenchao Jiang;Qingyun Dai;Yanhong Zhou;Rong-zhen Liu
中科院分区：
文献类型：
--
作者：
Wenchao Jiang;Qingyun Dai;Yanhong Zhou;Rong-zhen Liu
提出了一种基于多标记树逆遍历的多路径路由算法。MLT可以通过多个标记消息的探测过程来构造。然后，多个不相交的路径可以通过MLT的逆遍历来定位。MLT的构造和路径的定位都是分散的过程。仿真实验表明，基于MLT的NDMPR比CT方法能发现更多的节点不相交路径，而每个节点的路由表大小增加很少。此外，使用我们的方法的平均路径长度小于CT方法。
A novel Multi-Path Routing (MPR) approach based on inverse-traversing of Multi-Labeled Tree (MLT) is proposed. MLT can be constructed through the probing process of multiple labeled messages. Then, multiple disjoint paths can be located by inverse-traversing of the MLT. Both the constructing of MLT and the locating of the paths are decentralized processes. Simulation experiments indicate that MLT based NDMPR can find more node-disjoint paths than CT approach with a little increment in routing table size at each node. In addition, the average path length using our approach is smaller than that of CT approach.