An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
On Selection of Paths for Multipath Routing
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
An Extended Dynamic Source Routing Scheme in Ad Hoc Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Stability of end-to-end algorithms for joint routing and rate control
ACM SIGCOMM Computer Communication Review
IEEE/ACM Transactions on Networking (TON)
Disjoint multipath routing using colored trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multipath routing algorithms for congestion minimization
IEEE/ACM Transactions on Networking (TON)
All-to-all disjoint multipath routing using cycle embedding
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Multi-Tree Approach To Reliability In Distributed Networks
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
IEEE Journal on Selected Areas in Communications
Balanced Overlay Networks (BON): An Overlay Technology for Decentralized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
A node-disjoint multi-path routing (NMPR) method based on multi-labelled tree (MLT) is proposed. Given an assured node as the drain, any network can be transformed into a MLT rooted at the drain through sending multiple (equal to the number of its neighbours) probing messages from the drain to the other nodes according to the node-disjoint constraints. For each node except for the drain in the MLT, a path will be located by inverse-traversing from this node to the root. Multiple paths distributed in different branches of the MLT are necessarily node-disjoint. MLT is one kind of decentralised approach because each node in the network need only contain the relevant information about its neighbours. From the viewpoint of data forwarding, our NMPR based on MLT is of multiple points to one point. Examples and simulation experiments indicate that NMPR based on MLT can probe more node-disjoint paths than coloured tree (CT) approach with a little increment in routing table size at each node while retaining similar searching time. In addition, the average path length using MLT approach is smaller than that of CT approach.