Pushing the Performance Limits of Datacenter Networks With Fine-Grained Priority Assignment

IF 6.7 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Rui Zhuang;Jiangping Han;Kaiping Xue;Jian Li;David S.L. Wei;Ruidong Li;Qibin Sun;Jun Lu
{"title":"Pushing the Performance Limits of Datacenter Networks With Fine-Grained Priority Assignment","authors":"Rui Zhuang;Jiangping Han;Kaiping Xue;Jian Li;David S.L. Wei;Ruidong Li;Qibin Sun;Jun Lu","doi":"10.1109/TNSE.2024.3429402","DOIUrl":null,"url":null,"abstract":"Priority plays a crucial role in distinguishing the diverse demands of applications and improving the performance of underlying networks. However, application-provided priority is insufficient to cope with wide variations in traffic characteristics and dynamic network conditions. When assigning priorities to flows, existing proposals are limited to constrained dimensions, rendering them inadequate for accurately and rapidly identifying flow importance. To address this problem, we present Firapam, a novel priority assignment strategy that systematically combines important traffic states to achieve fine-grained and dynamic priority assignments. Firapam employs convex optimization to adaptively respond to changes in requirements and the environment, and implements admission control for flow priority in a distributed manner. Consequently, Firapam significantly reduces the flow completion time and deadline miss rate. We analytically and experimentally demonstrate that Firapam can effectively support existing priority assignments with significant performance improvements. Compared to state-of-the-art priority assignment methods, Firapam exhibits a remarkable decrease in deadline miss rate by 14.5% to 52.3%, across diverse traffic patterns. Moreover, it reduces the flow completion tail by 17.9% and ensures a minimum reduction of 72.3% in deadline miss rate under high network loads.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6298-6312"},"PeriodicalIF":6.7000,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10599832/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Priority plays a crucial role in distinguishing the diverse demands of applications and improving the performance of underlying networks. However, application-provided priority is insufficient to cope with wide variations in traffic characteristics and dynamic network conditions. When assigning priorities to flows, existing proposals are limited to constrained dimensions, rendering them inadequate for accurately and rapidly identifying flow importance. To address this problem, we present Firapam, a novel priority assignment strategy that systematically combines important traffic states to achieve fine-grained and dynamic priority assignments. Firapam employs convex optimization to adaptively respond to changes in requirements and the environment, and implements admission control for flow priority in a distributed manner. Consequently, Firapam significantly reduces the flow completion time and deadline miss rate. We analytically and experimentally demonstrate that Firapam can effectively support existing priority assignments with significant performance improvements. Compared to state-of-the-art priority assignment methods, Firapam exhibits a remarkable decrease in deadline miss rate by 14.5% to 52.3%, across diverse traffic patterns. Moreover, it reduces the flow completion tail by 17.9% and ensures a minimum reduction of 72.3% in deadline miss rate under high network loads.
利用细粒度优先级分配提升数据中心网络的性能极限
优先级在区分应用的不同需求和提高基础网络性能方面发挥着至关重要的作用。然而,应用程序提供的优先级不足以应对流量特性和动态网络条件的巨大变化。在为流量分配优先级时,现有建议仅限于受限的维度,因此无法准确、快速地识别流量的重要性。为解决这一问题,我们提出了 Firapam,这是一种新颖的优先级分配策略,它能系统地将重要的交通状态结合起来,实现细粒度的动态优先级分配。Firapam 采用凸优化技术来适应需求和环境的变化,并以分布式方式实现流量优先级的接纳控制。因此,Firapam 显著减少了流量完成时间和截止日期错过率。我们通过分析和实验证明,Firapam 可以有效支持现有的优先级分配,并显著提高性能。与最先进的优先级分配方法相比,Firapam 在不同流量模式下的截止日期错过率显著降低了 14.5% 至 52.3%。此外,它还将流量完成尾数减少了 17.9%,并确保在高网络负载下将截止日期错过率至少减少 72.3%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.
×
引用
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学术官方微信