Distributed loop network with minimum transmission delay

P. Erdős, D. Frank Hsu

Research output: Contribution to journalArticle

46 Citations (Scopus)

Abstract

Distributed loop networks are networks with at least one ring structure. They are widely used in the design of local area networks, multimodule memory organizations, data alignments in parallel memory systems, and supercomputer architecture. In this paper, we give a systematic and unified method of solutions in the design and implementation of these networks. We show that doubly linked loop networks with transmission delay less than or equal to (1+ε)√3N can be constructed asymptotically for sufficiently large N, the number of nodes in the network. This is close to the optimal value within a number which is small as compared to N. We then give several infinite classes of values of N for which optimal doubly linked loop networks can be actually designed. The method is then generalized to obtain a new upper bound for possible transmission delays in multiply linked loop networks. Routing and rerouting algorithms are designed for the optimal loop networks.

Original languageEnglish
Pages (from-to)223-241
Number of pages19
JournalTheoretical Computer Science
Volume100
Issue number1
DOIs
Publication statusPublished - Jun 22 1992

Fingerprint

Data storage equipment
Supercomputers
Local area networks
Computer systems
Supercomputer
Less than or equal to
Multiplication
Alignment
Routing
Upper bound
Ring
Vertex of a graph

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Distributed loop network with minimum transmission delay. / Erdős, P.; Hsu, D. Frank.

In: Theoretical Computer Science, Vol. 100, No. 1, 22.06.1992, p. 223-241.

Research output: Contribution to journalArticle

Erdős, P. ; Hsu, D. Frank. / Distributed loop network with minimum transmission delay. In: Theoretical Computer Science. 1992 ; Vol. 100, No. 1. pp. 223-241.
@article{2c985cdd831645afbc462d23efc5ddea,
title = "Distributed loop network with minimum transmission delay",
abstract = "Distributed loop networks are networks with at least one ring structure. They are widely used in the design of local area networks, multimodule memory organizations, data alignments in parallel memory systems, and supercomputer architecture. In this paper, we give a systematic and unified method of solutions in the design and implementation of these networks. We show that doubly linked loop networks with transmission delay less than or equal to (1+ε)√3N can be constructed asymptotically for sufficiently large N, the number of nodes in the network. This is close to the optimal value within a number which is small as compared to N. We then give several infinite classes of values of N for which optimal doubly linked loop networks can be actually designed. The method is then generalized to obtain a new upper bound for possible transmission delays in multiply linked loop networks. Routing and rerouting algorithms are designed for the optimal loop networks.",
author = "P. Erdős and Hsu, {D. Frank}",
year = "1992",
month = "6",
day = "22",
doi = "10.1016/0304-3975(92)90370-U",
language = "English",
volume = "100",
pages = "223--241",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Distributed loop network with minimum transmission delay

AU - Erdős, P.

AU - Hsu, D. Frank

PY - 1992/6/22

Y1 - 1992/6/22

N2 - Distributed loop networks are networks with at least one ring structure. They are widely used in the design of local area networks, multimodule memory organizations, data alignments in parallel memory systems, and supercomputer architecture. In this paper, we give a systematic and unified method of solutions in the design and implementation of these networks. We show that doubly linked loop networks with transmission delay less than or equal to (1+ε)√3N can be constructed asymptotically for sufficiently large N, the number of nodes in the network. This is close to the optimal value within a number which is small as compared to N. We then give several infinite classes of values of N for which optimal doubly linked loop networks can be actually designed. The method is then generalized to obtain a new upper bound for possible transmission delays in multiply linked loop networks. Routing and rerouting algorithms are designed for the optimal loop networks.

AB - Distributed loop networks are networks with at least one ring structure. They are widely used in the design of local area networks, multimodule memory organizations, data alignments in parallel memory systems, and supercomputer architecture. In this paper, we give a systematic and unified method of solutions in the design and implementation of these networks. We show that doubly linked loop networks with transmission delay less than or equal to (1+ε)√3N can be constructed asymptotically for sufficiently large N, the number of nodes in the network. This is close to the optimal value within a number which is small as compared to N. We then give several infinite classes of values of N for which optimal doubly linked loop networks can be actually designed. The method is then generalized to obtain a new upper bound for possible transmission delays in multiply linked loop networks. Routing and rerouting algorithms are designed for the optimal loop networks.

UR - http://www.scopus.com/inward/record.url?scp=0026879912&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026879912&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(92)90370-U

DO - 10.1016/0304-3975(92)90370-U

M3 - Article

VL - 100

SP - 223

EP - 241

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1

ER -