Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Cost-Efficient, Reliable, Util...

Cost-Efficient, Reliable, Utility-Based Session Management in the Cloud

Benjamin Byholm, Iván Porres, Cost-Efficient, Reliable, Utility-Based Session Management in the Cloud. In: Pavan Balaji, Ian Foster, Xian-He Sun, Kirk W. Cameron, Dimitrios S. Nikolopoulos (Eds.), 14th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing, IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, 102–111, IEEE Computer Society, 2014.

http://dx.doi.org/10.1109/CCGrid.2014.22

Abstract:

We present a model and system for cost-efficient and reliable management
of sessions in a Cloud, based on the von Neumann-Morgenstern utility theorem.
Our model enables a web application provider to maximize profit while
maintaining a desired quality of service. The objective is to determine whether,
when, where, and how long to store a session, given multiple storage options
with various properties, e.g. cost, capacity, and reliability. Reliability is affected
by three factors: how often session state is stored, how many stores are used, and
how reliable those stores are. To account for these factors, we use a Markovian
reliability model and treat the valid storage options for each session as a
von Neumann-Morgenstern lottery. We proceed by representing the resulting
problem as a knapsack problem, which can be heuristically solved for a good
compromise between efficiency and effectiveness. We analyze the results from
a discrete-event simulation involving multiple session management policies,
including two utility-based policies: a greedy heuristic policy intended to give
real-time performance and a reference policy based on solving the linear
programming relaxation of the knapsack problem, giving a theoretical upper
bound on achievable utility. As the focus of this work is exploratory, rather than
performance-based, we do not directly measure the time required for solving
the model. Instead, we give the computational complexity of the algorithms.
Our results indicate that otherwise unprofitable services become profitable
through utility-based session management in a cloud setting. However, if the
costs are much lower than the expected revenues, all policies manage to turn
a profit. Different policies performed the best under different circumstances.

Files:

Full publication in PDF-format

BibTeX entry:

@INPROCEEDINGS{inpByPo14a,
  title = {Cost-Efficient, Reliable, Utility-Based Session Management in the Cloud},
  booktitle = {14th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing},
  author = {Byholm, Benjamin and Porres, Iván},
  series = {IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing},
  editor = {Balaji, Pavan and Foster, Ian and Sun, Xian-He and Cameron, Kirk W. and Nikolopoulos, Dimitrios S.},
  publisher = {IEEE Computer Society},
  pages = {102–111},
  year = {2014},
  keywords = {Analytical models; Distributed Systems; Markov processes; Reliability, availability, and serviceability; Simulation; Utility theory; Web-based services},
}

Belongs to TUCS Research Unit(s): Software Engineering Laboratory (SE Lab)

Publication Forum rating of this publication: level 1

Edit publication