.png){kind=icon}
返回
Reliable and efficient big service selection
.png){kind=icon}
PRE
AI
DOI：10.1007/s10796-017-9767-x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Big services, both virtual (e.g., cloud services) and physical (e.g., public transportation), are evolving rapidly to handle and deal with big data. By aggregating services from various domains, big services adopt selection schemes to produce composite service solutions that meet customer requirements. However, unlike traditional service selection, a huge number of big services require some lengthy selection processes to improve the service reliability. In this paper, we propose an efficient big service selection approach based on the coefficient of variation and mixed integer programming that improves the solution in two senses: 1) minimizing the time cost and 2) maximizing the reliability. We tested our approach on real-world datasets, and the experimental results indicated that our approach is superior to others.
Keyword:
Service computing
Big service
Service selection
QoS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
2.0K
被引数:
6.5K
机构
引用论文
.png){kind=icon}
Full Valence Band Photoemission from Liquid Water Using EUV Synchrotron Radiation使用EUV同步加速器辐射从液态水中全价带光发射
PREAI
分享收藏
查看更多内容