.png){kind=icon}
返回
Efficient distribution of requests in federated cloud computing environments utilizing statistical multiplexing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2018.08.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
One of the main questions in cloud computing environments is how to efficiently distribute user requests or Virtual Machines (VMs) based on their resource needs over time. This question is also an important one when dealing with a cloud federation environment where rational cloud service providers are collaborating together by sharing customer requests. By considering intrinsic aspects of the cloud computing model one can propose request distribution methods that play on the strengths of this computing paradigm. In this paper we look at statistical multiplexing and server consolidation as such a strength and examine the use of the coefficient of variation and other related statistical metrics as objective functions which can be used in deciding on the request distribution mechanism. The complexity of using these objective functions is analyzed and heuristic methods which enable efficient request partitioning in a feasible time are presented & compared. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Cloud computing
Cloud federation
Multiclouds
Request partitioning
Statistical multiplexing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.3W
机构
引用论文
.png){kind=icon}
Workload Factoring and Resource Sharing via Joint Vertical and Horizontal Cloud Federation Networks
PREAI
分享收藏分享收藏
查看更多内容