Double loop networks with minimum delay
type: Item
instance of: scholarly article
title: Double loop networks with minimum delay
zbMATH Open document ID: 0614.90035
DOI: 10.1016/0012-365X(87)90123-3
author: Yanyan Li
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
review text: Double loop networks have been widely studied as practical and reliable computer networks. Let N denote the number of stations in a double loop network. The literature has proposed a topology which yields the diameter \(2\sqrt{N}\). In this paper we give a heuristic method which finds a topology with diameter roughly \(\sqrt{3N}\) for large N. We also give several infinite classes of values of N for which topologies are found that achieve the lower bound \(\lceil \sqrt{3N}\rceil -2\) for the diameter.
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 3995413
zbMATH Keywords: minimum delay
zbMATH Keywords: Double loop networks
zbMATH Keywords: diameter
MaRDI profile type: Publication
cites work: A Combinatorial Problem Related to Multimodule Memory Organizations
description: scientific article; zbMATH DE number 3995413