Abstract
We consider the broadcasting problem in heterogeneous tree networks T = (V(T),E(T)) with edge weight uncertainty, where the edge weight w u,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.
This work is partially supported by the National Science Council under the Grants No. NSC98-2221-E-019-029, and NSC99-2221-E-019-022-MY2.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Averbakh, I., Berman, O.: Minimax regret p-center location on a network with demand uncertainty. Location Science 5(4), 247–254 (1997)
Averbakh, I., Berman, O.: Algorithms for the robust 1-center problem on a tree. European J. Oper. Res. 123(2), 292–302 (2000)
Averbakh, I., Berman, O.: Minmax regret median location on a network under uncertainty. INFORMS J. Comput. 12(2), 104–110 (2000)
Bar-Noy, A., Kipnis, S.: Designing broadcasting algorithms in the postal model for message-passing systems. Math. Systems Theory 27(5), 431–452 (1994)
Burkard, R.E., Dollani, H.: A note on the robust 1-center problem on trees. Ann. Oper. Res. 110, 69–82 (2002)
van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Theory Comput. Syst. 10, 99–127 (1976)
Garey, M.R., Johnson, D.S.: Approximation algorithms for combinatorial problems: an annotated bibliography. In: Algorithms and Complexity: New Directions and Recent Results, pp. 41–52. Academic Press, New York (1976)
Goldman, A.J.: Optimal center location in simple networks. Transportation Science 5, 212–221 (1971)
Khuller, S., Kim, Y.A., Wan, Y.C.: On generalized gossiping and broadcasting. J. Algorithms 59(2), 81–106 (2006)
Koh, J.m., Tcha, D.w.: Information dissemination in trees with nonuniform edge transmission times. IEEE Trans. Comput. 40(10), 1174–1177 (1991)
Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. In: Nonconvex Optimization and its Applications, vol. 14, pp. xvi+356. Kluwer Academic Publishers, Dordrecht (1997)
Lee, H.-M., Chang, G.J.: Set to set broadcasting in communication networks. Discrete Appl. Math. 40(3), 411–421 (1992)
Nikulin, Y.: Robustness in combinatorial optimization and scheduling theory: An extended annotated bibliography (August 2006)
Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J. Comput. 10(4), 692–701 (1981)
Su, Y.-H., Lin, C.-C., Lee, D.T.: Broadcasting in Heterogeneous Tree Networks. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 368–377. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsou, CH., Chen, GH., Lin, CC. (2011). Broadcasting in Heterogeneous Tree Networks with Uncertainty. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-25591-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25590-8
Online ISBN: 978-3-642-25591-5
eBook Packages: Computer ScienceComputer Science (R0)