Graphs and algorithms
Fiber Network Service Survivability
Fiber Network Service Survivability
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Finding minimum energy disjoint paths in wireless ad-hoc networks
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Traffic Engineering and QoS Optimization of Integrated Voice & Data Networks
Traffic Engineering and QoS Optimization of Integrated Voice & Data Networks
Privacy-aware routing in sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On multipath routing in multihop wireless networks: security, performance, and their tradeoff
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network security
Energy-aware data gathering in wireless sensor networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
A study of the backup reprovisioning problem for FIPP p-cycles on WDM networks
Photonic Network Communications
Photonic Network Communications
EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
Efficient distributed algorithm for correctly finding disjoint paths in wireless sensor networks
International Journal of Sensor Networks
Dynamic lightpath provisioning in optical WDM mesh networks with asymmetric nodes
Photonic Network Communications
Design of reliable virtual infrastructure with resource sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
One way to improve the reliability of a network is through physical diversity, i.e., via routing of traffic between a given pair of nodes in the network over two or more physically-disjoint paths such that if a node or a physical link fails on one of the disjoint paths, not all of the traffic is lost. Alternatively, enough spare capacity may be allocated on the individual paths such that the lost traffic due to a node or physical link failure can be routed immediately over the predetermined paths. In this paper, we present optimal algorithms for K-disjoint paths (K=2) in a graph of vertices (or nodes) and edges (or links). These algorithms are simpler than those given in the past. We discuss how such algorithms can be used in the design of survivable mesh networks based on the digital crossconnect systems (DCS). We also discuss the generation of optimal network topologies which permit K2 disjoint paths and upon which survivable networks may be modeled.