A heuristic to generate all best partially disjoint paths in a communications network

Kist, Alexander A. and Harris, Richard J. (2002) A heuristic to generate all best partially disjoint paths in a communications network. In: 8th International Conference on Communication Systems (ICCS 2002), 25-28 Nov 2002, Singapore.

[img]
Preview
Text
Kist__Harris_2002_ICCS.pdf

Download (772kB)

Abstract

This paper considers a directed graph G(N, A) with n nodes, m directed arcs and a cost value for each arc. The synthesis of a partially link disjoint pair of paths for a given OD-pair with the minimum total cost is investigated. An algorithm is presented that solves the all-best partially disjoint path problem. The expected worst case running time of the algorithm is O(n^3). Possible applications include light path design and MPLS based traffic engineering. Partially disjoint path algorithms can also be used as intelligent alternatives to k-th shortest path algorithms.


Statistics for USQ ePrint 2820
Statistics for this ePrint Item
Item Type: Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)
Refereed: Yes
Item Status: Live Archive
Additional Information: © 2002 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Faculty/School / Institute/Centre: Historic - Faculty of Engineering and Surveying - No Department (Up to 30 Jun 2013)
Faculty/School / Institute/Centre: Historic - Faculty of Engineering and Surveying - No Department (Up to 30 Jun 2013)
Date Deposited: 12 Mar 2008 07:48
Last Modified: 24 Mar 2014 03:07
Uncontrolled Keywords: directed graphs, telecommunication network routing, telecommunication traffic, best partially disjoint paths, communications network, heuristic, partially link disjoint pair, traffic engineering
Fields of Research (2008): 10 Technology > 1005 Communications Technologies > 100503 Computer Communications Networks
URI: http://eprints.usq.edu.au/id/eprint/2820

Actions (login required)

View Item Archive Repository Staff Only