Novel disjoint path selection scheme based on link availability in ASON

被引：1
|
作者：
WANG Xian-qing
机构：
来源：
TheJournalofChinaUniversitiesofPostsandTelecommunications | 2007年 / 03期
关键词：
automatically switched optical network; risk-sharing links; partial risk-disjoint routing algorithm based on link availability; risk-disjoint degree;
D O I：
暂无
中图分类号：
TN929.1 [光波通信、激光通信];
学科分类号：
0803 ;
摘要：
Risk-disjoint routing is an efficient way to improve network survivability.In this article,a partial risk-disjoint routing algorithm based on link availability (PRDRA-LA) is proposed based on the complete risk-disjoint routing algorithm(CRDRA).While calculating the protection path with PRDRA-LA,the links that share risks with the links in the working path are filtered by link availability.In addition,the risk disjoint degree between the protection path and the working path can be adjusted freely.Simulation results showed that when compared with CRDRA,routing connections with PRDRA-LA can achieve improved survivability while the number of connections that can be successfully routed over the current network is kept from serious decline.
引用
收藏
页码：70 / 73
页数：4
相关论文
共 50 条
  • [41] Fast Link-Disjoint Path Algorithm on Parallel Reconfigurable Processor DAPDNA-2
    Kihara, Taku
    Shimizu, Sho
    Arakawa, Yutaka
    Yamanaka, Naoaki
    Shiba, Kosuke
    2008 14TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS, (APCC), VOLS 1 AND 2, 2008, : 643 - 647
  • [42] A RECURSIVE MATRIX-CALCULATION METHOD FOR DISJOINT PATH SEARCH WITH HOP LINK NUMBER CONSTRAINTS
    OKI, E
    YAMANAKA, N
    IEICE TRANSACTIONS ON COMMUNICATIONS, 1995, E78B (05) : 769 - 774
  • [43] Recursive matrix-calculation method for disjoint path search with hop link number constraints
    NTT Network Service Systems Lab, Musashino-shi, Japan
    IEICE Trans Commun, 5 (769-774):
  • [44] Effective algorithms for finding optimum pairs of link-disjoint paths in α+1 path protection
    Gan, Ming-Lee
    Liew, Soung-Yue
    TELECOMMUNICATION SYSTEMS, 2013, 52 (02) : 783 - 797
  • [45] Effective algorithms for finding optimum pairs of link-disjoint paths in α+1 path protection
    Ming-Lee Gan
    Soung-Yue Liew
    Telecommunication Systems, 2013, 52 : 783 - 797
  • [46] Wireless routeing scheme for UAV-assisted access networks based on the link path loss
    Getu, Beza Negash
    Alnoman, Ali
    JOURNAL OF INFORMATION AND TELECOMMUNICATION, 2024,
  • [47] A multi-layer disjoint path selection algorithm for highly reliable carrier services
    Miyamura, T
    Kurimoto, T
    Aoki, M
    Urushidani, S
    GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2004, : 1974 - 1978
  • [48] A Novel Routing Scheme for LEO Satellite Networks based on Link State Routing
    Yan, Hongcheng
    Zhang, Qingjun
    Sun, Yong
    2014 IEEE 17TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE), 2014, : 876 - 880
  • [49] Link prediction based on path entropy
    Xu, Zhongqi
    Pu, Cunlai
    Yang, Jian
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 456 : 294 - 301
  • [50] Longest Path Selection Based on Path Identifiers
    Pomeranz, Irith
    IEEE ACCESS, 2024, 12 : 14512 - 14520
12345