跳到主要导航 跳到搜索 跳到主要内容

A skyline-based efficient web service selection method supporting frequent requests

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

With the development of web technology, a sharp increment in the number of services brings in efficiency problem to service selection. Furthermore, in dynamic service selection, services have to be selected as soon as requests arrive. When requests to a service are frequent, the service is prone to failure. This paper proposes a skyline-based web service selection method to deal with efficiency problem as well as solve the frequent requests problem. The method covers a search algorithm and a service scheduling strategy. To improve efficiency of service selection, the search algorithm based on Kd-tree is designed to determine skyline and then narrow search space. To solve the frequent requests problem, lottery scheduling strategy is employed to schedule services. Every service will get a certain amount of tickets in the lottery scheduling strategy, and service with more tickets will be distributed with more requests. Experiments validate the performance of the method.

源语言英语
主期刊名Proceedings of the 2016 IEEE 20th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2016
编辑Xiaoping P. Liu, Jianming Yong, Jean-Paul Barthes, Weiming Shen, Chunsheng Yang, Junzhou Luo, Limin Chen
出版商Institute of Electrical and Electronics Engineers Inc.
328-333
页数6
ISBN(电子版)9781509019151
DOI
出版状态已出版 - 13 9月 2016
活动20th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2016 - Nanchang, 中国
期限: 4 5月 20166 5月 2016

出版系列

姓名Proceedings of the 2016 IEEE 20th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2016

会议

会议20th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2016
国家/地区中国
Nanchang
时期4/05/166/05/16

指纹

探究 'A skyline-based efficient web service selection method supporting frequent requests' 的科研主题。它们共同构成独一无二的指纹。

引用此