Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions

M. Keller, H. Karl, IEEE Transactions on Network and Service Management (2017) 121--135.

Download
Restricted 64-07572217.pdf 1.51 MB
Journal Article
Author
;
Department
Abstract
A current trend in networking and cloud computing is to provide compute resources at widely distributed sites; this is exemplified by developments such as Network Function Virtualisation. This paves the way for wide-area service deployments with improved service quality: e.g. user-perceived response times can be reduced by offering services at nearby sites. But always assigning users to the nearest site can be a bad decision if this site is already highly utilised. This paper formalises two related decisions of allocating compute resources at different sites and assigning users to them with the goal of minimising the response times while the total number of resources to be allocated is limited – a non-linear capacitated Facility Location Problem with integrated queuing systems. To efficiently handle its non-linearity, we introduce five linear problem linearisations and adapt the currently best heuristic for a similar scenario to our scenario. All six approaches are compared in experiments for solution quality and solving time. Surprisingly, our best optimisation formulation outperforms the heuristic in both time and quality. Additionally, we evaluate the influence of distributions of available compute resources in the network on the response time: The time was halved for some configurations. The presented formulation techniques for our problem linearisations are applicable to a broader optimisation domain.
Publishing Year
Journal Title
IEEE Transactions on Network and Service Management
Issue
1
Page
121--135
LibreCat-ID

Cite this

Keller M, Karl H. Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions. IEEE Transactions on Network and Service Management. 2017;(1):121--135. doi:10.1109/TNSM.2016.2611590
Keller, M., & Karl, H. (2017). Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions. IEEE Transactions on Network and Service Management, (1), 121--135. https://doi.org/10.1109/TNSM.2016.2611590
@article{Keller_Karl_2017, title={Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions}, DOI={10.1109/TNSM.2016.2611590}, number={1}, journal={IEEE Transactions on Network and Service Management}, publisher={IEEE}, author={Keller, Matthias and Karl, Holger}, year={2017}, pages={121--135} }
Keller, Matthias, and Holger Karl. “Response-Time-Optimised Service Deployment: MILP Formulations of Piece-Wise Linear Functions Approximating Non-Linear Bivariate Mixed-Integer Functions.” IEEE Transactions on Network and Service Management, no. 1 (2017): 121--135. https://doi.org/10.1109/TNSM.2016.2611590.
M. Keller and H. Karl, “Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions,” IEEE Transactions on Network and Service Management, no. 1, pp. 121--135, 2017.
Keller, Matthias, and Holger Karl. “Response-Time-Optimised Service Deployment: MILP Formulations of Piece-Wise Linear Functions Approximating Non-Linear Bivariate Mixed-Integer Functions.” IEEE Transactions on Network and Service Management, no. 1, IEEE, 2017, pp. 121--135, doi:10.1109/TNSM.2016.2611590.
Main File(s)
File Name
64-07572217.pdf 1.51 MB
Access Level
Restricted Closed Access
Last Uploaded
2018-03-21T13:15:53Z


Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar