一种新的混合数据中心网络无线资源分配算法

Boutheina Dab, Ilhem Fajjari, N. Aitsaadi, A. Mellouk
{"title":"一种新的混合数据中心网络无线资源分配算法","authors":"Boutheina Dab, Ilhem Fajjari, N. Aitsaadi, A. Mellouk","doi":"10.1109/MASS.2015.19","DOIUrl":null,"url":null,"abstract":"To this day, Cloud computing continues its explosive growth. Nevertheless, with the exceptional evolution of demands, data centers are suffering from congestion problems. To deal with these resource limitations, first, we put forward a novel Hybrid Data Center Network (HDCN) Architecture enabling high throughput wireless (IEEE 802.11 ad) and wired (IEEE 802.3) transmissions. Secondly, we propose a new resource allocation algorithm based on Graph Coloring in HDCN denoted by GC-HDCN. The main objective is to maximize the throughput of intra-HDCN communication requests over the wireless and/or wired infrastructure. The problem is formulated as minimum graph coloring which is NP-Hard. GC-HDCN makes use of i) column generation and ii) branch and price optimization schemes to resolve the assignment of wireless channels. Based on extensive simulations with Qual Net simulator considering all the layers of the protocol stack, the results obtained show that our proposal GC-HDCN outperforms the related prominent strategies in terms of i) end-to-end delay, ii) throughput and iii) spectrum spatial reuse.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A Novel Wireless Resource Allocation Algorithm in Hybrid Data Center Networks\",\"authors\":\"Boutheina Dab, Ilhem Fajjari, N. Aitsaadi, A. Mellouk\",\"doi\":\"10.1109/MASS.2015.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To this day, Cloud computing continues its explosive growth. Nevertheless, with the exceptional evolution of demands, data centers are suffering from congestion problems. To deal with these resource limitations, first, we put forward a novel Hybrid Data Center Network (HDCN) Architecture enabling high throughput wireless (IEEE 802.11 ad) and wired (IEEE 802.3) transmissions. Secondly, we propose a new resource allocation algorithm based on Graph Coloring in HDCN denoted by GC-HDCN. The main objective is to maximize the throughput of intra-HDCN communication requests over the wireless and/or wired infrastructure. The problem is formulated as minimum graph coloring which is NP-Hard. GC-HDCN makes use of i) column generation and ii) branch and price optimization schemes to resolve the assignment of wireless channels. Based on extensive simulations with Qual Net simulator considering all the layers of the protocol stack, the results obtained show that our proposal GC-HDCN outperforms the related prominent strategies in terms of i) end-to-end delay, ii) throughput and iii) spectrum spatial reuse.\",\"PeriodicalId\":436496,\"journal\":{\"name\":\"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASS.2015.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASS.2015.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

直到今天,云计算仍在继续其爆炸性的增长。然而,随着需求的异常演变,数据中心正在遭受拥塞问题的困扰。为了解决这些资源限制,首先,我们提出了一种新的混合数据中心网络(HDCN)架构,支持高吞吐量无线(IEEE 802.11 ad)和有线(IEEE 802.3)传输。其次,提出了一种新的基于图着色的HDCN资源分配算法,称为GC-HDCN。主要目标是在无线和/或有线基础设施上最大化hdcn内部通信请求的吞吐量。该问题被表述为NP-Hard的最小图着色问题。GC-HDCN采用i)列生成和ii)分支和价格优化方案来解决无线信道分配问题。在考虑协议栈各层的Qual Net模拟器上进行了大量仿真,结果表明,我们提出的GC-HDCN在i)端到端延迟,ii)吞吐量和iii)频谱空间重用方面优于相关的突出策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Wireless Resource Allocation Algorithm in Hybrid Data Center Networks
To this day, Cloud computing continues its explosive growth. Nevertheless, with the exceptional evolution of demands, data centers are suffering from congestion problems. To deal with these resource limitations, first, we put forward a novel Hybrid Data Center Network (HDCN) Architecture enabling high throughput wireless (IEEE 802.11 ad) and wired (IEEE 802.3) transmissions. Secondly, we propose a new resource allocation algorithm based on Graph Coloring in HDCN denoted by GC-HDCN. The main objective is to maximize the throughput of intra-HDCN communication requests over the wireless and/or wired infrastructure. The problem is formulated as minimum graph coloring which is NP-Hard. GC-HDCN makes use of i) column generation and ii) branch and price optimization schemes to resolve the assignment of wireless channels. Based on extensive simulations with Qual Net simulator considering all the layers of the protocol stack, the results obtained show that our proposal GC-HDCN outperforms the related prominent strategies in terms of i) end-to-end delay, ii) throughput and iii) spectrum spatial reuse.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信