Resource aggregation for fault tolerance in integrated services networks
ACM SIGCOMM Computer Communication Review
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Detection and diagnosis of data inconsistency failures in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance analysis of adaptive multipath load balancing in WDM-LOBS networks
Computer Communications
Detection and diagnosis of data inconsistency failures in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Minimum-cost multiple paths subject to minimum link and node sharing in a network
IEEE/ACM Transactions on Networking (TON)
Efficient distributed algorithm for correctly finding disjoint paths in wireless sensor networks
International Journal of Sensor Networks
| Hi-index | 0.00 |
In this paper, we present a routing protocol for finding two node-disjoint paths between each pair of nodes in a computer network. In the proposed protocol, each node in the network has the same procedure, which is driven by local information with respect to the network topology such as an adjacent node on a spanning tree in the network. Thus, the execution of the protocol can continue after changes of the network topology and load. The concept of spanning tree-based kernel construction is introduced to synchronize procedures under the distributed control of the protocol. The routing scheme based on the protocol possesses the enhanced capabilities of alternate routes and load splitting, which cope with failures and load variations in the network. Furthermore, even if topology changes occur which damage the obtained disjoint paths, the paths themselves can be updated efficiently