.png){kind=icon}
返回
A resource allocation model based on double-sided combinational auctions for transparent computing
.png){kind=icon}
PRE
AI
DOI：10.1007/s12083-017-0556-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Transparent Computing (TC) is becoming a promising paradigm in network computing era. Although many researchers believe that TC model has a high requirement for the communication bandwidth, there is no research on the communication bandwidth boundary or resource allocation, which impedes the development of TC. This paper focuses on studying an efficient transparent computing resource allocation model in an economic view. First, under the quality of experiments (QoE) ensured, the utility function of clients and transparent computing providers (TCPs) is constructed. After that, the demand boundary of communication bandwidth is analyzed under the ideal transparent computing model. Based on the above analyses, a resource allocation scheme based on double-sided combinational auctions (DCA) is proposed so that the resource can be shared by both the service side and the client side with the welfare of the whole society being maximized. Afterward, the results scheduled in different experimental scenarios are given, which verifies the effectiveness of the proposed strategy. Overall, this work provides an effective resource allocation model for optimizing the performance of TC.
Keyword:
Transparent computing
Communication bandwidth boundary
Double-sided auctions
Resources optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
2.2K
被引数:
2.9K
机构
引用论文
.png){kind=icon}
分享收藏Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks数据收集无线传感器网络的寿命和能量洞演化分析
PREAI
分享收藏
分享收藏
查看更多内容