Triple loop networks with small transmission delay

DOI10.1016/S0012-365X(96)00213-0MaRDI QIDQ1356442zbMATH OpenWikidataFDO

Authors O. Diekmann, Francesc Aguiló, Miquel Angel Fiol, Christine Garcia

Publication date 5 October 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(96)00213-0

zbMATH Keywords

diametermultiloop networks

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Analytic circuit theory (94C05) Applications of graph theory to circuits and networks (94C15)

Review text

The paper studies the triple loop case of the problem of finding multiloop networks with a fixed number of vertices and small diameter. Based on lattice theory and integral circulant matrices, a method is developed to deal with this problem by constructing three infinite families of triple loop networks with large order for the values of the diameter \(D=2, 4, 5\pmod 6\), showing that \(N(3,D)\geq 2D^3/27+ O(D^2)\), where \(N(3,D)\) is the number of vertices for a triple loop network with diameter \(D\). Similar results are also obtained in the more general frame of triple commutative-step digraphs.

Recommendations

• Triple Loop Networks with Minimal Transmission Delay
• scientific article; zbMATH DE number 2192178
• scientific article; zbMATH DE number 1785752
• New dense families of triple loop networks
• Double loop networks with minimum delay

Cites work

• A Combinatorial Problem Related to Multimodule Memory Organizations
• An efficient algorithm to find optimal double loop networks
• Congruences in \({\mathbb{Z}}^ n\), finite Abelian groups and the Chinese remainder theorem
• Diameters of weighted double loop networks
• Distributed loop network with minimum transmission delay
• Double commutative-step digraphs with minimum diameters
• Double loop networks with minimum delay
• Exact order of subsets of asymptotic bases
• Extremal Problems in the Construction of Distributed Loop Networks
• scientific article; zbMATH DE number 3966106 (Why is no real title available?)
• scientific article; zbMATH DE number 176256 (Why is no real title available?)
• On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant
• Two theorems on matrices

Cited in

(19)

• Triple-loop networks with arbitrarily many minimum distance diagrams
• New dense families of triple loop networks
• On transmitting delay in a distance-transitive strongly antipodal graph
• The existence of hyper-L triple-loop networks.
• A survey on multi-loop networks.
• A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency
• On the existence of hyper-L triple-loop networks
• Network properties of double and triple fixed step graphs
• Abelian Cayley digraphs with asymptotically large order for any given degree
• Gossiping and routing in undirected triple-loop networks
• scientific article; zbMATH DE number 146672 (Why is no real title available?)
• Triple Loop Networks with Minimal Transmission Delay
• scientific article; zbMATH DE number 1785752 (Why is no real title available?)
• The dilating method to obtain dense Cayley digraphs on finite abelian groups
• scientific article; zbMATH DE number 7310081 (Why is no real title available?)
• A set of families of analytically described triple loop networks defined by a parameter
• Large chordal rings for given diameter and uniqueness property of minima.
• scientific article; zbMATH DE number 2192178 (Why is no real title available?)
• Modeling hexagonal constellations with Eisenstein-Jacobi graphs

This page was built for publication: Triple loop networks with small transmission delay

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356442)