{"title":"CCCR:结合CNP和RTT实现数据中心网络的拥塞控制","authors":"Haopeng Li , Dingyu Yan , Yaping Liu , Shuo Zhang","doi":"10.1016/j.simpat.2025.103189","DOIUrl":null,"url":null,"abstract":"<div><div>With the rapid development of cloud computing, AI, and big data, data center networks face challenges in achieving ultra-low latency, high bandwidth, and stability. Many data centers still rely on traditional switches, which lack programmable features for advanced congestion control algorithms. In this environment, existing algorithms like DCQCN and TIMELY face two major challenges: (1) a single congestion signal (such as ECN or RTT) struggles to accurately reflect network conditions, leading to delayed congestion detection; (2) heuristic rate control strategies are prone to causing network fluctuations and slow convergence, making it difficult to meet the demands of high-bandwidth links. To address these issues, we propose CCCR, a congestion control algorithm that combines ECN (via CNP) and RTT signals. CCCR enables rapid, accurate rate reduction using receiver-side feedback and employs a adaptive rate increase based on minimum, average, and target RTT. It also adjusts in-flight data using per-flow BDP estimation. Simulations show that compared to DCQCN, TIMELY, and Swift, CCCR reduces the average flow completion time by 11%, 20%, and 12% respectively in incast scenarios, with better fairness than HPCC, and achieves up to 82% reduction in tail flow completion time for medium flows and up to 74% for long flows. In large-scale simulations, CCCR achieves comparable performance to programmable switch-based HPCC algorithms.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"144 ","pages":"Article 103189"},"PeriodicalIF":3.5000,"publicationDate":"2025-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"CCCR: Combining CNP and RTT for congestion control in datacenter networks\",\"authors\":\"Haopeng Li , Dingyu Yan , Yaping Liu , Shuo Zhang\",\"doi\":\"10.1016/j.simpat.2025.103189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>With the rapid development of cloud computing, AI, and big data, data center networks face challenges in achieving ultra-low latency, high bandwidth, and stability. Many data centers still rely on traditional switches, which lack programmable features for advanced congestion control algorithms. In this environment, existing algorithms like DCQCN and TIMELY face two major challenges: (1) a single congestion signal (such as ECN or RTT) struggles to accurately reflect network conditions, leading to delayed congestion detection; (2) heuristic rate control strategies are prone to causing network fluctuations and slow convergence, making it difficult to meet the demands of high-bandwidth links. To address these issues, we propose CCCR, a congestion control algorithm that combines ECN (via CNP) and RTT signals. CCCR enables rapid, accurate rate reduction using receiver-side feedback and employs a adaptive rate increase based on minimum, average, and target RTT. It also adjusts in-flight data using per-flow BDP estimation. Simulations show that compared to DCQCN, TIMELY, and Swift, CCCR reduces the average flow completion time by 11%, 20%, and 12% respectively in incast scenarios, with better fairness than HPCC, and achieves up to 82% reduction in tail flow completion time for medium flows and up to 74% for long flows. In large-scale simulations, CCCR achieves comparable performance to programmable switch-based HPCC algorithms.</div></div>\",\"PeriodicalId\":49518,\"journal\":{\"name\":\"Simulation Modelling Practice and Theory\",\"volume\":\"144 \",\"pages\":\"Article 103189\"},\"PeriodicalIF\":3.5000,\"publicationDate\":\"2025-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Simulation Modelling Practice and Theory\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1569190X25001248\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Simulation Modelling Practice and Theory","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1569190X25001248","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
CCCR: Combining CNP and RTT for congestion control in datacenter networks
With the rapid development of cloud computing, AI, and big data, data center networks face challenges in achieving ultra-low latency, high bandwidth, and stability. Many data centers still rely on traditional switches, which lack programmable features for advanced congestion control algorithms. In this environment, existing algorithms like DCQCN and TIMELY face two major challenges: (1) a single congestion signal (such as ECN or RTT) struggles to accurately reflect network conditions, leading to delayed congestion detection; (2) heuristic rate control strategies are prone to causing network fluctuations and slow convergence, making it difficult to meet the demands of high-bandwidth links. To address these issues, we propose CCCR, a congestion control algorithm that combines ECN (via CNP) and RTT signals. CCCR enables rapid, accurate rate reduction using receiver-side feedback and employs a adaptive rate increase based on minimum, average, and target RTT. It also adjusts in-flight data using per-flow BDP estimation. Simulations show that compared to DCQCN, TIMELY, and Swift, CCCR reduces the average flow completion time by 11%, 20%, and 12% respectively in incast scenarios, with better fairness than HPCC, and achieves up to 82% reduction in tail flow completion time for medium flows and up to 74% for long flows. In large-scale simulations, CCCR achieves comparable performance to programmable switch-based HPCC algorithms.
期刊介绍:
The journal Simulation Modelling Practice and Theory provides a forum for original, high-quality papers dealing with any aspect of systems simulation and modelling.
The journal aims at being a reference and a powerful tool to all those professionally active and/or interested in the methods and applications of simulation. Submitted papers will be peer reviewed and must significantly contribute to modelling and simulation in general or use modelling and simulation in application areas.
Paper submission is solicited on:
• theoretical aspects of modelling and simulation including formal modelling, model-checking, random number generators, sensitivity analysis, variance reduction techniques, experimental design, meta-modelling, methods and algorithms for validation and verification, selection and comparison procedures etc.;
• methodology and application of modelling and simulation in any area, including computer systems, networks, real-time and embedded systems, mobile and intelligent agents, manufacturing and transportation systems, management, engineering, biomedical engineering, economics, ecology and environment, education, transaction handling, etc.;
• simulation languages and environments including those, specific to distributed computing, grid computing, high performance computers or computer networks, etc.;
• distributed and real-time simulation, simulation interoperability;
• tools for high performance computing simulation, including dedicated architectures and parallel computing.