Efficient Node-Disjoint Paths Search in WDM Networks with Asymmetric Nodes

被引：0
|
作者：
Hashiguchi, Tomohiro [1 ]
Zhu, Yi [2 ]
Jue, Jason P. [2 ]
机构：
[1] Fujitsu Labs Ltd, Nakahara Ku, 4-1-1 Kamikodanaka, Kawasaki, Kanagawa 2118588, Japan
[2] Univ Texas Dallas, 800 West Campbell Rd, Richardson, TX 75080 USA
来源：
2011 37TH EUROPEAN CONFERENCE AND EXHIBITION ON OPTICAL COMMUNICATIONS (ECOC 2011) | 2011年
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
We present an efficient node-disjoint paths search method considering asymmetric nodes. Through simulation results, we show that the proposed method significantly improves the success rate of path search.
引用
收藏
页数：3
相关论文
共 50 条
  • [21] A distributed routing protocol for finding two node-disjoint paths in computer networks
    Ishida, K
    Kakuda, Y
    Kikuno, T
    Amano, K
    IEICE TRANSACTIONS ON COMMUNICATIONS, 1999, E82B (06) : 851 - 858
  • [22] Guaranteed on-demand discovery of node-disjoint paths in ad hoc networks
    Liu, Changwen
    Yarvis, Mark
    Conner, W. Steven
    Guo, Xingang
    COMPUTER COMMUNICATIONS, 2007, 30 (14-15) : 2917 - 2930
  • [23] An efficient construction of one-to-many node-disjoint paths in folded hypercubes
    Lai, Cheng-Nan
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2014, 74 (04) : 2310 - 2316
  • [24] Almost Polynomial Hardness of Node-Disjoint Paths in Grids
    Chuzhoy, Julia
    Kim, David Hong Kyun
    Nimavat, Rachit
    THEORY OF COMPUTING, 2021, 17
  • [25] One-to-Many Node-Disjoint Paths Routing in Dense Gaussian Networks
    Alsaleh, Omar
    Bose, Bella
    Hamdaoui, Bechir
    COMPUTER JOURNAL, 2015, 58 (02): : 173 - 187
  • [26] Performance Analysis of Node-Disjoint Paths in Multipath Routing for Wireless Sensor Networks
    Murthy G, Shiva
    Souza, R. J. D'
    Varaprasad, G.
    2ND INTERNATIONAL CONFERENCE ON METHODS AND MODELS IN SCIENCE AND TECHNOLOGY (ICM2ST-11), 2011, 1414
  • [27] QoS Routing Protocol with Multiple Node-Disjoint Paths in Ad Hoc Networks
    Yi-Wen Su
    Show-Shiow Tzeng
    Wireless Personal Communications, 2015, 83 : 1867 - 1885
  • [28] Node-disjoint paths in a level block of generalized hierarchical completely connected networks
    Takabatake, Toshinori
    Nakamigawa, Tomoki
    THEORETICAL COMPUTER SCIENCE, 2012, 465 : 28 - 34
  • [29] Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
    Martins, Lucia
    Gomes, Teresa
    Tipper, David
    NETWORKS, 2017, 70 (04) : 292 - 307
  • [30] Constraint-Based Local Search for Finding Node-Disjoint Bounded-Paths in Optical Access Networks
    Arbelaez, Alejandro
    Mehta, Deepak
    O'Sullivan, Barry
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2015, 2015, 9255 : 499 - 507
12345