scispace - formally typeset
Open Access

Efficient Online Monitoring of Web-Service SLAs

TLDR
An implementation to derive on-line monitors for web services automatically from SLAs using an Eclipse plugin is presented and the efficiency and scalability of this approach is evaluated using a large-scale case study in a service-oriented computational grid.
Abstract
If an organization depends on the service quality provided by another organization it often enters into a bilateral service level agreement (SLA), which mitigates outsourcing risks by associating penalty payments with poor service quality. Once these agreements are entered into, it becomes necessary to monitor their conditions, which will commonly relate to timeliness, reliability and request throughput, at run-time. We show how these conditions can be translated into timed automata. Acceptance of a timed word by a timed automaton can be decided in quadratic time and because the timed automata can operate while messages are exchanged at run-time there is effectively only a linear run-time overhead. We present an implementation to derive on-line monitors for web services automatically from SLAs using an Eclipse plugin. We evaluate the efficiency and scalability of this approach using a large-scale case study in a service-oriented computational grid.

read more

Citations
More filters

Specification Patterns from Research to Industry: A Case Study in Service-Based Applications (extended abstract)

TL;DR: The paper discusses the outcome of this comparison, indicating that some needs of the industry, especially in the area of requirements specification languages, are not fully met by current software engineering research.

A Guided Tour through SAVVY-WS: A Methodology for Specifying and Validating Web Service Compositions.

TL;DR: AVVY-WS as discussed by the authors is a methodology that aims at providing a novel integrated approach for design-time and run-time validation for Web service-based applications, composed via the BPEL workflow language.
Journal ArticleDOI

SLA-Driven Cost-Effective Monitoring Based on Criticality for Multi-Tenant Service-Based Systems

TL;DR: This paper proposes SLA-driven Cost-Effective Monitoring for multi-Tenant SBSs (SCEMTS) based on criticality for formulating a monitoring strategy, and shows that the SCEMTS outperforms the representative approaches in satisfying tenant SLAs, thus improving monitoring cost-effectiveness and ensuring the QoS of multi-tenant S BSs.
Dissertation

Bandwidth-aware distributed ad-hoc grids in deployed wireless sensor networks

E. Rondini
TL;DR: An application-independent distribution paradigm and a set of load distribution algorithms to allow computationally intensive applications to be collaboratively computed on resource-constrained devices are devised and empirically investigated the effects of network traffic information on the distribution performance.

Lifetime quality management for multi-tenant service-based systems

Yanchun Wang
TL;DR: In this thesis, a systematic solution to lifetime quality management for multi-tenant SBSs in the cloud environment is proposed, which consists of a set of techniques to address the major issues of quality management that arise at different stages of the lifetime of multi-Tenant S BSs.
References
More filters
Journal ArticleDOI

A theory of timed automata

TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
Book ChapterDOI

Symbolic Model Checking without BDDs

TL;DR: This paper shows how boolean decision procedures, like Stalmarck's Method or the Davis & Putnam Procedure, can replace BDDs, and introduces a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability.
Journal ArticleDOI

Model-Checking in Dense Real-Time

TL;DR: An algorithm for model-checking, for determining the truth of a TCTL-formula with respect to a timed graph, is developed and it is argued that choosing a dense domain instead of a discrete domain to model time does not significantly blow up the complexity of the model- checking problem.
Proceedings ArticleDOI

Property specification patterns for finite-state verification

TL;DR: This work proposes a pattern-based approach to the presentation, codification and reuse of property specifications for finite-state verification, believing that a primary cause rests with the fact that practitioners are unfamiliar with specification processes, notations, and strategies.
Book ChapterDOI

The event calculus explained

TL;DR: The event calculus is presented, a logic-based formalism for representing actions and their effects which reduces to monotonic predicate completion and is shown to apply to a variety of domains, including those featuring actions with indirect effects, actions with nondeterministic effects, concurrent actions, and continuous change.
Trending Questions (1)
How does SLA impact the efficiency and reliability of e-payment settlement?

The provided paper does not discuss the impact of SLA on the efficiency and reliability of e-payment settlement.