Broadcasting in heterogeneous tree networks

Authors:
Yu-Hsuan Su;Ching-Chi Lin;D. T. Lee
Affiliations:
Graduate Institute of Electronic Engineering, National Taiwan University, Taiwan;Department of Computer Science and Engineering, National Taiwan Ocean University, Taiwan;Institute of Information Science, Academia Sinica, Taiwan
Venue:
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Year:
2010

Citing 8
Cited 1

Information Dissemination in Trees with Nonuniform Edge Transmission Times

IEEE Transactions on Computers
Set to set broadcasting in communication networks

Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
Designing broadcasting algorithms in the Postal Model for message-passing systems

Proceedings of the 4th ACM symposium on Parallel algorithms and architectures
Message Multicasting in Heterogeneous Networks

SIAM Journal on Computing
An Approximation Algorithm for the Directed Telephone Multicast Problem

Algorithmica
Broadcasting in Heterogeneous Networks

Algorithmica
On generalized gossiping and broadcasting

Journal of Algorithms
Broadcasting on Networks of Workstations

Algorithmica

Broadcasting in heterogeneous tree networks with uncertainty

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the broadcasting problem in heterogeneous tree networks. A heterogeneous tree network is represented by a weighted tree T = (V,E) such that the weight of each edge denotes the communication time between the two end vertices. The broadcasting problem is to find a broadcast center such that the maximum communication time from the broadcast center to all vertices is minimized. In this paper, we propose a linear time algorithm for the broadcasting problem in a heterogeneous tree network following the postal model. As a byproduct of the algorithm, we can compute in linear time the broadcasting time of any vertex in the tree, i.e., the maximum time required to transmit messages from the vertex to every other vertex in the tree. Furthermore, an optimal sequence by which the broadcast center broadcasts its messages to all vertices in T can also be determined in linear time.