Optimally balanced spanning tree of the star network

The one-to-all personalized broadcast problem in an interconnection network can be optimally solved with respect to both the time and the number of transmissions if it is possible to construct an optimally balanced spanning tree of the network which is also a shortest path tree. We give an algorithm...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. 50; no. 1; pp. 88 - 91
Main Author Rescigno, A.A.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.01.2001
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithm design and analysis
Balancing
Broadcasting
Computer networks
Concurrent computing
Construction
Fault tolerance
Hypercubes
Interconnection
Multiprocessor interconnection networks
Networks
Optimization
Parallel algorithms
Shortest-path problems
Stars
Tree graphs
Trees
Online AccessGet full text

Cover

More Information
Summary:The one-to-all personalized broadcast problem in an interconnection network can be optimally solved with respect to both the time and the number of transmissions if it is possible to construct an optimally balanced spanning tree of the network which is also a shortest path tree. We give an algorithm to construct an optimally balanced spanning tree of the star network which is also a shortest path tree. Our result is optimal and improves on that of Chen et al. (1996) and Day and Tripathi (1994).
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/12.902755