Paper Info
Title
An Efficient Vertex Addition Method For Broadcast Networks
Abstract
Broadcasting is a basic problem of communication in usual networks. Many papers have investigated the construction of minimum broadcast networks, the cheapest possible broadcast network architecture (having the fewest communication lines), in which broadcasting can be accomplished as fast as theoretically possible from any vertex. Since this problem is very difficult, numerous papers have investigated ways to construct sparse networks in which broadcasting can be completed in minimum time from any originator. In this paper we introduce an efficient vertex addition method that allows us to construct sparse networks and improve the best known upper bounds on the broadcast function B(n) for many odd values of n. We also give the exact value of B(127).
Year
DOI
Venue
2008
10.1080/15427951.2008.10129163
INTERNET MATHEMATICS
Keywords
Field
DocType
network architecture,upper bound
Broadcasting,Combinatorics,Architecture,Atomic broadcast,Vertex (geometry),Computer science,Broadcasting (networking),Theoretical computer science,Minimum time
Journal
Volume
Issue
ISSN
5
3
1542-7951
Citations 
PageRank 
References 
14
0.64
0
Authors
1
Name
Order
Citations
PageRank
Hovhannes A. Harutyunyan120628.18