Lei Sun, Shangguang Wang, Jinglin Li, Qibo Sun, Fangchun Yang
{"title":"QoS Uncertainty Filtering for Fast and Reliable Web Service Selection","authors":"Lei Sun, Shangguang Wang, Jinglin Li, Qibo Sun, Fangchun Yang","doi":"10.1109/ICWS.2014.83","DOIUrl":"https://doi.org/10.1109/ICWS.2014.83","url":null,"abstract":"How to select the optimal composited service from a set of functionally equivalent services but different QoS attributes has become a hot research in service computing. However existing approaches are inefficient as they search all solution spaces. More importantly, they neglect the QoS inherently uncertainty due to the dynamic network environment. In this paper, we propose a fast and reliable Web service selection approach that attempts to select the best reliable composited service on the basis of filtering low reliable Web services according to the uncertainty of QoS. The approach first employs information theory and variance theory to abandon high QoS uncertainty services and downsize the solution spaces. A reliability fitness function is then designed to select the best reliable service for composited services. We experimented with real-world and synthetic datasets and compared our approach with other approaches. Our results show that our approach is not only fast, but also find more reliable composited services.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115432211","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":"Wire-Speed Differential SOAP Encoding","authors":"K. Agarwal","doi":"10.1109/ICWS.2014.41","DOIUrl":"https://doi.org/10.1109/ICWS.2014.41","url":null,"abstract":"The use of SOAP based communication protocol in complex Service-Oriented Architecture (SOA) environments can cause a significant strain on network resources thereby degrading application level performance. In this paper, we present software and hardware approaches for transparent line-rate encoding and decoding of SOAP traffic for alleviating network bandwidth bottlenecks. The proposed approaches are significantly lighter weight than gzip and binary XML encoding techniques while achieving better compression ratios. First we present a software-based scheme with a linear runtime that uses a finite set of pre-selected message templates for differential encoding of SOAP messages. We propose generating the templates by extracting the longest common subsequence from a representative set of SOAP messages encountered during the service operation. Next we present an architecture for line-rate implementation of data differencing functionality in hardware. As compared to the software-based scheme, the hardware design allows higher flexibility in the template selection and message encoding without compromising the encoder throughput. We test both schemes on a sample workload running on a SOAP based Business Intelligence software platform. Our results show that the proposed techniques can achieve an average of 10X reduction in the overall SOAP traffic. Furthermore, we show that the differentially encoded data can be further compressed by gzip to achieve a combined 15-17X reduction in the message sizes as compared to less than 5X compression obtained when using gzip by itself.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115668724","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}
Shuai Gong, Jinhua Xiong, Zhiyong Liu, M. Wojciechowski
{"title":"Discovering Diversity Corrections for Incompatible Web Services","authors":"Shuai Gong, Jinhua Xiong, Zhiyong Liu, M. Wojciechowski","doi":"10.1109/ICWS.2014.76","DOIUrl":"https://doi.org/10.1109/ICWS.2014.76","url":null,"abstract":"The increasing amount of web services over the Internet enable users composing them to satisfy the users'needs efficiently. Such service composing is prone to errors. Automatically detecting incompatible web services interaction and correcting them will largely improve users' experience on service composing. When correcting the errors, two major issues need to be addressed: First, how to satisfy diverse correction requirements of different users, Second, how to find the corrections efficiently. This paper proposes an approach to discovering maximum diversity corrections to reduce the risk of unsatisfying different end users' needs when presenting correction plans to them. To solve the problem efficiently, this paper proposes an approximate algorithm to find diverse correction plans. Furthermore, two pruning strategies are adopted to reduce the runtime of the algorithm. Experiments illustrate that our approach outperforms the baseline on the diversity of correction plans, and the two pruning strategies reduce the runtime significantly.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126087854","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}
Yao Zhao, Li Dong, Rongheng Lin, Danfeng Yan, Jun Yu Li
{"title":"Towards Effectively Identifying RESTful Web Services","authors":"Yao Zhao, Li Dong, Rongheng Lin, Danfeng Yan, Jun Yu Li","doi":"10.1109/ICWS.2014.79","DOIUrl":"https://doi.org/10.1109/ICWS.2014.79","url":null,"abstract":"In recent years, RESTful Web services have been rapidly developed and deployed, because of the advantages of lightweight, flexibility and extensibility, etc. However, most RESTful services are described in heterogeneous and ordinary HTML pages, which makes them really difficult to be identified and crawled automatically from the Internet. In this paper we propose a hybrid classifier framework called co-NV for automatic identification of RESTful services on the Web. In our framework, web pages are analyzed and filtered according to the contents and structure characteristics of HTML documents, with Naïve Bayes classifier and Vector Space Model (VSM) respectively. Experiments with real RESTful services prove that our framework works effectively with high precision and recall rate, and is very practical.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125365898","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":"Time-Aware Service Recommendation for Mashup Creation in an Evolving Service Ecosystem","authors":"Yangxin Zhong, Yushun Fan, Keman Huang, Wei Tan, Jia Zhang","doi":"10.1109/ICWS.2014.17","DOIUrl":"https://doi.org/10.1109/ICWS.2014.17","url":null,"abstract":"Web service recommendation has become a critical problem as services become increasingly prevalent on the Internet. Some existing methods focus on content matching techniques such as keyword search and semantic matching while others are based on Quality of Service (QoS) prediction. However, services and their mashups are evolving over time with publishing, perishing and changing of interfaces. Therefore, a practical service recommendation approach should take into account the evolution of a service ecosystem. In this paper, we present a method to extract service evolution patterns by exploiting Latent Dirichlet Allocation (LDA) and time series prediction. A time-aware service recommendation framework for mashup creation is presented combing service evolution, collaborative filtering and content matching. Experiments on real-world ProgrammableWeb data set show that our approach leads to a higher precision than traditional collaborative filtering and content matching methods.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122874612","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":"Modeling Accountable Cloud Services","authors":"Jun Zou, Yan Wang, M. Orgun","doi":"10.1109/ICWS.2014.58","DOIUrl":"https://doi.org/10.1109/ICWS.2014.58","url":null,"abstract":"Cloud computing services have been increasingly considered by business as a viable option for reducing IT expenditure. The highly automated and agile nature of cloud services offer businesses low cost, high efficiency and flexibility benefits. However, there are often associated problems with unmanaged accountability such as lack of disclosure of service obligations, mechanisms for detection for obligation fulfilment or determination of liable party if an obligation is violated. This paper analyses the accountability properties of a cloud service and proposes an accountable cloud service (ACS) model to address those problems. The ACS model is underpinned by a hybrid logic system called Dynamic Logic for Accountability (DLA) extended from Dynamic Logic. ACS provides an intuitive notation for modeling service collaboration diagrams based on a reduced version of BPMN2.0 to capture the fulfillment of service obligations. We also propose an Obligation Flow Diagram (OFD) as a simple method for conflict resolution and verification for the ACS model. The ACS model enables obligation specification, decomposition, validation, machine-interpretation, monitoring and reasoning, and ultimately facilitates accountability in cloud service consumption. Using Amazon S3 service as a case study, we show how to address those known accountability problems using our ACS model. Finally we discuss the applicability of our model to cloud services in general.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121873505","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":"Component-Based Information Service Platform for Heating Industry","authors":"Guangchang Hu, Budan Wu, B. Cheng, Junliang Chen","doi":"10.1109/ICWS.2014.105","DOIUrl":"https://doi.org/10.1109/ICWS.2014.105","url":null,"abstract":"To solve the problem of low information integration for heating industry, a framework of information service platform is proposed. The framework realizes information sharing and integration control of central heating. Four core components are designed to implement process development, service collaboration, publish/subscribe and event rule. A heating management system has been designed based on these components, which realizes intelligent and security of the production management. And three application subsystems have been developed to realize heating maintenance service, multi-level alarm service and heating charging service. The information service platform effectively achieves information integration and rapid service development.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131642350","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}
Emna Khanfir, Chiraz El Hog, Raoudha Ben Djemaa, Ikram Amous
{"title":"A Web Service Selection Framework Based on User's Context and QoS","authors":"Emna Khanfir, Chiraz El Hog, Raoudha Ben Djemaa, Ikram Amous","doi":"10.1109/ICWS.2014.119","DOIUrl":"https://doi.org/10.1109/ICWS.2014.119","url":null,"abstract":"Since the emergence of Web services and the diversity of user's devices, an emerging need for adapted web services appeared. In fact, users aim to find web services meeting their requests, contexts and desired QoS. In order to achieve this goal, we propose in this paper a framework to find and select adaptable web services. Our framework is named QoS-ASF and it is based on a multi-agent system.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131235554","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":"Runtime Enforcement of Data-centric Properties for Concurrent Service-Based Applications","authors":"Guoquan Wu, Jun Wei, Hua Zhong, Tao Huang","doi":"10.1109/ICWS.2014.64","DOIUrl":"https://doi.org/10.1109/ICWS.2014.64","url":null,"abstract":"For service-based applications which are composed of multiple independent third-parties, continuous monitoring is required to assure that runtime behavior of the systems complies with specified properties. However, most existing work only detects the violation while not consider how to enforce the properties so that the constraint can not be violated at runtime. To address this limitation, this paper presents EnforceBCL, a framework for enforcing data-centric properties for concurrent service-based applications. Users of EnforceBCL can specify the properties to be enforced using the expressive behavior constraint enforcement language. Data-centric property is enforced at runtime by blocking the process whose next action would violate it. The impacted processes can be unblocked and allowed to execute when the specified property eventually reaches a safe state. EnforceBCL also provides the mechanism to detect possible deadlock during the enforcement of the property, and executes corresponding handler to solve the deadlock. To evaluate the effectiveness and efficiency of the proposed approach, we conducted several experiments. Results show that EnforceBCL is able to effectively enforce data-centric properties for concurrent service-based applications and also incurs less performance overhead.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130691278","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":"An Efficient Multiple Trust Paths Finding Algorithm for Trustworthy Service Provider Selection in Real-Time Online Social Network Environments","authors":"Guanfeng Liu, An Liu, Yan Wang, Lei Li","doi":"10.1109/ICWS.2014.29","DOIUrl":"https://doi.org/10.1109/ICWS.2014.29","url":null,"abstract":"Online Social Networks (OSNs) have been used to enhance service provision and service selection, where trust is one of the most important factors for the decision making of service consumers. Thus, it is significant to evaluate the trustworthiness of the service providers along the social trust paths from a service consumer to a service provider. However, there are usually many social trust paths between an unknown service consumer and service provider. Thus, a challenging problem is how to effectively and effciently find those social trust paths that can yield trustworthy trust evaluation results based on the requirements of a service consumer particularly in the real-time OSN environments. In this paper, we first present a contextual trust-oriented social network structure and a concept of Quality of Trust (QoT). We then model the multiple social trust paths finding with end-to-end QoT constraints as the Multiple Constrained K Optimal Paths (MCOP-K) selection problem, which is NP-Complete. To deal with this challenging problem, based on the Monte Carlo method and our optimization search strategies, we propose a new efficient and effective approximation algorithm D-MCBA. The results of our experiments conducted on a real-world dataset of OSNs illustrate that D-MCBA can efficiently identify the social trust paths with better quality than our previously proposed MONTE K algorithm that is the most promising algorithm for the social trust path finding in OSNs.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130950973","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}