Bobaker Mohamed A. Madi, Quan Z. Sheng, Lina Yao, Yongrui Qin, Xianzhi Wang
{"title":"PLMwsp: Probabilistic Latent Model for Web Service QoS Prediction","authors":"Bobaker Mohamed A. Madi, Quan Z. Sheng, Lina Yao, Yongrui Qin, Xianzhi Wang","doi":"10.1109/ICWS.2016.86","DOIUrl":"https://doi.org/10.1109/ICWS.2016.86","url":null,"abstract":"With the unprecedented and dramatic development of Web services in recent years, designing novel approaches for efficient Web service prediction has become of paramount importance. Quality of Service (QoS) plays a critical role in Web service recommendation. However determining QoS values of Web services is still a challenging task. For example, some QoS properties (e.g., response time, throughput) may hold different values for different users. In this paper, we describe how to develop a novel approach, PLMwsp, based on a probabilistic latent model, to predict effectively the QoS values of Web services. A Web service prediction has been developed, and experiments have been conducted to show the efficacy of our approach.","PeriodicalId":271249,"journal":{"name":"2016 IEEE International Conference on Web Services (ICWS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115066051","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":"Optimized Composite Service Transactions through Execution Results Prediction","authors":"Jiuyun Xu, Zhaotong Li, Huanxing Chi, Muhan Wang, Chao Guan, S. Reiff-Marganiec, Huilin Shen","doi":"10.1109/ICWS.2016.107","DOIUrl":"https://doi.org/10.1109/ICWS.2016.107","url":null,"abstract":"Traditional web services transaction processing mechanism handle exception by forward recovery and backward recovery. These compensation mechanisms often lead to waste of resources and time. In this paper, we propose a framework for predicting outcomes of service executions as part of service compositions which allows to choose service instances that are likely to lead to a successful result in the first instance and thus reduces the need for invoking costly recovery mechanisms. The framework makes use of watchdogs to maintain an awareness of service availability and a pre-coordinator which has oversight of the whole composite Web service and acts as a control center. An analysis of a scenario shows that we cannot only provide users with a more satisfactory result, but also can reduce the overhead costs of resources and waste.","PeriodicalId":271249,"journal":{"name":"2016 IEEE International Conference on Web Services (ICWS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117030223","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}
Jie Zhu, Xiaoping Li, Rubén Ruiz, Xiaolong Xu, Yi Zhang
{"title":"Scheduling Stochastic Multi-stage Jobs on Elastic Computing Services in Hybrid Clouds","authors":"Jie Zhu, Xiaoping Li, Rubén Ruiz, Xiaolong Xu, Yi Zhang","doi":"10.1109/ICWS.2016.94","DOIUrl":"https://doi.org/10.1109/ICWS.2016.94","url":null,"abstract":"In this paper, we consider the widespread multi-stage job scheduling problem (e.g., in Big Data processed by MapReduce) in which jobs arrive at hybrid cloud systems stochastically. The objective is to minimize the number of elastic computing instances. Along with hard deadlines of jobs, the problem under study is NP-hard in strong sense. In terms of initial job priorities, timetables are constructed by adjusting job priorities adaptively and generating feasible schedules iteratively. Job sequences are generated by two simple dispatching rules. A fast local search heuristic and a rescheduling process are developed for improving the obtained sequences. Experimental results show that the proposed heuristics improve the utilization of computing resources effectively while meeting the cloud service quality requirements.","PeriodicalId":271249,"journal":{"name":"2016 IEEE International Conference on Web Services (ICWS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117333928","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 Collaborative Poisson Factorization for Service Recommendation","authors":"Shuhui Chen, Yushun Fan, Wei Tan, Jia Zhang, Bing Bai, Zhenfeng Gao","doi":"10.1109/ICWS.2016.33","DOIUrl":"https://doi.org/10.1109/ICWS.2016.33","url":null,"abstract":"With the booming number of web services, it is a challenge for inexperienced developers to select suitable services and make service compositions. Therefore, recommending services based on user queries becomes a necessity. For modeling the queries and services' descriptions, many recent studies are based on LDA (Latent Dirichlet Allocation). However, some previous empirical works indicate that LDA model doesn't gain high accuracy in generating latent presentation which is subject to the restrictive assumption of the Dirichlet-Multinomial distribution. In this paper, we propose a Time-aware Collaborative Poisson Factorization (TCPF) to tackle the problem. TCPF takes Poisson Factorization as the foundation to model mashup queries and service descriptions separately, and incorporate them with the historical usage data together using collective matrix factorization. Experiments on the real-world ProgrammableWeb dataset show that our model outperforms the state-of-the-art methods (e.g., Time-aware collaborative domain regression) by 7.7% in terms of mean average precision, and costs much less time on the sparse, massive and long-tailed data set.","PeriodicalId":271249,"journal":{"name":"2016 IEEE International Conference on Web Services (ICWS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124804568","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}
Zehui Cheng, Zhangbing Zhou, P. Hung, Ke Ning, Liang-Jie Zhang
{"title":"Layer-Hierarchical Scientific Workflow Recommendation","authors":"Zehui Cheng, Zhangbing Zhou, P. Hung, Ke Ning, Liang-Jie Zhang","doi":"10.1109/ICWS.2016.97","DOIUrl":"https://doi.org/10.1109/ICWS.2016.97","url":null,"abstract":"This article proposes to identify and recommend scientific workflows to promote their reuse and repurposing. Specifically, a scientific workflow is converted into a layer hierarchy, which specifies hierarchical relations between this workflow, its sub-workflows, and activities. Semantic similarity is calculated between layer hierarchies of workflows in order to construct a scientific workflow network model. A graph-skeleton based clustering method is adopted for grouping layer hierarchies into clusters. Barycenters in clusters are identified for facilitating cluster identification and workflow ranking and recommendation. Experimental result shows that this technique is efficient and accurate on ranking and recommending appropriate clusters and scientific workflows.","PeriodicalId":271249,"journal":{"name":"2016 IEEE International Conference on Web Services (ICWS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125117324","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}
Shunmei Meng, Zuojian Zhou, T. Huang, Duanchao Li, Song Wang, Fan Fei, Wenping Wang, Wanchun Dou
{"title":"A Temporal-Aware Hybrid Collaborative Recommendation Method for Cloud Service","authors":"Shunmei Meng, Zuojian Zhou, T. Huang, Duanchao Li, Song Wang, Fan Fei, Wenping Wang, Wanchun Dou","doi":"10.1109/ICWS.2016.40","DOIUrl":"https://doi.org/10.1109/ICWS.2016.40","url":null,"abstract":"With the rapid development of cloud computing, large scale of cloud services are provided to users. Recommender systems have been proven to be valuable tools to deal with information overload and be able to provide appropriate recommendations to users. The cloud environment is dynamic and uncertain, which makes the quality of cloud services time-sensitive. However, most existing recommender systems did not take temporal influence into consideration, therefore could not accommodate the dynamic cloud environment. In view of this challenge, we propose a temporal-aware hybrid collaborative recommendation method for cloud service. It aims at providing users with appropriate recommendations from time-sensitive cloud services. In our method, by distinguishing temporal QoS metrics from stable QoS metrics, temporal influence is integrated into classical neighborhood-based collaborative recommender algorithm. Besides, to get an optimal recommendation, a temporal-aware latent factor model based on tensor decomposition is proposed and combined to improve the recommendation performance. Finally, experiments are designed and conducted to demonstrate the efficiency of our method.","PeriodicalId":271249,"journal":{"name":"2016 IEEE International Conference on Web Services (ICWS)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126022904","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}
Yuliang Shi, Jiwei Huang, Xudong Zhao, Lei Liu, Shijun Liu, Li-zhen Cui
{"title":"Integrating Theoretical Modeling and Experimental Measurement for Soft Resource Allocation in Multi-tier Web Systems","authors":"Yuliang Shi, Jiwei Huang, Xudong Zhao, Lei Liu, Shijun Liu, Li-zhen Cui","doi":"10.1109/ICWS.2016.73","DOIUrl":"https://doi.org/10.1109/ICWS.2016.73","url":null,"abstract":"Soft resources, which are system software components that use hardware or synchronize the use of hardware, are playing a critical role in the performance of multi-tier web systems, and thus it is quite important to tune the soft resource allocation for using the limited hardware resources to obtain maximum effectiveness. In this paper, we integrate both theoretical and experimental studies to the soft resource allocation problem. Specifically, we apply the queueing network model for formulating multi-tier web systems, and conduct experimental measurements based on the RUBiS benchmark system to obtain precise model parameters. Quantitative analysis is carried out, based on which an optimization model as well as an algorithm are put forward for soft resource allocation. The efficacy of our approach is validated by both theoretical analyses and experimental results.","PeriodicalId":271249,"journal":{"name":"2016 IEEE International Conference on Web Services (ICWS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126599244","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}
Qi Xie, Shenglin Zhao, Zibin Zheng, Jieming Zhu, Michael R. Lyu
{"title":"Asymmetric Correlation Regularized Matrix Factorization for Web Service Recommendation","authors":"Qi Xie, Shenglin Zhao, Zibin Zheng, Jieming Zhu, Michael R. Lyu","doi":"10.1109/ICWS.2016.34","DOIUrl":"https://doi.org/10.1109/ICWS.2016.34","url":null,"abstract":"Web service recommendation has recently drawn much attention with the growing amount of Web services. Previous work usually exploits the collaborative filtering techniques for Web service recommendation, but suffers from the data sparsity problem that leads to inaccurate results. Our analysis on a real-world Quality of Service (QoS) dataset shows that there is a hidden correlation among users and services. We define such hidden correlation with an asymmetric matrix (namely asymmetric correlation), in which each entry presents the hidden correlation between a user pair or between a service pair. The goal of this work is to employ such asymmetric correlation among users and services to alleviate the data sparsity problem and further enhance the prediction accuracy in service recommendation. Specifically, we propose an asymmetric correlation regularized matrix factorization (MF) framework, in which asymmetric correlation and asymmetric correlation propagation have been naturally integrated. Finally, experimental results on a well-known real-world QoS dataset validate that the use of asymmetric correlation among users and services is effective in improving prediction accuracy for Web service recommendation.","PeriodicalId":271249,"journal":{"name":"2016 IEEE International Conference on Web Services (ICWS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116093346","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}
Fathoni A. Musyaffa, Lavdim Halilaj, R. Siebes, F. Orlandi, S. Auer
{"title":"Minimally Invasive Semantification of Light Weight Service Descriptions","authors":"Fathoni A. Musyaffa, Lavdim Halilaj, R. Siebes, F. Orlandi, S. Auer","doi":"10.1109/ICWS.2016.93","DOIUrl":"https://doi.org/10.1109/ICWS.2016.93","url":null,"abstract":"Unification and automation of RESTful web services' documentation and descriptions is currently receiving increasing attention. The open-source OpenAPI Specification (formerly known as Swagger) has become core of this effort and has been adopted by a number of major companies. It allows the description of RESTful web services using objects represented in JSON or YAML file formats. As a result, the created descriptions are human and machine-readable, but not machine-understandable. In this paper, we propose a nonintrusive approach for the addition of semantic annotations (similar to RDFa and JSON-LD for HTML) to specific fields of the OpenAPI Specification. We created a lightweight vocabulary for describing RESTful web services using this specification. Furthermore, we practically demonstrate how OpenAPI objects can be enriched with semantic descriptions in a minimally invasive way by adding URIs in the values of chosen OpenAPI properties.","PeriodicalId":271249,"journal":{"name":"2016 IEEE International Conference on Web Services (ICWS)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122847951","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":"BPCS: A Block-Based Service Process Caching Strategy to Accelerate the Execution of Service Processes","authors":"Tingjie Jia, Jian Cao, Yan Yao, Zitai Ma","doi":"10.1109/ICWS.2016.28","DOIUrl":"https://doi.org/10.1109/ICWS.2016.28","url":null,"abstract":"Composing a set of Web services as a service process is becoming a common practice, but it involves multiple service invocations over the network, which incurs a huge time cost. To accelerate its execution, we propose an engine-side block-based service process caching strategy (BPCS). It is based on, and derives its advantages from, three key ideas. First, the invocation of Web service embodies semantics which enables the application of semantic-based caching. Second, cachable blocks are identified from a service process and each block is equiped with a separate cache so that the time overhead of service invocation and caching can be minimized. Third, a replacement strategy is introduced taking into account time and space factors to manage the space allocation for a process with multiple caches. The algorithms and methods used in BPCS are introduced in detail. Finally, BPCS is validated with a detailed performance study on real service processes and Web services via comparison experiments, which shows considerable improvements of BPCS over other strategies.","PeriodicalId":271249,"journal":{"name":"2016 IEEE International Conference on Web Services (ICWS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114055506","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}