Distributed Loop Computer-Networks: A Survey

doi:10.1006/jpdc.1995.1002

Journal of Parallel and Distributed Computing

Volume 24, Issue 1, January 1995, Pages 2-10

https://doi.org/10.1006/jpdc.1995.1002 Get rights and content

Abstract

Distributed loop computer networks are extensions of the ring networks and are widely used in the design and implementation of local area networks and parallel processing architectures. We give a survey of recent results on this class of interconnection networks. We pay special attention to the actual computation of the minimum diameter and the construction of loop networks which can achieve this optimal number. Some open problems are offered for further investigation.

References (0)

Cited by (347)

On infinite circulant-balanced complete multipartite graphs decompositions based on generalized algorithmic approaches
2022, Alexandria Engineering Journal
Graph theory is a powerful and essential tool for applied scientists and engineers in analyzing and designing algorithms for several problems. Graph theory has a vital role in complex systems, especially in computer sciences. Applications of graph theory can be found in many scientific disciplines such as operational research, engineering, life sciences, management sciences, coding, and computer science. In the literature, there are two algorithms for constructing decompositions for the circulant graphs $C_{2 r, r}$ with $2 r$ vertices and $r$ degree. For $r, m ⩾ 2,$ a circulant-balanced complete multipartite graph $C_{mr, (m - 1) r}$ is a generalization to $C_{2 r, r} .$ Here, the major contributions are the generalization of the algorithms used for constructing the decompositions for the circulant graphs $C_{2 r, r}$ to generalized algorithms that can be used for the decomposition of $C_{mr, (m - 1) r}$ that have $mr$ vertices and $(m - 1) r$ degree. These generalized algorithms manage us to decompose the circulant graphs $C_{mr, (m - 1) r}$ by different graph classes. The paper's novelty is demonstrated by the fact that it is the first to suggest general approaches for decomposing circulant-balanced complete multipartite graphs. The constructed results in the present paper are suitable for generating different codes and also have great importance in the design of experiments.
On the decomposition of circulant graphs using algorithmic approaches: On the decomposition of circulant graphs
2022, Alexandria Engineering Journal
Many structural models in chemistry, biology, computer science, sociology, and operations research can be analyzed using graph theory. Some examples of these structure models are species movement between regions, molecular bonds, shortest spanning trees, development of computer algorithms. This paper introduces the edge decomposition of circulant graphs with 2n vertices by different graph classes. These circulant graphs are denoted as $C_{2 n, n},$ where n is the degree of the graph $C_{2 n, n} .$ We propose two algorithmic approaches for constructing edge decomposition of $C_{2 n, n} .$ With aid of the proposed algorithmic approaches, we construct paths decompositions, trees decompositions, disjoint unions of cycles and trees decompositions, and complete bipartite graphs decompositions of $C_{2 n, n} .$ In the end, a recursive construction of an edge decomposition, based on orthogonal edge decompositions, is proposed. This helps in using the mutually orthogonal decompositions of the circulant graphs $C_{2 n, n}$ in several applications, such as the design of experiments and binary codes generation.
Algebraic invariants of edge ideals of some circulant graphs
2024, AIMS Mathematics
Labeling Circulant Graphs: Distance Two Condition
2023, Symmetry
ALGEBRAIC INVARIANTS OF EDGE IDEALS OF CUBIC CIRCULANT GRAPHS
2023, arXiv
The Novel Generally Described Graphs for Cyclic Orthogonal Double Covers of Some Circulants
2023, Lobachevskii Journal of Mathematics

View all citing articles on Scopus

View full text

Regular ArticleDistributed Loop Computer-Networks: A Survey

Abstract

Regular Article
Distributed Loop Computer-Networks: A Survey