---
res:
bibo_abstract:
- 'In the near future many more compute resources will be available at different
geographical locations. To minimize the response time of requests, application
servers closer to the user can hence be used to shorten network round trip times.
However, this advantage is neutralized if the used data centre is highly loaded
as the processing time of re- quests is important as well. We model the request
response time as the network round trip time plus the processing time at a data
centre.We present a capacitated facility location problem formal- ization where
the processing time is modelled as the sojourn time of a queueing model. We discuss
the Pareto trade-off between the number of used data centres and the resulting
response time. For example, using fewer data centres could cut expenses but results
in high utilization, high response time, and smaller revenues.Previous work presented
a non-linear cost function. We prove its convexity and exploit this property in
two ways: First, we transform the convex model into a linear model while controlling
the maximum approximation error. Sec- ond, we used a convex solver instead of
a slower non-linear solver. Numerical results on network topologies exemplify
our work.@eng'
bibo_authorlist:
- foaf_Person:
foaf_givenName: Matthias
foaf_name: Keller, Matthias
foaf_surname: Keller
- foaf_Person:
foaf_givenName: Holger
foaf_name: Karl, Holger
foaf_surname: Karl
foaf_workInfoHomepage: http://www.librecat.org/personId=126
bibo_doi: 10.1145/2627566.2627570
dct_date: 2014^xs_gYear
dct_language: eng
dct_title: Response Time-Optimized Distributed Cloud Resource Allocation@
...