{"title":"基于改进SACK的RoCE乱序包处理算法","authors":"Yang Nie, Zheng Shi, Xinyi Chen, Liguo Qian","doi":"10.1109/IAEAC54830.2022.9929858","DOIUrl":null,"url":null,"abstract":"RoCE (RDMA over commodity Ethernet) combines the go-back-N retransmission mechanism, priority-based flow control (PFC) and congestion control (CC) algorithms to achieve the low latency, low CPU overhead and high bandwidth required by data center networks (DCN). However, when faced with scenarios such as multi-path and adaptive routing that may lead to out-of-order packets, RoCE is prone to serious throughput degradation. This paper proposes an improved Selective Acknowledgement (SACK) algorithm for RoCE (SACK-RoCE) to solve the above problem. The SACK-RoCE includes three mechanisms: packet trace, out-of-order packet detection, and lost packets retransmission. In simulation, we test the performance of the SACK-RoCE in both single flow and real-world flows environment. The SACK-RoCE improves the throughput by 7 times compared to RoCE and can almost keep the number of retransmission times consistent with the number of lost packets. As for real loads, the SACK-RoCE outperforms the improved RoCE NIC (IRN) by 12.05%∼22.32% on average FCT, tail FCT and average slowdown metrics. In addition, the SACK-RoCE adds only 315 bits of memory usage per link, which makes the algorithm easy to deploy.","PeriodicalId":349113,"journal":{"name":"2022 IEEE 6th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC )","volume":"169 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Out-of-Order Packet Processing Algorithm of RoCE Based on Improved SACK\",\"authors\":\"Yang Nie, Zheng Shi, Xinyi Chen, Liguo Qian\",\"doi\":\"10.1109/IAEAC54830.2022.9929858\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"RoCE (RDMA over commodity Ethernet) combines the go-back-N retransmission mechanism, priority-based flow control (PFC) and congestion control (CC) algorithms to achieve the low latency, low CPU overhead and high bandwidth required by data center networks (DCN). However, when faced with scenarios such as multi-path and adaptive routing that may lead to out-of-order packets, RoCE is prone to serious throughput degradation. This paper proposes an improved Selective Acknowledgement (SACK) algorithm for RoCE (SACK-RoCE) to solve the above problem. The SACK-RoCE includes three mechanisms: packet trace, out-of-order packet detection, and lost packets retransmission. In simulation, we test the performance of the SACK-RoCE in both single flow and real-world flows environment. The SACK-RoCE improves the throughput by 7 times compared to RoCE and can almost keep the number of retransmission times consistent with the number of lost packets. As for real loads, the SACK-RoCE outperforms the improved RoCE NIC (IRN) by 12.05%∼22.32% on average FCT, tail FCT and average slowdown metrics. In addition, the SACK-RoCE adds only 315 bits of memory usage per link, which makes the algorithm easy to deploy.\",\"PeriodicalId\":349113,\"journal\":{\"name\":\"2022 IEEE 6th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC )\",\"volume\":\"169 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 6th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC )\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IAEAC54830.2022.9929858\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 6th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC )","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAEAC54830.2022.9929858","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
RoCE(商用以太网上的RDMA)结合了回退n重传机制、基于优先级的流量控制(PFC)和拥塞控制(CC)算法,以实现数据中心网络(DCN)所需的低延迟、低CPU开销和高带宽。但是,当面对多路径和自适应路由等可能导致报文乱序的场景时,RoCE容易出现严重的吞吐量下降。针对上述问题,本文提出了一种改进的面向RoCE的选择性确认(SACK)算法(SACK-RoCE)。SACK-RoCE包括三种机制:报文跟踪、乱序报文检测和丢失报文重传。在仿真中,我们测试了SACK-RoCE在单流和真实流环境中的性能。与RoCE相比,SACK-RoCE的吞吐量提高了7倍,重传次数几乎与丢包次数保持一致。对于实际负载,SACK-RoCE在平均FCT、尾部FCT和平均减速指标上优于改进的RoCE NIC (IRN) 12.05% ~ 22.32%。此外,SACK-RoCE每条链路只增加315位内存使用,这使得该算法易于部署。
An Out-of-Order Packet Processing Algorithm of RoCE Based on Improved SACK
RoCE (RDMA over commodity Ethernet) combines the go-back-N retransmission mechanism, priority-based flow control (PFC) and congestion control (CC) algorithms to achieve the low latency, low CPU overhead and high bandwidth required by data center networks (DCN). However, when faced with scenarios such as multi-path and adaptive routing that may lead to out-of-order packets, RoCE is prone to serious throughput degradation. This paper proposes an improved Selective Acknowledgement (SACK) algorithm for RoCE (SACK-RoCE) to solve the above problem. The SACK-RoCE includes three mechanisms: packet trace, out-of-order packet detection, and lost packets retransmission. In simulation, we test the performance of the SACK-RoCE in both single flow and real-world flows environment. The SACK-RoCE improves the throughput by 7 times compared to RoCE and can almost keep the number of retransmission times consistent with the number of lost packets. As for real loads, the SACK-RoCE outperforms the improved RoCE NIC (IRN) by 12.05%∼22.32% on average FCT, tail FCT and average slowdown metrics. In addition, the SACK-RoCE adds only 315 bits of memory usage per link, which makes the algorithm easy to deploy.