{"title":"Deadline Enables In-Order Flowlet Switching for Load Balancing","authors":"Xinglong Diao, Wenting Wei, Huaxi Gu","doi":"10.1145/3600061.3603126","DOIUrl":null,"url":null,"abstract":"Fine granularity can greatly enhance load balancing opportunities, but packet reordering is still a challenge. In this paper, we propose EDFLet, a flowlet switching mechanism that uses deadlines to achieve in-order flowlet-level load balancing. We assign a deadline value to each packet of a flowlet based on its burst interval, which ensures that an earlier flowlet completes transmission before the next flowlet of the same flow. We also apply Earliest Deadline First scheduling at the switch, which guarantees that packets that packets meet their deadlines and arrive in order at the receiver. Our experimental results show that EDFLet performs better than existing methods in both symmetric and asymmetric topologies.","PeriodicalId":228934,"journal":{"name":"Proceedings of the 7th Asia-Pacific Workshop on Networking","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th Asia-Pacific Workshop on Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3600061.3603126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Fine granularity can greatly enhance load balancing opportunities, but packet reordering is still a challenge. In this paper, we propose EDFLet, a flowlet switching mechanism that uses deadlines to achieve in-order flowlet-level load balancing. We assign a deadline value to each packet of a flowlet based on its burst interval, which ensures that an earlier flowlet completes transmission before the next flowlet of the same flow. We also apply Earliest Deadline First scheduling at the switch, which guarantees that packets that packets meet their deadlines and arrive in order at the receiver. Our experimental results show that EDFLet performs better than existing methods in both symmetric and asymmetric topologies.