Abstract
The Push-Tree Problem is a recently addressed optimization problem, with the aim to minimize the total amount of traffic generated on information broadcasting networks by a compromise between the use of “push” and “pull” mechanisms. That is, the push-tree problem can be seen as a mixture of building multicast trees with respect to nodes receiving pieces of information while further nodes may obtain information from the closest node within the tree by means of shortest paths. In this sense we are accounting for tradeoffs of push and pull mechanisms in information distribution. The objective of this paper is to extend the literature on the problem by presenting four mathematical formulations and by defining and applying some metaheuristics for its resolution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
1 See Koch et al. (2001) as well as http://elib.zib.de/steinlib/steinlib.php.
- 2.
References
R. Battiti. Reactive search: Toward self-tuning heuristics. In V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors, Modern Heuristic Search Methods, pages 61–83. Wiley, Chichester, 1996.
J.E. Beasley. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41:1069–1072, 1990.
K.V. Martínez Facundo, J.A. Saucedo Martínez, J. Á. Segura Ramiro, M. A. Urbano Vázquez, and R. Z. Ríos Mercado. El problema del árbol de empuje en sistemas de telecomunicaciones. Ingenierías, 10 (36), 2007.
A. Fink and S. Voß. HotFrame: A heuristic optimization framework. In S. Voß and D. Woodruff, editors, Optimization Software Class Libraries, pages 81–154. Kluwer, Boston, 2002.
F. Glover and M. Laguna. Tabu Search. Kluwer, Boston, 1997.
F. Havet. Robustness of a routing tree for a push tree problem. Technical Report 4464, INRIA, 2002.
F. Havet and M. Wennink. The push tree problem. In SPAA 01: 13th ACM Symposium on Parallel Algorithms and Architectures, pages 318–319, 2001.
F. Havet and M. Wennink. The push tree problem. Networks, 44:281–291, 2004.
M. Hollander and D.A. Wolfe. Nonparametric Statistical Methods, 2nd Edition. John Wiley & Sons, 1999.
D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning. Operations Research, 37:865–892, 1989.
T. Koch, A. Martin, and S. Voß. SteinLib: An updated library on Steiner tree problems in graphs. In D.-Z. Du and X. Cheng, editors, Steiner Trees in Industries, pages 285–325. Kluwer, Boston, 2001.
C.E. Miller, A.W. Tucker, and R.A. Zemlin. Integer programming formulation of traveling salesman problems. Journal of the Association of Computing Machinery, 7:326–329, 1960.
P. Mirchandani. The multi-tier tree problem. INFORMS Journal on Computing, 8: 202–218, 1996.
C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, New Jersey, 1982.
H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Math. Japonica, 24:573–577, 1980.
X. Tang and J. Xu. On replica placement for QoS-Aware content distribution. In Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 2, pages 806–815, 2004.
S. Voß. Steiner tree problems in telecommunications. In M. Resende and P.M. Pardalos, editors, Handbook of Optimization in Telecommunications, pages 459–492. Springer, New York, 2006.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this paper
Cite this paper
Caserta, M., Fink, A., Raiconi, A., Schwarze, S., Voß, S. (2009). Mathematical Formulations and Metaheuristics Comparison for the Push-Tree Problem. In: Chinneck, J.W., Kristjansson, B., Saltzman, M.J. (eds) Operations Research and Cyber-Infrastructure. Operations Research/Computer Science Interfaces, vol 47. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-88843-9_13
Download citation
DOI: https://doi.org/10.1007/978-0-387-88843-9_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-88842-2
Online ISBN: 978-0-387-88843-9
eBook Packages: Computer ScienceComputer Science (R0)