On robustness of service-based applications

Andrew Roczniak, Université D'Ottawa / University Of Ottawa, Université D'Ottawa / University Of Ottawa
Service-based applications is the name given to a situation arising when a user or a group of users interact with a set of distributed and autonomous functionalities such that some value is created for those users. For interoperability purposes, this interaction should take place through open and standardized interfaces. Collaborative applications allow users to participate in achieving a common goal or objective. From a basic collaborative application that allows participants to author a
more » ... edia document, three distinct functionalities were extracted and implemented as distributed and autonomous services. An example on how a group of users might interact with those services using standard set of protocols and off-the-shelf techniques is presented. From the point of view of a user, a service-based application can only be useful if it provides some indication about its robustness. Creation of such applications therefore must consider the issue of undependability of a required service. A particular source of service failure (service provider refuses a service) or degraded performance (occasional lack of service or degraded quality of service) can be attributed to producers self-interested behavior. The state of the art in dealing with the effects of rational behavior comprises trust and reputation networks, and methods based on game theory and mechanism design. These are presented and discussed in a broader survey of available strategies, tools and available techniques to analyze and mitigate effects of rational behavior. The basis for the investigated solution is the observation that part of a service may be redundant with respect to some part of another service. Instead of adding redundancy to the system, our solution exploits the already existing redundancy to improve robustness of these applications. The interaction with services is modeled as finite-state transducers and a heuristic is proposed to obtain redundancy between any pair of services for which an interaction model exists. Then, an algorithm that u [...]
doi:10.20381/ruor-13040 fatcat:hguq6jpf65b2bccbah4xkr5gku