Achieving predictability and service differentiation in web services

8Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper proposes a model and an admission control algorithm for achieving predictability in web services by means of service differentiation. We use real-time scheduling principles typically used offline, adapt them to web services to work online. The proposed model and algorithm is empirically evaluated by implementing it Apache Axis2. The implementation is benchmarked against the unmodified version of Axis2 for various types of workloads and arrival rates, given different deadlines. We meet 100% of the deadlines keeping a healthy request acceptance rate of 42-100% depending on the task size variation. Our solution outperforms Axis2, specially at instances with high task size variance, by a factor of 10 - 1000. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gamini Abhaya, V., Tari, Z., & Bertok, P. (2009). Achieving predictability and service differentiation in web services. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5900 LNCS, pp. 364–372). https://doi.org/10.1007/978-3-642-10383-4_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free