Zhangbing Zhou, Sami Bhiri, Walid Gaaloul, Lei Shu, Laurentiu A. Vasiliu, M. Hauswirth
Web service interactions lie in the core of SOA. Due to the autonomy, heterogeneity and continuous evolution of Web services, mediators are usually needed to support service interactions to overcome possible mismatches that may exist among business processes. In this paper, we introduce a space-based architecture for process mediator which considers both control-flow and data-flow, present possible mismatch patterns, and suggest how they can be automatically mediated. Our work can be used to perform runtime mediation and thus to facilitate service interactions.
{"title":"Developing Process Mediator for Web Service Interactions","authors":"Zhangbing Zhou, Sami Bhiri, Walid Gaaloul, Lei Shu, Laurentiu A. Vasiliu, M. Hauswirth","doi":"10.1109/ICWS.2008.126","DOIUrl":"https://doi.org/10.1109/ICWS.2008.126","url":null,"abstract":"Web service interactions lie in the core of SOA. Due to the autonomy, heterogeneity and continuous evolution of Web services, mediators are usually needed to support service interactions to overcome possible mismatches that may exist among business processes. In this paper, we introduce a space-based architecture for process mediator which considers both control-flow and data-flow, present possible mismatch patterns, and suggest how they can be automatically mediated. Our work can be used to perform runtime mediation and thus to facilitate service interactions.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"3 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":"123169404","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}
This paper explores the use of rationale for understanding the context of reputation information so as to facilitate the exchange and transfer of reputation information across distributed heterogeneous reputation systems for selection of the best service for a particular user's requirements.
{"title":"Explaining Reputation for Informed Web Services Selection","authors":"W. Sherchan, S. Krishnaswamy, S. Loke","doi":"10.1109/ICWS.2008.94","DOIUrl":"https://doi.org/10.1109/ICWS.2008.94","url":null,"abstract":"This paper explores the use of rationale for understanding the context of reputation information so as to facilitate the exchange and transfer of reputation information across distributed heterogeneous reputation systems for selection of the best service for a particular user's requirements.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"17 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":"126651030","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 common architecture in today's development of distributed systems is the service-oriented architecture (SOA) implemented using Web services. Until recently, it was difficult to build a SOA based grid/distributed system using Web services due to the inability to learn the state of services. The state of a Web service could only be accessed through specialized clients and/or services. Should the specialized client or service fail, the state can't be accessed. This paper shows the innovative resources via Web instances (RVWI) framework. RVWI grants to web services the ability to show the state of dynamic resources in their WSDL. This was achieved via software components called connectors which watch for any changes in a resource and updates the web service. The significance of this report is the support for resources which can change state between requests and the innovation is the improvement of state updates between the service and discovery services.
{"title":"Publishing Dynamic State Changes of Resources through State Aware WSDL","authors":"Michael Brock, A. Goscinski","doi":"10.1109/ICWS.2008.73","DOIUrl":"https://doi.org/10.1109/ICWS.2008.73","url":null,"abstract":"A common architecture in today's development of distributed systems is the service-oriented architecture (SOA) implemented using Web services. Until recently, it was difficult to build a SOA based grid/distributed system using Web services due to the inability to learn the state of services. The state of a Web service could only be accessed through specialized clients and/or services. Should the specialized client or service fail, the state can't be accessed. This paper shows the innovative resources via Web instances (RVWI) framework. RVWI grants to web services the ability to show the state of dynamic resources in their WSDL. This was achieved via software components called connectors which watch for any changes in a resource and updates the web service. The significance of this report is the support for resources which can change state between requests and the innovation is the improvement of state updates between the service and discovery services.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"41 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":"115819594","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 study the access control integration problem for web services. Organizations frequently use many services, each with its own access control policies, which must interoperate while maintaining secure access to information. The integration problem is to take the set of such services and to find a globally consistent access control policy that ensures that the system composed from the services does not have any authorization failures or information disclosures. We give a sound and complete algorithm for access control integration by reducing the problem to Boolean constraint solving. We have implemented ROLEMATCHER, a tool to infer global role-based access control schemas for a set of services, and show on examples that it can quickly infer global roles for composed systems, or determine the absence of a globally consistent role schema.
{"title":"A Theory of Role Composition","authors":"Jeffrey M. Fischer, R. Majumdar","doi":"10.1109/ICWS.2008.40","DOIUrl":"https://doi.org/10.1109/ICWS.2008.40","url":null,"abstract":"We study the access control integration problem for web services. Organizations frequently use many services, each with its own access control policies, which must interoperate while maintaining secure access to information. The integration problem is to take the set of such services and to find a globally consistent access control policy that ensures that the system composed from the services does not have any authorization failures or information disclosures. We give a sound and complete algorithm for access control integration by reducing the problem to Boolean constraint solving. We have implemented ROLEMATCHER, a tool to infer global role-based access control schemas for a set of services, and show on examples that it can quickly infer global roles for composed systems, or determine the absence of a globally consistent role schema.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"19 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":"124997247","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. E. Haddad, Maude Manouvrier, Guillermo Ramirez, M. Rukoz
Web services composition has been gaining interest over the last years as it leverages the capabilities to offer complex operations resulting from the aggregation of Web services offered by different organizations. As composite Web services are often long-running, loosely coupled and cross-organizational applications, advanced transactional support is required to ensure reliable execution. In addition, in the presence of multiple Web services with equivalent functionality, users will discriminate the alternatives based on their quality of service (QoS). This paper address the issue of selecting and composing Web services not only according to their functional requirements but also to their transactional properties and QoS characteristics defined using a quality model. In this model, Web services are selected in a way that satisfies user preferences. These preferences are expressed as weights over QoS criterion and as risk level defining semantically the transactional requirements.
{"title":"QoS-Driven Selection of Web Services for Transactional Composition","authors":"J. E. Haddad, Maude Manouvrier, Guillermo Ramirez, M. Rukoz","doi":"10.1109/ICWS.2008.116","DOIUrl":"https://doi.org/10.1109/ICWS.2008.116","url":null,"abstract":"Web services composition has been gaining interest over the last years as it leverages the capabilities to offer complex operations resulting from the aggregation of Web services offered by different organizations. As composite Web services are often long-running, loosely coupled and cross-organizational applications, advanced transactional support is required to ensure reliable execution. In addition, in the presence of multiple Web services with equivalent functionality, users will discriminate the alternatives based on their quality of service (QoS). This paper address the issue of selecting and composing Web services not only according to their functional requirements but also to their transactional properties and QoS characteristics defined using a quality model. In this model, Web services are selected in a way that satisfies user preferences. These preferences are expressed as weights over QoS criterion and as risk level defining semantically the transactional requirements.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"159 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":"134218082","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 a dynamic mechanism, thread count adaptation, that adjusts the thread counts that are allocated to services for adapting to CPU requirement variations in SMP environments. Our goal is to increase the maximum throughput available on a system that has multiple dynamic content services while meeting different service time criteria for these services in dynamic workloads. Our challenge is to significantly improve response times for dynamic content on a busy well-tuned thread-pool-based system without prioritizing any specific services. Our experiments demonstrate that a prototype using our approach on J2EE middleware quickly (around every 20 ms) adjusted the thread counts for the services and that it improved the average 90th-percentile response times by up to 27% (and 22% on average) for the SPECjAppServer2004 benchmark.
{"title":"Dynamic Thread Count Adaptation for Multiple Services in SMP Environments","authors":"T. Ogasawara","doi":"10.1109/ICWS.2008.47","DOIUrl":"https://doi.org/10.1109/ICWS.2008.47","url":null,"abstract":"We propose a dynamic mechanism, thread count adaptation, that adjusts the thread counts that are allocated to services for adapting to CPU requirement variations in SMP environments. Our goal is to increase the maximum throughput available on a system that has multiple dynamic content services while meeting different service time criteria for these services in dynamic workloads. Our challenge is to significantly improve response times for dynamic content on a busy well-tuned thread-pool-based system without prioritizing any specific services. Our experiments demonstrate that a prototype using our approach on J2EE middleware quickly (around every 20 ms) adjusted the thread counts for the services and that it improved the average 90th-percentile response times by up to 27% (and 22% on average) for the SPECjAppServer2004 benchmark.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"23 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":"134279548","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 meta-model for nonfunctional property descriptions targeted to support the selection of Web Services. The approach is based on the explicit distinction between NFP offered by providers and requested by users, on the concept of policy that aggregates NFP descriptions into single entities with an applicability condition, and finally on a set of constraint operators, which is particularly relevant for NFP requests. The semantic meta-model embracing the above perspective is defined by a BNF syntax whose semantics is formalized by an ontology. The ontology has been formalized in OWL-DL and WSML to provide for logical syntax. The logic upon which the meta-model supports NFP-based selection is discussed in the paper.
{"title":"A Meta-model for Non-functional Property Descriptions of Web Services","authors":"F. D. Paoli, M. Palmonari, M. Comerio, A. Maurino","doi":"10.1109/ICWS.2008.97","DOIUrl":"https://doi.org/10.1109/ICWS.2008.97","url":null,"abstract":"In this paper we propose a meta-model for nonfunctional property descriptions targeted to support the selection of Web Services. The approach is based on the explicit distinction between NFP offered by providers and requested by users, on the concept of policy that aggregates NFP descriptions into single entities with an applicability condition, and finally on a set of constraint operators, which is particularly relevant for NFP requests. The semantic meta-model embracing the above perspective is defined by a BNF syntax whose semantics is formalized by an ontology. The ontology has been formalized in OWL-DL and WSML to provide for logical syntax. The logic upon which the meta-model supports NFP-based selection is discussed in the paper.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"27 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":"115785158","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}
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}
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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：