By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wenchao Jiang ; Information Engineering College, Guangdong University of Technology, GuangZhou, 510006, China ; Qingyun Dai ; Yanhong Zhou ; Rong Liu

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.

Published in:

Intelligent Computing and Integrated Systems (ICISS), 2010 International Conference on

Date of Conference:

22-24 Oct. 2010