DTE:Dynamic Traffic Engineering in Software Defined Data Center Networks

Farshad Tajedin, M. Farhoudi, Aliehsan Samiei, B. Akbari
{"title":"DTE:Dynamic Traffic Engineering in Software Defined Data Center Networks","authors":"Farshad Tajedin, M. Farhoudi, Aliehsan Samiei, B. Akbari","doi":"10.1109/CENIM48368.2019.8973350","DOIUrl":null,"url":null,"abstract":"Nowadays, data center networks confront a huge amount of data that can cause both network congestion and packet loss; therefore, traffic engineering methods can help to balance the load through the network. In recent years, quite a bit of traffic engineering methods have been proposed in order to reduce network utilization, especially in cloud data center networks. Reducing network utilization; preventing network congestion, which leads to guaranteeing QoS; and optimal using of the existing route are considered as major challenges through all these works. Prevalent traffic engineering algorithms such as ECMP do not have any focus on the current network circumstance, nor do they provide a solution for mice flows. In this work, we propose a novel dynamic traffic engineering method in software-defined data center networks which considers current network circumstance, uses network resources in an optimal manner, and guarantees QoS. The algorithm uses OpenFlow protocol to detect new flow, gather network information in short intervals, and choose the best route for the flow based on network loads. The proposed algorithm selects the best path through the network for each flow based on their existing flows’ type in order to not only improve the QoS but also achieve more customer satisfaction. The evaluation results demonstrate that the DTE algorithm reduces high-priority flows jitter, increase network utilization, and balance loads through the network and path to reach hosts better in comparison with existing traffic engineering methods.","PeriodicalId":106778,"journal":{"name":"2019 International Conference on Computer Engineering, Network, and Intelligent Multimedia (CENIM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Computer Engineering, Network, and Intelligent Multimedia (CENIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CENIM48368.2019.8973350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Nowadays, data center networks confront a huge amount of data that can cause both network congestion and packet loss; therefore, traffic engineering methods can help to balance the load through the network. In recent years, quite a bit of traffic engineering methods have been proposed in order to reduce network utilization, especially in cloud data center networks. Reducing network utilization; preventing network congestion, which leads to guaranteeing QoS; and optimal using of the existing route are considered as major challenges through all these works. Prevalent traffic engineering algorithms such as ECMP do not have any focus on the current network circumstance, nor do they provide a solution for mice flows. In this work, we propose a novel dynamic traffic engineering method in software-defined data center networks which considers current network circumstance, uses network resources in an optimal manner, and guarantees QoS. The algorithm uses OpenFlow protocol to detect new flow, gather network information in short intervals, and choose the best route for the flow based on network loads. The proposed algorithm selects the best path through the network for each flow based on their existing flows’ type in order to not only improve the QoS but also achieve more customer satisfaction. The evaluation results demonstrate that the DTE algorithm reduces high-priority flows jitter, increase network utilization, and balance loads through the network and path to reach hosts better in comparison with existing traffic engineering methods.
软件定义数据中心网络中的动态流量工程
如今,数据中心网络面临着大量的数据,这些数据可能会导致网络拥塞和数据包丢失;因此,流量工程方法可以帮助实现网络负载均衡。近年来,为了降低网络利用率,特别是在云数据中心网络中,提出了相当多的流量工程方法。降低网络利用率;防止网络拥塞,从而保证QoS;现有路线的优化利用是所有工作面临的主要挑战。流行的流量工程算法(如ECMP)没有关注当前的网络环境,也没有为鼠标流提供解决方案。本文提出了一种新的软件定义数据中心网络动态流量工程方法,该方法考虑了当前网络环境,以最优方式利用网络资源,并保证了QoS。该算法采用OpenFlow协议检测新流量,在短时间间隔内收集网络信息,并根据网络负载选择最佳流量路由。该算法根据每个流的现有流类型选择网络中最优路径,既提高了服务质量,又提高了客户满意度。评价结果表明,与现有的流量工程方法相比,DTE算法能更好地减少高优先级流抖动,提高网络利用率,通过网络和路径均衡负载到达主机。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信