中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
Proactive service selection based on acquaintance model and LS-SVM
Author: Hu, JJ ; Chen, XL ; Zhang, CY
Keyword: Service selection ; Acquaintance model ; Negotiation ; LS-SVM
Source: NEUROCOMPUTING
Issued Date: 2016
Volume: 211, Pages:60-65
Indexed Type: SCI
Department: Beijing Inst Technol, Sch Software, Beijing 100081, Peoples R China. Chinese Acad Sci, Inst Software, Beijing 100190, Peoples R China.
Abstract: Current service selection is unable to perform proactively. When a service provider overloads, the services list is ever-lengthening, which leads to backlog and failure of service composition. To compensate for this deficiency, this paper improves the proactive service selection. In this strategy, the service provider analyses a time series of services received to forecast the backlog and consign services to the others through a negotiation process. The least squares support vector learning is used to predict a random list of services, and an acquaintance model (AM) makes a consigner allocate backlog services to other providers with high degree of relationship. The backlog of services by forecasting is entrusted to the provider who can implement the same service, and negotiation between the providers with the same role would allow generation of a new service selection solution before a fault occurs. Experiments showed that the least squares support vector machine (LS-SVM) algorithm was more accurate in predicting a services list and a negotiation mechanism using AM decreased communication time effectively, which improved the success rate of service selection and reduced the execution time of service composition. (C) 2016 Elsevier B.V. All rights reserved.
English Abstract: Current service selection is unable to perform proactively. When a service provider overloads, the services list is ever-lengthening, which leads to backlog and failure of service composition. To compensate for this deficiency, this paper improves the proactive service selection. In this strategy, the service provider analyses a time series of services received to forecast the backlog and consign services to the others through a negotiation process. The least squares support vector learning is used to predict a random list of services, and an acquaintance model (AM) makes a consigner allocate backlog services to other providers with high degree of relationship. The backlog of services by forecasting is entrusted to the provider who can implement the same service, and negotiation between the providers with the same role would allow generation of a new service selection solution before a fault occurs. Experiments showed that the least squares support vector machine (LS-SVM) algorithm was more accurate in predicting a services list and a negotiation mechanism using AM decreased communication time effectively, which improved the success rate of service selection and reduced the execution time of service composition. (C) 2016 Elsevier B.V. All rights reserved.
Language: 英语
WOS ID: WOS:000384871700008
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/17297
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
1-s2.0-S0925231216305616-main.pdf(1132KB)----限制开放 联系获取全文

Recommended Citation:
Hu, JJ,Chen, XL,Zhang, CY. Proactive service selection based on acquaintance model and LS-SVM[J]. NEUROCOMPUTING,2016-01-01,211:60-65.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Hu, JJ]'s Articles
[Chen, XL]'s Articles
[Zhang, CY]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Hu, JJ]‘s Articles
[Chen, XL]‘s Articles
[Zhang, CY]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace