TRANSMISSION FAULT-TOLERANCE OF ITERATED LINE DIGRAPHS

The main result of this paper states that, if every cyclic modification of a d-regular digraph has super line-connectivity d, then the line digraph also has super line-connectivity d. Since many well-known interconnection network topologies, such as the Kautz digraphs, the de Bruijn digraphs, etc., can be constructed by iterating the line digraph construction, our result leads to several known and new connectivity results for these topologies, as shown later in the paper.

Download Full-text

Effect of Different Connection Patterns of MUX and DEMUX on Terminal Reliability and Routing Scheme of Gamma-Minus MIN

International Journal of Reliability Quality and Safety Engineering ◽

10.1142/s0218539318500134 ◽

2018 ◽

Vol 25 (03) ◽

pp. 1850013 ◽

Cited By ~ 2

Author(s):

Shilpa Gupta ◽

G. L. Pahuja

Keyword(s):

Fault Tolerance ◽

Communication Systems ◽

Interconnection Network ◽

Low Cost ◽

Reliability Evaluation ◽

Performance Measure ◽

Cost Ratio ◽

Performance Indices ◽

Network Topologies ◽

Terminal Reliability

In parallel and distributed systems, multistage interconnection network (MIN) plays an important role for its efficient communication between processor and memory at a very low cost. A major class of MIN called Gamma network is known for its redundant network topology and is being used in broadband communication systems. The increased redundancy incorporation makes these networks more complex and hence reliability evaluation becomes complex. The performance evaluation of these network topologies requires reliability evaluation utilizing routing mechanism or techniques. In this paper, we have proposed four topologies of Gamma-Minus network using MUX and DEMUX. Terminal Reliability (TR), fault tolerance and routing schemes of Gamma-Minus network topologies proposed have been computed by utilizing different connection patterns of MUX/DEMUX. Also, performance indices such as TR, Reliability Cost Ratio (RCR), Fault Tolerance, etc. computed for different Gamma-Minus architectures have been compared with the existing Gamma networks, other than Gamma-Minus. All the performance indices for different Gamma-Minus topologies show improvement over the performance indices of different Gamma networks. The proposed Gamma-Minus architectures have been compared among themselves and also Gamma-Minus2 shows the best performance for all performance indices. To the best of our knowledge, most of the researchers have not compared fault tolerance and RCR performance measure.

Download Full-text

On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs

Information Processing Letters ◽

10.1016/s0020-0190(02)00479-9 ◽

2003 ◽

Vol 86 (2) ◽

pp. 79-85 ◽

Cited By ~ 20

Author(s):

Yosuke Kikuchi ◽

Yukio Shibata

Keyword(s):

Kautz Digraphs ◽

De Bruijn ◽

De Bruijn Digraphs ◽

Domination Numbers

Download Full-text

SHUFFLE-RING: A NEW CONSTANT-DEGREE NETWORK

International Journal of Foundations of Computer Science ◽

10.1142/s0129054198000088 ◽

1998 ◽

Vol 09 (01) ◽

pp. 77-98 ◽

Cited By ~ 1

Author(s):

GUIHAI CHEN ◽

FRANCIS C. M. LAU

Keyword(s):

Fault Tolerance ◽

Interconnection Network ◽

Cost Effective ◽

Node Degree ◽

Constant Degree ◽

Small Constant ◽

De Bruijn ◽

Effective Network ◽

Cube Connected Cycles

The hypercube as a parallel interconnection network has been of academic and engineering concern for tens of year due to its many merits. However, its increasing node degree is an obvious weakness. Some networks such as the cube-connected cycles (CCC) and the de Bruijn network have been proposed to overcome the increasing degree of the hypercube. In this paper, we present a new cost-effective network which outperforms the cube network. It can overcome the increasing degree of cube networks while keeping the advantages of the cube network such as logarithmic diameter, easy routing, optimal fault tolerance, and suitability for the ASCEND/DESCEND class of parallel problems. Furthermore, the proposed network achieves the logarithmic diameter with a very small constant node degree, 3 or 4.

Download Full-text

On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-44679-6_45 ◽

2001 ◽

pp. 400-408

Author(s):

Yosuke Kikuchi ◽

Yukio Shibata

Keyword(s):

Kautz Digraphs ◽

De Bruijn ◽

De Bruijn Digraphs ◽

Domination Numbers

Download Full-text

De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations

Combinatorial Network Theory - Applied Optimization ◽

10.1007/978-1-4757-2491-2_3 ◽

1996 ◽

pp. 65-105 ◽

Cited By ~ 2

Author(s):

Ding-Zhu Du ◽

Feng Cao ◽

D. Frank Hsu

Keyword(s):

Kautz Digraphs ◽

De Bruijn ◽

De Bruijn Digraphs

Download Full-text

Cycle checking algorithm for verifying the connectivity of a fault tolerant network structure

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i4.16282 ◽

2018 ◽

Vol 7 (4) ◽

pp. 2729

Author(s):

Nethravathi B ◽

Kamalesh V. N

Keyword(s):

Fault Tolerance ◽

Network Structure ◽

Fault Tolerant ◽

Interconnection Network ◽

Network Structures ◽

Network Graph ◽

Design Algorithm ◽

Node Connectivity ◽

Network Topologies ◽

The Stability

The key challenges while designing a communication network structures and critical network topologies is to take accounts of aspects related to failures. Over years efforts are being made for constructing quality fault tolerance network structures. The performance of a network application depends on the stability and survivability of underlined interconnection network structure. Node –connectivity of a network graph is a globally accepted deterministic measure for measuring the fault tolerance in a network structure. Once the network is designed and constructed by any one of the existing design algorithm and claimed that the constructed network is k-connected network, this research paper proposes a cute cycle based method to verify the same.

Download Full-text