A Method for Web Services Fault Tolerance Based on Ripple Effect Analysis

2011 ◽  
Vol 474-476 ◽  
pp. 1617-1620
Author(s):  
Dong Yang ◽  
Lei Liu ◽  
Manuel Bernal Llinares

In this paper we first establish a dependency matrix over the inputs of web services in composition and the degree of dependency between the interface parameters for a single web service. Operating over the matrices, the ripple effect of a single service's fault at runtime has been analysed and computed. Based on this, we have looked for a method to substitute the failing service with an equivalent one at runtime. Using simulations and real examples we have confirmed the effectiveness of the method shown in this paper.

Author(s):  
Debmalya Biswas ◽  
Krishnamurthy Vidyasankar

Over the years, the notion of transactions has become synonymous with providing fault-tolerance, reliability and robustness to database systems. To extend the same transactional guarantees to new and evolving paradigms, such as Web service, the transactional mechanisms must first be adapted to the distinguishing characteristics of Web services, mainly composability, long-running nature, and privacy and security concerns. Composability refers to the ability to form new composite services by combining the functionalities of existing services. Due to their long-running nature, compensation based mechanisms are usually preferred to provide transactional guarantees for Web services. Compensation requires access (visibility) over the execution details of the services in the composition. However, such visibility may not always be feasible in a compositional context where component services are provided by different providers across organizational boundaries, with very strong privacy and security constraints. This paper looks at compensation options for Web services in a hierarchical composition. Multiple compensation options may be available for a composite service both at the same level and at different levels of the hierarchy. This paper shows how to find an optimal compensation option under restricted visibility.


Author(s):  
Debmalya Biswas ◽  
Krishnamurthy Vidyasankar

Over the years, the notion of transactions has become synonymous with providing fault-tolerance, reliability and robustness to database systems. To extend the same transactional guarantees to new and evolving paradigms, such as Web service, the transactional mechanisms must first be adapted to the distinguishing characteristics of Web services, mainly composability, long-running nature, and privacy and security concerns. Composability refers to the ability to form new composite services by combining the functionalities of existing services. Due to their long-running nature, compensation based mechanisms are usually preferred to provide transactional guarantees for Web services. Compensation requires access (visibility) over the execution details of the services in the composition. However, such visibility may not always be feasible in a compositional context where component services are provided by different providers across organizational boundaries, with very strong privacy and security constraints. This paper looks at compensation options for Web services in a hierarchical composition. Multiple compensation options may be available for a composite service both at the same level and at different levels of the hierarchy. This paper shows how to find an optimal compensation option under restricted visibility.


2012 ◽  
Vol 13 (2) ◽  
pp. 279-297
Author(s):  
문태형 ◽  
곽영환 ◽  
Jaehwan Kim ◽  
Hyuk-Dae Kwon

Author(s):  
Mustapha Mohammed Baua'a

The I\O file system Read\Write operations are considered the most significant characteristics. Where, many researchers focus on their works on how to decrease the response time of I\O file system read\write operations. However, most articles concentrate on how to read\write content of the file in parallelism manner. Here in this paper, the author considers the parallelizing Read\Write whole file bytes not only its contents. A case study has been applied in order to make the idea more clear. It talks about two techniques of uploading\downloading files via Web Service. The first one is a traditional way where the files uploaded and downloaded serially. While the second one is uploaded\ downloaded files using Java thread in order to simulate parallelism technique. Java Netbeans 8.0.2 have been used as a programming environment to implement the Download\Upload files through Web Services. Validation results are also presented via using Mat-lab platform as benchmarks. The visualized figures of validation results are clearly clarifying that the second technique shows better response time in comparison to the traditional way.


2019 ◽  
Vol 54 (6) ◽  
Author(s):  
Sawsan Ali Hamid ◽  
Rana Alauldeen Abdalrahman ◽  
Inam Abdullah Lafta ◽  
Israa Al Barazanchi

Recently, web services have presented a new and evolving model for constructing the distributed system. The meteoric growth of the Web over the last few years proves the efficacy of using simple protocols over the Internet as the basis for a large number of web services and applications. Web service is a modern technology of web, which can be defined as software applications with a programmatic interface based on Internet protocol. Web services became common in the applications of the web by the help of Universal, Description, Discovery and Integration; Web Service Description Language and Simple Object Access Protocol. The architecture of web services refers to a collection of conceptual components in which common sets of standard can be defined among interoperating components. Nevertheless, the existing Web service's architecture is not impervious to some challenges, such as security problems, and the quality of services. Against this backdrop, the present study will provide an overview of these issues. Therefore, it aims to propose web services architecture model to support distributed system in terms of application and issues.


2011 ◽  
Vol 20 (04) ◽  
pp. 357-370 ◽  
Author(s):  
D. PAULRAJ ◽  
S. SWAMYNATHAN ◽  
M. MADHAIYAN

One of the key challenges of the Service Oriented Architecture is the discovery of relevant services for a given task. In Semantic Web Services, service discovery is generally achieved by using the service profile ontology of OWL-S. Profile of a service is a derived, concise description and not a functional part of the semantic web service. There is no schema present in the service profile to describe the input, output (IO), and the IOs in the service profile are not always annotated with ontology concepts, whereas the process model has such a schema to describe the IOs which are always annotated with ontology concepts. In this paper, we propose a complementary sophisticated matchmaking approach which uses the concrete process model ontology of OWL-S instead of the concise service profile ontology. Empirical analysis shows that high precision and recall can be achieved by using the process model-based service discovery.


2022 ◽  
Vol 22 (1) ◽  
pp. 1-31
Author(s):  
Marwa Daaji ◽  
Ali Ouni ◽  
Mohamed Mohsen Gammoudi ◽  
Salah Bouktif ◽  
Mohamed Wiem Mkaouer

Web service composition allows developers to create applications via reusing available services that are interoperable to each other. The process of selecting relevant Web services for a composite service satisfying the developer requirements is commonly acknowledged to be hard and challenging, especially with the exponentially increasing number of available Web services on the Internet. The majority of existing approaches on Web Services Selection are merely based on the Quality of Service (QoS) as a basic criterion to guide the selection process. However, existing approaches tend to ignore the service design quality, which plays a crucial role in discovering, understanding, and reusing service functionalities. Indeed, poorly designed Web service interfaces result in service anti-patterns, which are symptoms of bad design and implementation practices. The existence of anti-pattern instances in Web service interfaces typically complicates their reuse in real-world service-based systems and may lead to several maintenance and evolution problems. To address this issue, we introduce a new approach based on the Multi-Objective and Optimization on the basis of Ratio Analysis method (MOORA) as a multi-criteria decision making (MCDM) method to select Web services based on a combination of their (1) QoS attributes and (2) QoS design. The proposed approach aims to help developers to maintain the soundness and quality of their service composite development processes. We conduct a quantitative and qualitative empirical study to evaluate our approach on a Quality of Web Service dataset. We compare our MOORA-based approach against four commonly used MCDM methods as well as a recent state-of-the-art Web service selection approach. The obtained results show that our approach outperforms state-of-the-art approaches by significantly improving the service selection quality of top- k selected services while providing the best trade-off between both service design quality and desired QoS values. Furthermore, we conducted a qualitative evaluation with developers. The obtained results provide evidence that our approach generates a good trade-off for what developers need regarding both QoS and quality of design. Our selection approach was evaluated as “relevant” from developers point of view, in improving the service selection task with an average score of 3.93, compared to an average of 2.62 for the traditional QoS-based approach.


Sign in / Sign up

Export Citation Format

Share Document