Conference Paper

Note on the problem of partially link disjoint paths

RMIT Univ., Melbourne, Vic., Australia
DOI: 10.1109/ICICS.2003.1292754 Conference: Information, Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint Conference of the Fourth International Conference on, Volume: 3
Source: IEEE Xplore


This paper discusses the problem of partially link disjoint paths in communication networks. The problem is situated in between the well-known shortest path generation and the synthesis of two disjoint paths. The contributions of this paper are twofold: firstly, topologies and relevant graph properties are investigated and the degree of divergence is defined as a metric to distinguish the degree of commonality for the two partially disjoint paths. Secondly, heuristic approaches are introduced that solve the problem of generating partly disjoint paths.

Download full-text


Available from: Richard Harris, Dec 13, 2013