Gigabits-per-second optical interconnection networks: fault-tolerance with and without optical amplifiers

Author(s):  
O.K. Tonguz
2015 ◽  
Vol 26 (01) ◽  
pp. 159-168 ◽  
Author(s):  
Xianyong Li ◽  
Xiaofan Yang ◽  
Li He ◽  
Cui Yu ◽  
Jing Zhang

Fault tolerance is especially important for interconnection networks, vastly influencing the performance of the parallel processing systems underlying the corresponding networks. This paper studies the fault tolerance of radix-k n-dimensional hypermesh optical interconnection networks, determines the connectivity of partial hypermesh, and derives the conditional connectivity of hypermesh provided that each adjacent set cannot be faulty simultaneously. Under this condition, the hypermesh networks can tolerate up to 2n(k-1)-k-1 fault processors without being disrupted, implying that when the number of dimension n (respectively, radix-k) is a fixed value in the hypermesh network, the larger the value of radix-k (respectively, dimension n) is, the higher the reliability and availability of the network becomes.


2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Xianyong Li ◽  
Yajun Du ◽  
Yongquan Fan

As power grids and optical interconnection networks are interdependent, the reliabilities of the optical networks are critical issues in power systems. The optical networks hold prominent performance including wide bandwidth, low loss, strong anti-interference capability, high fidelity, and reliable performance. They are regarded as promising alternatives to electrical networks for parallel processing. This paper is aimed at taking the first step in understanding the communication efficiencies of optical networks. For that purpose, on optical networks, we propose a series of novel notions including communication pattern, r -communication graph, reduced diameter, enhanced connectivity, r -diameter, and r -connectivity. Using these notions, we determine that the r -diameter and r -connectivity of the optical n -dimensional hypercube network are n / r and n 1 + n 2 + ⋯ + n r , respectively. Since the parameter r is variable, we can adjust different values of r on the basis of the wavelength resources and load of the optical networks, achieving enhanced communication efficiencies of these networks. Compared with the electric n -dimensional hypercube network, the proposed communication pattern on the optical hypercube network not only reduces the maximum communication delay of the conventional electrical hypercube significantly but also improves its fault tolerance remarkably.


Author(s):  
Pier Giorgio Raponi ◽  
Nicola Andriolli ◽  
Isabella Cerutti ◽  
Piero Castoldi ◽  
Odile Liboiron-Ladouceur

2018 ◽  
Vol 29 (06) ◽  
pp. 995-1001 ◽  
Author(s):  
Shuli Zhao ◽  
Weihua Yang ◽  
Shurong Zhang ◽  
Liqiong Xu

Fault tolerance is an important issue in interconnection networks, and the traditional edge connectivity is an important measure to evaluate the robustness of an interconnection network. The component edge connectivity is a generalization of the traditional edge connectivity. The [Formula: see text]-component edge connectivity [Formula: see text] of a non-complete graph [Formula: see text] is the minimum number of edges whose deletion results in a graph with at least [Formula: see text] components. Let [Formula: see text] be an integer and [Formula: see text] be the decomposition of [Formula: see text] such that [Formula: see text] and [Formula: see text] for [Formula: see text]. In this note, we determine the [Formula: see text]-component edge connectivity of the hypercube [Formula: see text], [Formula: see text] for [Formula: see text]. Moreover, we classify the corresponding optimal solutions.


2019 ◽  
Vol 29 (04) ◽  
pp. 1950017
Author(s):  
Shiying Wang ◽  
Mujiangshan Wang

Connectivity plays an important role in measuring the fault tolerance of interconnection networks. As a topology structure of interconnection networks, the m-ary n-dimensional hypercube [Formula: see text] has many good properties. In this paper, we prove, by elementary method, that [Formula: see text] is tightly [Formula: see text] super connected [Formula: see text] and super edge-connected [Formula: see text].


1990 ◽  
Author(s):  
Peter Healey ◽  
Steven A. Cassidy ◽  
David W. Smith

Sign in / Sign up

Export Citation Format

Share Document