Apostolos Papageorgiou, Marius Schatke, Stefan Schulte, R. Steinmetz
Contrary to simple Web content, standard Web services do not offer their clients the possibility to use cached information without the risk that it may be out-of-date. This feature has not been worth its costs in realistic Web service usage scenarios until now. However, its absence may pose restrictions and impede possible benefits in a future scenario, where mediators are both willing and able to effectively minimize the amount of wirelessly transmitted data in the Internet of Services. This paper describes how developments in the Internet of Services start to motivate the automatic enablement of safe (i.e., always up-to-date) client-side caching for Web services. It presents our solution for generically adding this feature to any Web service, and, based on new experiments, reveals the limits beyond which the approach can offer significant benefits.
与简单的Web内容相反，标准Web服务不向其客户机提供使用缓存信息的可能性，而不会冒信息过期的风险。到目前为止，在实际的Web服务使用场景中，这个特性的成本还不够高。然而，在未来的场景中，如果中介机构愿意并且能够有效地减少服务互联网中无线传输的数据量，那么它的缺失可能会造成限制并阻碍可能的好处。本文描述了Internet of Services的发展如何开始激励Web服务的安全(即始终是最新的)客户端缓存的自动启用。本文介绍了将此功能一般地添加到任何Web服务的解决方案，并基于新的实验揭示了该方法可以提供显著好处的限制。
{"title":"Enhancing the Caching of Web Service Responses on Wireless Clients","authors":"Apostolos Papageorgiou, Marius Schatke, Stefan Schulte, R. Steinmetz","doi":"10.1109/ICWS.2011.52","DOIUrl":"https://doi.org/10.1109/ICWS.2011.52","url":null,"abstract":"Contrary to simple Web content, standard Web services do not offer their clients the possibility to use cached information without the risk that it may be out-of-date. This feature has not been worth its costs in realistic Web service usage scenarios until now. However, its absence may pose restrictions and impede possible benefits in a future scenario, where mediators are both willing and able to effectively minimize the amount of wirelessly transmitted data in the Internet of Services. This paper describes how developments in the Internet of Services start to motivate the automatic enablement of safe (i.e., always up-to-date) client-side caching for Web services. It presents our solution for generically adding this feature to any Web service, and, based on new experiments, reveals the limits beyond which the approach can offer significant benefits.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"229 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123316515","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, the Web Services Interoperability Organization(WS-I) has announced to have completed its interoperability standards work. The latest deliverables include the so-called "Basic Security Profile" and the "Reliable SecureProfile". This gives rise to the question whether or not Web Services adopters can rely on interoperability of Web Services stacks, in particular in terms of security and reliability features. To answer this question, we thoroughly analyze two important Web Services stacks for interoperability of WS-Security and WS-Reliable Messaging features. Our analysis shows that security and reliability features are far from being implemented in an interoperable manner. Additionally, we reveal that some of those interoperability problems are not even covered by WS-I profiles and therefore conclude that WS-I's work has not yet resulted in Web Services interoperability.
{"title":"Has WS-I's Work Resulted in Ws-* Interoperability?","authors":"Andreas Schönberger, Johannes Schwalb, G. Wirtz","doi":"10.1109/ICWS.2011.42","DOIUrl":"https://doi.org/10.1109/ICWS.2011.42","url":null,"abstract":"Recently, the Web Services Interoperability Organization(WS-I) has announced to have completed its interoperability standards work. The latest deliverables include the so-called \"Basic Security Profile\" and the \"Reliable SecureProfile\". This gives rise to the question whether or not Web Services adopters can rely on interoperability of Web Services stacks, in particular in terms of security and reliability features. To answer this question, we thoroughly analyze two important Web Services stacks for interoperability of WS-Security and WS-Reliable Messaging features. Our analysis shows that security and reliability features are far from being implemented in an interoperable manner. Additionally, we reveal that some of those interoperability problems are not even covered by WS-I profiles and therefore conclude that WS-I's work has not yet resulted in Web Services interoperability.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"319 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116423459","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}
Jiuyun Xu, Kun Chen, Youxiang Duan, S. Reiff-Marganiec
Service-Oriented Computing is benefit of interoperation among services. Current service-oriented computing research is much more concerning the low level interoperation among services, such as service discovery, service composition etc. However, the high level research issue-the feature interaction problem is also challenging the interoperation of service-oriented computing. Traditional feature interaction methods are focused on the service design phrase with formal methods or software engineering analysis. Autonomy and distribution of service deploying style have made the needs of runtime detecting and resolving feature interaction in SOC research community. This paper investigates the detection of feature interactions in web services at runtime and proposes ESTRIPs, an extended STRIPS operation conflict-free of services in business process detection method, which reasons from OWL-S and SWRL combined with runtime SOAP messages. First, we give the model of the feature interaction problem in business process during its execution and then the ESTRIPS method given in detail. The implementation of a prototype is illustrated. Using a real world scenario shows the plausibility of our method of detecting feature interactions of business process.
{"title":"Modeling Business Process of Web Services with an Extended STRIPS Operations to Detection Feature Interaction Problems Runtime","authors":"Jiuyun Xu, Kun Chen, Youxiang Duan, S. Reiff-Marganiec","doi":"10.1109/ICWS.2011.73","DOIUrl":"https://doi.org/10.1109/ICWS.2011.73","url":null,"abstract":"Service-Oriented Computing is benefit of interoperation among services. Current service-oriented computing research is much more concerning the low level interoperation among services, such as service discovery, service composition etc. However, the high level research issue-the feature interaction problem is also challenging the interoperation of service-oriented computing. Traditional feature interaction methods are focused on the service design phrase with formal methods or software engineering analysis. Autonomy and distribution of service deploying style have made the needs of runtime detecting and resolving feature interaction in SOC research community. This paper investigates the detection of feature interactions in web services at runtime and proposes ESTRIPs, an extended STRIPS operation conflict-free of services in business process detection method, which reasons from OWL-S and SWRL combined with runtime SOAP messages. First, we give the model of the feature interaction problem in business process during its execution and then the ESTRIPS method given in detail. The implementation of a prototype is illustrated. Using a real world scenario shows the plausibility of our method of detecting feature interactions of business process.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124668423","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}
OWL-S is an ontology that provides the necessary vocabulary for describing various components of Web services so that automated discovery, composition and invocation of Web services can be made possible. The main component, the process model, describes the interaction protocol between a Web service and its clients. Such protocol includes not only the inputs, outputs, preconditions and results of the service, but also the control flow and data flow within the service. In this paper, we propose an approach to verify various properties of the process model of an OWL-S service. We define a set of mapping rules to translate a process model into a process algebra model and use a dedicated model checker to check the properties of the translated model. We handle not only the control flow of the process model, but also the binding-based data flow. Pre-conditions and results are also included in our approach. As a case study, we use a reasonably complex online book shopping Web service.
{"title":"Verifying OWL-S Service Process Models","authors":"Yuzhang Feng, M. Kirchberg","doi":"10.1109/ICWS.2011.101","DOIUrl":"https://doi.org/10.1109/ICWS.2011.101","url":null,"abstract":"OWL-S is an ontology that provides the necessary vocabulary for describing various components of Web services so that automated discovery, composition and invocation of Web services can be made possible. The main component, the process model, describes the interaction protocol between a Web service and its clients. Such protocol includes not only the inputs, outputs, preconditions and results of the service, but also the control flow and data flow within the service. In this paper, we propose an approach to verify various properties of the process model of an OWL-S service. We define a set of mapping rules to translate a process model into a process algebra model and use a dedicated model checker to check the properties of the translated model. We handle not only the control flow of the process model, but also the binding-based data flow. Pre-conditions and results are also included in our approach. As a case study, we use a reasonably complex online book shopping Web service.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130821115","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 composite web services one can only either hide the identities of the participants or provide end-to-end confidentiality via encryption. For a designer of inter-organizational business processes this implies that she either needs to reveal her suppliers or force her customers to reveal their information. In this paper we present a solution to the encrypted data modification problem and recon ciliate this apparent conflict. Using a generic sender-transformer-recipient example scenario, we illustrate the steps required for applying XML transformations to encrypted data, present the cryptographic building blocks, and give an outlook on advantages and weaknesses of the proposed encryption scheme. The transformer is then able to offer composite services without itself learning the content of the messages.
{"title":"Towards Privacy-Preserving XML Transformation","authors":"Meiko Jensen, F. Kerschbaum","doi":"10.1109/ICWS.2011.10","DOIUrl":"https://doi.org/10.1109/ICWS.2011.10","url":null,"abstract":"In composite web services one can only either hide the identities of the participants or provide end-to-end confidentiality via encryption. For a designer of inter-organizational business processes this implies that she either needs to reveal her suppliers or force her customers to reveal their information. In this paper we present a solution to the encrypted data modification problem and recon ciliate this apparent conflict. Using a generic sender-transformer-recipient example scenario, we illustrate the steps required for applying XML transformations to encrypted data, present the cryptographic building blocks, and give an outlook on advantages and weaknesses of the proposed encryption scheme. The transformer is then able to offer composite services without itself learning the content of the messages.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131190083","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}
Data Providing Services (DPSs) have the sole purpose of retrieving data from existing sources according to their input parameters while also providing a semantic description of the data they provide using a parametrized view over a domain ontology. A layered model of viewing DPSs is proposed consisting of the data acquisition, syntactic and semantic layers. It is shown that by defining all three layers, a DPS may be generated and managed exclusively by its declarative definition. This will increase the agility and efficiency with which DPSs may be deployed and managed. As a development model, a set of reusable messages are created, these messages are to be semantically annotated using a view over the domain ontology and are syntactically represented such that they may be exported to XML Schema. These messages are used within the DPS definition where their views over the domain ontology are parametrized and the data acquisition layer is defined to acquire data from the source.
{"title":"A Multi-layered Approach for the Declarative Development of Data Providing Services","authors":"Kevin P. Brown, Miriam A. M. Capretz","doi":"10.1109/ICWS.2011.104","DOIUrl":"https://doi.org/10.1109/ICWS.2011.104","url":null,"abstract":"Data Providing Services (DPSs) have the sole purpose of retrieving data from existing sources according to their input parameters while also providing a semantic description of the data they provide using a parametrized view over a domain ontology. A layered model of viewing DPSs is proposed consisting of the data acquisition, syntactic and semantic layers. It is shown that by defining all three layers, a DPS may be generated and managed exclusively by its declarative definition. This will increase the agility and efficiency with which DPSs may be deployed and managed. As a development model, a set of reusable messages are created, these messages are to be semantically annotated using a view over the domain ontology and are syntactically represented such that they may be exported to XML Schema. These messages are used within the DPS definition where their views over the domain ontology are parametrized and the data acquisition layer is defined to acquire data from the source.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132556286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the rapid development of services and software, how to share, integrate and discover them properly in open and dynamic network environment is one of the most important challenges for software technology. With monad techniques, we present a novel formal semantic model for service oriented computing in a black-box observation way. The monad-based model can help us formally describe and further study on software components and services through monads' properties such as abstraction, reflection and composability. This model relatively improves service reuse and discovery, and it significantly facilitates web service composition and enables integration of legacy applications.
{"title":"A Formal Model of Service Computing and Its Applications on Service Discovery","authors":"Yingzhou Zhang, Wei Fu, Lei Chen, Bihuan Xu","doi":"10.1109/ICWS.2011.84","DOIUrl":"https://doi.org/10.1109/ICWS.2011.84","url":null,"abstract":"With the rapid development of services and software, how to share, integrate and discover them properly in open and dynamic network environment is one of the most important challenges for software technology. With monad techniques, we present a novel formal semantic model for service oriented computing in a black-box observation way. The monad-based model can help us formally describe and further study on software components and services through monads' properties such as abstraction, reflection and composability. This model relatively improves service reuse and discovery, and it significantly facilitates web service composition and enables integration of legacy applications.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133431127","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 present the design and the architecture of the CloudDB AutoAdmin system which aims to fill the existing gaps between the provided cloud database services and the requirements of the consumer applications. In particular, it focuses on facilitating the job of the cloud database consumers in implementing database applications as distributed, scalable, and elastic services with a minimum effort on the side of the application developer and a limited footprint in the application code.
{"title":"CloudDB AutoAdmin: Towards a Truly Elastic Cloud-Based Data Store","authors":"S. Sakr, Liang Zhao, H. Wada, Anna Liu","doi":"10.1109/ICWS.2011.19","DOIUrl":"https://doi.org/10.1109/ICWS.2011.19","url":null,"abstract":"In this paper, we present the design and the architecture of the CloudDB AutoAdmin system which aims to fill the existing gaps between the provided cloud database services and the requirements of the consumer applications. In particular, it focuses on facilitating the job of the cloud database consumers in implementing database applications as distributed, scalable, and elastic services with a minimum effort on the side of the application developer and a limited footprint in the application code.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133068156","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}
Although web services have been espoused due to their many benefits, it is known that overhead delay, particularly the communication delay, associated with invocation and execution of web services is high. Consequently, much research has been expended on minimizing those delays. In many situations an application invokes a web service repeatedly such that some or most of the data returned by the web service does not change. For instance, many web services that return schedules, such as bus or train schedules, exhibit this property. We present Differential Caches, with the accompanying Differential Updates method and the Mobile SOAP (MoSOAP) protocol, to avoid transfer of repeated data, sent by a web service to an application. The protocol is flexible in that other optimization techniques, such as encoding, can also be applied. We report on results of experiments, using a research prototype, to evaluate the method's potential benefits and also its overhead. The results of experiments show clearly that potential benefits outweigh the overhead. Under optimal conditions, the MoSOAP protocol with Differential Caches obtained a speedup of close to 800%, in delivery of the web services' replies in comparison to the SOAP communication. Further improvements in delays were gained when encoding was used in conjunction with Differential Caches.
{"title":"Differential Caches for Web Services in Mobile Environments","authors":"M. Qaiser, P. Bodorik, D. Jutla","doi":"10.1109/ICWS.2011.50","DOIUrl":"https://doi.org/10.1109/ICWS.2011.50","url":null,"abstract":"Although web services have been espoused due to their many benefits, it is known that overhead delay, particularly the communication delay, associated with invocation and execution of web services is high. Consequently, much research has been expended on minimizing those delays. In many situations an application invokes a web service repeatedly such that some or most of the data returned by the web service does not change. For instance, many web services that return schedules, such as bus or train schedules, exhibit this property. We present Differential Caches, with the accompanying Differential Updates method and the Mobile SOAP (MoSOAP) protocol, to avoid transfer of repeated data, sent by a web service to an application. The protocol is flexible in that other optimization techniques, such as encoding, can also be applied. We report on results of experiments, using a research prototype, to evaluate the method's potential benefits and also its overhead. The results of experiments show clearly that potential benefits outweigh the overhead. Under optimal conditions, the MoSOAP protocol with Differential Caches obtained a speedup of close to 800%, in delivery of the web services' replies in comparison to the SOAP communication. Further improvements in delays were gained when encoding was used in conjunction with Differential Caches.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126482057","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 Architectures and web service technology are becoming popular in recent years. As more web services can be used over the Internet, the need to find efficient algorithms for web services composition that can deal with large amounts of services becomes important. These algorithms must deal with different issues like performance, semantics or user restrictions. In this paper we present an A* algorithm which solves the problem of semantic input-output message structure matching for web service composition. Given are quest, a service dependency graph with a subset of the original services from an external repository is dynamically generated. Then, the A*search algorithm is used to find a minimal composition that satisfies the user request. Moreover, in order to improve the performance, a set of dynamic optimization techniques has been implemented over the search process. A full experimental validation with eight different public repositories has been done showing a good performance as in all tests as the algorithm finds a valid solution with minimal number of services and execution path.
{"title":"Automatic Web Service Composition with a Heuristic-Based Search Algorithm","authors":"P. Rodríguez-Mier, M. Mucientes, M. Lama","doi":"10.1109/ICWS.2011.89","DOIUrl":"https://doi.org/10.1109/ICWS.2011.89","url":null,"abstract":"Service Oriented Architectures and web service technology are becoming popular in recent years. As more web services can be used over the Internet, the need to find efficient algorithms for web services composition that can deal with large amounts of services becomes important. These algorithms must deal with different issues like performance, semantics or user restrictions. In this paper we present an A* algorithm which solves the problem of semantic input-output message structure matching for web service composition. Given are quest, a service dependency graph with a subset of the original services from an external repository is dynamically generated. Then, the A*search algorithm is used to find a minimal composition that satisfies the user request. Moreover, in order to improve the performance, a set of dynamic optimization techniques has been implemented over the search process. A full experimental validation with eight different public repositories has been done showing a good performance as in all tests as the algorithm finds a valid solution with minimal number of services and execution path.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134609206","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
扫码关注我们
求助内容：
应助结果提醒方式：