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 条
  • [1] Region-Based Fault-Tolerant Distributed File Storage System Design in Networks
    Sen, Arunabha
    Mazumder, Anisha
    Banerjee, Sujogya
    Das, Arun
    Zhou, Chenyang
    Shirazipourazad, Shahrzad
    NETWORKS, 2015, 66 (04) : 380 - 395
  • [2] On Region-based Fault Tolerant Design of Distributed File Storage in Networks
    Banerjee, Sujogya
    Shirazipourazad, Shahrzad
    Sen, Arunabha
    2012 PROCEEDINGS IEEE INFOCOM, 2012, : 2806 - 2810
  • [3] Region Based Containers - A new paradigm for the analysis of Fault Tolerant Networks
    Joshi, Prashant D.
    Hsu, D. Frank
    Sen, Arunabha
    Hamdioui, Said
    Bertels, Koen
    2017 IEEE INTERNATIONAL SYMPOSIUM ON DEFECT AND FAULT TOLERANCE IN VLSI AND NANOTECHNOLOGY SYSTEMS (DFT), 2017, : 78 - 81
  • [4] Performance Improvement of Region-Based Fault-Tolerant Routing Methods Based on the Passage of Fault Blocks
    Kurokawa, Yota
    Fukushi, Masaru
    2019 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TW), 2019,
  • [5] Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks
    Ho, Tung-Yang
    Lin, Cheng-Kuan
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2009, 25 (06) : 1855 - 1862
  • [6] Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
    Lin, Cheng-Kuan
    Ho, Tung-Yang
    Tan, Jimmy J. M.
    Hsu, Lih-Hsing
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2009, 86 (01) : 57 - 66
  • [7] Stochastic Communication: A New Paradigm for Fault-Tolerant Networks-on-Chip
    Bogdan, Paul
    Dumitras, Tudor
    Marculescu, Radu
    VLSI DESIGN, 2007,
  • [8] THE CONNECTIVITY OF HYPERGRAPH AND THE DESIGN OF FAULT-TOLERANT MULTIBUS
    陈廷槐
    康泰
    姚荣
    Science China Mathematics, 1988, (05) : 597 - 610
  • [9] THE CONNECTIVITY OF HYPERGRAPH AND THE DESIGN OF FAULT-TOLERANT MULTIBUS
    CHEN, TH
    KANG, T
    YAO, R
    SCIENTIA SINICA SERIES A-MATHEMATICAL PHYSICAL ASTRONOMICAL & TECHNICAL SCIENCES, 1988, 31 (05): : 597 - 610
  • [10] Fault-Tolerant Region-Based Control of an Underwater Vehicle with Kinematically Redundant Thrusters
    Ismail, Zool H.
    Faudzi, Ahmad A.
    Dunnigan, Andmatthew W.
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2014, 2014