Networks communicating for each pairing of terminals

László Csaba, Ralph J. Faudree, A. Gyárfás, Jenö Lehel, Richard H. Schelp

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Let G be a multigraph of maximum degree Δ and with a set of t vertices of degree one, called terminals. We call G a (Δ, t)‐network if for any pairing of its terminals there exist edge‐disjoint paths in G between those pairs (t is even). The concept of (Δ, t)‐networks is introduced to model the situation when switching processors having Δ ports are to be connected in such a way that simultaneous communication is possible for any pairing of the free ports. We establish some properties of (Δ, t)‐networks. In particular, we investigate optimal (or near‐optimal) networks and obtain lower and upper bounds on the function n(Δ, t), the minimum number of interior nodes a (Δ, t)‐network can have.

Original languageEnglish
Pages (from-to)615-626
Number of pages12
JournalNetworks
Volume22
Issue number7
DOIs
Publication statusPublished - Jan 1 1992

Fingerprint

Communication

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Csaba, L., Faudree, R. J., Gyárfás, A., Lehel, J., & Schelp, R. H. (1992). Networks communicating for each pairing of terminals. Networks, 22(7), 615-626. https://doi.org/10.1002/net.3230220702

Networks communicating for each pairing of terminals. / Csaba, László; Faudree, Ralph J.; Gyárfás, A.; Lehel, Jenö; Schelp, Richard H.

In: Networks, Vol. 22, No. 7, 01.01.1992, p. 615-626.

Research output: Contribution to journalArticle

Csaba, L, Faudree, RJ, Gyárfás, A, Lehel, J & Schelp, RH 1992, 'Networks communicating for each pairing of terminals', Networks, vol. 22, no. 7, pp. 615-626. https://doi.org/10.1002/net.3230220702
Csaba, László ; Faudree, Ralph J. ; Gyárfás, A. ; Lehel, Jenö ; Schelp, Richard H. / Networks communicating for each pairing of terminals. In: Networks. 1992 ; Vol. 22, No. 7. pp. 615-626.
@article{da9f307101c142e097a5eac8cc8d722c,
title = "Networks communicating for each pairing of terminals",
abstract = "Let G be a multigraph of maximum degree Δ and with a set of t vertices of degree one, called terminals. We call G a (Δ, t)‐network if for any pairing of its terminals there exist edge‐disjoint paths in G between those pairs (t is even). The concept of (Δ, t)‐networks is introduced to model the situation when switching processors having Δ ports are to be connected in such a way that simultaneous communication is possible for any pairing of the free ports. We establish some properties of (Δ, t)‐networks. In particular, we investigate optimal (or near‐optimal) networks and obtain lower and upper bounds on the function n(Δ, t), the minimum number of interior nodes a (Δ, t)‐network can have.",
author = "L{\'a}szl{\'o} Csaba and Faudree, {Ralph J.} and A. Gy{\'a}rf{\'a}s and Jen{\"o} Lehel and Schelp, {Richard H.}",
year = "1992",
month = "1",
day = "1",
doi = "10.1002/net.3230220702",
language = "English",
volume = "22",
pages = "615--626",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "7",

}

TY - JOUR

T1 - Networks communicating for each pairing of terminals

AU - Csaba, László

AU - Faudree, Ralph J.

AU - Gyárfás, A.

AU - Lehel, Jenö

AU - Schelp, Richard H.

PY - 1992/1/1

Y1 - 1992/1/1

N2 - Let G be a multigraph of maximum degree Δ and with a set of t vertices of degree one, called terminals. We call G a (Δ, t)‐network if for any pairing of its terminals there exist edge‐disjoint paths in G between those pairs (t is even). The concept of (Δ, t)‐networks is introduced to model the situation when switching processors having Δ ports are to be connected in such a way that simultaneous communication is possible for any pairing of the free ports. We establish some properties of (Δ, t)‐networks. In particular, we investigate optimal (or near‐optimal) networks and obtain lower and upper bounds on the function n(Δ, t), the minimum number of interior nodes a (Δ, t)‐network can have.

AB - Let G be a multigraph of maximum degree Δ and with a set of t vertices of degree one, called terminals. We call G a (Δ, t)‐network if for any pairing of its terminals there exist edge‐disjoint paths in G between those pairs (t is even). The concept of (Δ, t)‐networks is introduced to model the situation when switching processors having Δ ports are to be connected in such a way that simultaneous communication is possible for any pairing of the free ports. We establish some properties of (Δ, t)‐networks. In particular, we investigate optimal (or near‐optimal) networks and obtain lower and upper bounds on the function n(Δ, t), the minimum number of interior nodes a (Δ, t)‐network can have.

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

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

U2 - 10.1002/net.3230220702

DO - 10.1002/net.3230220702

M3 - Article

AN - SCOPUS:85011848965

VL - 22

SP - 615

EP - 626

JO - Networks

JF - Networks

SN - 0028-3045

IS - 7

ER -