18 May 2020 in ACM Transactions on the Web
Automatic web service composition has received a significant research attention in service-oriented computing over decades of research. With increasing number of web services, providing an end-to-end Quality of Service (QoS) guarantee in responding to user queries is becoming an important concern. Multiple QoS parameters (e.g., response time, latency, throughput, reliability, availability, success rate) are associated with a service, thereby, service composition with a large number of candidate services is a challenging multi-objective optimization problem. In this article, we study the multi-constrained multi-objective QoS-aware web service composition problem and propose three different approaches to solve the same, one optimal, based on Pareto front construction, and two others based on heuristically traversing the solution space. We compare the performance of the heuristics against the optimal and show the effectiveness of our proposals over other classical approaches for the same problem setting, with experiments on WSC-2009 and ICEBE-2005 datasets.
20 January 2022 in IEEE Transactions on Dependable and Secure Computing
The advent of Multi-Access Edge Computing (MEC) has enabled service providers to mitigate high network latencies often encountered in accessing cloud services by deploying containerized application instances on edge servers situated near end users. MEC servers are, however, susceptible to various types of failures such as communication link failures, hardware failures and so on. A fault recovery strategy determines which MEC servers to utilize to re-deploy application containers in the event of a failure. In this work, we propose a two-fold fault recovery strategy characterized by application priority. We propose a Formal Methods driven local recovery strategy for high-priority applications. We use Stochastic Multi-Player Games as a Formal Model to characterize the interactions between the different components in an MEC environment. We use objectives specified in Probabilistic Alternating-Time Temporal Logic with a Probabilistic Model Checker to derive recovery strategies considering all possible execution scenarios of the model. For lower priority applications, we resort to a global recovery strategy by designing a greedy heuristic considering each server's failure probability. We use benchmark datasets to validate our approach. Experimental results show an average 14\% reduction in latency with our approach in comparison with other state-of-the-art methods.
19 December 2023 in IEEE Transactions on Network and Service Management
In Multi-Access Edge Computing (MEC), a number of mechanisms exist to determine the optimal placement of monolithic service workflows. For applications designed as microservice workflow architectures, service placement schemes need to be revisited owing to the inherent interdependencies which exist between microservices. The dynamic environment, with stochastic user movement and service invocations, along with a large placement configuration space makes microservice placement in MEC a challenging task. Additionally, owing to user mobility, a placement scheme may need to be recalibrated, triggering service migrations to maintain the advantages offered by MEC. Existing microservice placement and migration schemes consider on-demand strategies. In this work, we take a different route and propose a Reinforcement Learning (RL) based proactive mechanism using a Learning Automata (LA) for microservice placement and migration that on one hand, keeps track of user mobility and resorts to migration when necessary, while on the other hand, keeps track of server residual capacities so that no server is overloaded. We use the San Francisco Taxi dataset to validate our approach. Experimental results show the effectiveness of our approach in comparison to other methods.
25 August 2017 in ACM Transactions on the Web
In recent times, automated business processes and web services have become ubiquitous in diverse application spaces. Efficient composition of web services in real time while providing necessary Quality of Service (QoS) guarantees is a computationally complex problem and several heuristic based approaches have been proposed to compose the services optimally. In this article, we present the design of a scalable QoS-aware service composition mechanism that balances the computational complexity of service composition with the QoS guarantees of the composed service and achieves scalability. Our design guarantees a single QoS parameter using an intelligent search and pruning mechanism in the composed service space. We also show that our methodology yields near optimal solutions on real benchmarks. We then enhance our proposed mechanism to guarantee multiple QoS parameters using aggregation techniques. Finally, we explore search time versus solution quality tradeoff using parameterized search algorithms that produce better-quality solutions at the cost of delay. We present experimental results to show the efficiency of our proposed mechanism.
24 May 2017 in IEEE Transactions on Services Computing
Efficient service composition in real time, while satisfying desirable Quality of Service (QoS) guarantees for the composite solution has been one of the topmost research challenges in the domain of services computing. On one hand, optimal QoS aware service composition algorithms, that come with the promise of solution optimality, are inherently compute intensive, and therefore, often fail to generate the optimal solution in real time for large scale web services. On the other hand, heuristic solutions that have the ability to generate solutions fast and handle large and complex service spaces, settle for sub-optimal solution quality. The problem of balancing the trade-off between computation efficiency and optimality in service composition has alluded researchers since quite some time, and several proposals for taming the scale and complexity of web service composition have been proposed in literature. In this paper, we present a new perspective towards this trade-off in service composition based on abstraction refinement, which can be seamlessly integrated on top of any off-the-shelf service composition method to tackle the space complexity, thereby, making it more time and space efficient. Instead of considering services individually during composition, we propose a set of abstractions and corresponding refinements to form service groups based on functional characteristics. The composition and QoS satisfying solution construction steps are carried out in the abstract service space. Our abstraction refinement methods give a significant speed-up compared to traditional composition techniques, since we end up exploring a substantially smaller space on average. Experimental results on benchmarks show the efficiency of our proposed mechanism in terms of time and the number of services considered for building the QoS satisfying composite solution.