Name
Abstract | ||
|---|---|---|
The underlying topology of an interconnection network can be modeled by a digraph D = (V, A). A strongly connected digraph D is maximally arc-connected if its arc-connectivity is equal to its minimum degree. The maximally arc-connected tolerance m(lambda) (D) to arc-faults of a maximally arc-connected digraph D is the maximum integer f, for which D - S is still maximally arc-connected for any set S subset of A(D) with vertical bar S vertical bar <= f. The index m(lambda) (D) is used to measure the reliability of networks. In this paper, we present upper and lower bounds on m(lambda) (D). More refined bounds are obtained under some conditions, from which the exact values of m(lambda) (D) are determined for some networks modeled by digraphs. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1093/comjnl/bxy084 | COMPUTER JOURNAL |
Keywords | Field | DocType |
arc fault tolerance,maximally arc-connected,restricted arc-connectivity,networks | Arc-fault circuit interrupter,Topology,Arc (geometry),Computer science,Distributed computing | Journal |
Volume | Issue | ISSN |
62 | 5 | 0010-4620 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shuang Zhao | 1 | 30 | 12.77 |
| Jixiang Meng | 2 | 353 | 55.62 |