Shared Backup Path Protection for Anycast and Unicast Flows Using the Node-Link Notation

被引:5
|
作者
Walkowiak, Krzysztof [1 ]
Rak, Jacek [2 ]
机构
[1] Wroclaw Univ Technol, Wybrzeze Wyspianskiego 27, PL-50370 Wroclaw, Poland
[2] Gdansk Univ Technol, PL-80233 Gdansk, Poland
来源
2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) | 2011年
关键词
anycast communications; shared protection; reliable networks; ILP modeling; joint optimization; NETWORKS;
D O I
10.1109/icc.2011.5962478
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper we address the problem of shared backup path protection (SBPP) against random failures of single links in connection-oriented communication networks. Most of recent works has been concentrated on protecting the unicast traffic. Our paper is also focused on shared protection of anycast (i.e. one-to-one-out-of-many) flows. Anycasting is frequently met in practice (e. g. in Content Delivery Networks, peer-to-peer systems, or DNS service). A new ILP model for joint optimization of dedicated working and shared backup paths of anycast and unicast demands is introduced and is followed by extensive simulation research. The model is the first one that provides the optimal solutions to the problem of anycast traffic shared protection by using the Node-Link notation. The results show that our approach reduces the network cost and capacity utilization ratio by 36% and 42% accordingly, compared to the case when capacity sharing is not used.
引用
收藏
页数:6
相关论文
共 50 条
  • [21] Shared partial path protection in WDM networks with shared risk link groups
    Shao, Xu
    Zhou, Luying
    Cheng, Xiaofei
    Saradhi, Chava Vijaya
    Wang, Yixin
    Li, Jianqing
    PHOTONIC NETWORK COMMUNICATIONS, 2008, 16 (03) : 221 - 231
  • [22] Using common region in node-link displays: The role of field dependence/independence
    Chmielewski, TL
    Dansereau, DF
    Moreland, JL
    JOURNAL OF EXPERIMENTAL EDUCATION, 1998, 66 (03): : 197 - 207
  • [23] A comparison of the readability of graphs using node-link and matrix-based representations
    Ghoniem, M
    Fekete, JD
    Castagliola, P
    IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2004, PROCEEDINGS, 2004, : 17 - 24
  • [24] Ultrafast potential-backup-cost (PBC)-Based shared path protection schemes
    Xu, Dahai
    Qiao, Chunming
    Xiong, Yizhi
    JOURNAL OF LIGHTWAVE TECHNOLOGY, 2007, 25 (08) : 2251 - 2259
  • [25] Shared end-to-content backup path protection in k-node (edge) content connected elastic optical datacenter networks
    Li, Xin
    Huang, Shanguo
    Yin, Shan
    Guo, Bingli
    Zhao, Yongli
    Zhang, Jie
    Zhang, Min
    Gu, Wanyi
    OPTICS EXPRESS, 2016, 24 (09): : 9446 - 9464
  • [26] Availability-Guaranteed Virtual Optical Network Mapping with Shared Backup Path Protection
    Kong, Jian
    Jue, Jason P.
    Kim, Inwoong
    Wang, Xi
    Zhang, Qiong
    Cankaya, Hakki C.
    Xie, Weisheng
    Ikeuchi, Tadashi
    2016 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2016,
  • [27] Survey and Performance Comparison of Dynamic Provisioning Methods for Optical Shared Backup Path Protection
    Shen, Gangxiang
    Grover, Wayne D.
    2ND INTERNATIONAL CONFERENCE ON BROADBAND NETWORKS (BROADNETS 2005), 2005, : 387 - 396
  • [28] Robust QoT Assured Resource Allocation in Shared Backup Path Protection Based EONs
    Chebolu, Venkatesh
    Behera, Sadananda
    Das, Goutam
    IEEE ACCESS, 2022, 10 : 105528 - 105545
  • [29] Tracking Disease Using Small World Network Theory and Matrix and Node-Link Graphics
    Applen, J. D.
    2015 IEEE INTERNATIONAL PROFESSIONAL COMMUNICATION CONFERENCE (IPCC), 2015,
  • [30] Policy-based shared path protection for dual link failures
    Xu, DH
    Xiong, YZ
    Qiao, CM
    OPTICOMM 2003: OPTICAL NETWORKING AND COMMUNICATIONS, 2003, 5285 : 102 - 113