Routing on Shortest Pair of Disjoint Paths with Bandwidth Guaranteed

被引：3
|
作者：
Leng, Hongze [1 ]
Song, Junqiang [1 ]
Xie, Zheng [2 ]
Liang, Meilian [3 ]
Zhang, Jun [4 ]
机构：
[1] Natl Univ Def Technol, Comp Sch, Changsha 410073, Hunan, Peoples R China
[2] Natl Univ Def Technol, Sch Sci, Changsha 410073, Peoples R China
[3] Guangxi Univ, Sch Math & Informat Sci, Nanning 530004, Peoples R China
[4] Beijing Univ Aeronaut & Astronaut, Sch Elect & Informat Engn, Beijing 100083, Peoples R China
来源：
EIGHTH IEEE INTERNATIONAL CONFERENCE ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, PROCEEDINGS | 2009年
关键词：
QoS; multipath; shortest pair; disjoint; bandwidth; guaranteed; ALGORITHM; SELECTION;
D O I：
10.1109/DASC.2009.81
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
QoS routing and multipath routing have been receiving much attention respectively in network communication. However, the research combining those two kinds of routing is rare. This paper integrated the ideas of QoS and multipath, and presented the problem of Shortest Pair of Disjoint Paths with Bandwidth Guaranteed. We proved it to be NP-Complete, and then proposed a heuristic algorithm. The analysis indicates that our algorithm shows good performance and it can produce optimal solutions in most cases.
引用
收藏
页码：557 / +
页数：3
相关论文
共 50 条
  • [41] On line routing of guaranteed bandwidth with restoration
    Olszewski, Ireneusz
    INTERNATIONAL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS, 2007, 53 (01) : 23 - 38
  • [42] Online routing of bandwidth guaranteed paths with local restoration using optimized aggregate usage information
    Raza, S
    Aslam, F
    Uzmi, ZA
    ICC 2005: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, 2005, : 201 - 207
  • [43] Routing reliability analysis of partially disjoint paths
    Pu, J
    Manning, E
    Shoja, GC
    2001 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, VOLS I AND II, CONFERENCE PROCEEDINGS, 2001, : 79 - 82
  • [44] Energy Aware Two Disjoint Paths Routing
    Lin, Gongqi
    Soh, Sieteng
    Chin, Kwan-Wu
    Lazarescu, Mihai
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2014, 43 : 27 - 41
  • [45] Routing of disjoint backup paths in ATM networks
    Pioro, M
    Szczesniak, M
    ATM NETWORKS - PERFORMANCE AND ANALYSIS, VOL. 3, 1997, : 162 - 175
  • [46] NEW HARDNESS RESULTS FOR ROUTING ON DISJOINT PATHS
    Chuzhoy, Julia
    Kim, David H. K.
    Nimavat, Rachit
    SIAM JOURNAL ON COMPUTING, 2022, 51 (02)
  • [47] New Hardness Results for Routing on Disjoint Paths
    Chuzhoy, Julia
    Kim, David H. K.
    Nimavat, Rachit
    STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 86 - 99
  • [48] Parallel algorithm for shortest pairs of edge-disjoint paths
    Banerjee, S
    Ghosh, RK
    Reddy, APK
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1996, 33 (02) : 165 - 171
  • [49] A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths
    Guo, Longkun
    Deng, Yunyun
    Liao, Kewen
    He, Qiang
    Sellis, Timos
    Hu, Zheshan
    PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 1456 - 1462
  • [50] Application of K Disjoint Shortest Paths Algorithm in Vision Recognition
    Tsvetanov, Sevdalin
    Marinova, Daniela
    SEVENTH INTERNATIONAL CONFERENCE ON NEW TRENDS IN THE APPLICATIONS OF DIFFERENTIAL EQUATIONS IN SCIENCES (NTADES 2020), 2021, 2321
12345