The result of applying the expression E1 to the his-
tory H is the history H1 that contains the event occur-
rences of H at which the events specified by E1 take
place. Particularly, history H1 shows that the com-
plex event specified by E1 takes place at t = 24(h)
because the event MT513 did not happen within 24h
upon receiving the event MT502. Similarly, the result
of applying the expression E2 to the history H is the
history H2 that contains the event occurrences of H at
which the events specified by E2 take place. Particu-
larly, History H2 shows that the complex event spec-
ified by E2 takes place at t = 36(h) where the event
MT502 happened after an event MT513.
For a space limitation reason, we only describe
the following operators. Sequence: the event type
E characterizing the sequence of two events e1 and e2
is of the form E= Sequence(e1, e2). An instance of E
occurs iff e1 occurs before e2. Negation: the event
type E characterizing the negation of an event e is of
the form E= Negation (e). An instance of E occurs
iff e doesnt occur in a validity interval that depends
on a context of detection. Within: the event type E
defining a complex event P that occurs within a time
period T is of the form E= P Within (T). An instance
of E occurs iff the complex event P occurs within T
time period.
3.3 Adaptation Process
During the monitoring, in case of unfulfilment of
duties, we introduce a proactive adaptation frame-
work that pre-empts end-to-end process SLA viola-
tions. In this scenario, the soft constraints are used
to relax and decide how to rebuild a composition in-
volved in a transaction. Let ’s recall in a nutshell
the Soft constraint Solving Problem (SCSP, (Bistarelli
et al., 2002)). Traditional CSPs is an assignment of a
value to every variable, it can either be fully solved
(when all requirements are satisfied) or not solved at
all (some requirements cannot be satisfied). Solv-
ing techniques for soft CSPs can generate solutions
for overconstrained problems by allowing some con-
straints to remain unsatisfied. Soft constraints gener-
alize classical CSPs by adding a preference level to
every tuple in the domain of the constraint variables.
This level can be used to obtain a suitable solution
which may not fulfill all constraints, which optimizes
some metrics, and which in our case will be naturally
applied to the requirements of the business transac-
tions. The basic operations on soft constraints (build-
ing a constraint conjunctions and projecting on vari-
ables) need to handle preferences in a homogeneous
way. It is based on mathematical structure of semir-
ing algebra, enriched with additional properties and
termed a C-semiring. For instance, let’s consider that
the service execution related to the constraint C2 got
1.5 day instead of 1 day. That means that the exe-
cution time of services related to the remaining con-
straints is 3.5 day instead of 4 days. Thus, we relax
the individual constraints in a way that their aggre-
gate execution time satisfy the new global constraint
(3.5). In case we have four services to be executed,
we may have alternative selections by applying the
SCSP techniques. One could be 0.5, 1, 1, and 1 days
respectively for services S2, S3, S4, and S5, second
could be 1.5, 0.5, 0.5, and 1 days respectively for ser-
vices S
′
2, S
′
3, S
′
4, and S
′
5.
4 CONCLUSIONS
The approach presented in this paper offers a struc-
ture for managing and controlling the QoS of a busi-
ness transaction at run-time. The proposed frame-
work monitors business transactions, computes po-
tential risks, and performs proactive adaptation ac-
tions in order to prevent the possible risks of violat-
ing global SLA. We identify the actual possible cases
of SLA violation during run-time and provide an ap-
proach for mitigating them by substituting services
that could have failed or triggering changes of the
composite services in terms of its compounding com-
ponents by relaxing the constraints. The limitation
of the framework is that it in its current version can-
not resist the violation of local SLAs. Extending the
functionality of the framework in terms of local SLA
violation prevention is our future work.
REFERENCES
Bistarelli, S., Codognet, P., and Rossi, F. (2002). Abstract-
ing Soft Constraints: Framework, Properties, Exam-
ples. Artificial Intelligence, 139(2):175–211.
http://www.sybase.com/products/financialservicessolutions/
complex-event processing, S. C. E. P.
Luckham, D. (2001). The Power of Events: An Introduc-
tion to Complex Event Processing in Distributed En-
terprise Systems. Addison-Wesley Longman.
Papazoglou, M. P. and Kratz, B. (2007). Web services tech-
nology in support of business transactions. Service
Oriented Computing and Applications, 1(1):51–63.
Weigand, H. and van den Heuvel, W.-J. (2002). Cross-
organizational workflow integration using contracts.
Decision Support Systems, 33(3):247–265.
CLOSER2013-3rdInternationalConferenceonCloudComputingandServicesScience
144