# Service Oriented Computing and Applications

Publisher: Springer Verlag

## Impact Factor Rankings

5-year impact 0.00 0.00 0.00 0.00 0.00 SpringerLink 1863-2386 314016720 Document, Periodical Journal / Magazine / Newspaper, Computer File

## Publisher details

• Pre-print
• Author can archive a pre-print version
• Post-print
• Author can archive a post-print version
• Conditions
• Author's pre-print on pre-print servers such as arXiv.org
• Author's post-print on author's personal website immediately
• Author's post-print on any open access repository after 12 months after publication
• Publisher's version/PDF cannot be used
• Published source must be acknowledged
• Must link to publisher version
• Set phrase to accompany link to published version (see policy)
• Articles in some journals can be made Open Access on payment of additional charge
• Classification
​ green

## Publications in this journal

• ##### Article: Partially distributed coordination with Reo and constraint automata
[Hide abstract]
ABSTRACT: Coordination languages, such as Reo, have emerged for the specification and implementation of interaction protocols among concurrent entities, manifested as connectors. In this paper, we describe a theoretical justification and a practical proof-of-concept tool for automatically generating partially distributed, partially centralized implementations of Reo connectors. Such implementations have three performance advantages: faster compilation at build time (compared to a purely centralized approach), reduced latency at run time (compared to a purely distributed approach), and improved parallelism at run time (compared to a purely centralized approach). Our theory relies on the definition of a new product operator on constraint automata (Reo’s formal semantics), which we use to formally justify distributions of disjoint parts of a coordination scheme over different machines according to several possible motivations (e.g., performance, QoS constraints, privacy, resource availability, and network topology). To exemplify our work, in a case study, we show and explain how a generated connector implementation can be executed.
Service Oriented Computing and Applications 09/2015; 9(3-4). DOI:10.1007/s11761-015-0177-y
• ##### Article: A method for fair propagation of user perceptions for trust management in composite services
[Hide abstract]
ABSTRACT: Trust and reputation models are used as mechanisms for selecting services. One of the benefits of service-oriented architecture is enabling the composition of services and composing value-added services, which are called composite services. A challenging problem of trust management in composite services is how to propagate the consumers’ perceptions of composite services to their component services. Due to the opaque nature of service composition, the consumer does not know the underlying components of a composite service. Therefore, a consumer can only provide a single feedback rating for the composite service. In this paper, we propose a fair approach for propagating the user’s rating to component services by considering both the past behavior trend of each component service and the internal ratings among component services. The proposed approach is capable of propagating trust in both horizontal and vertical composition, without the need of monitoring component services.
Service Oriented Computing and Applications 06/2015; 9(2). DOI:10.1007/s11761-014-0158-6
• ##### Article: Towards a formal study of automatic failure recovery in protocol-based web service composition
[Hide abstract]
ABSTRACT: In the protocol-based Web service composition, the runtime unavailability of component services may result in a failed execution of the composite. In literature, multiple recovery heuristics have been proposed. This work provides a formal study and focuses on the complexity issues of the recovery problem in the protocol-based Web service composition. A recovery is a process responsible of migrating the failed execution into an alternative execution of the composite that still has the ability to reach a final state. The alternative execution is called a recovery execution. Following failure occurrence, several recovery executions may be available. The problem of finding the best recovery execution(s) is called the recovery problem. Several criteria may be used to determine the best recovery execution(s). In this work, we define the best recovery execution as the one which is attainable from the failed execution with a maximal number of invisible compensations with respect to the client. We assume that all transitions are compensatable. For a given recovery execution, we prove that the decision problem associated with computing the number of invisibly compensated transitions is NP-complete, and thus, we conclude that deciding of the best recovery execution is in $$\Sigma _2^P$$ .
Service Oriented Computing and Applications 02/2015; DOI:10.1007/s11761-015-0176-z
• Source
##### Article: Pabble: parameterised Scribble
[Hide abstract]
ABSTRACT: Many parallel and distributed message-passing programs are written in a parametric way over available resources, in particular the number of nodes and their topologies, so that a single parallel program can scale over different environments. This article presents a parameterised protocol description language, Pabble, which can guarantee safety and progress in a large class of practical, complex parameterised message-passing programs through static checking. Pabble can describe an overall interaction topology, using a concise and expressive notation, designed for a variable number of participants arranged in multiple dimensions. These parameterised protocols in turn automatically generate local protocols for type checking parameterised MPI programs for communication safety and deadlock freedom. In spite of undecidability of endpoint projection and type checking in the underlying parameterised session type theory, our method guarantees the termination of end point projection and type checking.
Service Oriented Computing and Applications 12/2014; DOI:10.1007/s11761-014-0172-8
• ##### Article: An e-commerce-oriented creditworthiness service
[Hide abstract]
Service Oriented Computing and Applications 09/2014; 8(3):191-198. DOI:10.1007/s11761-014-0157-7
• ##### Article: An Intents-based approach for dynamic service discovery
Service Oriented Computing and Applications 08/2014; DOI:10.1007/s11761-014-0163-9
• ##### Article: SOA^\mathrm{+d}: a new way to design the decision in SOA—based on the new standard Decision Model and Notation (DMN)
[Hide abstract]
ABSTRACT: In recent years, Service Oriented Architecture (SOA) technologies are emerging as a powerful vehicle for organizations that need to integrate their applications within and across organizational boundaries. In addition, organizations need to make better decisions more quickly. Moreover, they need to change those decisions immediately to adapt to this increasingly dynamic business environment. It is primarily a question in ensuring the decisional aspect by adopting the SOA as a support architecture. In this paper, we describe a new approach called SOA$$^\mathrm{+d}$$ based on a certain number of standards. It is going to be studied on three dimensions: The first is related to the definition of the information system implied in the SOA based on the use case model. The second develops the business dimension which is based on the BPMN (Business Process Modeling Notation). The last dimension addresses the need of decision; we use the new standard decision model and notation (DMN) which is recently approved by Object Management Group (OMG) and considered as a simple notation to specify the decision. Finally, Service Oriented Architecture Modeling Language (SoaML) will be used for design of several services. We also present our meta-model Decisional Model of Service (DMS) to define a new set of concepts necessary for modeling the three levels. Some of them are already known, whereas others are new and are proposed as an element of this work. we illustrate our proposal with a real case study in the Pharmacy Inventory Management.
Service Oriented Computing and Applications 08/2014; DOI:10.1007/s11761-014-0162-x
• ##### Article: Mechanism and architecture for the migration of service implementation during traffic peaks
[Hide abstract]
ABSTRACT: Service-Oriented Architecture has been widely applied in enterprise computing systems for software-enabled services. However, cost efficiency and scalability requirements have moved the execution environment towards the cloud domain. Hybrid approaches have emerged, which utilise both enterprise and cloud domains in order to balance between the cost of service execution and the provided Quality of Service (QoS) for end users. This paper presents a migration, monitoring and load-balancing mechanism and architecture for scaling services between the enterprise and cloud domains during traffic peaks. The argued benefit of the proposal is the automation of the service-migration process and improvement of the QoS. A prototype system is presented as a proof of the conceptual architecture. The performance results in a hybrid cloud environment indicate that service implementation can be migrated and load can be balanced within 200 ms. Furthermore, the mechanism can improve the QoS for end users during traffic peaks. Our approach differs from existing proposals by focusing on the migration of service implementation, instead of the migration of service as part of a virtual machine.
Service Oriented Computing and Applications 06/2014; 9(2). DOI:10.1007/s11761-014-0160-z
• ##### Article: Enabling service-level agreement renegotiation through extending WS-Agreement specification
[Hide abstract]
ABSTRACT: WS-Agreement is a language and protocol designed for creating service-level agreements (SLAs) based on initial offers, and for monitoring those offers at runtime. The definition of WS-Agreement protocol is very general and does not contemplate the possibility of changing an agreement at runtime. This paper presents extensions of the WS-Agreement specification to support the dynamic nature of SLAs by allowing the possibility of SLA renegotiation at runtime. The extended WS-Agreement specification has been implemented and tested. Within this implementation, the concept of renegotiation is demonstrated through the ability to create more than one SLA at runtime. An evaluation is conducted to examine the profits a service provider may gain through renegotiation, as well the savings resulting from rescuing the SLA from violations as a consequence of avoiding paying penalties. The results show that making the SLA terms adaptable and changeable is a viable mechanism that provides flexibility to the service provider and service consumer.
Service Oriented Computing and Applications 06/2014; 9(2). DOI:10.1007/s11761-014-0159-5
• ##### Article: Optima: A domain-specific model for prioritization and conflicts management in requirements engineering for services intermediaries
[Hide abstract]
ABSTRACT: New business models are set up, thanks to Web technologies. In this work, we focus on services intermediary companies. They generate value through the (automatic) selection of third-party services and the (automatic) delivery of the combinations of these services to consumers. Such companies face the problem of deciding which services to select and deliver in order to maximize their profit. The two main paper objectives are (i) to design the generic business model of services intermediaries and (ii) to propose an optimization model. The latter enables to choose the consumer requirements that will be satisfied in order to maximize profit. This model ranks implementable solutions based on various financial aspects. They are related to cost and revenue information that is associated with the requirements. It can support the decision-making process that aims at selecting a profit-maximizing set of requirements for services intermediaries’ system-to-be. Indeed, the proposed model solves the conflicts between requirements and prioritizes the optional requirements. We argue for the relevance of the optimization model via an example and simulations.
Service Oriented Computing and Applications 06/2014; 8(2). DOI:10.1007/s11761-013-0151-5
• ##### Article: Introducing web service accessibility assessment techniques through a unified quality of service context
[Hide abstract]
ABSTRACT: This paper introduces novel web service (WS) accessibility assessment techniques through a unified Quality of Services (QoS) context. The goal is to enable future QoS-aware service selection systems to select and provide accessible web services, ones that are properly designed so as to allow their consumption from end-user applications, used from people with disabilities. In this line, a WS accessibility assessment Framework (WSaaF) has been developed, on the basis of WS accessibility guidelines, dealing with accessibility issues that can appear both on the presentation level of content delivered through WSs and on the content level itself. The WSaaF and its guidelines follow the rationale behind W3C WCAG 2.0-based accessibility standardization of web content. It provides the basis toward building future accessible WSs, a task that can be further facilitated by the use of an appropriate Tool (WSaaT), developed with the aim to provide automatic assessment of services, against guidelines of the proposed framework. Then, the WS accessibility attribute is introduced, as a metric that can be used in conjunction to ones typically utilized so far, within QoS-aware service selection systems. As a result, a novel unified QoS framework is proposed, incorporating the notion of accessibility in the service selection process. The proposed unified QoS framework can eventually lead to the provision of services, which are selected from appropriate repositories and better suit the special needs of people with disabilities.
Service Oriented Computing and Applications 06/2014; 8(2). DOI:10.1007/s11761-013-0135-5
• Source
##### Article: An approach for selecting best available services through a new method of decomposing QoS constraints
[Hide abstract]
ABSTRACT: Quality of Service (QoS) plays as a discriminating factor for selecting appropriate services that meet the given user’s non-functional requirements during service composition. There is a compelling need to select suitable services quickly so that the composition can meet dynamic needs. Recently, local selection approaches for QoS-based selection have been put forward toward reduced time complexity. A methodology for selecting the best available service combination for a given user requirement (workflow) with a new method of decomposing QoS constraints is proposed in this paper. The methodology consists of two phases, namely ‘Constraint Decomposition Phase’ and ‘Service Selection Phase’. In the Constraint Decomposition Phase, a unique method is proposed to decompose the given non-functional (global or workflow level) constraints into local constraints for individual tasks in the workflow. Each individual task with its local constraints forms a subproblem. In the Service Selection phase, each subproblem is resolved by finding the best available service from its respective service class using an iterative searching procedure. A prototype has been implemented, and the low computation time of the proposed method makes it well suited to dynamic composition. The proposed method of decomposing constraints is independent of number of services in a service class, and the method is applicable to any combinational workflow with AND, OR and Loop patterns. Further, a new method for computing response time of OR execution pattern which guarantees successful execution of each path in an OR pattern is a remarkable contribution of this work.
Service Oriented Computing and Applications 06/2014; 9(2). DOI:10.1007/s11761-014-0154-x
• ##### Article: Probabilistic top-K dominating services composition with uncertain QoS
[Hide abstract]
ABSTRACT: Traditional service selection schemes require users to define a utility function by assigning weights to each quality-of-service (QoS) metric. To relieve users from the professional knowledge, skyline techniques have been studied recently by several researchers. However, the size of skyline services is sometimes not easy controlled due to intrinsic attributes of services. Additionally, we observe that most QoS metrics may fluctuate during run-time. Considering such uncertainty and dynamics, in this paper, we propose to obtain probabilistic top-k dominating services with uncertain QoS. Different from previous works, our approach employs the probabilistic characteristic of service instances and calculates the dominating abilities of services so as to achieve an accurate selection. Experimental results have shown the feasibility and effectiveness of our approach.
Service Oriented Computing and Applications 03/2014; 8(1). DOI:10.1007/s11761-013-0152-4
• ##### Article: A novel framework for bindings synchronization of Web services
[Hide abstract]
ABSTRACT: Over the last decade, Web services technology has emerged as a promising solution to address interoperability problems that prevent distributed software systems from being integrated with one another. Accordingly, an increasing number of Web services have been deployed over the Internet to overcome limitations of existing integration models. Typically to use Web services, service providers publish in service registries information about their Web services including the service qualities and bindings that the service consumers use to select first and then to bind to Web services they need. However, as Web services increase in number, the number of service registries holding this information is also increased raising the challenge of how to synchronize such information over these registries since it may change over time. To address the above challenge, we first review in this paper an example of a decentralized architecture of service repositories that highlights the need to synchronize Web service information, especially service bindings, and then, we propose an agent-based synchronization model to meet this need. Finally, an experimental study is conducted to evaluate the performance of our proposal.
Service Oriented Computing and Applications 03/2014; 9(1). DOI:10.1007/s11761-014-0155-9
• ##### Conference Paper: Location Independent Routing in Process Network Overlays
[Hide abstract]
ABSTRACT: In distributed computing, location transparency --the decoupling of objects, tasks, and virtual machines from their physical location --is desirable in that it can simplify application development and management, and enable load balancing and efficient resource allocation. Many existing systems for location transparency are built on top of TCP/IP. We argue that addressing mobile objects in terms of the host where they temporarily reside may not be the best design decision. When objects can migrate, it becomes necessary to use a dedicated routing infrastructure to deliver inter-object messages, such as location servers or forwarding chains. This incurs high costs in terms of complexity, overhead, and latency. In this paper, we defer object overlay routing to an underlying networking layer, by assuming a location independent routing scheme in place of TCP/IP. In this scheme, messages are directed to destinations determined by flat identifiers instead of IP addresses. Consequently, messages are delivered directly to a recipient object, instead of a possibly out-of-date location. We explore the scheme in the context of a small object-based language with asynchronous message passing, in the style of core Erlang. We provide a standard, network-oblivious operational semantics of this language, and a network-aware semantics which takes many aspects of distribution and message routing into account. The main result is that execution of a program on top of an abstract network of processing nodes connected by asynchronous point-to-point communication channels preserves the network-oblivious behavior in a sound and fully abstract way, in the sense of contextual equivalence. This is a novel and strong result for such a low-level model. Previous work has addressed distributed implementations only in terms of fully connected TCP underlays. But in this setting, contextual equivalence is typically too strong, due to the need for locking to resolve preemption arising from object mobility.
Proceedings of the 2014 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing; 02/2014