ALGORITHMS FOR FINDING AN OPTIMAL SET OF SHORT DISJOINT PATHS IN A COMMUNICATION-NETWORK

被引：30
|
作者：
TORRIERI, D
机构：
[1] U.S. Army Survivability Management Office, Adelphi
来源：
IEEE TRANSACTIONS ON COMMUNICATIONS | 1992年 / 40卷 / 11期
关键词：
D O I：
10.1109/26.179933
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
The motives for seeking a set of short disjoint paths in a communication network are explained. A sequentially constructed optimal set is defined. Three efficient algorithms, one that constructs an optimal set and two that construct approximations, are presented. One of the latter algorithms not only constructs a larger set of short disjoint paths than an iterated version of the standard Dijkstra algorithm, but also offers a major reduction in computation time for large networks.
引用
收藏
页码：1698 / 1702
页数：5
相关论文
共 50 条
  • [1] Algorithms for finding optimal disjoint paths around a rectangle
    Chan, WT
    Chin, FYL
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, 1350 : 314 - 323
  • [2] ON THE SELECTION OF PRIMARY PATHS FOR A COMMUNICATION-NETWORK
    TCHA, D
    MARUYAMA, K
    [J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1985, 9 (04): : 257 - 265
  • [3] Efficient algorithms for finding disjoint paths in grids
    Chan, WT
    Chin, FYL
    [J]. PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 454 - 463
  • [4] ENUMERATION OF ALL SIMPLE PATHS IN A COMMUNICATION-NETWORK
    MISRA, RB
    MISRA, KB
    [J]. MICROELECTRONICS RELIABILITY, 1980, 20 (04) : 419 - 426
  • [5] THE RELIABILITY OF A COMMUNICATION-NETWORK WITH RESPECT TO COMBINATIONS OF PATHS
    BOGATYREV, VA
    [J]. TELECOMMUNICATIONS AND RADIO ENGINEERING, 1981, 35-6 (02) : 38 - 40
  • [6] ALGORITHM FOR ENUMERATING ALL SIMPLE PATHS IN A COMMUNICATION-NETWORK
    MISRA, RB
    [J]. MICROELECTRONICS AND RELIABILITY, 1979, 19 (04): : 363 - 366
  • [7] Efficient algorithms for finding the maximum number of disjoint paths in grids
    Chan, WT
    Chin, FYL
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2000, 34 (02): : 337 - 369
  • [8] Exact Algorithms for Finding Partial Edge-Disjoint Paths
    Deng, Yunyun
    Guo, Longkun
    Huang, Peihuang
    [J]. COMPUTING AND COMBINATORICS (COCOON 2018), 2018, 10976 : 14 - 25
  • [9] External Memory Algorithms for Finding Disjoint Paths in Undirected Graphs
    Babenko, Maxim
    Kolesnichenko, Ignat
    [J]. SOFSEM 2018: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2018, 10706 : 295 - 304
  • [10] FINDING DISJOINT PATHS WITH DIFFERENT PATH-COSTS - COMPLEXITY AND ALGORITHMS
    LI, CL
    MCCORMICK, ST
    SIMCHILEVI, D
    [J]. NETWORKS, 1992, 22 (07) : 653 - 667
12345