One of the major current trends in service-oriented systems is the emphasis given to the need of introducing runtime adaptation features, so that the system can meet its QoS requirements in a volatile operating environment. In this paper we present the design and implementation of a service broker that supports the QoS-driven runtime adaptation of SOA applications offered as composite services to users. We describe the functionalities provided by the broker components and present their design and implementation according to two different versions we have developed and that are both based on open source products. The components of the first version have been developed in Java as Web services, while the second version takes advantage of OpenESB. Since the broker needs to sustain a traffic of requests generated by several concurrent users, we also present the replicated architectures of the two broker versions. We discuss the design tradeoffs and the lesson we have learned in developing the broker.
{"title":"Designing a Broker for QoS-driven Runtime Adaptation of SOA Applications","authors":"V. Cardellini, Stefano Iannucci","doi":"10.1109/ICWS.2010.77","DOIUrl":"https://doi.org/10.1109/ICWS.2010.77","url":null,"abstract":"One of the major current trends in service-oriented systems is the emphasis given to the need of introducing runtime adaptation features, so that the system can meet its QoS requirements in a volatile operating environment. In this paper we present the design and implementation of a service broker that supports the QoS-driven runtime adaptation of SOA applications offered as composite services to users. We describe the functionalities provided by the broker components and present their design and implementation according to two different versions we have developed and that are both based on open source products. The components of the first version have been developed in Java as Web services, while the second version takes advantage of OpenESB. Since the broker needs to sustain a traffic of requests generated by several concurrent users, we also present the replicated architectures of the two broker versions. We discuss the design tradeoffs and the lesson we have learned in developing the broker.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"19 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":"134044640","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}
Computing has reached the time of distributed applications everywhere. Service-oriented architectures are more and more used to organize such complex and highly dynamic applications into business processes calling services discovered in registries at load-time. In this context, Quality of Service (QoS) and agility in business processes become key issues. Instead of binding business processes to services at load-time, this paper proposes to monitor sets of candidate services for their current QoS and to choose among them at call-time. This new form of late-binding paves the way to more agile and robust applications called adaptive business processes. Besides the conceptual background and implementation of this late-binding in an industrial-strength web service platform, this paper presents the LCP-net formalism introduced to provide programmers with a mean to express qualitatively their preferences among the different QoS properties of services, hence tackling the multi-criteria decision making arising from the run-time choice among candidate services given several unrelated QoS properties.
{"title":"QoS-based Late-Binding of Service Invocations in Adaptive Business Processes","authors":"Pierre Châtel, J. Malenfant, I. Truck","doi":"10.1109/ICWS.2010.74","DOIUrl":"https://doi.org/10.1109/ICWS.2010.74","url":null,"abstract":"Computing has reached the time of distributed applications everywhere. Service-oriented architectures are more and more used to organize such complex and highly dynamic applications into business processes calling services discovered in registries at load-time. In this context, Quality of Service (QoS) and agility in business processes become key issues. Instead of binding business processes to services at load-time, this paper proposes to monitor sets of candidate services for their current QoS and to choose among them at call-time. This new form of late-binding paves the way to more agile and robust applications called adaptive business processes. Besides the conceptual background and implementation of this late-binding in an industrial-strength web service platform, this paper presents the LCP-net formalism introduced to provide programmers with a mean to express qualitatively their preferences among the different QoS properties of services, hence tackling the multi-criteria decision making arising from the run-time choice among candidate services given several unrelated QoS properties.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"61 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":"116346135","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 are now widely used in web-based applications. To protect the information in web services, many security specifications have been proposed. Attribute-based Encryption (ABE) provides us a brand new cryptographic primitive for access control. This paper sets out to examine an unexplored area to date – how attribute-based encryption might be used to provide privacy and security for web services. We try to implement ABE in web services. The implementation and performance evaluation demonstrate that ABE is efficient and feasible in web services.
{"title":"Implementing Attribute-Based Encryption in Web Services","authors":"Song Luo, Jian-bin Hu, Zhong Chen","doi":"10.1109/ICWS.2010.82","DOIUrl":"https://doi.org/10.1109/ICWS.2010.82","url":null,"abstract":"Web services are now widely used in web-based applications. To protect the information in web services, many security specifications have been proposed. Attribute-based Encryption (ABE) provides us a brand new cryptographic primitive for access control. This paper sets out to examine an unexplored area to date – how attribute-based encryption might be used to provide privacy and security for web services. We try to implement ABE in web services. The implementation and performance evaluation demonstrate that ABE is efficient and feasible in web services.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"60 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":"132153016","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}
Dynamic service compositions pose new verification and validation challenges such as uncertainty in service membership. Moreover, applying an entire test suite to loosely coupled services one after another in the same composition can be too rigid and restrictive. In this paper, we investigate the impact of service selection on service-centric testing techniques. Specifically, we propose to incorporate service selection in executing a test suite and develop a suite of metrics and test case prioritization techniques for the testing of location-aware services. A case study shows that a test case prioritization technique that incorporates service selection can outperform their traditional counterpart — the impact of service selection is noticeable on software engineering techniques in general and on test case prioritization techniques in particular. Further-more, we find that points-of-interest-aware techniques can be significantly more effective than input-guided techniques in terms of the number of invocations required to expose the first failure of a service composition.
{"title":"Taking Advantage of Service Selection: A Study on the Testing of Location-Based Web Services Through Test Case Prioritization","authors":"K. Zhai, Bo Jiang, W. Chan, T. Tse","doi":"10.1109/ICWS.2010.98","DOIUrl":"https://doi.org/10.1109/ICWS.2010.98","url":null,"abstract":"Dynamic service compositions pose new verification and validation challenges such as uncertainty in service membership. Moreover, applying an entire test suite to loosely coupled services one after another in the same composition can be too rigid and restrictive. In this paper, we investigate the impact of service selection on service-centric testing techniques. Specifically, we propose to incorporate service selection in executing a test suite and develop a suite of metrics and test case prioritization techniques for the testing of location-aware services. A case study shows that a test case prioritization technique that incorporates service selection can outperform their traditional counterpart — the impact of service selection is noticeable on software engineering techniques in general and on test case prioritization techniques in particular. Further-more, we find that points-of-interest-aware techniques can be significantly more effective than input-guided techniques in terms of the number of invocations required to expose the first failure of a service composition.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"23 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":"133766770","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}
Nowadays, executions of composite Web services are typically conducted by heavyweight centralized engines. A centralized is a potential processing and communication bottleneck as well as a central point of failure, and its cost of deployment is usually too high for a large number of small businesses or end-users. In addition, it presents some weaknesses dealing with privacy issues. These drawbacks, and requirements such as loose coupling, are pushing service infrastructures toward more decentralized and dynamic interaction schemes. In this paper, we propose a decentralized alternative system for the execution of composite Web services based on the chemical analogy. The chemical paradigm provides a high-level execution model that allows executing composite services in a fully decentralized manner. Our architecture is composed by nodes communicating through a shared space containing both control and data flows, allowing to distribute the composition among nodes without the need for any centralized coordination.
{"title":"Decentralized Approach for Execution of Composite Web Services Using the Chemical Paradigm","authors":"H. Fernandez, T. Priol, Cédric Tedeschi","doi":"10.1109/ICWS.2010.46","DOIUrl":"https://doi.org/10.1109/ICWS.2010.46","url":null,"abstract":"Nowadays, executions of composite Web services are typically conducted by heavyweight centralized engines. A centralized is a potential processing and communication bottleneck as well as a central point of failure, and its cost of deployment is usually too high for a large number of small businesses or end-users. In addition, it presents some weaknesses dealing with privacy issues. These drawbacks, and requirements such as loose coupling, are pushing service infrastructures toward more decentralized and dynamic interaction schemes. In this paper, we propose a decentralized alternative system for the execution of composite Web services based on the chemical analogy. The chemical paradigm provides a high-level execution model that allows executing composite services in a fully decentralized manner. Our architecture is composed by nodes communicating through a shared space containing both control and data flows, allowing to distribute the composition among nodes without the need for any centralized coordination.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"44 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":"132862209","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}
Mohamad El Falou, M. Bouzid, A. Mouaddib, Thierry Vidal
The ability to automatically answer a request that requires the composition of a set of web services has received much interest in the last decade, as it supports B2B applications. Planning techniques are used widely in the literature to describe the web services composition problem but they don’t scale up well. This weakness is due to the search space explosion caused by the large ranges of data exchanged among services. In addition, it is more interesting to use a decentralised planner because the nature of the problem is distributed. In this paper, we consider a set of web service agents where each agent has a set of services organised in a graph. To respond to a request, agents propose their best local partial plans which are partial paths in the graph. They then coordinate their partial plans to provide the global plan for the submitted request using an algorithm based on a distributed heuristic function. This function ensures the optimality and the completeness of the algorithm. Indeed, it is based not only on the agent capabilities to respond to a request, but also taking into account the plans proposed by other agents. The complexity of the algorithm is polynomial. The experiments show the ability of our approach to find the optimal solutions for automated web services composition taking into account the dependencies betwen the agents.
{"title":"A Distributed Planning Approach for Web Services Composition","authors":"Mohamad El Falou, M. Bouzid, A. Mouaddib, Thierry Vidal","doi":"10.1109/ICWS.2010.13","DOIUrl":"https://doi.org/10.1109/ICWS.2010.13","url":null,"abstract":"The ability to automatically answer a request that requires the composition of a set of web services has received much interest in the last decade, as it supports B2B applications. Planning techniques are used widely in the literature to describe the web services composition problem but they don’t scale up well. This weakness is due to the search space explosion caused by the large ranges of data exchanged among services. In addition, it is more interesting to use a decentralised planner because the nature of the problem is distributed. In this paper, we consider a set of web service agents where each agent has a set of services organised in a graph. To respond to a request, agents propose their best local partial plans which are partial paths in the graph. They then coordinate their partial plans to provide the global plan for the submitted request using an algorithm based on a distributed heuristic function. This function ensures the optimality and the completeness of the algorithm. Indeed, it is based not only on the agent capabilities to respond to a request, but also taking into account the plans proposed by other agents. The complexity of the algorithm is polynomial. The experiments show the ability of our approach to find the optimal solutions for automated web services composition taking into account the dependencies betwen the agents.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"73 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":"132967140","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 behavioral analysis for Web services provides a priori detection of errors to ensure successful interactions in services invocation and composition, and the behavioral substitution of Web services is one of the most important issues in such analysis. In this paper, we propose to formalize the behavior of a Web service by π-calculus. Based on the formalization, we introduce two notions of behavioral substitution of Web services namely strong and weak simulation. Furthermore, we propose a derivative approach to analyzing the behavioral substitution of services according to the given notions, which is implemented based on an existing tool of Pi-calculus. The proposed approach takes advantage of formalization and theory of Pi- calculus, so that the formalized services can be naturally analyzed and the behavioral substitution of them can be easily determined.
{"title":"Analyzing Behavioral Substitution of Web Services Based on Pi-calculus","authors":"Li Kuang, Yingjie Xia, Shuiguang Deng, Jian Wu","doi":"10.1109/ICWS.2010.54","DOIUrl":"https://doi.org/10.1109/ICWS.2010.54","url":null,"abstract":"The behavioral analysis for Web services provides a priori detection of errors to ensure successful interactions in services invocation and composition, and the behavioral substitution of Web services is one of the most important issues in such analysis. In this paper, we propose to formalize the behavior of a Web service by π-calculus. Based on the formalization, we introduce two notions of behavioral substitution of Web services namely strong and weak simulation. Furthermore, we propose a derivative approach to analyzing the behavioral substitution of services according to the given notions, which is implemented based on an existing tool of Pi-calculus. The proposed approach takes advantage of formalization and theory of Pi- calculus, so that the formalized services can be naturally analyzed and the behavioral substitution of them can be easily determined.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"82 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":"116067756","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}
Cloud computing environment requires a more open and loosely-coupled service and resource management model. Web Services for Management specification (WS-Management), as an initiative of DMTF organization, can help to manage IT resources cross multiple domains in cloud environment. In this paper, we propose a novel WS-Management-based Cloud-oriented resource management model. We describe the main components of this model. And then, we discuss our management model verification experimental scheme focusing on DASH resource. Finally, we present conclusion and future work.
云计算环境需要更加开放、松耦合的服务和资源管理模型。Web服务管理规范(Web Services for Management, WS-Management)作为DMTF组织的一项倡议，可以帮助管理云环境中跨多个域的IT资源。本文提出了一种新的基于ws - management的面向云的资源管理模型。我们描述了这个模型的主要组成部分。然后，讨论了以DASH资源为核心的管理模型验证实验方案。最后，提出了结论和今后的工作。
{"title":"A Novel Cloud-Oriented WS-Management-Based Resource Management Model","authors":"ZhiHui Lv, Jie Wu, Weiming Fu","doi":"10.1109/ICWS.2010.96","DOIUrl":"https://doi.org/10.1109/ICWS.2010.96","url":null,"abstract":"Cloud computing environment requires a more open and loosely-coupled service and resource management model. Web Services for Management specification (WS-Management), as an initiative of DMTF organization, can help to manage IT resources cross multiple domains in cloud environment. In this paper, we propose a novel WS-Management-based Cloud-oriented resource management model. We describe the main components of this model. And then, we discuss our management model verification experimental scheme focusing on DASH resource. Finally, we present conclusion and future work.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"21 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":"128009420","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}
Tien-Dung Cao, Trung-Tien Phan-Quang, Patrick Félix, R. Castanet
This paper presents a methodology to perform passive testing of behavioural conformance for the web services based on the security rule. The proposed methodology can be used either to check a trace (offline checking) or to runtime verification (online checking) with timing constraints, including future and past time. In order to perform this: firstly, we use the Nomad language to define the security rules. Secondly, we propose an algorithm that can check simultaneously multi instances. Afterwards, with each security rule, we propose a graphical statistics, with some fixed properties, that helps the tester to easy assess about the service. In addition to the theoretical framework we have developed a software tool, called RV4WS (Runtime Verification engine for Web Service), that helps in the automation of our passive testing approach. In particular the algorithm presented in this paper is fully implemented in the tool. We also present a mechanism to collect the observable trace in this paper.
{"title":"Automated Runtime Verification for Web Services","authors":"Tien-Dung Cao, Trung-Tien Phan-Quang, Patrick Félix, R. Castanet","doi":"10.1109/ICWS.2010.19","DOIUrl":"https://doi.org/10.1109/ICWS.2010.19","url":null,"abstract":"This paper presents a methodology to perform passive testing of behavioural conformance for the web services based on the security rule. The proposed methodology can be used either to check a trace (offline checking) or to runtime verification (online checking) with timing constraints, including future and past time. In order to perform this: firstly, we use the Nomad language to define the security rules. Secondly, we propose an algorithm that can check simultaneously multi instances. Afterwards, with each security rule, we propose a graphical statistics, with some fixed properties, that helps the tester to easy assess about the service. In addition to the theoretical framework we have developed a software tool, called RV4WS (Runtime Verification engine for Web Service), that helps in the automation of our passive testing approach. In particular the algorithm presented in this paper is fully implemented in the tool. We also present a mechanism to collect the observable trace in this paper.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"48 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120995879","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}
Large-scale scientific data management and analysis usually relies on many distributed scientists with diverse expertise. In recent years, such a collaborative effort is often composed and automated into a dataflow-oriented process, a so-called scientific workflow. However, existing scientific workflow tools are single user-oriented and do not support collaborative scientific workflow composition, execution, and management among multiple distributed scientists. In this paper, we report our study of collaboration protocols towards building a tool supporting collaborative scientific workflow composition. Based on a scientific collaboration ontology, we propose a collaboration model supported by a set of collaboration primitives and patterns. The collaboration protocols are then applied to support effective concurrency control in the process of collaborative workflow composition.
{"title":"Confucius: A Scientific Collaboration System Using Collaborative Scientific Workflows","authors":"Jia Zhang, D. Kuc, Shiyong Lu","doi":"10.1109/ICWS.2010.103","DOIUrl":"https://doi.org/10.1109/ICWS.2010.103","url":null,"abstract":"Large-scale scientific data management and analysis usually relies on many distributed scientists with diverse expertise. In recent years, such a collaborative effort is often composed and automated into a dataflow-oriented process, a so-called scientific workflow. However, existing scientific workflow tools are single user-oriented and do not support collaborative scientific workflow composition, execution, and management among multiple distributed scientists. In this paper, we report our study of collaboration protocols towards building a tool supporting collaborative scientific workflow composition. Based on a scientific collaboration ontology, we propose a collaboration model supported by a set of collaboration primitives and patterns. The collaboration protocols are then applied to support effective concurrency control in the process of collaborative workflow composition.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"133 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":"115548678","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
扫码关注我们
求助内容：
应助结果提醒方式：