{"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}
{"title":"Adaptive Service Composition Based on Runtime Requirements Monitoring","authors":"Zhanlei Ma, Lin Liu, Hongji Yang, J. Mylopoulos","doi":"10.1109/ICWS.2011.83","DOIUrl":"https://doi.org/10.1109/ICWS.2011.83","url":null,"abstract":"In today's service computing environments, user needs and expectations are constantly changing. New services emerge while old ones become obsolete and need to be replaced. In such settings, composite services need to be adaptive to changes in user requirements and the environment. This paper proposes a conceptual framework for modeling compositional adaptation for services founded on a requirements monitoring facility. This facility helps maintain adherence between user requirements changes and the dynamics of service composition structure and quality attributes. Specifically, user requirements are represented as goals and soft goals, service composition structure is represented with a CSP-like grammar, and the adaptation mechanism is based on AI planning. The proposed approach is evaluated in a service simulation environment of real-world supply-chain adaptation scenarios.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"83 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":"122963486","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}
{"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}
Apostolos Papageorgiou, Marius Schatke, Stefan Schulte, R. Steinmetz
{"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}
{"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}
Nan Guo, Tianhan Gao, Bin Zhang, R. Fernando, E. Bertino
{"title":"Aggregated Privacy-Preserving Identity Verification for Composite Web Services","authors":"Nan Guo, Tianhan Gao, Bin Zhang, R. Fernando, E. Bertino","doi":"10.1109/ICWS.2011.53","DOIUrl":"https://doi.org/10.1109/ICWS.2011.53","url":null,"abstract":"An aggregated privacy-preserving identity verification scheme is proposed for composite Web services. It aggregates multiple component providers' interactions of identity verification to a single one involving the user. Besides, it protects users from privacy disclosure through the adoption of zero-knowledge of proof of knowledge. This approach can dramatically reduce the computation time, independently on the number of identity attributes and component providers.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"361 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":"132312223","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}
{"title":"A New QoS Prediction Approach Based on User Clustering and Regression Algorithms","authors":"Yuliang Shi, Kun Zhang, Bing Liu, Li-zhen Cui","doi":"10.1109/ICWS.2011.95","DOIUrl":"https://doi.org/10.1109/ICWS.2011.95","url":null,"abstract":"QoS has become an important measure for web service selection. In this paper, we present an approach which can provide the approximate QoS value for users, and support finding the optimal web service. Firstly, it clusters the users based on location and network condition, then according to the QoS historical statistics of users in the same cluster, uses the linear regression algorithm to predict the QoS value based on invocation time and workload.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"60 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":"128933062","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}
{"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}
{"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}
{"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}