SDN-based dynamic flow scheduling in optical data centers

S. Girisankar, Tram Truong Huu, G. Mohan
{"title":"SDN-based dynamic flow scheduling in optical data centers","authors":"S. Girisankar, Tram Truong Huu, G. Mohan","doi":"10.1109/COMSNETS.2017.7945376","DOIUrl":null,"url":null,"abstract":"Wavelength division multiplexing (WDM) based optical networks have been shown to be an attractive “green” solution for cloud data center networks because of its high bisection bandwidth, low power consumption and low complexity of network wiring. In addition to the circuit-switched nature of optical networks, the high degree of the optical switch and dynamic arrival of traffic flows make the problem of flow scheduling in optical data centers becomes very challenging. It has to consider not only the flow admission control but also wavelength assignment for the lightpaths. In this paper, we address the problem of flow scheduling in optical data centers. We first develop an optimization programming formulation that aims at maximizing the revenue for cloud providers in a long run. Since solving the optimization formulation is computationally prohibitive, we develop heuristic scheduling algorithms based on the congestion factor of traffic flows. We design a Software Defined Network framework that integrates the proposed algorithms to perform flow scheduling in optical data center networks. We evaluate the proposed algorithms through comprehensive simulations and compare their performance against that of a baseline algorithm. The results show that the proposed algorithms achieve good performance improvement compared to the baseline algorithm.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2017.7945376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Wavelength division multiplexing (WDM) based optical networks have been shown to be an attractive “green” solution for cloud data center networks because of its high bisection bandwidth, low power consumption and low complexity of network wiring. In addition to the circuit-switched nature of optical networks, the high degree of the optical switch and dynamic arrival of traffic flows make the problem of flow scheduling in optical data centers becomes very challenging. It has to consider not only the flow admission control but also wavelength assignment for the lightpaths. In this paper, we address the problem of flow scheduling in optical data centers. We first develop an optimization programming formulation that aims at maximizing the revenue for cloud providers in a long run. Since solving the optimization formulation is computationally prohibitive, we develop heuristic scheduling algorithms based on the congestion factor of traffic flows. We design a Software Defined Network framework that integrates the proposed algorithms to perform flow scheduling in optical data center networks. We evaluate the proposed algorithms through comprehensive simulations and compare their performance against that of a baseline algorithm. The results show that the proposed algorithms achieve good performance improvement compared to the baseline algorithm.
基于sdn的光数据中心动态流调度
基于波分复用(WDM)的光网络由于其高对分带宽、低功耗和低网络布线复杂性,已被证明是云数据中心网络的一种有吸引力的“绿色”解决方案。除了光网络的电路交换特性外,光交换的高度和流量的动态到达使得光数据中心的流量调度问题变得非常具有挑战性。它不仅要考虑进流控制,而且要考虑光路的波长分配。本文研究了光数据中心的流调度问题。我们首先开发了一个优化规划公式,旨在使云提供商的长期收益最大化。由于求解优化公式在计算上是禁止的,我们开发了基于交通流拥挤系数的启发式调度算法。我们设计了一个软件定义网络框架,该框架集成了所提出的算法来执行光数据中心网络中的流调度。我们通过综合模拟来评估所提出的算法,并将其性能与基线算法进行比较。结果表明,与基线算法相比,本文提出的算法取得了较好的性能提升。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信