移动运营商业务计算与通信计算之间的资源分配

Kezhi Wang, Kun Yang
{"title":"移动运营商业务计算与通信计算之间的资源分配","authors":"Kezhi Wang, Kun Yang","doi":"10.1109/ICC.2017.7997240","DOIUrl":null,"url":null,"abstract":"With the fast development of the cloud computing and virtualization techniques, computation resources can be allocated more dynamically and scalably on demand. This paper aims to study two types of computing, i.e., service computing and communication computing. We have proposed to have both computing resource in mobile operator's mobile cloud and investigated how to jointly allocate them with the objective of reducing mobile operator's power consumption and meanwhile, improving mobile users' experience. In this paper, we have introduced the computing power minimization problem, which is NP-hard. By applying several transformations and estimations, the problem can be solved by the branch and bound solution. Also, admission control is considered in this paper. Simulation results have shown that the proposed joint resource allocation solution has a very good performance and outperforms the traditional fixed data rate guarantee algorithm.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"12 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Resource allocation between service computing and communication computing for mobile operator\",\"authors\":\"Kezhi Wang, Kun Yang\",\"doi\":\"10.1109/ICC.2017.7997240\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the fast development of the cloud computing and virtualization techniques, computation resources can be allocated more dynamically and scalably on demand. This paper aims to study two types of computing, i.e., service computing and communication computing. We have proposed to have both computing resource in mobile operator's mobile cloud and investigated how to jointly allocate them with the objective of reducing mobile operator's power consumption and meanwhile, improving mobile users' experience. In this paper, we have introduced the computing power minimization problem, which is NP-hard. By applying several transformations and estimations, the problem can be solved by the branch and bound solution. Also, admission control is considered in this paper. Simulation results have shown that the proposed joint resource allocation solution has a very good performance and outperforms the traditional fixed data rate guarantee algorithm.\",\"PeriodicalId\":6517,\"journal\":{\"name\":\"2017 IEEE International Conference on Communications (ICC)\",\"volume\":\"12 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2017.7997240\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2017.7997240","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

随着云计算和虚拟化技术的快速发展,计算资源可以更加动态和可扩展地按需分配。本文主要研究两种类型的计算,即服务计算和通信计算。我们提出在移动运营商的移动云中同时拥有两种计算资源,并研究如何共同分配,以降低移动运营商的功耗,同时改善移动用户的体验。本文介绍了计算能力最小化问题,这是一个np困难问题。通过变换和估计,可以得到分支定界解。此外,本文还考虑了准入控制问题。仿真结果表明,提出的联合资源分配方案具有很好的性能,优于传统的固定数据速率保证算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Resource allocation between service computing and communication computing for mobile operator
With the fast development of the cloud computing and virtualization techniques, computation resources can be allocated more dynamically and scalably on demand. This paper aims to study two types of computing, i.e., service computing and communication computing. We have proposed to have both computing resource in mobile operator's mobile cloud and investigated how to jointly allocate them with the objective of reducing mobile operator's power consumption and meanwhile, improving mobile users' experience. In this paper, we have introduced the computing power minimization problem, which is NP-hard. By applying several transformations and estimations, the problem can be solved by the branch and bound solution. Also, admission control is considered in this paper. Simulation results have shown that the proposed joint resource allocation solution has a very good performance and outperforms the traditional fixed data rate guarantee algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic control of NFV forwarding graphs with end-to-end deadline constraints New sensing technique for detecting application layer DDoS attacks targeting back-end database resources Using the pattern-of-life in networks to improve the effectiveness of intrusion detection systems On the two time scale characteristics of wireless high speed railway networks Secrecy outage analysis of buffer-aided multi-antenna relay systems without eavesdropper's CSI
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1