A QoS aware services mashup model for cloud computing applications
PublisherSchool of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC)
Rights accessOpen Access
Purpose: With the popularity of cloud computing, cloud services have become to be application programming platform where users can create new applications mashup(composing) the functionality offered byothers.By composing of distributed, cloud services dynamicallyto provide more complex tasks, services mashup provides an attractive way for building large-scale Internet applications.One of the challenging issues of cloud services mashup is how to find service paths to route the service instances provider through whilemeeting the applications’ resource requirements so that the QoS constraints are satisfied. However, QoS aware service routing problem istypically NP-hard.The purpose of this paper is to propose a QoS Aware Services Mashup(QASM) model to solve this problem more effectively. Design/methodology/approach: In this paper, we focus on the QoS aware services selection problem in cloud services mashup, for example, given the user service composition requirements and their QoS constraint descriptions, how to select the required serviceinstances and route the data flows through these instances so that the QoS requirements are satisfied. We design a heuristic algorithm to find service paths to route the data flows through whilemeeting the applications’ resource requirements and specific QoS constraints. Findings: This study propose a QoS Aware Services Mashup(QASM) model to solve this problem more effectively. Simulations show that QASM can achieve desired QoS assurances as well as load balancing in cloud services environment. Originality/value: This paper present a QASM model for providing high performance distributed applications in the cloud computing
CitationChen, Yee Ming; Peng, Yi Jen. A QoS aware services mashup model for cloud computing applications. "Journal of Industrial Engineering and Management", Desembre 2012, vol. 5, núm. 2, p. 457-472.