Note on the problem of partially link disjoint paths

Author

Kist, Alexander A. ; Harris, Richard J.

Author_Institution

RMIT Univ., Melbourne, Vic., Australia

Volume

3

fYear

2003

fDate

15-18 Dec. 2003

Firstpage

1680

Abstract

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.

Keywords

graph theory; network topology; telecommunication links; telecommunication networks; communication networks; degree of divergence; graph properties; heuristic approaches; network synthesis; network topology; partially link disjoint paths; shortest path generation; Algorithm design and analysis; Australia; Communication networks; Cost function; Multiprotocol label switching; Network synthesis; Network topology; Robustness; Standby generators; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Information, Communications and Signal Processing, 2003 and Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint Conference of the Fourth International Conference on

Print_ISBN

0-7803-8185-8

Type

conf

DOI

10.1109/ICICS.2003.1292754

Filename

1292754