Broadcasting in Heterogeneous Networks

Authors:
Samir Khuller;Yoo-Ah Kim
Affiliations:
Department of Computer Science, University of Maryland, College Park, MD 20742, USA;Computer Science and Engineering Department, University of Connecticut, Storrs, CT 06269, USA
Venue:
Algorithmica
Year:
2007

Citing 0
Cited 4

Approximation Algorithms for Key Management in Secure Multicast

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Optimum Broadcasting in Complete Weighted-Vertex Graphs

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Broadcasting in heterogeneous tree networks

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Optimal file distribution in peer-to-peer networks

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

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we study a well-known broadcasting heuristic for heterogeneous networks of workstations, called fastest node first. We show that this heuristic produces an optimal solution for minimizing the sum of all completion times and, in addition, produces a 1.5 approximation for the problem of minimizing the maximum completion time. We also develop a polynomial-time approximation scheme for this problem. We extend these results to show that the same bounds can be obtained for the multicast operation on such heterogeneous networks. In addition we show that the problem of minimizing the maximum completion time is NP-hard, which settles the complexity of this open problem.