File(s) under permanent embargo
Optimal broadcasting for locally twisted cubes
This paper addresses the single node broadcast problem over a locally twisted cube (LTQ). The broadcast algorithm proposed for this problem uses a new broadcast tree construction which can run in time O(NlogN) where N=2 n is the number of the nodes in LTQ. The broadcast tree turns out to be optimal in terms of the number of transmission steps. To the best of our knowledge, it is the first time to present an optimal broadcast algorithm for LTQ.
History
Journal
Information processing lettersVolume
112Issue
4Pagination
129 - 134Publisher
Elsevier B.V.Location
Amsterdam, The NetherlandsPublisher DOI
ISSN
0020-0190eISSN
1872-6119Language
engPublication classification
C1.1 Refereed article in a scholarly journalCopyright notice
2011, ElsevierUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC