Buradasınız

A QoS aware services mashup model for cloud computing applications

Journal Name:

Publication Year:

DOI: 
http://dx.doi.org/10.3926/jiem.472
Abstract (2. Language): 
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 by others. By composing of distributed, cloud services dynamically to 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 while meeting the applications’ resource requirements so that the QoS constraints are satisfied. However, QoS aware service routing problem is typically NP-hard. The purpose of this paper The purpose of this paper The purpose of this paper The purpose of this paper The purpose of this paper The purpose of this paper The purpose of this paper The purpose of this paper The purpose of this paper The purpose of this paper The purpose of this paper The purpose of this paper The purpose of this paper The purpose of this paper The purpose of this paper is to is to is to propose a QoS Aware Services Mashup(QASM) model to solve this problem more effectively. Design/methodology/approach Design/methodology/approachDesign/methodology/approach Design/methodology/approach Design/methodology/approach Design/methodology/approachDesign/methodology/approachDesign/methodology/approach Design/methodology/approach 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 service instances 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 while meeting 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. Research limitations/implications: The number of mashup platforms and research works in the survey is limited. Furthermore, mashup platforms are continuously updated, thus some information might be outdated. Practical implications: It was found that each different cloud service should have distinct business model. The QASM model is a tool for translating cloud computing technology into customer value. Social implications: The purpose of this study was to explore QoS aspect of cloud computing business model from services provider viewpoint. The cost structure should be continued as economics as clouds are the key driving factor for both services providers and customers. Originality/value: This paper present a QASM model for providing high performance distributed applications in the cloud computing systems
457-472

REFERENCES

References: 

Berbner, R., Spahn, M., Repp, N., Heckmann, O., & Steinmetz, R. (2006). Heuristics for QoS-aware Web Service Composition, Proceedings of the 2006 IEEE International Conference on Web Services (ICWS06).
Buyya, R., Yeo, C.S., & Venugopal, S. (2008 Sept). Market Oriented Cloud Computing: Vision, Hype, and Reality for delivering IT Services as Computing Utilities. Keynote Paper, in Proceedings of the 10th IEEE International Conference on High Performance Computing and Communications (HPCC 2008), IEEE CS Press, Los Alamitos, CA, USA, 25-27.
Broberg, J., Buyya, R., & Tari, Z. (2009). Metacdn: Harnessing Storage Clouds' for high performance content delivery. Journal of Network and Computer Applications, 32(5), 1012¬1022. http://dx.doi.org/10.1016/j.jnca.2009.03.004
Cahon, S., Melab, N., & Talbi, E.G. (2004, May). Paradis EO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3), 357-380. http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec
Chu, X., Nadiminti, K., Jin, C., Venugopal, S., & Buyya, R. (2007). Aneka: Next-Generation Enterprise Grid Platformfor e-Science and e-Business Applications. Proceedings of the 3rd IEEE International Conference on e-Science and Grid Computing, IEEE Computer Society Press, Los Alamitos, CS, 151 -159.
Dijkstra, E. (1959). A note on two problems in connection with graphs, Numerische Mathematik, l.1 269-271. http://dx.doi.org/10.1007/BF01386390
Foster, I., Kesselman, C., Nick, J.M., & Tuecke, S. (2002). Grid service for distributed system integration, IEEE Computer, 35(6), 37-46. http://dx.doi.org/10.1109/MC.2002.1009167
Feng, G., Makki, K., Pissinou, N., & Doulgeris, C. (2002). Heuristic andExact Algorithms for QoS Routing with Multiple Constraints. IEICETrans. Communications, E85-B(12), 2838-2850.
Juttner, A., Szviatovszki, B., Mecs, I., & Rajko, Z. (2001). Lagrange relaxation based method for the QoS routing problem. Proceedings of the IEEE INFOCOM, 2, 859-868.
Korkmaz, T.,
&
Krunz, M. (2001). A randomized algorithm for finding a path subject to multiple QoS constraints. Computer Networks, 36(2-3), 251-268.
http://dx.doi.org/10.1016/S1389-1286(00)00209-7
Kirley, M., & Stewart, R. (2007). Multi-objective evolutionary algorithms on complex networks. Proceedings of the Fourth International Conference on Evolutionary Multi-Criterion Optimization, Lecture Notes Computer Science 4403, Springer Berlin, Heidelberg, 81-95.
Wang, Z., & Crowcroft, J. (1996). Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications, 14,1228-1234. http://dx.doi.org/10.1109/49.536364
Yu, T., & Lin, K. J. (2004). Service selection algorithms for web services with end-to-end QoS constraints. IEEE International Conference onE-Commerce Technology (CEC'04), 129-136.
Zeng, L., Benatallah, B., Ngu, A., et al. (2004). QoS-aware middleware for Web service composition. IEEE Transactions on Software Engineering, 5(30), 311 -328. http://dx.doi.org/10.1109/TSE.2004.11

Thank you for copying data from http://www.arastirmax.com