Posts with Tag ‘Dependability’

A Model for Evaluation of User-Perceived Service Properties

Sunday, March 10, 2013, 13:46
A Model for the Evaluation of User-Perceived Service Properties Authors:
Andreas Dittrich
Igor Kaitovic
Cristina Murillo
Rafael Rezende

27th IEEE International Symposium on Parallel Distributed Processing, Workshops and PhD Forum, IPDPSW 2013, Boston, MA, USA, May 20-24, 2013

Download: accepted version, final published version

An ever-increasing number of both functional and non-functional requirements has resulted in growing system complexity which demands new solutions in system modeling and evaluation. As a remedy, service-oriented architecture (SOA) offers services as basic building elements of system design. Service dependability is highly dependent on the properties of the underlying information and communications technology (ICT) infrastructure. This is especially true for the user-perceived dependability of a specific pair service client and provider as every pair may utilize different ICT components. We provide a model for the description of ICT components and their non-functional properties based on the Unified Modeling Language (UML). Given a service description, a network topology model and a pair service client and provider, we propose a methodology to automatically identify relevant ICT components and generate a user-perceived service infrastructure model (UPSIM). We demonstrate the feasibility of the methodology by applying it to parts of the service network infrastructure at University of Lugano (USI), Switzerland. We then show how this methodology can be used to facilitate user-perceived service dependability analysis.

Categories: Publication, Research and Education
Tags: , , , , , , , , , , , , , , ,

Self-Aware Adaptive Service Networks with Dependability Guarantees

Monday, March 15, 2010, 18:30
Self-Aware Adaptive Service Networks with Dependability Guarantees Author:
Andreas Dittrich

Proceedings of the Joint Workshop of the German Research Training Groups in Computer Science, Algorithmic synthesis of reactive and discrete-continuous systems (AlgoSyn), Dagstuhl, Germany, May 31 – June 2, 2010

Download: extended abstract

Disasters striking in inhabited areas pose a significant risk to the development and growth of modern societies. The impact of any disaster would be severe. In case a disaster strikes, fast and safe mitigation of damages is important. Information and communication technology (ICT) plays a crucial role in helping reconnaissance and first response teams on disaster sites.

Most rescue teams bring their own network equipment to use several IT services. Many of these services (e.g., infrastructure, location, communication) could be shared among teams but most of the time they are not. Coordination of teams is partly done by pen and paper-based methods. A single network for all participating teams with the possibility to reliably publish, discover and use services would be of great benefit.

Despite the participating teams and course of action being different on every site, described service networks display certain common properties: They arise spontaneously,
the number of nodes and their capabilities are subject to high fluctuation, the number and types of services are also fluctuating strongly and there is no global administrative configuration.

Because of these properties all network layers involved would need to be configured automatically. Based on the Internet Protocol (IP) — the only well-established global networking standard — a number of mechanisms promise to automatically configure service networks. In disaster management scenarios, where various services are critical for operation, mission control could benefit from these mechanisms by getting a live view of all active services and their states. It needs to be investigated if and how they are applicable.

Given an ad-hoc, auto-configuring service network, how and to what extent can we guarantee dependability properties such as availability, the ability to perform in the presence of faults (performability) and ultimately the ability to sustain certain levels of availability or performability (survivability) for critical services at run-time?

The goal of this dissertation is to provide a comprehensive dependability evaluation for such heterogenous and dynamic service networks. A run-time dependability cycle is being embedded into the network. In this cycle, the network is constantly monitored.
A distributed service discovery layer provides network-wide service presence monitoring. This will be extended to provide monitoring for availability and performability assessment. Based on monitoring data, dependability properties are evaluated at run-time. The survivability of critical services can be estimated by calculating the expected availability or performability with a given fault model. If necessary, adaptation measures are triggered which in turn can cause the monitoring to be reconfigured. Even if no adaptation is possible, run-time awareness of critical states is already a huge benefit. This cycle is the base of a self-aware adaptive service network.

Categories: Publication, Research and Education
Tags: , , , , , , , , , ,

Experimental Responsiveness Evaluation of Decentralized Service Discovery

Wednesday, February 17, 2010, 11:34
Experimental Responsiveness Evaluation of Decentralized Service Discovery Authors:
Andreas Dittrich
Felix Salfner

24th IEEE International Symposium on Parallel Distributed Processing, Workshops and PhD Forum (IPDPSW), Atlanta, GA, USA, April 19-23, 2010

Download: final published version, IEEEXplore

Service discovery is a fundamental concept in service networks. It provides networks with the capability to publish, browse and locate service instances. Service discovery is thus the precondition for a service network to operate correctly and for the services to be available. In the last decade, decentralized service discovery mechanisms have become increasingly popular. Especially in ad-hoc scenarios – such as ad-hoc wireless networks – they are an integral part of auto-configuring service networks. Albeit the fact that auto-configuring networks are increasingly used in application domains where dependability is a major issue, these environments are inherently unreliable. In this paper, we examine the dependability of decentralized service discovery. We simulate service networks that are automatically configured by Zeroconf technologies. Since discovery is a time-critical operation, we evaluate responsiveness – the probability to perform some action on time even in the presence of faults – of domain name system (DNS) based service discovery under influence of packet loss. We show that responsiveness decreases significantly already with moderate packet loss and becomes practicably unacceptable with higher packet loss.

Categories: Publication, Research and Education
Tags: , , , , , , , , ,

Quantifying Criticality of Dependability-Related IT Organization Processes in CobiT

Monday, August 10, 2009, 07:55
Quantifying Criticality of Dependability-Related IT Organization Processes in CobiT Authors:
Tobias Goldschmidt
Andreas Dittrich
Miroslaw Malek

15th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC), Shanghai, China, November 16-18, 2009

Download: final published version, IEEEXplore

With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology (IT) organization. Generic reference models can be used as an alternative to analytical approaches by focusing on transforming qualitative assessment into quantitative evaluation of IT organization. In this paper, we examine the reference models IT Infrastructure Library (ITIL) and the Control Objectives for Information and Related Technology (CobiT) to derive a quantifiable concept for estimating the criticality of dependability-related IT organization processes in CobiT. After systematically analyzing ITIL processes and deriving properties that are relevant to dependability, those processes are mapped onto CobiT processes. Furthermore, we propose a process criticality index (PCI) which reflects the significance of each dependability-related process within a particular reference model. The PCI is based on the graph theory concept of betweenness centrality and uses a directed graph where nodes represent dependability-related processes and edges relations among them. Finally, using cycle and sequence analysis we are able to identify for every process which processes have to be implemented a priori. This provides an efficient strategy for implementing most significant processes first, according to the ranking based on the PCI.

Categories: Publication
Tags: , , , , ,