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.
Text (Published Version)
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.
Statistics for this ePrint Item
|Item Type:||Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)|
|Item Status:||Live Archive|
|Additional Information (displayed to public):||Published version deposited in accordance with the copyright policy of the publisher.|
|Depositing User:||Dr Alexander Kist|
|Faculty / Department / School:||Historic - Faculty of Engineering and Surveying - Department of Electrical, Electronic and Computer Engineering|
|Date Deposited:||04 Apr 2010 01:44|
|Last Modified:||24 Mar 2014 02:50|
|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 (FoR):||10 Technology > 1005 Communications Technologies > 100503 Computer Communications Networks|
|Socio-Economic Objective (SEO):||B Economic Development > 89 Information and Communication Services > 8901 Communication Networks and Services > 890101 Fixed Line Data Networks and Services|
Actions (login required)
|Archive Repository Staff Only|