Kist, Alexander A. and Harris, Richard J. (2003) Note on the problem of partially link disjoint paths. In: 2003 Joint Conference of the 4th International Conference on Information, Communications and Signal Processing and the 4th Pacific Rim Conference on Multimedia, 15-18 Dec 2003, Singapore.
|HTML Citation||EndNote||Dublin Core||Reference Manager|
Full text available as:
|PDF (Published Version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
Official URL: http://dx.doi.org/10.1109/ICICS.2003.1292754
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.
|Item Type:||Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)|
|Additional Information:||Published version deposited in accordance with the copyright policy of the publisher.|
|Uncontrolled Keywords:||communication networks, degree of divergence, graph properties, heuristic approaches, network synthesis, network topology, partially link disjoint paths, shortest path generation|
|Fields of Research (FOR2008):||10 Technology > 1005 Communications Technologies > 100503 Computer Communications Networks|
|Socio-Economic Objective (SEO2008):||B Ecomonic Development > 89 Information and Communication Services > 8901 Communication Networks and Services > 890101 Fixed Line Data Networks and Services|
|Deposited On:||04 Apr 2010 11:44|
|Last Modified:||10 Jun 2010 17:34|
Archive Staff Only: edit this record