Premium
Degree‐ and time‐constrained broadcast networks
Author(s) -
Dinneen Michael J.,
Pritchard Geoffrey,
Wilson Mark C.
Publication year - 2002
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.10018
Subject(s) - degree (music) , broadcasting (networking) , computer science , broadcast communication network , upper and lower bounds , mathematical optimization , theoretical computer science , mathematics , computer network , mathematical analysis , physics , acoustics
Abstract We consider the problem of constructing networks with as many nodes as possible, subject to upper bounds on the degree and broadcast time. This paper includes the results of an extensive empirical study of broadcasting in small regular graphs using a stochastic search algorithm to approximate the broadcast time. Significant improvements on known results are obtained for cubic broadcast networks. © 2002 Wiley Periodicals, Inc.