dc.contributor.author |
Dinneen, Michael |
en |
dc.contributor.author |
Ventura, Jose |
en |
dc.contributor.author |
Wilson, Mark |
en |
dc.contributor.author |
Zakeri, Golbon |
en |
dc.date.accessioned |
2009-04-08T04:03:10Z |
en |
dc.date.available |
2009-04-08T04:03:10Z |
en |
dc.date.issued |
1997-02 |
en |
dc.identifier.citation |
Computer Science Technical Reports 139 (1997) |
en |
dc.identifier.issn |
1173-3500 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3487 |
en |
dc.description.abstract |
In broadcasting, or one-to-all communication, a message originally held in one node of the network must be transmitted to all the other nodes. A minimal broadcast network is a communication network that can transmit a message originated at any node to all other nodes of the network in minimum time. In this paper, we present a compound method to construct sparse, time-relaxed, minimal broadcast networks (t-mbn), in which broadcasting can be accomplished in slightly more than the minimum time. The proposed method generates a new network by connecting a subset of nodes from several copies of a t₁-mbn using the structure of another t₂-mbn. The objective is to construct a network as sparse as possible satisfying the desired broadcasting time constraint. Computational results illustrate the effectiveness of the proposed method. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
Computer Science Technical Reports |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/csTRcgi.pl?serial |
en |
dc.title |
Construction of Time-Relaxed Minimal Broadcast Networks |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |