This paper reports on an implementation for tool support of model-checking collaborating service compositions with deployment configurations under resource constraints.The implementation accepts UML Deployment Diagrams with an applied service deployment profile and one or more WS-BPEL orchestrations that are assigned to Web Servlets and servers in this deployment. Using model-checking techniques the tool can determine whether the configuration of deadlock-free service orchestration processes introduce deadlock scenarios when combined with resource constraints of a deployment environment. The implementation is built upon a tool suite, called WS-Engineer, which is aimed at assisting service engineers in constructing and testing various aspects of a service engineering approach, including orchestration, choreography and deployment artifacts. The tool integrates as a plug-in for Eclipse, alongside the IBM Rational software architect tool suite and others. A case study based upon a complex service grid solution, for analyzing chemical markup patterns, is used to demonstrate the accessible and practical nature of the solution.
{"title":"Tool Support for Safety Analysis of Service Composition and Deployment Models","authors":"H. Foster","doi":"10.1109/ICWS.2008.12","DOIUrl":"https://doi.org/10.1109/ICWS.2008.12","url":null,"abstract":"This paper reports on an implementation for tool support of model-checking collaborating service compositions with deployment configurations under resource constraints.The implementation accepts UML Deployment Diagrams with an applied service deployment profile and one or more WS-BPEL orchestrations that are assigned to Web Servlets and servers in this deployment. Using model-checking techniques the tool can determine whether the configuration of deadlock-free service orchestration processes introduce deadlock scenarios when combined with resource constraints of a deployment environment. The implementation is built upon a tool suite, called WS-Engineer, which is aimed at assisting service engineers in constructing and testing various aspects of a service engineering approach, including orchestration, choreography and deployment artifacts. The tool integrates as a plug-in for Eclipse, alongside the IBM Rational software architect tool suite and others. A case study based upon a complex service grid solution, for analyzing chemical markup patterns, is used to demonstrate the accessible and practical nature of the solution.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128406636","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}
Central to the notion of dynamic binding and loose coupling that underlie service-oriented architectures is dynamic service discovery. At the heart of most service discovery mechanisms is a matchmaking algorithm that matches a semantic query to a set of compatible web service advertisements. These advertisements also describe service semantics as a set of OWL-S terms. Most current matchmaking algorithms are based on semantic matching of input and output terms alone. However, a complete description of the service profile also includes preconditions and effects and in order to find a true match the matchmaker needs to match on these aspects of the advertisement as well. In this paper, we make the case for augmenting existing matchmaking algorithms with preconditions and effects in the context of Web Services. Further, we propose an algorithm for condition matching that is layered on the top of input-output term matching that overcomes the limitations of existing work. Although the problem of condition matching is NP-Complete, we can overcome this limitation by using a set of heuristics that gives us results in polynomial time. We also analyze complexity of the algorithm by comparing it with brute force approach of matching. We show that our algorithm yields results more efficiently than brute force matching but with the same accuracy.
{"title":"On Extending Semantic Matchmaking to Include Preconditions and Effects","authors":"U. Bellur, H. Vadodaria","doi":"10.1109/ICWS.2008.18","DOIUrl":"https://doi.org/10.1109/ICWS.2008.18","url":null,"abstract":"Central to the notion of dynamic binding and loose coupling that underlie service-oriented architectures is dynamic service discovery. At the heart of most service discovery mechanisms is a matchmaking algorithm that matches a semantic query to a set of compatible web service advertisements. These advertisements also describe service semantics as a set of OWL-S terms. Most current matchmaking algorithms are based on semantic matching of input and output terms alone. However, a complete description of the service profile also includes preconditions and effects and in order to find a true match the matchmaker needs to match on these aspects of the advertisement as well. In this paper, we make the case for augmenting existing matchmaking algorithms with preconditions and effects in the context of Web Services. Further, we propose an algorithm for condition matching that is layered on the top of input-output term matching that overcomes the limitations of existing work. Although the problem of condition matching is NP-Complete, we can overcome this limitation by using a set of heuristics that gives us results in polynomial time. We also analyze complexity of the algorithm by comparing it with brute force approach of matching. We show that our algorithm yields results more efficiently than brute force matching but with the same accuracy.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128463427","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}
Pub Date : 2008-09-23DOI: 10.1109/SERVICES-2.2008.54
M. Luo, Liang-Jie Zhang
This tutorial will take the audience through an "aggregated" SOA engagement and discuss key processes, activities, and deliverables through the entire life cycle, especially in service modeling, realization, integration through an enterprise service bus and governance. Best practices and some anti-patterns will also be presented and discussed. It is mostly based on some of the speakers' pioneering project practices and lessons learned since SOA and Web service's inception.
{"title":"Practical SOA: Service Modeling, Enterprise Service Bus and Governance","authors":"M. Luo, Liang-Jie Zhang","doi":"10.1109/SERVICES-2.2008.54","DOIUrl":"https://doi.org/10.1109/SERVICES-2.2008.54","url":null,"abstract":"This tutorial will take the audience through an \"aggregated\" SOA engagement and discuss key processes, activities, and deliverables through the entire life cycle, especially in service modeling, realization, integration through an enterprise service bus and governance. Best practices and some anti-patterns will also be presented and discussed. It is mostly based on some of the speakers' pioneering project practices and lessons learned since SOA and Web service's inception.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132256197","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}
Lingshuang Shao, Lu Zhang, Tao Xie, Junfeng Zhao, Bing Xie, Hong Mei
With the popularity of service-oriented computing, how to construct highly available service-oriented applications is becoming a hot topic in both the research and industry communities. As a fundamental problem in dynamic service selection, availability estimation is challenging because of the dynamic nature of Web services. To grasp the dynamic nature of Web services, we set up an experimental environment for collecting runtime information of Web services. Based on the collected runtime information, we identify several characteristics of service failures and successes, and further define three typical service runtime statuses. Based on these statuses, we propose a novel approach to dynamic availability estimation, which is called status identification based availability estimation for service selection (SIBE). To evaluate our approach, we compare SIBE with other approaches in an experiment of dynamic service selection on the Internet. Experimental results show that SIBE can efficiently improve the success rate of selecting available services.
{"title":"Dynamic Availability Estimation for Service Selection Based on Status Identification","authors":"Lingshuang Shao, Lu Zhang, Tao Xie, Junfeng Zhao, Bing Xie, Hong Mei","doi":"10.1109/ICWS.2008.131","DOIUrl":"https://doi.org/10.1109/ICWS.2008.131","url":null,"abstract":"With the popularity of service-oriented computing, how to construct highly available service-oriented applications is becoming a hot topic in both the research and industry communities. As a fundamental problem in dynamic service selection, availability estimation is challenging because of the dynamic nature of Web services. To grasp the dynamic nature of Web services, we set up an experimental environment for collecting runtime information of Web services. Based on the collected runtime information, we identify several characteristics of service failures and successes, and further define three typical service runtime statuses. Based on these statuses, we propose a novel approach to dynamic availability estimation, which is called status identification based availability estimation for service selection (SIBE). To evaluate our approach, we compare SIBE with other approaches in an experiment of dynamic service selection on the Internet. Experimental results show that SIBE can efficiently improve the success rate of selecting available services.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134071773","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 a comprehensive trust management approach for Web services that covers the analysis/modelling of trust relationships and the development of trust management layer in a consistent manner. The specific characteristics of trust relationships in Web services are discussed. We introduce a separated trust management layer for Web services that can hold computing components for trust management tasks. A trust management architecture for Web services is proposed for building up the trust management layer. The proposed trust management architecture for Web services deals with trust requirements, trust evaluation, and trust consumption in Web services under a unified umbrella and it provides a solid foundation upon which may evolve the trust management layer for Web services.
{"title":"Trust Management for Web Services","authors":"Weiliang Zhao, V. Varadharajan","doi":"10.1109/ICWS.2008.53","DOIUrl":"https://doi.org/10.1109/ICWS.2008.53","url":null,"abstract":"In this paper, we propose a comprehensive trust management approach for Web services that covers the analysis/modelling of trust relationships and the development of trust management layer in a consistent manner. The specific characteristics of trust relationships in Web services are discussed. We introduce a separated trust management layer for Web services that can hold computing components for trust management tasks. A trust management architecture for Web services is proposed for building up the trust management layer. The proposed trust management architecture for Web services deals with trust requirements, trust evaluation, and trust consumption in Web services under a unified umbrella and it provides a solid foundation upon which may evolve the trust management layer for Web services.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134236566","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}
The rapid adoption of model-driven design (MDD) methodology in SOA-based solution design requires an adaptive tooling environment that can systematically improve designers' productivity. Ideally, the environment should be flexible enough to both handle frequently changing requirements and support new features without intensive coding efforts. In this paper, we provide a coding-free enablement framework to realize such extensible tooling environments based on a mathematical abstraction of key models in SOA solution design using graph theory definition. This abstraction formalizes the SOA modeling logic and semantics, and also guides the implementation of an extensible and customizable tooling environment. As a case study, we illustrate how our framework is able to transform the development style from Java programming to text editing through our implementation of a UML 2.0 based SOA modeling environment using IBMpsilas Rational Software Architect (RSA) development platform.
{"title":"Coding-Free Model-Driven Enablement Framework and Engineering Practices of a Context-Aware SOA Modeling Environment","authors":"N. Zhou, Yi-Min Chee, Liang-Jie Zhang","doi":"10.1109/ICWS.2008.77","DOIUrl":"https://doi.org/10.1109/ICWS.2008.77","url":null,"abstract":"The rapid adoption of model-driven design (MDD) methodology in SOA-based solution design requires an adaptive tooling environment that can systematically improve designers' productivity. Ideally, the environment should be flexible enough to both handle frequently changing requirements and support new features without intensive coding efforts. In this paper, we provide a coding-free enablement framework to realize such extensible tooling environments based on a mathematical abstraction of key models in SOA solution design using graph theory definition. This abstraction formalizes the SOA modeling logic and semantics, and also guides the implementation of an extensible and customizable tooling environment. As a case study, we illustrate how our framework is able to transform the development style from Java programming to text editing through our implementation of a UML 2.0 based SOA modeling environment using IBMpsilas Rational Software Architect (RSA) development platform.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134040248","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}
Communications among Web services are asynchronous. Asynchronous models of service compositions face the problem that the performance of verification is bring down with states explosion. We describe an approach, which utilize the interaction-independence of component services in the composition and forms all component services into different groups. Preliminary experiment results show that the verification of service compositions upon these groups can decrease the size of exploration states and hence improve the performance.
{"title":"Exploiting Independence in Design of Web Service Composition","authors":"Fangfang Liu, Yan Chi, Xiangfeng Luo","doi":"10.1109/ICWS.2008.82","DOIUrl":"https://doi.org/10.1109/ICWS.2008.82","url":null,"abstract":"Communications among Web services are asynchronous. Asynchronous models of service compositions face the problem that the performance of verification is bring down with states explosion. We describe an approach, which utilize the interaction-independence of component services in the composition and forms all component services into different groups. Preliminary experiment results show that the verification of service compositions upon these groups can decrease the size of exploration states and hence improve the performance.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"733 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134462237","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 describe an approach to discover the control flow graph of Web services for Web services analysis, verification, and testing. For this purpose, three novel methods are proposed. First, we introduce a domain independent RDF Schemas for concise resource oriented functional specification of Web services operations. Secondly, we describe the use of RDF entailment to accurately derive the control flow from the functional specifications. We developed a transformation from RDF graph to SPARQL query to facilitate the RDF entailment which offers flexibility and extensibility over the direct graph matching approach. The third is a linkage based Web services modeling and analysis framework, within which we apply an improved Google PageRank algorithm to efficiently calculate test coverage potential using the derived control flow. We justify that the proposed linkage based Web services modeling and analysis framework is particularly suitable for testing Web services. A prototype of the proposed methods has been implemented and tested on some standard based Web services. Experimental results show that the control flow analysis is quite efficient and accurate, and the coverage based test results of the proposed approach are very promising.
{"title":"Control Flow Analysis and Coverage Driven Testing for Web Services","authors":"Li Li, W. Chou, Weiping Guo","doi":"10.1109/ICWS.2008.104","DOIUrl":"https://doi.org/10.1109/ICWS.2008.104","url":null,"abstract":"In this paper, we describe an approach to discover the control flow graph of Web services for Web services analysis, verification, and testing. For this purpose, three novel methods are proposed. First, we introduce a domain independent RDF Schemas for concise resource oriented functional specification of Web services operations. Secondly, we describe the use of RDF entailment to accurately derive the control flow from the functional specifications. We developed a transformation from RDF graph to SPARQL query to facilitate the RDF entailment which offers flexibility and extensibility over the direct graph matching approach. The third is a linkage based Web services modeling and analysis framework, within which we apply an improved Google PageRank algorithm to efficiently calculate test coverage potential using the derived control flow. We justify that the proposed linkage based Web services modeling and analysis framework is particularly suitable for testing Web services. A prototype of the proposed methods has been implemented and tested on some standard based Web services. Experimental results show that the control flow analysis is quite efficient and accurate, and the coverage based test results of the proposed approach are very promising.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133113903","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}
Augmenting web services with explicit semantics forms the foundation of Service Oriented Architectures (SOAs) automation. As more and more Semantic Web Services (SWSs) are deployed, similar SWSs could have quite different quality-of-service (QoS) levels. The QoS-aware discovery becomes an important challenge. While some efforts try to solve it via Constraint Programming (CP), they suffer from the purely syntactic matchmaking method. Furthermore, the construction of constraints and the selection of services are completely dependent on the literal translation from QoS descriptions, which increase obstacles to actually apply CP. In this paper, we propose a semantic QoS-aware framework for SWSs discovery by combining the semantic matchmaking and CP. Initially, a QoS ontology is presented to define QoS data into service descriptions. Then the ontology reasoning is adopted to change previous syntactic matchmaking into a semantic way. Through confirming the compatibility of concepts, complex QoS conditions are solved as constraints and a selection algorithm is proposed to obtain the optimal offer. Finally, the prototype implementation of our framework is discussed and a SWSs discovery case is used to illustrate the comprehensive discovery process.
{"title":"A Semantic QoS-Aware Discovery Framework for Web Services","authors":"Qian Ma, Hao Wang, Ying Li, G. Xie, Feng Liu","doi":"10.1109/ICWS.2008.44","DOIUrl":"https://doi.org/10.1109/ICWS.2008.44","url":null,"abstract":"Augmenting web services with explicit semantics forms the foundation of Service Oriented Architectures (SOAs) automation. As more and more Semantic Web Services (SWSs) are deployed, similar SWSs could have quite different quality-of-service (QoS) levels. The QoS-aware discovery becomes an important challenge. While some efforts try to solve it via Constraint Programming (CP), they suffer from the purely syntactic matchmaking method. Furthermore, the construction of constraints and the selection of services are completely dependent on the literal translation from QoS descriptions, which increase obstacles to actually apply CP. In this paper, we propose a semantic QoS-aware framework for SWSs discovery by combining the semantic matchmaking and CP. Initially, a QoS ontology is presented to define QoS data into service descriptions. Then the ontology reasoning is adopted to change previous syntactic matchmaking into a semantic way. Through confirming the compatibility of concepts, complex QoS conditions are solved as constraints and a selection algorithm is proposed to obtain the optimal offer. Finally, the prototype implementation of our framework is discussed and a SWSs discovery case is used to illustrate the comprehensive discovery process.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132971149","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}
We propose the Service Control Technology for the Web-telecom coordination service, and we show our proposal effectiveness. In the NGN (Next-Generation Network), many new applications are expected using open network interfaces. In particular, we study the SDP (Service Delivery Platform) for coordinating existing Internet services and telecom services. In this paper, we propose the Service control technology, which handles common process required in the telecom trigger Web-telecom coordination service. Our method achieves improvement in usability of telecom user, reliability of the coordination service, and processing performance. We implement our method two types (Proxy type, Callable type) and measured processing performance. In comparison to related technologies, we show our method effectiveness.
{"title":"Development of Service Control Server for Web-Telecom Coordination Service","authors":"Y. Yamato, H. Ohnishi, H. Sunaga","doi":"10.1109/ICWS.2008.17","DOIUrl":"https://doi.org/10.1109/ICWS.2008.17","url":null,"abstract":"We propose the Service Control Technology for the Web-telecom coordination service, and we show our proposal effectiveness. In the NGN (Next-Generation Network), many new applications are expected using open network interfaces. In particular, we study the SDP (Service Delivery Platform) for coordinating existing Internet services and telecom services. In this paper, we propose the Service control technology, which handles common process required in the telecom trigger Web-telecom coordination service. Our method achieves improvement in usability of telecom user, reliability of the coordination service, and processing performance. We implement our method two types (Proxy type, Callable type) and measured processing performance. In comparison to related technologies, we show our method effectiveness.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"57 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124339840","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
扫码关注我们
求助内容：
应助结果提醒方式：