Broadcasting in heterogeneous tree networks with uncertainty

Authors:
Cheng-Hsiao Tsou;Gen-Huey Chen;Ching-Chi Lin
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Department of Computer Science and Engineering, National Taiwan Ocean University, Keelung, Taiwan
Venue:
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Year:
2011

Citing 6
Cited 0

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
Minmax Regret Median Location on a Network Under Uncertainty

INFORMS Journal on Computing
On generalized gossiping and broadcasting

Journal of Algorithms
Broadcasting in heterogeneous tree networks

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the broadcasting problem in heterogeneous tree networks T=(V(T),E(T)) with edge weight uncertainty, where the edge weight wu,v can take any value from [w−u,v,$w^+_{u,v}$] with unknown distribution. The broadcasting problem with uncertainty is to find a "minmax-regret" broadcast center to minimize the worst-case loss in the objective function that may occur due to the uncertainty. In this paper, we propose an O(n logn loglogn)-time algorithm for the broadcasting problem with uncertainty in heterogeneous tree networks following the postal model.