A novel MPR approach based on inverse-traversing of Multi-Labeled Tree

摘要

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.