Region-Based Connectivity - A New Paradigm for Design of Fault-tolerant Networks

被引:0
|
作者
Sen, Arunabha [1 ]
Murthy, Sudheendra [1 ]
Banerjee, Sujogya [1 ]
机构
[1] Arizona State Univ, Dept Comp Sci & Engn, Tempe, AZ 85281 USA
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The studies in fault-tolerance in networks mostly focus on the connectivity of the graph as the metric of fault-tolerance. If the underlying graph is k-connected, it can tolerate up to k - 1 failures. In measuring the fault tolerance in terms of connectivity, no assumption regarding the locations of the faulty nodes are made - the failed nodes may be close to each other or far from each other. In other words, the connectivity metric has no way of capturing the notion of locality of faults. However in many networks, faults may be highly localized. This is particularly true in military networks, where an enemy bomb may inflict massive but localized damage to the network. To capture the notion of locality of faults in a network, a new metric region-based connectivity (RBC) was introduced in [1]. It was shown that RBC can achieve the same level of fault-tolerance as the metric connectivity, with much lower networking resources. The study in [1] was restricted to single region fault model (SRFM), where faults are confined to one region only. In this paper, we extend the notion of RBC to multiple region fault model (MRFM), where faults are no longer confined to a single region. As faults in MRFM are still confined to regions, albeit multiple of them, it is different from unconstrained fault model where no constraint on locality of faults is imposed. The MRFM leads to several new concepts, such as region-disjoint paths and region cuts. We show that the classical result, the maximum number of node-disjoint paths between a pair of nodes is equal to the minimum number of nodes whose removal disconnects the pair, is no longer valid when region-disjoint paths and region cuts are considered. We prove that the problems of finding (i) the maximum number of region-disjoint paths between a pair of nodes, and (ii) minimum number of regions whose removal disconnect a pair of nodes, are both NP-complete. We provide heuristic solution to these two problems and evaluate their efficacy by comparing the results with optimal solutions.
引用
收藏
页码:94 / 100
页数:7
相关论文
共 50 条
  • [21] Efficient target monitoring with fault-tolerant connectivity in wireless sensor networks
    Deepa, Rajasekar
    Revathi, Venkataraman
    TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2023, 34 (02)
  • [22] Fault-tolerant Hamiltonian connectivity of 2-tree-generated networks
    Abdallah, Mohamad
    Cheng, Eddie
    THEORETICAL COMPUTER SCIENCE, 2022, 907 : 62 - 81
  • [23] On Connectivity of Airborne Networks in Presence of Region-based Faults
    Shirazipourazad, Shahrzad
    Ghosh, Pavel
    Sen, Arunabha
    2011 - MILCOM 2011 MILITARY COMMUNICATIONS CONFERENCE, 2011, : 1997 - 2002
  • [24] Impact of Region-based Faults on the Connectivity of Wireless Networks
    Sen, Arunabha
    Banerjee, Sujogya
    Ghosh, Pavel
    Shirazipourazad, Shahrzad
    2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, 2009, : 1430 - 1437
  • [25] FAULT-TOLERANT FFT NETWORKS
    JOU, JY
    ABRAHAM, JA
    IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (05) : 548 - 561
  • [26] FAULT-TOLERANT ASYNCHRONOUS NETWORKS
    PRADHAN, DK
    REDDY, SM
    IEEE TRANSACTIONS ON COMPUTERS, 1973, C 22 (07) : 662 - 669
  • [27] ON FAULT-TOLERANT NETWORKS FOR SORTING
    YAO, AC
    YAO, FF
    SIAM JOURNAL ON COMPUTING, 1985, 14 (01) : 120 - 128
  • [28] Fault-Tolerant Rendezvous in Networks
    Chalopin, Jeremie
    Dieudonne, Yoann
    Labourel, Arnaud
    Pelc, Andrzej
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT II, 2014, 8573 : 411 - 422
  • [29] ON MINIMUM FAULT-TOLERANT NETWORKS
    UENO, S
    BAGCHI, A
    HAKIMI, SL
    SCHMEICHEL, EF
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1993, 6 (04) : 565 - 574
  • [30] Automating Reliable and Fault-Tolerant Design of LoRa-based IoT Networks
    Yu, Xiaofan
    Xu, Weihong
    Cherkasova, Ludmila
    Rosing, Tajana Simunic
    PROCEEDINGS OF THE 2021 17TH INTERNATIONAL CONFERENCE ON NETWORK AND SERVICE MANAGEMENT (CNSM 2021): SMART MANAGEMENT FOR FUTURE NETWORKS AND SERVICES, 2021, : 455 - 463