Loading...
Please wait, while we are loading the content...
Similar Documents
A Heuristic to Generate All Best Partially Disjoint Paths in a Communication Networks (2000)
| Content Provider | CiteSeerX |
|---|---|
| Author | Kist, Alexander A. Harris, Richard J. |
| Abstract | This paper considers a directed graph with nodes, 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³). 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. |
| File Format | |
| Language | English |
| Publisher Date | 2000-01-01 |
| Publisher Institution | EIGHTH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (ICCS 2002 |
| Access Restriction | Open |
| Subject Keyword | Communication Network Best Partially Disjoint Path Disjoint Path Problem Minimum Total Cost Cost Value Light Path Design Disjoint Path Algorithm Directed Graph Link Disjoint Pair K-th Shortest Path Algorithm Intelligent Alternative Possible Application Expected Worst Case Traffic Engineering |
| Content Type | Text |
| Resource Type | Technical Report |
