research-article

Design to Minimize Diameter on Building-Block Network

Authors:

M. Imase,

M. ItohAuthors Info & Claims

IEEE Transactions on Computers, Volume 30, Issue 6

Pages 439 - 442

https://doi.org/10.1109/TC.1981.1675809

Published: 01 June 1981 Publication History

Publisher Site

Abstract

This paper proposes a simple algorithm for the graph design of small-diameter networks. For given nodes n and degree d, this algorithm can be used to construct a directed graph with diameter ?logd n?, which is at most one larger than the lower bound ?logd (n(d - 1) + 1)? - 1. Its average distance is also close to the lower bound. The algorithm can be used to construct a directed graph with smaller diameter, compared with any other conventional methods, when n is larger.

References

[1]

C. Duret, "A nodal structure switching network," in Proc. ICC 1979, June 1979, 40C2, pp. 834-839.

Google Scholar

[2]

K. Okada, M. Imase, and H. Ichikawa, "New architecture and the traffic aspects of switching network using microprocessors," presented at ITC, Oct. 1979.

Google Scholar

[3]

B. Elspas, "Topological construction on interconnection limited logic," Switching Theory Logic Des., vol. S-164, pp. 133-147. Oct. 1964.

Digital Library

Google Scholar

[4]

H. Friedman, "A design for (d, k) graphs," IEEE Trans. Electron. Comput., vol. EC-15, pp. 253-254, Apr. 1966.

Crossref

Google Scholar

[5]

I. Korn, "On (d, k) graphs," IEEE Trans. Electron. Comput., vol. EC-16, p. 90, Feb. 1967.

Crossref

Google Scholar

[6]

S. B, Akcrs "On the construction of (d, k) graphs," IEEE Trans. Electron. Comput., vol. EC-14, p. 488, June 1965.

Crossref

Google Scholar

[7]

C. K. Wong, "A combinational problem related to multimodule memory organization," J. Ass. Comput. Mach., vol. 21, pp. 392-402, July 1974.

Digital Library

Google Scholar

[8]

S. Toueg and K. Steiglitz, "The design of small-diameter networks by local search," IEEE Trans. Comput., vol. C-28, pp. 537-542, July 1979.

Digital Library

Google Scholar

[9]

B. Arden and H. Lec, "A multi-tree structured network," in Proc. 17th COMPCON, Sept 1978, pp. 201-210.

Google Scholar

[10]

S. Toueg, "On the impossibility of directed Moore graphs," J. Combinatorial Theory, to be published.

Google Scholar

Cited By

View all

Melnikov SSamouylov KZyazin A(2023)On the Identification of a Finite Automaton by Its Input and Output Sequences in Case of DistortionsDistributed Computer and Communication Networks: Control, Computation, Communications10.1007/978-3-031-50482-2_8(95-104)Online publication date: 25-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-50482-2_8
Baharev ASchichl HNeumaier AAchterberg T(2021)An Exact Method for the Minimum Feedback Arc Set ProblemACM Journal of Experimental Algorithmics10.1145/344642926(1-28)Online publication date: 23-Apr-2021
https://dl.acm.org/doi/10.1145/3446429
Mollah MFaizian PRahman MYuan XPakin SLang MEl-Araby EEl-Ghazawi TPanda D(2018)A comparative study of topology design approaches for HPC interconnectsProceedings of the 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing10.1109/CCGRID.2018.00066(392-401)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1109/CCGRID.2018.00066
Show More Cited By

Index Terms

Design to Minimize Diameter on Building-Block Network
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
      2. Network flows
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems
    2. Graph algorithms analysis
      1. Network flows

Index terms have been assigned to the content through auto-classification.

Recommendations

Upper bounds on the Steiner diameter of a graph

Let G be a connected graph of order p and S a nonempty set of vertices of G. Then the Steiner distance d(S) of S is the minimum size of a connected subgraph of G whose vertex set contains S. If n is an integer, 2@?n@?p, the Steiner n-diameter, diam"n(G),...
Steiner diameter of 3, 4 and 5-connected maximal planar graphs

Let G be a connected graph of order p and S a nonempty set of vertices of G . Then the Steiner distance d ( S ) of S is the minimum size of a connected subgraph of G whose vertex set contains S . If n is an integer, 2 n p , the Steiner n -diameter, diam ...
The diameter of directed graphs

Let D be a strongly connected oriented graph, i.e., a digraph with no cycles of length 2, of order n and minimum out-degree δ. Let D be eulerian, i.e., the in-degree and out-degree of each vertex are equal. Knyazev (Mat. Z. 41(6) 1987 829) proved that ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 30, Issue 6

June 1981

87 pages

ISSN:0018-9340

Issue’s Table of Contents

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 June 1981

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

37
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Melnikov SSamouylov KZyazin A(2023)On the Identification of a Finite Automaton by Its Input and Output Sequences in Case of DistortionsDistributed Computer and Communication Networks: Control, Computation, Communications10.1007/978-3-031-50482-2_8(95-104)Online publication date: 25-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-50482-2_8
Baharev ASchichl HNeumaier AAchterberg T(2021)An Exact Method for the Minimum Feedback Arc Set ProblemACM Journal of Experimental Algorithmics10.1145/344642926(1-28)Online publication date: 23-Apr-2021
https://dl.acm.org/doi/10.1145/3446429
Mollah MFaizian PRahman MYuan XPakin SLang MEl-Araby EEl-Ghazawi TPanda D(2018)A comparative study of topology design approaches for HPC interconnectsProceedings of the 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing10.1109/CCGRID.2018.00066(392-401)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1109/CCGRID.2018.00066
Du HHe XDu WFeldman M(2017)Optimization of the Critical Diameter and Average Path Length of Social NetworksComplexity10.1155/2017/32036152017Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1155/2017/3203615
Li KWang S(2017)Design Methodology of Fault-Tolerant Custom 3D Network-on-ChipACM Transactions on Design Automation of Electronic Systems10.1145/305474522:4(1-20)Online publication date: 20-May-2017
https://dl.acm.org/doi/10.1145/3054745
Lin ZLin DPei D(2017)Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applicationsCryptography and Communications10.1007/s12095-016-0183-89:4(431-443)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1007/s12095-016-0183-8
Dong YShan EKang L(2015)Constructing the minimum dominating sets of generalized de Bruijn digraphsDiscrete Mathematics10.5555/2779623.2779706338:8(1501-1508)Online publication date: 6-Aug-2015
https://dl.acm.org/doi/10.5555/2779623.2779706
Condo CMartina MRuo Roch MMasera G(2015)Exploiting generalized de-Bruijn/Kautz topologies for flexible iterative channel code decoder architecturesIntegration, the VLSI Journal10.1016/j.vlsi.2014.11.00350:C(139-146)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1016/j.vlsi.2014.11.003
Sabbaghi-Nadooshan RPatooghy A(2015)Analytical performance modeling of de Bruijn inspired mesh-based network-on-chipsMicroprocessors & Microsystems10.1016/j.micpro.2014.12.00239:1(27-36)Online publication date: 1-Feb-2015
https://dl.acm.org/doi/10.1016/j.micpro.2014.12.002
Lien MKuo JFu H(2015)On the decycling number of generalized Kautz digraphsInformation Processing Letters10.1016/j.ipl.2014.09.013115:2(209-211)Online publication date: 1-Feb-2015
https://dl.acm.org/doi/10.1016/j.ipl.2014.09.013
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

Upper bounds on the Steiner diameter of a graph

Steiner diameter of 3, 4 and 5-connected maximal planar graphs

The diameter of directed graphs

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations