Abstract
We consider the problem of allocating database segments to the locations of a content distribution network (CDN). Many other decisions such as server location, query routing, user assignment and network topology are also addressed simultaneously. We consider the problem with the backbone (server network) being restricted to be a tree. Although it is an extremely hard problem to solve in its original form, prior information on the segment allocation, server location, and the tree backbone, reduces the original problem to a simple assignment problem, and therefore, indicates the suitability of a decomposition approach. We formulate the problem and develop a Benders decomposition approach. Due to the hardness of the master problem, we solve it heuristically to obtain a reasonable upper bound on the original problem in a short period of time. The success of the algorithm is particularly significant in large problems, for which CPLEX struggles to obtain even a feasible integer solution.
References
Applegate, D., Archer, A., Gopalakrishnan, V., Lee, S., Ramakrishnan, K.K.: Optimal content placement for a large-scale vod system. In: Proceedings of the 6th International Conference, Co-NEXT ’10, pp. 4:1–4:12. ACM, New York, NY, USA (2010)
Contreras, I., Fernndez, E., Marin, A.: The tree of hubs location problem. Eur. J. Oper. Res. 202(2), 390–400 (2010)
de Sá, E.M., de Camargo, R.S., de Miranda, G.: An improved benders decomposition algorithm for the tree of hubs location problem. Eur. J. Oper. Res. 226(2), 185–202 (2013)
McDaniel, D., Devine, M.: A modified benders’ partitioning algorithm for mixed integer programming. Manag. Sci. 24(3), 312–319 (1977)
Sen, G., Krishnamoorthy, M., Rangaraj, N., Narayanan, V.: Exact approaches for static data segment allocation problem in an information network. Comput. Oper. Res. 62, 282–295 (2015)
Sen, G., Krishnamoorthy, M., Rangaraj, N., Narayanan, V.: Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem. Networks (2016, in press). doi:10.1002/net.21675
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this paper
Cite this paper
Sen, G., Krishnamoorthy, M., Narayanan, V., Rangaraj, N. (2017). A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone. In: Dörner, K., Ljubic, I., Pflug, G., Tragler, G. (eds) Operations Research Proceedings 2015. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-42902-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-42902-1_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42901-4
Online ISBN: 978-3-319-42902-1
eBook Packages: Business and ManagementBusiness and Management (R0)