2012 IEEE 19th International Conference on Web Services最新文献_第2页

WSP: A Network Coordinate Based Web Service Positioning Framework for Response Time Prediction 基于网络坐标的响应时间预测Web服务定位框架

2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.81

Jieming Zhu, Yu Kang, Zibin Zheng, Michael R. Lyu

{"title":"WSP: A Network Coordinate Based Web Service Positioning Framework for Response Time Prediction","authors":"Jieming Zhu, Yu Kang, Zibin Zheng, Michael R. Lyu","doi":"10.1109/ICWS.2012.81","DOIUrl":"https://doi.org/10.1109/ICWS.2012.81","url":null,"abstract":"With the rapid growth of Web services in recent years, the optimal service selection from functionally-equivalent service candidates has become more critical for building high quality service-oriented systems. To provide accurate QoSvalues for service selection, user-side QoS prediction thus becomes an important research problem. Although collaborative filtering based prediction approaches have been studied in several previous works, these methods suffer from the limitation of the sparsity of available historical QoS data, which greatly degrades the prediction accuracy. To address this problem, this paper proposes a Web service positioning (WSP)framework for response time prediction, which is one of the most important QoS properties. In our approach, a small set of landmarks are deployed to periodically monitor the response times of the Web service candidates and provide references to the numerous service users. By combining the advantages of network coordinate based approaches and collaborative filtering based approaches, the response times between users and Web services can be accurately predicted using their corresponding Euclidean distances. Extensive experiments are conducted based on our real-world QoS dataset collected on PlanetLab, comprising about 359,400 response time values from 200 users on 1,597 Web services. The experimental results show that our WSP approach outperforms the other existing approaches, especially when the historical data is sparse.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116488110","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}

引用次数: 26

Optimizing QoS-Aware Services Composition for Concurrent Processes in Dynamic Resource-Constrained Environments 动态资源约束环境下并发进程qos感知服务组合优化

2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.54

Yuanhong Shen, Xiaohu Yang, Ye Wang, Zhen Ye

{"title":"Optimizing QoS-Aware Services Composition for Concurrent Processes in Dynamic Resource-Constrained Environments","authors":"Yuanhong Shen, Xiaohu Yang, Ye Wang, Zhen Ye","doi":"10.1109/ICWS.2012.54","DOIUrl":"https://doi.org/10.1109/ICWS.2012.54","url":null,"abstract":"QoS-aware service composition intends to integrate services from different providers and maximize the global QoS in order to increase the user's satisfaction degree while subjecting to dynamic context constraints. Current composition approaches only focus on optimizing a single process to maximize the satisfaction degree for one party. When multiple processes are performed concurrently by their selfish users in a dynamic resource-constrained environment, new issues will arise, i.e., undesirable competition for service resources, extra waiting and frequent change of contexts. To address these issues, this paper aims to optimize QoS-aware services composition for multiple selfish users if the communication among users is allowed. Firstly, we propose an extensional QoS-aware service selection model for each process. Then based on this model, we present fault handling mechanisms before and during the execution of concurrent composite services for concurrent processes based on a multi-issue negotiation protocol among agents, and an adaptive context-aware service re-selection mechanism for adjusting the service execution plan for each running composite service in the dynamic resource-constrained environment. Comparative experiments reveal our approach facilitates to increase the average satisfaction degree, reduce the average waiting time of multiple users, and make the satisfaction degrees among multiple users more evenly distributed in the dynamic resource-constrained environment.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"523 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123207599","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}

引用次数: 16

User-Centered QoS Computation for Web Service Selection 以用户为中心的Web服务选择QoS计算

2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.18

Chunqi Shi, Donghui Lin, T. Ishida

{"title":"User-Centered QoS Computation for Web Service Selection","authors":"Chunqi Shi, Donghui Lin, T. Ishida","doi":"10.1109/ICWS.2012.18","DOIUrl":"https://doi.org/10.1109/ICWS.2012.18","url":null,"abstract":"QoS computation plays an important role in Web service selection. It involves property value preprocessing aspect, user satisfaction calculation aspect, and aggregation of multiple QoS properties aspect. However, little attention has been paid to users participating in QoS computation. In this paper, we examine QoS computation from the angle of experienced users and novice users. An experienced user is able to be more active in providing configuration information such as expected boundary of a QoS property, distribution function of user satisfaction, and the aggregation weight of each QoS property. While a novice user has limited experience to do this. Based on the study of user-centered factors in QoS computation, we propose a user-centered QoS computation, which provides a new choice of normalization in property value preprocessing aspect, an approach of approximation in user satisfaction calculation aspect, and a weight suggestion way in aggregation of multiple properties aspect. A case study in translation service selection shows that the proposed user-centered QoS calculation is more efficient for novice users than random configuration, and much more efficient for experience users.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129409397","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}

引用次数: 16

Ontology Alignment by Combining Lexical Analysis with Consequences from Reasoners 结合词法分析和推理结果的本体对齐

2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.57

J. Liao, Xiulei Liu, Xiaomin Zhu, Tong Xu, Jingyu Wang, Haifeng Sun

引用次数: 2

A Probabilistic Approach for Long-Term B2B Service Compositions 长期B2B服务组合的概率方法

2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.39

Adrian Klein, Florian Wagner, F. Ishikawa, S. Honiden

{"title":"A Probabilistic Approach for Long-Term B2B Service Compositions","authors":"Adrian Klein, Florian Wagner, F. Ishikawa, S. Honiden","doi":"10.1109/ICWS.2012.39","DOIUrl":"https://doi.org/10.1109/ICWS.2012.39","url":null,"abstract":"Service composition algorithms are used for realizing loosely coupled interactions in Service-Oriented Computing. Starting from an abstract workflow, concrete services are matched, based on their QoS, with the preferences and constraints of users. Current approaches usually only consider static QoS values and find a single solution consisting of one concrete service for each workflow task. In a business-to-business (B2B) environment, though, there are additional requirements for service compositions: 1) a high number of invocations, and 2) a high reliability. Thus, we introduce a probabilistic approach on the basis of a new QoS model to solve the composition problem for such long-term B2B service compositions. For each task and for every point in time, we determine the most appropriate services and backup services for a specific user. Thus, the selection depends on the actual response time and reliability, or recent invocation failures or timeouts. For that purpose, we propose an adaptive genetic algorithm that employs our QoS model and determines backup services dynamically based on the required reliability. Our evaluations show that our approach significantly increases the utility of long-term compositions compared with standard approaches in the envisioned B2B environments.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127883559","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}

引用次数: 2

Scaling Spatial Alarm Services on Road Networks 在道路网络上扩展空间报警服务

2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.93

Kisung Lee, Ling Liu, S. Meng, Balaji Palanisamy

{"title":"Scaling Spatial Alarm Services on Road Networks","authors":"Kisung Lee, Ling Liu, S. Meng, Balaji Palanisamy","doi":"10.1109/ICWS.2012.93","DOIUrl":"https://doi.org/10.1109/ICWS.2012.93","url":null,"abstract":"Spatial alarm services are essential components of many location-based applications. One of the key technical challenges for supporting spatial alarms as a service is performance and scalability. This paper shows that the Euclidean distance-based spatial alarm processing techniques are inadequate for mobile users traveling on road networks due to the high overhead in terms of server load for alarm checks and the high energy consumption in terms of client wakeups. We design and develop RoadAlarm, a road network aware spatial alarm processing service, with three unique features. First, we introduce the concept of road network-based spatial alarms using road network distance measures and a set of metrics specialized for spatial alarm processing. Second, we develop the basic model for spatial alarm processing by exploiting two types of filters: subscription filter and Euclidean lower bound filter. Third and but not the least, we develop a suite of optimization techniques to further reduce the frequency of wakeups at mobile clients and the number of alarm checks at the alarm processing server, while ensuring high accuracy of spatial alarm processing. Our experimental results show that RoadAlarm outperforms existing Euclidean space-based approaches with high success rate (accuracy) and significantly increased hibernation time.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129265561","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}

引用次数: 2

Describing and Verifying Integrity Constraints in XML Using OCL 用OCL描述和验证XML中的完整性约束

2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.60

Jakub Malý, M. Nečaský

引用次数: 1

Effect of Data Validity on the Reliability of Data-centric Web Services 数据有效性对以数据为中心的Web服务可靠性的影响

2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.95

Ewa Musial, Mei-Hwa Chen

引用次数: 4

TASS: Transaction Assurance in Service Selection 塔斯社:服务选择中的事务保证

2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.72

Jiuxin Cao, Gongrui Zhu, Xiao Zheng, Bo Liu, Fang Dong

引用次数: 11

Web Service Selection Algorithm Using Vickrey Auction 基于Vickrey拍卖的Web服务选择算法

2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.83

Atsushi Watanabe, F. Ishikawa, Y. Fukazawa, S. Honiden

{"title":"Web Service Selection Algorithm Using Vickrey Auction","authors":"Atsushi Watanabe, F. Ishikawa, Y. Fukazawa, S. Honiden","doi":"10.1109/ICWS.2012.83","DOIUrl":"https://doi.org/10.1109/ICWS.2012.83","url":null,"abstract":"The technology for web services has facilitated composition of a new service by combining existing services. The resulting composite service is required to guarantee Quality of Service (QoS), such as price, in addition to the demanded function. Each composite service faces computationally-expensive service selection by exploring enormous service combinations for optimization of a utility function and satisfaction of global constraints. In addition, each concrete service has difficulties in determining QoS that is profitable while attractive for customers, or composite services. Specifically, information on rival services is generally secret and changeable, which is required for the optimal decision. In response to these problems, this paper proposes an algorithm for service selection using Vickrey auction. In the first phase of the proposed algorithm, the composite service selects some best concrete services through the reverse Vickrey auction, only considering the utility function. In the second phase, the global constraints are satisfied through adjustments based on the Vickrey auction. The proposed algorithm avoids full exploration of services combinations for efficient computation, while encouraging providers to declare their best QoS without caring about extra profit.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125631210","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}

引用次数: 11