Towards network-aware service composition in the cloud

Klein, Adrian; Ishikawa, Fuyuki; Honiden, Shinichi

doi:10.1145/2187836.2187965

Cited by 111 publications

(78 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Klein et al [91] considers QoS-aware service composition by handling network latencies. The authors present a network model that allows estimating latencies between locations and propose a genetic algorithm to achieve network-aware and QoS-aware service provisioning.…”

Section: Black-box Service Modelsmentioning

confidence: 99%

Quality-of-service in cloud computing: modeling techniques and their applications

Ardagna

Casale

Ciavotta

et al. 2014

J Internet Serv Appl

211

View full text Add to dashboard Cite

Recent years have seen the massive migration of enterprise applications to the cloud. One of the challenges posed by cloud applications is Quality-of-Service (QoS) management, which is the problem of allocating resources to the application to guarantee a service level along dimensions such as performance, availability and reliability. This paper aims at supporting research in this area by providing a survey of the state of the art of QoS modeling approaches suitable for cloud systems. We also review and classify their early application to some decision-making problems arising in cloud QoS management.

show abstract

Section: Black-box Service Modelsmentioning

confidence: 99%

Quality-of-service in cloud computing: modeling techniques and their applications

Ardagna

Casale

Ciavotta

et al. 2014

J Internet Serv Appl

211

View full text Add to dashboard Cite

show abstract

“…Constraints families (34)-(36) express the upper and lower bounds for the number of monitors (denoted by a), monitoring frequency (denoted by b) and monitoring granularity (denoted by g) of every local monitoring strategy. Constraints on other monitoring parameters (if any) can be included in the IP as additional constraints, in a form similar to constraints (34)- (36). Constraints family (37) ensures that only the local monitoring strategies that generate more benefit than they cost are taken into consideration.…”

Section: Global Optimisationmentioning

confidence: 99%

“…Many efforts have been devoted to selecting appropriate component services at design time to fulfil the quality requirements for SBSs. Representative pieces of such work include [5], [7], [36], [64]. In [64], a middleware platform AgFlow is presented that uses Integer Programming to compute the optimal plan for the execution of composite SBSs from several execution paths represented by DAGs.…”

Section: Related Workmentioning

confidence: 99%

“…Authors of [5] adopt the Skyline technique to deal with the computational complexity of QoS-aware service composition. In [36], the authors take a further step by taking the network latency into account when selecting services for SBSs.…”

Section: Related Workmentioning

confidence: 99%

“…Here the BCs of an SBS refer to its component services and the data transmission links (or transmissions in short) between the component services. With the advent of cloud computing, the distribution of the component services of SBSs rises rapidly, increasing the impact of the network on the quality of the SBSs [36]. Thus, the data transmissions between the component services must be considered in monitoring SBSs.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Formulating Cost-Effective Monitoring Strategies for Service-Based Systems

Han

Yang

et al. 2014

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-When operating in volatile environments, service-based systems (SBSs) that are dynamically composed from component services must be monitored in order to guarantee timely and successful delivery of outcomes in response to user requests. However, monitoring consumes resources and very often impacts on the quality of the SBSs being monitored. Such resource and system costs need to be considered in formulating monitoring strategies for SBSs. The critical path of a composite SBS, i.e., the execution path in the service composition with the maximum execution time, is of particular importance in cost-effective monitoring as it determines the response time of the entire SBS. In volatile operating environments, the critical path of an SBS is probabilistic, as every execution path can be critical with a certain probability, i.e., its criticality. As such, it is important to estimate the criticalities of different execution paths when deciding which parts of the SBS to monitor. Furthermore, cost-effective monitoring also requires management of the trade-off between the benefit and cost of monitoring. In this paper, we propose CriMon, a novel approach to formulating and evaluating monitoring strategies for SBSs. CriMon first calculates the criticalities of the execution paths and the component services of an SBS and then, based on those criticalities, generates the optimal monitoring strategy considering both the benefit and cost of monitoring. CriMon has two monitoring strategy formulation methods, namely local optimisation and global optimisation. In-lab experimental results demonstrate that the response time of an SBS can be managed cost-effectively through CriMon-based monitoring. The effectiveness and efficiency of the two monitoring strategy formulation methods are also evaluated and compared.

show abstract

An adaptive service selection method for cross‐cloud service composition

Yang

Lin

Dou

2013

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARY Cloud computing aims at providing elastic applications that can be scaled at runtime. In practice, traditional service composition methods are not flexible enough to changes in cross‐cloud environment. In view of this challenge, an adaptive service selection method for cross‐cloud service composition is proposed in this paper, by dynamically selecting proper services with near‐optimal performance for adapting to changes in time. First, concretely speaking, the service selection and execution are modeled with Markov decision process to ensure flexibility. Second, service pair is defined, and the way to build service pairs set is proposed to predict the performance of candidate services. Third, the adaptive service selection algorithm is designed to select proper cloud services for changing cross‐cloud environment. Finally, a case study for cross‐cloud service composition and experiments are presented for validating the feasibility of our proposal. Concurrency and Computation: Practice and Experience, 2013.© 2013 Wiley Periodicals, Inc.

show abstract

Towards network-aware service composition in the cloud

Cited by 111 publications

References 25 publications

Quality-of-service in cloud computing: modeling techniques and their applications

Quality-of-service in cloud computing: modeling techniques and their applications

Formulating Cost-Effective Monitoring Strategies for Service-Based Systems

An adaptive service selection method for cross‐cloud service composition

Contact Info

Product

Resources

About