Projective planes and congestion-free networks

Authors:
Charles J. Colbourn
Affiliations:
Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
Venue:
Discrete Applied Mathematics
Year:
2002

Citing 6
Cited 3

Design theory

Design theory
Applications of combinatorial designs in computer science

ACM Computing Surveys (CSUR)
The Organization of Permutation Architectures with Bused Interconnections

IEEE Transactions on Computers
Bus interconnection networks

Discrete Applied Mathematics
Combinatorial design of congestion-free networks

IEEE/ACM Transactions on Networking (TON)
Quorums from difference covers

Information Processing Letters

Multiple access communications using combinatorial designs

Theoretical aspects of computer science
Multiple Access Communications Using Combinatorial Designs

Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Projective Planes, Coverings and a Network Problem

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.04

Visualization

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.