Optimizing the reliability of component-based n-version approaches

Grosspietsch, K.E.

doi:10.1109/ipdps.2002.1016526

Cited by 8 publications

(12 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The selection problem is formulated as a mixed integer programming problem, and some heuristics are proposed to calculate in an efficient way an approximate solution. An analogous problem is considered in [38]. The proposed methodology is motivated by its application to componentbased systems, but it can be easily extended to a SOA environment.…”

Section: Related Workmentioning

confidence: 99%

Towards Self-adaptation for Dependable Service-Oriented Systems

Cardellini

Casalicchio

Grassi

et al. 2009

Architecting Dependable Systems VI

View full text Add to dashboard Cite

Abstract. Increasingly complex information systems operating in dynamic environments ask for management policies able to deal intelligently and autonomously with problems and tasks. An attempt to deal with these aspects can be found in the Service-Oriented Architecture (SOA) paradigm that foresees the creation of business applications from independently developed services, where services and applications build up complex dependencies. Therefore the dependability of SOA systems strongly depends on their ability to self-manage and adapt themselves to cope with changes in the operating conditions and to meet the required dependability with a minimum of resources. In this paper we propose a model-based approach to the realization of self-adaptable SOA systems, aimed at the fulfillment of dependability requirements. Specifically, we provide a methodology driving the system adaptation and we discuss the architectural issues related to its implementation. To bring this approach to fruition, we developed a prototype tool and we show the results that can be achieved with a simple example.

show abstract

Section: Related Workmentioning

confidence: 99%

Towards Self-adaptation for Dependable Service-Oriented Systems

Cardellini

Casalicchio

Grassi

et al. 2009

Architecting Dependable Systems VI

View full text Add to dashboard Cite

show abstract

“…The forgetting element is necessary to ensure the operative response of the system to changes in the behavior of versions when a certain version can significantly change its reliability in case of changing the input data stream [3], therefore is necessary to change rapidly its rating of version for correct distribution of the weights during voting [4]. The rating is determined by summing of all the elements of the stack.…”

Section: Voting Algorithmsmentioning

confidence: 99%

Model implementation of the simulation environment of voting algorithms, as a dynamic system for increasing the reliability of the control complex of autonomous unmanned objects

et al. 2017

View full text Add to dashboard Cite

Abstract. In the article the question of application of redundant schemes for the development of faulttolerant software, in particular multiversion programming, is considered with reference to the task increasing the reliability of the control complex of autonomous unmanned objects. Modifications of the basic voting algorithms by an agreed majority and its fuzzy version are proposed. The software implementation of the simulation environment that implements the described approach and the proposed modified algorithms is considered. The results of the simulation the dependence of the reliability indicators of the system on its input parameters are shown by authors.

show abstract

“…Each selected concrete service is then dynamically bound to the corresponding abstract service. Other methodologies [4,8,9] extend this idea by also considering the possibility of binding each abstract service to a set of functionally equivalent concrete services rather than a single service, coordinated according to some redundancy pattern (e.g., one-out-of-N or sequential retry), to achieve higher QoS at the expense of higher cost: in this case both the redundancy pattern and the set of equivalent concrete services must be selected at runtime.…”

Section: Introductionmentioning

confidence: 99%

Adaptive Management of Composite Services under Percentile-Based Service Level Agreements

Cardellini

Casalicchio

Grassi

et al. 2010

Service-Oriented Computing – ICSOC 2007

View full text Add to dashboard Cite

We present a brokering service for the adaptive management of composite services. The goal of this broker is to dynamically adapt at runtime the composite service configuration, to fulfill the Service Level Agreements (SLAs) negotiated with different classes of requestors, despite variations of the operating environment. Differently from most of the current approaches, where the performance guarantees are characterized only in terms of bounds on average QoS metrics, we consider SLAs that also specify upper bounds on the percentile of the service response time, which are expected to better capture user perceived QoS. The adaptive composite service management is based on a service selection scheme that minimizes the service broker cost while guaranteeing the negotiated QoS to the different service classes. The optimal service selection is determined by means of a linear program that can be efficiently solved. As a result, the proposed approach is scalable and lends itself to an efficient implementation.

show abstract

Optimizing the reliability of component-based n-version approaches

Cited by 8 publications

References 4 publications

Towards Self-adaptation for Dependable Service-Oriented Systems

Towards Self-adaptation for Dependable Service-Oriented Systems

Model implementation of the simulation environment of voting algorithms, as a dynamic system for increasing the reliability of the control complex of autonomous unmanned objects

Adaptive Management of Composite Services under Percentile-Based Service Level Agreements

Contact Info

Product

Resources

About