Reliable networking in Ethernet ring mesh networks using regular topologies

Jahanshahi, Mohsen; Bistouni, Fathollah

doi:10.1007/s11235-019-00566-8

Cited by 8 publications

(5 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Network topology architecture is the geometric ordering of communication links and nodes in a network, which is used to represent the structural appearance of the entire network [ 4 ]. Common network topology architectures include bus topology [ 5 ], ring topology [ 6 ], star topology [ 7 , 8 ], and tree topology [ 9 ]. There are several papers comparing and evaluating these topology architectures.…”

Section: Introductionmentioning

confidence: 99%

“…It can enhance error-containment and fault-tolerance mechanisms. For the ring topology, Mohsen Jahanshahi and Fathollah Bistouni [ 6 ] proposed two ring redundancy topology architectures to enhance the reliability of the network. Ahmed Amari and Ahlem Mifdaoui [ 21 ] proposed duplicated mono-ring and multiple-ring topologies, which increase the reliability of the network.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Design and Reliability Analysis of a Novel Redundancy Topology Architecture

Liu

Gao

et al. 2022

Sensors

View full text Add to dashboard Cite

Topology architecture has a decisive influence on network reliability. In this paper, we design a novel redundancy topology and analyze the structural robustness, the number of redundant paths between two terminal nodes, and the reliability of the proposed topology by using natural connectivity and time-independent and time-dependent terminal pair reliability, k-terminal reliability, and all-terminal reliability comprehensively and quantitatively, and we compare these measures of the proposed topology with AFDX in three scenarios. The evaluations show that in the structural robustness analysis, when no nodes are removed, the natural connectivity of the proposed topology with 10 nodes, 16 nodes, and 20 nodes is 77.8%, 26.95%, and 81.39% higher than that of AFDX, respectively. In the time-independent reliability analysis, when the link reliability is 0.9, terminal pair reliability of the proposed topology with 10 nodes, 16 nodes, and 20 nodes is 5.78%, 17.75%, and 34.65% higher than that of AFDX, respectively; k-terminal reliability is 10.04%, 31.97%, and 53.74% higher than that of AFDX, respectively; and all-terminal reliability is 29.36%, 74.37%, and 107.91% higher than that of AFDX, respectively. In the time-dependent reliability analysis, when the operating time is 8000 h, the terminal pair reliability of the proposed topology with 10 nodes, 16 nodes, and 20 nodes is 3.53%, 10.87%, and 21.08% higher than that of AFDX, respectively; the k-terminal reliability is 6.20%, 19.65%, and 32.58% higher than that of AFDX, respectively; and the all-terminal reliability is 18.25%, 45.04%, and 63.86% higher than that of AFDX, respectively. The proposed topology increases the redundant paths of data transmission. It ensures reliable data transmission and has high robustness and reliability. It provides a new idea for improving the reliability of industrial buses.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Design and Reliability Analysis of a Novel Redundancy Topology Architecture

Liu

Gao

et al. 2022

Sensors

View full text Add to dashboard Cite

show abstract

“…In the communication network, the network topology architecture is the interconnection layout between devices in the network [1]. The network topology architectures mainly include bus topology [2], star topology [3], ring topology [4], tree topology [5], and their hybrid topology [6]. The bus topology is often used in the local area network.…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, network reliability usually refers to the probability that the network satisfies the required connectivity. When analyzing the reliability of the network, we use three indicators, namely two-terminal reliability, k-terminal reliability, and all-terminal reliability [4]. The two-terminal reliability refers to the probability that there is at least one fault-free communication path for communication between two nodes in the network, where one node is the source node and the other node is the destination node.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Algorithm for Reliability Evaluation of the Bus Network

Liu

2022

IEEE Access

View full text Add to dashboard Cite

The bus network is widely used in industrial automation and avionics systems due to its many advantages. Network reliability is an important indicator of the bus network design and analysis. However, the widely used reliability evaluation method is not capable of dealing with the bus network. In this paper, we model the bus network without redundancy and the bus network with redundancy, propose the algorithms to calculate the two-terminal reliability and the k-terminal reliability of the bus network with redundancy, and verify the effectiveness of the algorithms in three scenarios. The experimental results show that when the reliability of the link reaches 0.9, the two-terminal reliability of the bus network with redundancy of six terminal nodes, eight terminal nodes, and ten terminal nodes is 40.95%, 52.17%, and 61.26% higher than that of the bus network without redundancy, respectively; k-terminal reliability is 61.26%, 74.58%, and 83.32% higher than that of the bus network without redundancy, respectively. The bus network with redundancy increases the communication paths for data exchange between devices, and has higher reliability than the bus network without redundancy. The algorithms proposed in this paper provide an effective solution for the reliability evaluation of the bus network. It perfects the reliability evaluation system of the network with different topology architectures.INDEX TERMS Minimal path sets, minimal cut sets, reliability evaluation, Sum-of-Disjoint Products, the bus networks.

show abstract

“…The number of spanning trees of a graph is one of the most studied quantity in graph theory, this number appears in a several applications such as network reliability [8][9][10], cryptography [7], enumerating certain chemical isomers [11], and counting of the Eulerian circuits in a graph [12]. The study of this number was initiated by the physicist Kirchhoff who proposed a method called "Matrix Tree Theorem" expressing the number of spanning trees for any graph by computing the determinant of the Laplacian matrix defined by : L(G) = D(G)-A(G), with D(G) and A(G) are respectively the degrees matrix and the adjacency matrix [1].…”

Section: Introductionmentioning

confidence: 99%

Computing the number of spanning trees in the Wheel multiple graph

Khattabi¹

2019

IJATCSE

View full text Add to dashboard Cite

The number of spanning trees in a network relevant to several networks aspects, namely their topological and dynamic properties such as their reliability. Generally, this number can be obtained by the well-known Matrix Tree Theorem. However, computing the number of spanning trees in a network using this method is computationally demanding specially for a large network, which leads us to investigate the number of spanning trees in planar graphs. In this paper, we propose an efficient method to find exact formulas for counting the number of spanning trees in a general type of the multiple planar wheel graph.

show abstract

Reliable networking in Ethernet ring mesh networks using regular topologies

Cited by 8 publications

References 38 publications

Design and Reliability Analysis of a Novel Redundancy Topology Architecture

Design and Reliability Analysis of a Novel Redundancy Topology Architecture

An Efficient Algorithm for Reliability Evaluation of the Bus Network

Computing the number of spanning trees in the Wheel multiple graph

Contact Info

Product

Resources

About