Projective planes and congestion-free networks

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The design of networks using broadcast media so that every two sites lie on a common link, subject to constraints on the number of links at each site (degree), and the number of sites on each link (link size), is examined. A method proposed by Yener et al. is shown to fail, in general, to achieve the minimum link size for a specified degree constraint. The existence of (k,n)-arcs in projective planes is employed to improve upon their results.

Original languageEnglish (US)
Pages (from-to)117-126
Number of pages10
JournalDiscrete Applied Mathematics
Volume122
Issue number1-3
DOIs
StatePublished - Oct 15 2002

Fingerprint

Projective plane
Congestion
Broadcast
Arc of a curve
Design

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Projective planes and congestion-free networks. / Colbourn, Charles.

In: Discrete Applied Mathematics, Vol. 122, No. 1-3, 15.10.2002, p. 117-126.

Research output: Contribution to journalArticle

@article{df0c68a860474fe3861fc80b148f8ba2,
title = "Projective planes and congestion-free networks",
abstract = "The design of networks using broadcast media so that every two sites lie on a common link, subject to constraints on the number of links at each site (degree), and the number of sites on each link (link size), is examined. A method proposed by Yener et al. is shown to fail, in general, to achieve the minimum link size for a specified degree constraint. The existence of (k,n)-arcs in projective planes is employed to improve upon their results.",
author = "Charles Colbourn",
year = "2002",
month = "10",
day = "15",
doi = "10.1016/S0166-218X(01)00356-0",
language = "English (US)",
volume = "122",
pages = "117--126",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Projective planes and congestion-free networks

AU - Colbourn, Charles

PY - 2002/10/15

Y1 - 2002/10/15

N2 - The design of networks using broadcast media so that every two sites lie on a common link, subject to constraints on the number of links at each site (degree), and the number of sites on each link (link size), is examined. A method proposed by Yener et al. is shown to fail, in general, to achieve the minimum link size for a specified degree constraint. The existence of (k,n)-arcs in projective planes is employed to improve upon their results.

AB - The design of networks using broadcast media so that every two sites lie on a common link, subject to constraints on the number of links at each site (degree), and the number of sites on each link (link size), is examined. A method proposed by Yener et al. is shown to fail, in general, to achieve the minimum link size for a specified degree constraint. The existence of (k,n)-arcs in projective planes is employed to improve upon their results.

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

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

U2 - 10.1016/S0166-218X(01)00356-0

DO - 10.1016/S0166-218X(01)00356-0

M3 - Article

AN - SCOPUS:84867954358

VL - 122

SP - 117

EP - 126

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1-3

ER -