Optimum allocation of distributed service workflows with probabilistic real-time guarantees

Konstanteli, K; Cucinotta, T; Varvarigou, T

dc.contributor.author	Konstanteli, K	en
dc.contributor.author	Cucinotta, T	en
dc.contributor.author	Varvarigou, T	en
dc.date.accessioned	2014-03-01T01:34:03Z
dc.date.available	2014-03-01T01:34:03Z
dc.date.issued	2010	en
dc.identifier.issn	18632386	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/20661
dc.subject	Advance reservations	en
dc.subject	Probabilistic service guarantees	en
dc.subject	Real-time interactive workflows	en
dc.subject.other	Admission control tests	en
dc.subject.other	Advance reservation	en
dc.subject.other	Business rules	en
dc.subject.other	Distributed service	en
dc.subject.other	Numerical example	en
dc.subject.other	Objective functions	en
dc.subject.other	Optimum allocation	en
dc.subject.other	Physical resources	en
dc.subject.other	Probabilistic service guarantees	en
dc.subject.other	Problem description	en
dc.subject.other	Service guarantees	en
dc.subject.other	Work-flows	en
dc.subject.other	Numerical analysis	en
dc.subject.other	Management	en
dc.title	Optimum allocation of distributed service workflows with probabilistic real-time guarantees	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s11761-010-0068-1	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s11761-010-0068-1	en
heal.publicationDate	2010	en
heal.abstract	This paper addresses the problem of optimum allocation of distributed real-time workflows with probabilistic service guarantees over a set of physical resources. The discussion focuses on how such a problem may be mathematically formalized, in terms of both constraints and objective function to be optimized, which also accounts for possible business rules for regulating the deployment of the workflows. The presented formal problem constitutes a probabilistic admission control test that may be run by a provider in order to decide whether or not it is worth to admit new workflows into the system and to decide what the optimum allocation of the workflow to the available resources is. Various options are presented, which may be plugged into the formal problem description, depending on the specific needs of individual workflows. The presented problem has been implemented using GAMS and has been tested under various solvers. An illustrative numerical example and an analysis of the results of the implemented model under realistic settings are presented. © 2010 Springer-Verlag London Limited.	en
heal.journalName	Service Oriented Computing and Applications	en
dc.identifier.doi	10.1007/s11761-010-0068-1	en
dc.identifier.volume	4	en
dc.identifier.issue	4	en
dc.identifier.spage	229	en
dc.identifier.epage	243	en