International Journal of Web and Grid Services http://www.inderscience.com/browse/index.php?journalID=47&year=2011&vol=7&issue=4 Inderscience Publishers Ltd en-uk International Journal of Web and Grid Services 1741-1106 1741-1114 © 2011 Inderscience Publishers Ltd editor@inderscience.com https://www.inderscience.com/images/files/coverImgs/ijwgs_scoverijwgs.jpg http://www.inderscience.com/browse/index.php?journalID=47&year=2011&vol=7&issue=4 http://www.inderscience.com/link.php?id=44709 This paper presents a survey of transactional and recovery issues for web service composition. Service composition creates challenges for concurrent processes that access shared data. This paper outlines past research on advanced transaction models and transactional workflows. Standards to support transactions for web service composition are then presented. The paper then elaborates on data consistency issues for web service composition, outlining relaxed locking techniques, data dependency analysis, and other modularisation techniques for user-defined correctness, flexible recovery actions, and cross-cutting concerns. Failure recovery strategies, self-healing mechanisms, and checkpointing systems are also addressed. The paper concludes by outlining challenges for future research. A survey of transactional issues for Web Service composition and recovery
Le Gao; Susan D. Urban; Janani Ramachandran
International Journal of Web and Grid Services, Vol. 7, No. 4 (2011) pp. 331 - 356
This paper presents a survey of transactional and recovery issues for web service composition. Service composition creates challenges for concurrent processes that access shared data. This paper outlines past research on advanced transaction models and transactional workflows. Standards to support transactions for web service composition are then presented. The paper then elaborates on data consistency issues for web service composition, outlining relaxed locking techniques, data dependency analysis, and other modularisation techniques for user-defined correctness, flexible recovery actions, and cross-cutting concerns. Failure recovery strategies, self-healing mechanisms, and checkpointing systems are also addressed. The paper concludes by outlining challenges for future research.

]]> 10.1504/IJWGS.2011.044709 International Journal of Web and Grid Services, Vol. 7, No. 4 (2011) pp. 331 - 356 Le Gao; Susan D. Urban; Janani Ramachandran Department of Computer Science, Texas Tech University, Lubbock, Texas 79409, USA. ' Department of Industrial Engineering, Texas Tech University, Lubbock, Texas 79409, USA. ' Department of Computer Science, Texas Tech University, Lubbock, Texas 79409, USA transactional work?ow service composition service recovery data consistency data dependency failure recovery web services relaxed locking modularisation self-healing mechanisms checkpointing systems. 2012-01-03T23:20:50-05:00 7 4 331 356 2012-01-03T23:20:50-05:00 http://www.inderscience.com/link.php?id=44710 Service-Oriented Computing (SOC) allows developers to structure applications as a set of reusable services. Web Services expose their functionality by using Web Service Description Language (WSDL). We found that there is a high correlation between well-known object-oriented metrics taken in the code implementing services and the occurrences of 'anti-patterns' in their WSDLs. We show that some simple refactorings performed early when developing Web Services can greatly improve the quality of WSDL documents. Then, the contribution of this work is a practical approach to guide practitioners in obtaining better WSDL designs that aligns with the technologies and techniques commonly used in the industry for building services. Detecting WSDL bad practices in code-first Web Services
Cristian Mateos; Marco Crasso; Alejandro Zunino; José Luis Ordiales Coscia
International Journal of Web and Grid Services, Vol. 7, No. 4 (2011) pp. 357 - 387
Service-Oriented Computing (SOC) allows developers to structure applications as a set of reusable services. Web Services expose their functionality by using Web Service Description Language (WSDL). We found that there is a high correlation between well-known object-oriented metrics taken in the code implementing services and the occurrences of 'anti-patterns' in their WSDLs. We show that some simple refactorings performed early when developing Web Services can greatly improve the quality of WSDL documents. Then, the contribution of this work is a practical approach to guide practitioners in obtaining better WSDL designs that aligns with the technologies and techniques commonly used in the industry for building services.

]]> 10.1504/IJWGS.2011.044710 International Journal of Web and Grid Services, Vol. 7, No. 4 (2011) pp. 357 - 387 Cristian Mateos; Marco Crasso; Alejandro Zunino; José Luis Ordiales Coscia ISISTAN Research Institute UNICEN University, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Cientí?cas y Técnicas (CONICET). ' ISISTAN Research Institute UNICEN University, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Cientí?cas y Técnicas (CONICET). ' ISISTAN Research Institute UNICEN University, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Cientí?cas y Técnicas (CONICET). ' UNICEN University, Argentina SOC service-oriented computing web services code-first WSDL specification web service discovery object-oriented metrics WSDL anti-patterns early detection reusable services. 2012-01-03T23:20:50-05:00 7 4 357 387 2012-01-03T23:20:50-05:00 http://www.inderscience.com/link.php?id=44695 This paper studies the problem of Quality of Service (QoS)-based service selection in distributed QoS management environments where QoS data are maintained by distributed QoS registries. We propose DH4SS, a distributed heuristic service selection approach to solve the problem efficiently while avoiding massive data delivery and protecting data privacy in large scale cross-organisational applications. The basic idea is to decompose the global optimisation problem into local problems, then perform local selection in each QoS registry, and finally conduct centralised optimisation. Experimental results show that DH4SS performs efficiently with high approximation ratios and fits well with distributed QoS management environments. DH4SS: a distributed heuristic for QoS-based service selection
Jing Li; Yongwang Zhao; Hailong Sun; Zibin Zheng; Dianfu Ma
International Journal of Web and Grid Services, Vol. 7, No. 4 (2011) pp. 388 - 409
This paper studies the problem of Quality of Service (QoS)-based service selection in distributed QoS management environments where QoS data are maintained by distributed QoS registries. We propose DH4SS, a distributed heuristic service selection approach to solve the problem efficiently while avoiding massive data delivery and protecting data privacy in large scale cross-organisational applications. The basic idea is to decompose the global optimisation problem into local problems, then perform local selection in each QoS registry, and finally conduct centralised optimisation. Experimental results show that DH4SS performs efficiently with high approximation ratios and fits well with distributed QoS management environments.

]]> 10.1504/IJWGS.2011.044695 International Journal of Web and Grid Services, Vol. 7, No. 4 (2011) pp. 388 - 409 Jing Li; Yongwang Zhao; Hailong Sun; Zibin Zheng; Dianfu Ma School of Computer Science and Engineering, Beihang University, 37 Xueyuan Road, Haidian District, Beijing 100191, China. ' School of Computer Science and Engineering, Beihang University, 37 Xueyuan Road, Haidian District, Beijing 100191, China. ' School of Computer Science and Engineering, Beihang University, 37 Xueyuan Road, Haidian District, Beijing 100191, China. ' Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, NT, Hong Kong. ' School of Computer Science and Engineering, Beihang University, 37 Xueyuan Road, Haidian District, Beijing 100191, China web services QoS management quality of service service composition service selection privacy protection distributed heuristics. 2012-01-03T23:20:50-05:00 7 4 388 409 2012-01-03T23:20:50-05:00 http://www.inderscience.com/link.php?id=44696 Performance of web services may fluctuate owing to the dynamic internet environment, which makes the Quality-of-Service (QoS) of web services inherently uncertain. With the increase in web services in the internet, selecting the optimal service from a set of functionally equivalent candidates becomes an important research problem. In this paper, we propose an efficient and effective approach for reliable web service selection. Our approach first employs cloud model to compute the QoS uncertainty for pruning redundant services while extracting reliable services. Then, based on QoS uncertainty computing, Mixed Integer Programming (MIP) is used to select optimal services. We evaluate our approach experimentally on real-world web services as well as randomly generated QoS values. The experimental results show that our approach can provide reliable and efficient service selection for users. Reliable web service selection via QoS uncertainty computing
Shangguang Wang; Zibin Zheng; Qibo Sun; Hua Zou; Fangchun Yang
International Journal of Web and Grid Services, Vol. 7, No. 4 (2011) pp. 410 - 426
Performance of web services may fluctuate owing to the dynamic internet environment, which makes the Quality-of-Service (QoS) of web services inherently uncertain. With the increase in web services in the internet, selecting the optimal service from a set of functionally equivalent candidates becomes an important research problem. In this paper, we propose an efficient and effective approach for reliable web service selection. Our approach first employs cloud model to compute the QoS uncertainty for pruning redundant services while extracting reliable services. Then, based on QoS uncertainty computing, Mixed Integer Programming (MIP) is used to select optimal services. We evaluate our approach experimentally on real-world web services as well as randomly generated QoS values. The experimental results show that our approach can provide reliable and efficient service selection for users.

]]> 10.1504/IJWGS.2011.044696 International Journal of Web and Grid Services, Vol. 7, No. 4 (2011) pp. 410 - 426 Shangguang Wang; Zibin Zheng; Qibo Sun; Hua Zou; Fangchun Yang State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Haidian, Beijing 100876, China. ' Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, NT, Hong Kong. ' State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Haidian, Beijing, China. ' State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Haidian, Beijing, China. ' State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Haidian, Beijing, China QoS uncertainty quality of service web services service selection cloud modelling mixed integer programming cloud computing optimisation reliability. 2012-01-03T23:20:50-05:00 7 4 410 426 2012-01-03T23:20:50-05:00 http://www.inderscience.com/link.php?id=44697 A grid computing environment involves cooperation and sharing resources among distributed machines. Users may dispatch their tasks to remote computing resources instead of just computing locally. Hence, task assignment is an important issue in a grid computing environment. It plays a crucial role in achieving high utilisation of resources. Due to heterogeneity of resources, assigning an application is significantly complicated and challenging task in grid system. Tasks assignment becomes much more complex when it comes to assign tasks with precedence constraints represented by a Directed Acyclic Graph (DAG). In this paper, we propose a dependent task assignment strategy for Grids. Tasks assignment for Grid computing
Meriem Meddeber; Belabbas Yagoubi
International Journal of Web and Grid Services, Vol. 7, No. 4 (2011) pp. 427 - 443
A grid computing environment involves cooperation and sharing resources among distributed machines. Users may dispatch their tasks to remote computing resources instead of just computing locally. Hence, task assignment is an important issue in a grid computing environment. It plays a crucial role in achieving high utilisation of resources. Due to heterogeneity of resources, assigning an application is significantly complicated and challenging task in grid system. Tasks assignment becomes much more complex when it comes to assign tasks with precedence constraints represented by a Directed Acyclic Graph (DAG). In this paper, we propose a dependent task assignment strategy for Grids.

]]> 10.1504/IJWGS.2011.044697 International Journal of Web and Grid Services, Vol. 7, No. 4 (2011) pp. 427 - 443 Meriem Meddeber; Belabbas Yagoubi Department of Mathematics and Computer Science, University of Mascara, Mascara, Algeria. ' Department of Computer Science, University of Oran, Oran, Algeria dependent tasks grid computing task assignment DAG directed acyclic graph grid modelling GridSim. 2012-01-03T23:20:50-05:00 7 4 427 443 2012-01-03T23:20:50-05:00