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 条
  • [31] Pairwise Disjoint Paths Routing in Tori
    Kaneko, Keiichi
    Son Van Nguyen
    Hyunh Thi Thanh Binh
    IEEE ACCESS, 2020, 8 : 192206 - 192217
  • [32] Disjoint paths routing in pancake graphs
    Kaneko, Keiichi
    Peng, Shietung
    SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2006, : 254 - +
  • [33] Robustly Disjoint Paths with Segment Routing
    Aubry, Francois
    Vissicchio, Stefano
    Bonaventure, Olivier
    Deville, Yves
    CONEXT'18: PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON EMERGING NETWORKING EXPERIMENTS AND TECHNOLOGIES, 2018, : 204 - 216
  • [34] Shortest Paths with Shortest DetoursA Biobjective Routing Problem
    Carolin Torchiani
    Jan Ohst
    David Willems
    Stefan Ruzika
    Journal of Optimization Theory and Applications, 2017, 174 : 858 - 874
  • [35] DISTRIBUTED ALGORITHMS FOR COMPUTING SHORTEST PAIRS OF DISJOINT PATHS
    OGIER, RG
    RUTENBURG, V
    SCHACHAM, N
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (02) : 443 - 455
  • [36] Shortest node-disjoint paths on random graphs
    De Bacco, C.
    Franz, S.
    Saad, D.
    Yeung, C. H.
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2014,
  • [37] A QUICK METHOD FOR FINDING SHORTEST PAIRS OF DISJOINT PATHS
    SUURBALLE, JW
    TARJAN, RE
    NETWORKS, 1984, 14 (02) : 325 - 336
  • [38] Reconfiguration of vertex-disjoint shortest paths on graphs
    Saito, Rin
    Eto, Hiroshi
    Ito, Takehiro
    Uehara, Ryuhei
    Journal of Graph Algorithms and Applications, 2024, 28 (03) : 87 - 101
  • [39] On maximum available bandwidth through disjoint paths
    Sen, A
    Hao, B
    Shen, BH
    Zhou, L
    Ganguly, S
    2005 WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, 2005, : 34 - 38
  • [40] An Efficient Scheme for Solving Bandwidth Guaranteed Scheduling and Shortest path Routing Problem in Wireless Mesh Networks
    Zeng, Ziming
    Zeng, Yuanyuan
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2007, 7 (12): : 18 - 26
12345