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.
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 this ePrint Item
|Item Type:||Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)|
|Item Status:||Live Archive|
|Additional Information:||Deposited in accordance with the copyright policy of the publisher. ©2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Faculty / Department / School:||Historic - Faculty of Engineering and Surveying - No Department|
|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 :||10 Technology > 1005 Communications Technologies > 100503 Computer Communications Networks|
Actions (login required)
|Archive Repository Staff Only|