A heuristic to generate all best partially disjoint paths in a communications network
Paper
Paper/Presentation Title | A heuristic to generate all best partially disjoint paths in a communications network |
---|---|
Presentation Type | Paper |
Authors | Kist, Alexander A. (Author) and Harris, Richard J. (Author) |
Journal or Proceedings Title | Proceedings of the 8th International Conference on Communication Systems |
Journal Citation | 1, pp. 357-362 |
Number of Pages | 6 |
Year | 2002 |
Place of Publication | Singapore |
ISBN | 0780375106 |
Digital Object Identifier (DOI) | https://doi.org/10.1109/ICCS.2002.1182497 |
Web Address (URL) of Paper | https://ieeexplore.ieee.org/document/1182497 |
Web Address (URL) of Conference Proceedings | https://ieeexplore.ieee.org/xpl/conhome/8429/proceeding |
Conference/Event | 8th International Conference on Communication Systems (ICCS 2002) |
Event Details | 8th International Conference on Communication Systems (ICCS 2002) Event Date 25 to end of 28 Nov 2002 Event Location Singapore |
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. |
Keywords | directed graphs, telecommunication network routing, telecommunication traffic, best partially disjoint paths, communications network, heuristic, partially link disjoint pair, traffic engineering |
ANZSRC Field of Research 2020 | 400604. Network engineering |
Public Notes | Files associated with this item cannot be displayed due to copyright restrictions. |
Byline Affiliations | Royal Melbourne Institute of Technology (RMIT) |
https://research.usq.edu.au/item/9y454/a-heuristic-to-generate-all-best-partially-disjoint-paths-in-a-communications-network
1871
total views199
total downloads0
views this month0
downloads this month