Routing of disjoint backup paths in ATM networks

被引:0
|
作者
Pioro, M
Szczesniak, M
机构
关键词
ATM networks; ATM cross connect; virtual paths; VP routing; robust design; network dimensioning; discrete optimisation;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The paper considers a virtual path restoration mechanism for ATM networks, based on preplanned disjoint backup paths. The purpose of the paper is two fold. First, the network model is introduced and two robust design tasks associated with routing of virtual paths protected. with the mechanism are formulated. Then, it is discussed how the tasks can be solved with a stochastic discrete optimisation algorithm called Simulated Allocation. A network design example is reported, and the result of Simulated Allocation is compared with the results of two other methods.
引用
收藏
页码:162 / 175
页数:14
相关论文
共 50 条
  • [21] Routing permutations with link-disjoint and node-disjoint paths in a class of self-routable networks
    Yang, YY
    Wang, JC
    2002 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDING, 2002, : 239 - 246
  • [22] 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
  • [23] 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
  • [24] NEW HARDNESS RESULTS FOR ROUTING ON DISJOINT PATHS
    Chuzhoy, Julia
    Kim, David H. K.
    Nimavat, Rachit
    SIAM JOURNAL ON COMPUTING, 2022, 51 (02)
  • [25] 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
  • [26] Ant-based survivable routing in dynamic WDM networks with shared backup paths
    Son Hong Ngo
    Xiaohong Jiang
    Vinh Trong Le
    Susumu Horiguchi
    The Journal of Supercomputing, 2006, 36 : 297 - 307
  • [27] Robust multipath routing to exploit maximally disjoint paths for wireless ad hoc networks
    Kim, J
    Moh, S
    Chung, I
    Yu, CS
    ADVANCED WEB AND NETWORK TECHNOLOGIES, AND APPLICATIONS, PROCEEDINGS, 2006, 3842 : 306 - 309
  • [28] 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
  • [29] Ant-based survivable routing in dynamic WDM networks with shared backup paths
    Ngo, Son Hong
    Jiang, Xiaohong
    Le, Vinh Trong
    Horiguchi, Susumu
    JOURNAL OF SUPERCOMPUTING, 2006, 36 (03): : 297 - 307
  • [30] An adaptive routing protocol for ad-hoc networks using multiple disjoint paths
    Hwang, YK
    Lee, HK
    Varshney, PK
    IEEE VTC 53RD VEHICULAR TECHNOLOGY CONFERENCE, SPRING 2001, VOLS 1-4, PROCEEDINGS, 2001, : 2249 - 2253