Triple loop networks with small transmission delay (Q1356442): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An efficient algorithm to find optimal double loop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact order of subsets of asymptotic bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters of weighted double loop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed loop network with minimum transmission delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double commutative-step digraphs with minimum diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruences in \({\mathbb{Z}}^ n\), finite Abelian groups and the Chinese remainder theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Problems in the Construction of Distributed Loop Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double loop networks with minimum delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two theorems on matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Related to Multimodule Memory Organizations / rank
 
Normal rank

Revision as of 13:09, 27 May 2024

scientific article
Language Label Description Also known as
English
Triple loop networks with small transmission delay
scientific article

    Statements

    Triple loop networks with small transmission delay (English)
    0 references
    0 references
    5 October 1997
    0 references
    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.
    0 references
    multiloop networks
    0 references
    diameter
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references