Abstract
In the service computing paradigm, a service broker can build new applications by composing network-accessible services offered by loosely coupled independent providers. In this paper, we address the admission control problem for a a service broker which offers to prospective users a composite service with a range of different Quality of Service (QoS) classes. We formulate the problem as a Markov Decision Process (MDP) problem with the goal of maximizing the broker revenue while guaranteeing non-functional QoS requirements to its already admitted users. To assess the effectiveness of the MDP-based admission control, we present experimental results where we compare the optimal decisions obtained by the analytical solution of the MDP with other policies.
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
Preview
Unable to display preview. Download preview PDF.
References
Ardagna, D., Pernici, B.: Adaptive service composition in flexible processes. IEEE Trans. Softw. Eng. 33(6), 369–384 (2007)
Bannazadeh, H., Leon-Garcia, A.: Online optimization in application admission control for service oriented systems. In: Proc. IEEE APSCC 2008 (2008)
Beckmann, M., Subramanian, R.: Optimal replacement policy for a redundant system. OR Spectrum 6(1), 47–51 (1984)
Bellucci, A., Cardellini, V., Di Valerio, V., Iannucci, S.: A scalable and highly available brokering service for SLA-based composite services. In: Maglio, P.P., Weske, M., Yang, J., Fantinato, M. (eds.) ICSOC 2010. LNCS, vol. 6470, pp. 527–541. Springer, Heidelberg (2010)
Bichler, M., Setzer, T.: Admission control for media on demand services. Service Oriented Computing and Applications 1(1), 65–73 (2007)
Canfora, G., Di Penta, M., Esposito, R., Villani, M.: A framework for QoS-aware binding and re-binding of composite web services. J. Syst. Softw. 81 (2008)
Cardellini, V., Casalicchio, E., Grassi, V., Lo Presti, F.: Flow-based service selection for web service composition supporting multiple QoS classes. In: Proc. IEEE ICWS 2007, pp. 743–750 (2007)
Chen, M., Feldman, R.: Optimal replacement policies with minimal repair and age-dependent costs. Eur. J. Oper. Res. 98(1), 75–84 (1997)
Doshi, P., Goodwin, R., Akkiraju, R., Verma, K.: Dynamic workflow composition: using Markov decision processes. Int’l J. Web Service Res. 2(1) (2005)
Gao, A., Yang, D.q., Tang, S.w., Zhang, M.: Web Service Composition Using Markov Decision Processes. In: Fan, W., Wu, Z., Yang, J. (eds.) WAIM 2005. LNCS, vol. 3739, pp. 308–319. Springer, Heidelberg (2005)
OASIS: Web Services Business Process Execution Language Version 2.0 (January 2007)
Pillai, S., Narendra, N.: Optimal replacement policy of services based on Markov decision process. In: Proc. IEEE SCC 2009, pp. 176–183 (2009)
Puterman, M.L.: Markov Decision Processes: Discrete Stochastic, Dynamic Programming. Wiley, Chichester (1994)
Wang, H., Zhou, X., Zhou, X., Liu, W., Li, W., Bouguettaya, A.: Adaptive service composition based on reinforcement learning. In: Maglio, P.P., Weske, M., Yang, J., Fantinato, M. (eds.) ICSOC 2010. LNCS, vol. 6470, pp. 92–107. Springer, Heidelberg (2010)
Wu, C., Bertsekas, D.: Admission control for wireless networks. Tech. Rep. LIDS-P- 2466, Lab. for Information and Decision Systems, MIT (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abundo, M., Cardellini, V., Lo Presti, F. (2011). Optimal Admission Control for a QoS-Aware Service-Oriented System. In: Abramowicz, W., Llorente, I.M., Surridge, M., Zisman, A., Vayssière, J. (eds) Towards a Service-Based Internet. ServiceWave 2011. Lecture Notes in Computer Science, vol 6994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24755-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-24755-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24754-5
Online ISBN: 978-3-642-24755-2
eBook Packages: Computer ScienceComputer Science (R0)