Pablo Rabanal, J. A. Mateo, Ismael Rodríguez, Gregorio Díaz
We present a tool to automatically derive choreography-conforming web services systems. The user provides a specification that describes peer-to-peer collaborations of the observable behavior of parties from a global viewpoint, in our case WS-CDL documents, and the tool automatically extracts the particular behavior of each participant, more concretely, WS-BPEL documents defining the behavior from a local viewpoint. We implement two automatic methods(centralized and decentralized) that derive conforming systems even in cases where projecting the choreography into each service would lead to a non-conforming system. This issue is addressed by adding some control messages that make services interact as required by the choreography. Experiments where the number of exchanged messages is measured are presented, and strategies to reduce the number of these messages are discussed.
{"title":"DIEGO: A Tool for DerIving chorEoGraphy-cOnforming Web Service Systems","authors":"Pablo Rabanal, J. A. Mateo, Ismael Rodríguez, Gregorio Díaz","doi":"10.1109/ICWS.2011.68","DOIUrl":"https://doi.org/10.1109/ICWS.2011.68","url":null,"abstract":"We present a tool to automatically derive choreography-conforming web services systems. The user provides a specification that describes peer-to-peer collaborations of the observable behavior of parties from a global viewpoint, in our case WS-CDL documents, and the tool automatically extracts the particular behavior of each participant, more concretely, WS-BPEL documents defining the behavior from a local viewpoint. We implement two automatic methods(centralized and decentralized) that derive conforming systems even in cases where projecting the choreography into each service would lead to a non-conforming system. This issue is addressed by adding some control messages that make services interact as required by the choreography. Experiments where the number of exchanged messages is measured are presented, and strategies to reduce the number of these messages are discussed.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133019368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of services that optimizes some QoS attributes under given QoS constraints has been shown to be NP-hard. Therefore, heuristic algorithms are widely used, finding acceptable solutions in polynomial time. Still the time complexity of such algorithms can be prohibitive for real-time use, especially if the algorithms are required to run until they find near-optimal solutions. Thus, we propose a heuristic approach based on Hill-Climbing that makes effective use of an initial bias computed with Linear Programming, and works on a reduced search space. In our evaluation, we show that our approach finds near-optimal solutions and achieves a low time complexity.
{"title":"Efficient Heuristic Approach with Improved Time Complexity for Qos-Aware Service Composition","authors":"Adrian Klein, F. Ishikawa, S. Honiden","doi":"10.1109/ICWS.2011.60","DOIUrl":"https://doi.org/10.1109/ICWS.2011.60","url":null,"abstract":"Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of services that optimizes some QoS attributes under given QoS constraints has been shown to be NP-hard. Therefore, heuristic algorithms are widely used, finding acceptable solutions in polynomial time. Still the time complexity of such algorithms can be prohibitive for real-time use, especially if the algorithms are required to run until they find near-optimal solutions. Thus, we propose a heuristic approach based on Hill-Climbing that makes effective use of an initial bias computed with Linear Programming, and works on a reduced search space. In our evaluation, we show that our approach finds near-optimal solutions and achieves a low time complexity.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"14 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131437744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A design issue that often appears in real-world services is that their interfaces are not cohesive, i.e., they consist of many and possibly unrelated operations. This issue may complicate the comprehension of the services functionalities and the maintenance of the applications that use them. Currently, the state of the art on case studies that focus on the evaluation of the cohesion of services offered by major service providers is limited, while research efforts on corresponding cohesion metrics are at a quite early stage. In particular, there exist coarse-grained metrics of cohesion lack, which consider that the operations of a service interface are related if the types of certain of their input/output data exactly match. The problem in this approach is that operations which operate on data characterized by similar, but not exactly matching, types are treated as being totally unrelated. Consequently, the aforementioned metrics may overestimate the cohesion lack of service interfaces. In this paper, we undertake a more elaborate approach to evaluate a set of real world services provided by Amazon. Specifically, we propose two fine-grained metrics of cohesion lack, which are defined with respect to the structural similarity of the input/output data types of interface operations. The proposed metrics are formally defined and analytically assessed with respect to fundamental properties of software metrics. Finally we report the results from our case study.
{"title":"Fine-Grained Metrics of Cohesion Lack for Service Interfaces","authors":"Dionysis Athanasopoulos, A. Zarras","doi":"10.1109/ICWS.2011.27","DOIUrl":"https://doi.org/10.1109/ICWS.2011.27","url":null,"abstract":"A design issue that often appears in real-world services is that their interfaces are not cohesive, i.e., they consist of many and possibly unrelated operations. This issue may complicate the comprehension of the services functionalities and the maintenance of the applications that use them. Currently, the state of the art on case studies that focus on the evaluation of the cohesion of services offered by major service providers is limited, while research efforts on corresponding cohesion metrics are at a quite early stage. In particular, there exist coarse-grained metrics of cohesion lack, which consider that the operations of a service interface are related if the types of certain of their input/output data exactly match. The problem in this approach is that operations which operate on data characterized by similar, but not exactly matching, types are treated as being totally unrelated. Consequently, the aforementioned metrics may overestimate the cohesion lack of service interfaces. In this paper, we undertake a more elaborate approach to evaluate a set of real world services provided by Amazon. Specifically, we propose two fine-grained metrics of cohesion lack, which are defined with respect to the structural similarity of the input/output data types of interface operations. The proposed metrics are formally defined and analytically assessed with respect to fundamental properties of software metrics. Finally we report the results from our case study.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123914208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Services have been increasingly used as the building blocks for decoupled and flexible applications. Service evolution is a critical issue because even small changes, if not compatible, can potentially affect a huge number of client applications. However, particularly in the context of large scale usage of a service, changes cause different impact on client applications according to its use. This paper proposes to focus on compatibility from the point of view of usage patterns in order to deal with service evolution issues in more flexible and less costly way. The idea is to summarize the behavior of client applications into usage profiles, from which metrics that represent the impact of changes can be derived. This valuable information may support service providers on decisions about service lifecycle. The paper discusses the adoption of usage profiles and presents a framework for the automatic evaluation of service changes impact during its lifecycle.
{"title":"Service Evolution Management Based on Usage Profile","authors":"Marcelo Yamashita, K. Becker, R. Galante","doi":"10.1109/ICWS.2011.102","DOIUrl":"https://doi.org/10.1109/ICWS.2011.102","url":null,"abstract":"Services have been increasingly used as the building blocks for decoupled and flexible applications. Service evolution is a critical issue because even small changes, if not compatible, can potentially affect a huge number of client applications. However, particularly in the context of large scale usage of a service, changes cause different impact on client applications according to its use. This paper proposes to focus on compatibility from the point of view of usage patterns in order to deal with service evolution issues in more flexible and less costly way. The idea is to summarize the behavior of client applications into usage profiles, from which metrics that represent the impact of changes can be derived. This valuable information may support service providers on decisions about service lifecycle. The paper discusses the adoption of usage profiles and presents a framework for the automatic evaluation of service changes impact during its lifecycle.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124139336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web Services standard-based system resource management is a new direction. In this paper, in order to verify the WS-Management standard whether to satisfy the realistic system resource management requirements, we use IBM MAPE categories to find more WS-Management related use cases. We design three typical use cases based on MAPE principles. Finally, we make a conclusion and propose our next-step work.
{"title":"Apply WS-Management to Manage Real Resources: MAPE Use Case Study","authors":"Zhihui Lu, Jie Wu, Weiming Fu","doi":"10.1109/ICWS.2011.100","DOIUrl":"https://doi.org/10.1109/ICWS.2011.100","url":null,"abstract":"Web Services standard-based system resource management is a new direction. In this paper, in order to verify the WS-Management standard whether to satisfy the realistic system resource management requirements, we use IBM MAPE categories to find more WS-Management related use cases. We design three typical use cases based on MAPE principles. Finally, we make a conclusion and propose our next-step work.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128414499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
WS-BPEL processes can facilitate service discovery when the services have multiple interfaces in certain order. Current approaches derive the abstract WS-BPEL processes directly from the corresponding executable ones by hiding or omitting the internal activities. However, these simple approaches may prevent the services from being found by valuable potential partners at service discovery stage. To address this problem, we propose a novel approach to refactoring the executable and abstract WS-BPEL processes for service discovery. We show the application of our approach through a typical travel agency service.
{"title":"Refactoring and Publishing WS-BPEL Processes to Obtain More Partners","authors":"Wei Song, Xiaoxing Ma, S. Cheung, Hao Hu, Qiliang Yang, Jian Lü","doi":"10.1109/ICWS.2011.12","DOIUrl":"https://doi.org/10.1109/ICWS.2011.12","url":null,"abstract":"WS-BPEL processes can facilitate service discovery when the services have multiple interfaces in certain order. Current approaches derive the abstract WS-BPEL processes directly from the corresponding executable ones by hiding or omitting the internal activities. However, these simple approaches may prevent the services from being found by valuable potential partners at service discovery stage. To address this problem, we propose a novel approach to refactoring the executable and abstract WS-BPEL processes for service discovery. We show the application of our approach through a typical travel agency service.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128426526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the prevalence of SOA, an increasing number of Web services are created and composed to construct complex business processes. Selecting an appropriate service from a lot of independently developed services which have the same functionality but different QoS properties is essential for the effect of the composite service according to users' preference. Moreover, the efficiency and effect of the service selection algorithm also play an important role. In this paper, we propose a novel algorithm, named QSSAC, for service selection problem. This algorithm is based on the service clustering which can cluster a lot of atomic services of each task into a few classes according to their QoS properties. With the help of service clustering, our algorithm is able to reduce the execution time and guarantee the near-optimal result as well. Finally, three strategies are provided for re-selecting atomic services in dynamic environment. In experiment, we study the performance of QSSAC algorithm, and its feasibility has been demonstrated by simulation.
{"title":"A QoS-Aware Web Service Selection Algorithm Based on Clustering","authors":"Yi Xia, Ping Chen, L. Bao, M. Wang, J. Yang","doi":"10.1109/ICWS.2011.36","DOIUrl":"https://doi.org/10.1109/ICWS.2011.36","url":null,"abstract":"With the prevalence of SOA, an increasing number of Web services are created and composed to construct complex business processes. Selecting an appropriate service from a lot of independently developed services which have the same functionality but different QoS properties is essential for the effect of the composite service according to users' preference. Moreover, the efficiency and effect of the service selection algorithm also play an important role. In this paper, we propose a novel algorithm, named QSSAC, for service selection problem. This algorithm is based on the service clustering which can cluster a lot of atomic services of each task into a few classes according to their QoS properties. With the help of service clustering, our algorithm is able to reduce the execution time and guarantee the near-optimal result as well. Finally, three strategies are provided for re-selecting atomic services in dynamic environment. In experiment, we study the performance of QSSAC algorithm, and its feasibility has been demonstrated by simulation.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127234798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Bi, Zhiliang Zhu, Haitao Yuan, Yushun Fan, Ming Tie
In the process of web service composition, the check and prevention of semantic incompatibility is one of the most important issues. In this paper, a controlled Petri net (CtlPN)-based model for web service composition is proposed. Meanwhile, the optimal controller is constructed, such that the appropriate vectors of controllable place and arc are appended in the key transition which can lead to deadlock states. In addition, for the semantic incompatibility case, a policy based on appending optimal controller is presented. It is proved that our policy can be a good solution. Finally, the proposed controller is transformed as the activity of BPEL.
{"title":"A Petri Net Based Hybrid Optimal Controller for Deadlock Prevention in Web Service Composition","authors":"J. Bi, Zhiliang Zhu, Haitao Yuan, Yushun Fan, Ming Tie","doi":"10.1109/ICWS.2011.90","DOIUrl":"https://doi.org/10.1109/ICWS.2011.90","url":null,"abstract":"In the process of web service composition, the check and prevention of semantic incompatibility is one of the most important issues. In this paper, a controlled Petri net (CtlPN)-based model for web service composition is proposed. Meanwhile, the optimal controller is constructed, such that the appropriate vectors of controllable place and arc are appended in the key transition which can lead to deadlock states. In addition, for the semantic incompatibility case, a policy based on appending optimal controller is presented. It is proved that our policy can be a good solution. Finally, the proposed controller is transformed as the activity of BPEL.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128814629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose to use communities as a mean to organize Web services registries in a multi-registry environment. First, we propose a semantic model for Web services registry description (WSRD). A WSRD description depicts the functionalities offered by services advertised by a given registry. Thereafter, we propose an implicit approach for building communities based on the WSRD descriptions using a fuzzy clustering technique. Eventually, this clustering will be helpful for selecting an adequate registry for service requesters. Provided experiments in this paper show the feasibility of our approach.
{"title":"Implementation of Communities of Web Service Registries","authors":"M. Sellami, Walid Gaaloul, S. Tata","doi":"10.1109/ICWS.2011.69","DOIUrl":"https://doi.org/10.1109/ICWS.2011.69","url":null,"abstract":"In this paper, we propose to use communities as a mean to organize Web services registries in a multi-registry environment. First, we propose a semantic model for Web services registry description (WSRD). A WSRD description depicts the functionalities offered by services advertised by a given registry. Thereafter, we propose an implicit approach for building communities based on the WSRD descriptions using a fuzzy clustering technique. Eventually, this clustering will be helpful for selecting an adequate registry for service requesters. Provided experiments in this paper show the feasibility of our approach.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122430328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose an event-based framework that allows to specify and reason about the monitoring properties during composition process execution. The proposed approach is highly expressive and allows to specify monitoring properties that can be based on either functional or non-functional requirements, allows multi-level detection of any violation, allows to calculate effects of any such violation on the overall process execution and to recover from it using a set of recovery actions. The choice of a reasoning based approach allows to foresee the effects of violations and respects any functional and non-functional constraints associated with the process, when performing recovery. In addition, as the approach builds upon an event-based declarative framework called DISC, it results in an integrated approach as both composition design and monitoring framework are event-based.
{"title":"An Event-Based Reasoning Approach to Web Services Monitoring","authors":"Ehtesham Zahoor, O. Perrin, C. Godart","doi":"10.1109/ICWS.2011.97","DOIUrl":"https://doi.org/10.1109/ICWS.2011.97","url":null,"abstract":"In this paper, we propose an event-based framework that allows to specify and reason about the monitoring properties during composition process execution. The proposed approach is highly expressive and allows to specify monitoring properties that can be based on either functional or non-functional requirements, allows multi-level detection of any violation, allows to calculate effects of any such violation on the overall process execution and to recover from it using a set of recovery actions. The choice of a reasoning based approach allows to foresee the effects of violations and respects any functional and non-functional constraints associated with the process, when performing recovery. In addition, as the approach builds upon an event-based declarative framework called DISC, it results in an integrated approach as both composition design and monitoring framework are event-based.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122540012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：