[Back]


Talks and Poster Presentations (with Proceedings-Entry):

R. Khazankin, D. Schall, S. Dustdar:
"Adaptive Request Prioritization in Dynamic Service-oriented Systems (Best student paper award)";
Talk: IEEE International Conference on Services Computing (SCC 2011), Washington, DC, USA; 2011-07-04 - 2011-07-09; in: "Proceedings of the IEEE International Conference on Services Computing (SCC 2011)", H. Jacobsen, Y. Wang, P. Hung (ed.); IEEE Computer Society, (2011), ISBN: 978-0-7695-4462-5; 9 - 15.



English abstract:
The availability of scarce resources in a serviceoriented
system demands for context-aware selection policies
that adapt based on service-level agreements (SLAs). One of
the open issues is to prioritize service requests in dynamically
changing environments where concurrent instances of
processes may compete for resources. Here we propose a
runtime monitoring approach to observe the actual state of the
system. We argue that priorities should be assigned to requests
based on potential violations of SLA objectives. While most
existing work in the area of quality of service monitoring and
SLA modeling focuses typically on purely technical systems,
we consider service-oriented systems spanning both softwarebased
services and human actors. Adaptive request scheduling
in such systems is challenging due to the poorly predictable
behavior of human actors in performing tasks. Our approach
helps to cope with these challenges by prioritizing service
requests that may cause violations of SLAs and corresponding
objectives that are associated with processes.

Keywords:
service-oriented systems, monitoring, adaptation, service-level agreements, scheduling, human factors


"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1109/SCC.2011.22



Related Projects:
Project Head Schahram Dustdar:
COIN

Project Head Reinhard Pichler:
Service-orientierte Datenintegration


Created from the Publication Database of the Vienna University of Technology.