Current approaches for service adaptation focus on either the message interface aspect or the control flow interface aspect separately. Our work recognizes that message adaptation may affect control flow adaptation and vice versa in complex ways. Hence an integrated approach is necessary. We propose a framework for integration and identify a set of extendible message adaptation patterns to solve typical message mismatches. In addition we give an algorithm for generating new message adapter on the fly so as to integrate control flow considerations into message adaptation. Finally we show how these individual patterns can be combined by another algorithm to create a complete adapter for two processes. The advantages of our method are illustrated with a case study. We present the design of a prototype and show XSLT code for implementing the message transformation.
{"title":"Towards Integrated Service Adaptation A New Approach Combining Message and Control Flow Adaptation","authors":"Zhe Shan, Akhil Kumar, P. Grefen","doi":"10.1109/ICWS.2010.89","DOIUrl":"https://doi.org/10.1109/ICWS.2010.89","url":null,"abstract":"Current approaches for service adaptation focus on either the message interface aspect or the control flow interface aspect separately. Our work recognizes that message adaptation may affect control flow adaptation and vice versa in complex ways. Hence an integrated approach is necessary. We propose a framework for integration and identify a set of extendible message adaptation patterns to solve typical message mismatches. In addition we give an algorithm for generating new message adapter on the fly so as to integrate control flow considerations into message adaptation. Finally we show how these individual patterns can be combined by another algorithm to create a complete adapter for two processes. The advantages of our method are illustrated with a case study. We present the design of a prototype and show XSLT code for implementing the message transformation.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125646651","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}
Scientific workflow systems facilitate scientific experiments by integrating and coordinating geographically distributed data and algorithmic services in a loosely coupled manner. Most scientific workflow-engines use centralized coordination as the choice of approach for executing workflows, requiring the coordinator (i.e., workflow-engine) to send and receive all input and output data of component services. Such indirect data communication between the component services increases the data-traffic of the coordinator and weakens the performance of the workflow. To optimize this, we propose an approach where data-flow is dynamically delegated from the coordinator to the component services, with direct transportation of data between the component services.
{"title":"Optimizing the Data-Traffic of Centrally Coordinated Scientific Workflow Systems","authors":"S. Subramanian, P. Puntervoll, P. Sztromwasser","doi":"10.1109/ICWS.2010.71","DOIUrl":"https://doi.org/10.1109/ICWS.2010.71","url":null,"abstract":"Scientific workflow systems facilitate scientific experiments by integrating and coordinating geographically distributed data and algorithmic services in a loosely coupled manner. Most scientific workflow-engines use centralized coordination as the choice of approach for executing workflows, requiring the coordinator (i.e., workflow-engine) to send and receive all input and output data of component services. Such indirect data communication between the component services increases the data-traffic of the coordinator and weakens the performance of the workflow. To optimize this, we propose an approach where data-flow is dynamically delegated from the coordinator to the component services, with direct transportation of data between the component services.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129300698","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 composition environment is highly dynamic with new services being deployed, existing ones becoming unavailable or their QoS and other non-functional properties (cost, availability, etc.) changing dynamically. However, current approaches for web services composition and execution, such as WS-BPEL, can neither tailor the execution automatically as per the required QoS nor can they adapt to the highly dynamic environment. Though there have been some recent efforts in this direction they are piecemeal and insufficient. They either do not take user's non-functional requirements (NFRs) into consideration for adaptation, or there is no standard way of specifying these requirements for a BPEL process. In this paper, we propose an integrated approach for dynamically adapting web service compositions based on NFRs. We first give a specification for representing NFRs for each partner service of a BPEL process, and then describe a system that dynamically adapts the BPEL process based on these requirements by selecting suitable services at runtime. The selected services only need to be semantically equivalent and the system automatically takes care of the syntactical differences between their interfaces. We integrated our system in an existing BPEL engine using aspect oriented approach and demonstrate via experiments that it has very little performance overhead even at high loads.
{"title":"From Specification to Adaptation: An Integrated QoS-driven Approach for Dynamic Adaptation of Web Service Compositions","authors":"Vikas Agarwal, P. Jalote","doi":"10.1109/ICWS.2010.39","DOIUrl":"https://doi.org/10.1109/ICWS.2010.39","url":null,"abstract":"Web services composition environment is highly dynamic with new services being deployed, existing ones becoming unavailable or their QoS and other non-functional properties (cost, availability, etc.) changing dynamically. However, current approaches for web services composition and execution, such as WS-BPEL, can neither tailor the execution automatically as per the required QoS nor can they adapt to the highly dynamic environment. Though there have been some recent efforts in this direction they are piecemeal and insufficient. They either do not take user's non-functional requirements (NFRs) into consideration for adaptation, or there is no standard way of specifying these requirements for a BPEL process. In this paper, we propose an integrated approach for dynamically adapting web service compositions based on NFRs. We first give a specification for representing NFRs for each partner service of a BPEL process, and then describe a system that dynamically adapts the BPEL process based on these requirements by selecting suitable services at runtime. The selected services only need to be semantically equivalent and the system automatically takes care of the syntactical differences between their interfaces. We integrated our system in an existing BPEL engine using aspect oriented approach and demonstrate via experiments that it has very little performance overhead even at high loads.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"89 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129752295","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 (SOA) promotes a paradigm where ad-hoc applications are built by dynamically linking service-based software capabilities. Service providers follow specification standards to advertise their services’ capabilities and to enable loosely coupled integration between their services and other businesses over the Web. A major challenge in this domain is interpreting the data that must be marshaled between consumer and producer systems. We propose a framework to support formal modeling and contracts for data-centric Web services. We demonstrate how this framework can be used to verify correctness properties for composition of services.
{"title":"Formal Specification and Verification of Data-Centric Service Composition","authors":"Iman Saleh, Gregory Kulczycki, M. Blake","doi":"10.1109/ICWS.2010.80","DOIUrl":"https://doi.org/10.1109/ICWS.2010.80","url":null,"abstract":"Service-oriented architecture (SOA) promotes a paradigm where ad-hoc applications are built by dynamically linking service-based software capabilities. Service providers follow specification standards to advertise their services’ capabilities and to enable loosely coupled integration between their services and other businesses over the Web. A major challenge in this domain is interpreting the data that must be marshaled between consumer and producer systems. We propose a framework to support formal modeling and contracts for data-centric Web services. We demonstrate how this framework can be used to verify correctness properties for composition of services.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124594845","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}
Kristof Geebelen, Eryk Kulikowski, E. Truyen, W. Joosen
Most work on adaptive workflows offers insufficient flexibility to enforce complex policies regarding dynamic, evolvable and robust workflows. In addition, many proposed approaches require customized workflow engines. This paper presents a portable framework for realistic enforcement of dynamic adaptation policies in business processes. The framework is based on the Model-View-Controller (MVC) pattern, commonly used for adding dynamism to web pages. To enhance reusability, our approach supports separation of adaptation logic from the functional workflow and modularization of workflow tasks in reusable aspects. The main idea is to design a workflow process as a template, where tasks can be specified on an abstract level. Concrete implementations of the tasks, modeled as aspects, are then selected from a library according to a policy-based adaptation logic. This logic is implemented using a general purpose language that offers an extensible and flexible solution to enforce any type of policy. We evaluate by means of a case study on workflow confidentiality to what extent an approach using standards-based technologies allows application-specific adaptation of running workflow instances.
{"title":"A MVC Framework for Policy-Based Adaptation of Workflow Processes: A Case Study on Confidentiality","authors":"Kristof Geebelen, Eryk Kulikowski, E. Truyen, W. Joosen","doi":"10.1109/ICWS.2010.81","DOIUrl":"https://doi.org/10.1109/ICWS.2010.81","url":null,"abstract":"Most work on adaptive workflows offers insufficient flexibility to enforce complex policies regarding dynamic, evolvable and robust workflows. In addition, many proposed approaches require customized workflow engines. This paper presents a portable framework for realistic enforcement of dynamic adaptation policies in business processes. The framework is based on the Model-View-Controller (MVC) pattern, commonly used for adding dynamism to web pages. To enhance reusability, our approach supports separation of adaptation logic from the functional workflow and modularization of workflow tasks in reusable aspects. The main idea is to design a workflow process as a template, where tasks can be specified on an abstract level. Concrete implementations of the tasks, modeled as aspects, are then selected from a library according to a policy-based adaptation logic. This logic is implemented using a general purpose language that offers an extensible and flexible solution to enforce any type of policy. We evaluate by means of a case study on workflow confidentiality to what extent an approach using standards-based technologies allows application-specific adaptation of running workflow instances.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121007614","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}
Wolfgang Halb, Herwig Zeiner, Bernhard Jandl, Harald Lernbeiß, Christian Derler
Although WS-BPEL is a widely used language for modeling executable business processes in service oriented architectures it is almost impossible to dynamically bind services at runtime taking complex constraints and optimisation goals into account. The approach presented in this paper uses semantically annotated workflow templates and extensions to introduce adaptability which enables agile service oriented architectures. The technological solution will be validated in a critical infrastructure environment where resilience and security play an important role.
{"title":"Agile Service Oriented Architecture with Adaptive Processes Using Semantically Annotated Workflow Templates","authors":"Wolfgang Halb, Herwig Zeiner, Bernhard Jandl, Harald Lernbeiß, Christian Derler","doi":"10.1109/ICWS.2010.42","DOIUrl":"https://doi.org/10.1109/ICWS.2010.42","url":null,"abstract":"Although WS-BPEL is a widely used language for modeling executable business processes in service oriented architectures it is almost impossible to dynamically bind services at runtime taking complex constraints and optimisation goals into account. The approach presented in this paper uses semantically annotated workflow templates and extensions to introduce adaptability which enables agile service oriented architectures. The technological solution will be validated in a critical infrastructure environment where resilience and security play an important role.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128978866","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 increasing use of the Web for everyday tasks is making Web services an essential part of the Internet customer's daily life. Users query the Internet for a required Web service and get back a set of Web services that may or may not satisfy their request. To get the most relevant Web services that fulfill the user's request, the user has to construct the request using the keywords that best describe the user's objective and match correctly with the Web Service name or location. Clustering Web services based on function similarities would greatly boost the ability of Web services search engines to retrieve the most relevant Web services. This paper proposes a novel technique to mine Web Service Description Language (WSDL) documents and cluster them into functionally similar Web service groups. The application of our approach to real Web services description files has shown good performance for clustering Web services based on function similarity, as a predecessor step to retrieving the relevant Web services for a user request by search engines.
{"title":"Clustering WSDL Documents to Bootstrap the Discovery of Web Services","authors":"Khalid Elgazzar, A. Hassan, Patrick Martin","doi":"10.1109/ICWS.2010.31","DOIUrl":"https://doi.org/10.1109/ICWS.2010.31","url":null,"abstract":"The increasing use of the Web for everyday tasks is making Web services an essential part of the Internet customer's daily life. Users query the Internet for a required Web service and get back a set of Web services that may or may not satisfy their request. To get the most relevant Web services that fulfill the user's request, the user has to construct the request using the keywords that best describe the user's objective and match correctly with the Web Service name or location. Clustering Web services based on function similarities would greatly boost the ability of Web services search engines to retrieve the most relevant Web services. This paper proposes a novel technique to mine Web Service Description Language (WSDL) documents and cluster them into functionally similar Web service groups. The application of our approach to real Web services description files has shown good performance for clustering Web services based on function similarity, as a predecessor step to retrieving the relevant Web services for a user request by search engines.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130418420","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}
Use cases are a key technique to elicit software requirements from the point of view of the user of a system. Their prevalence is noticeable ever since the onset of agile programming techniques. Within SOA projects however, business process models are used for capability analysis and gap detection. Business process models present a global view of the system and hence are more suited for gap detection. Therefore, in practice both these forms of requirements continue to be useful and coexist. Often in big software projects and in distributed development environment such coexisting requirement specifications can grow out of synch. We present here a technique to semi-automatically transform use cases into business processes and to create mapping between them. By preserving the mapping between these forms one can enforce consistency between the two forms of requirements.
{"title":"Use Cases to Process Specifications in Business Process Modeling Notation","authors":"A. Sinha, A. Paradkar","doi":"10.1109/ICWS.2010.105","DOIUrl":"https://doi.org/10.1109/ICWS.2010.105","url":null,"abstract":"Use cases are a key technique to elicit software requirements from the point of view of the user of a system. Their prevalence is noticeable ever since the onset of agile programming techniques. Within SOA projects however, business process models are used for capability analysis and gap detection. Business process models present a global view of the system and hence are more suited for gap detection. Therefore, in practice both these forms of requirements continue to be useful and coexist. Often in big software projects and in distributed development environment such coexisting requirement specifications can grow out of synch. We present here a technique to semi-automatically transform use cases into business processes and to create mapping between them. By preserving the mapping between these forms one can enforce consistency between the two forms of requirements.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131043747","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-Policy is a standard to express requirements and capabilities in Web service systems. Policies are based on domain-specific assertions. In this paper we present a lightweight approach to semantic annotations of policy assertions. The approach allows matching of requirements and capabilities based not only on the syntactical representation of their corresponding assertions but also on their semantic meaning. Besides vocabulary mismatches our approach can also handle granularity mismatches, e.g. if two capabilities in combination satisfy a single requirement. We present a validation of our approach consisting of a performance evaluation and the realization of a use case, both based on our implementation of the semantic policy matching algorithm. We furthermore show the advantages of our approach compared to existing related work.
{"title":"Semantic Annotations for WS-Policy","authors":"Sebastian Speiser","doi":"10.1109/ICWS.2010.15","DOIUrl":"https://doi.org/10.1109/ICWS.2010.15","url":null,"abstract":"WS-Policy is a standard to express requirements and capabilities in Web service systems. Policies are based on domain-specific assertions. In this paper we present a lightweight approach to semantic annotations of policy assertions. The approach allows matching of requirements and capabilities based not only on the syntactical representation of their corresponding assertions but also on their semantic meaning. Besides vocabulary mismatches our approach can also handle granularity mismatches, e.g. if two capabilities in combination satisfy a single requirement. We present a validation of our approach consisting of a performance evaluation and the realization of a use case, both based on our implementation of the semantic policy matching algorithm. We furthermore show the advantages of our approach compared to existing related work.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131538034","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}
Recently, mashups are gaining tremendous popularity as an important Web 2.0 application. Mashups provide end-users with an opportunity to create personalized Web services which aggregate and manipulate data from multiple diverse sources distributed across the Web. However, this increase in personalization also results in new scalability and performance challenges. Surprisingly, there are very few studies on the performance aspect of mashups. In this paper, we propose two novel techniques to enhance the scalability and performance of mashup platforms. The first is an efficient mashup merging scheme that avoids duplicate computations and unnecessary data retrievals by detecting common operator sequences in different mashups and executing them together. Second, we propose a canonical form-based mashup reordering scheme that not only transforms individual mashups to their most efficient forms but also increases the effectiveness of mashup merging. This paper also reports a number of experiments studying the benefits and costs of the proposed techniques.
{"title":"Enhancing Scalability and Performance of Mashups Through Merging and Operator Reordering","authors":"O. Hassan, Lakshmish Ramaswamy, J. Miller","doi":"10.1109/ICWS.2010.92","DOIUrl":"https://doi.org/10.1109/ICWS.2010.92","url":null,"abstract":"Recently, mashups are gaining tremendous popularity as an important Web 2.0 application. Mashups provide end-users with an opportunity to create personalized Web services which aggregate and manipulate data from multiple diverse sources distributed across the Web. However, this increase in personalization also results in new scalability and performance challenges. Surprisingly, there are very few studies on the performance aspect of mashups. In this paper, we propose two novel techniques to enhance the scalability and performance of mashup platforms. The first is an efficient mashup merging scheme that avoids duplicate computations and unnecessary data retrievals by detecting common operator sequences in different mashups and executing them together. Second, we propose a canonical form-based mashup reordering scheme that not only transforms individual mashups to their most efficient forms but also increases the effectiveness of mashup merging. This paper also reports a number of experiments studying the benefits and costs of the proposed techniques.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132910771","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
扫码关注我们
求助内容：
应助结果提醒方式：