{"title":"自调节阻塞:一种用于拥塞控制和公平带宽分配的主动队列管理算法","authors":"Ying Jiang, M. Hamdi, J. Liu","doi":"10.1109/ISCC.2003.1214249","DOIUrl":null,"url":null,"abstract":"Queue management and congestion control are very important to the robustness and fairness of the Internet. In this paper, a new queue management algorithm, termed self adjustable choke (SAC) is proposed to achieve both fairness and congestion control in an Internet router. It is based on the well-known RED algorithm and a recently proposed CHOKe algorithm. The SAC scheme has kept the advantages of simplicity and lower processing cost of RED and CHOKe, while solving their unfair bandwidth allocation properties. In particular, the SAC scheme treats TCP and UDP flows differently, and can adaptively adjust its parameters according to the current traffic status. As a result, using the SAC, bandwidth is distributed evenly among different flows, no matter how different these flows are. This will be demonstrated and compared to CHOKe using experimental results under various traffic scenarios.","PeriodicalId":356589,"journal":{"name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Self adjustable CHOKe: an active queue management algorithm for congestion control and fair bandwidth allocation\",\"authors\":\"Ying Jiang, M. Hamdi, J. Liu\",\"doi\":\"10.1109/ISCC.2003.1214249\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Queue management and congestion control are very important to the robustness and fairness of the Internet. In this paper, a new queue management algorithm, termed self adjustable choke (SAC) is proposed to achieve both fairness and congestion control in an Internet router. It is based on the well-known RED algorithm and a recently proposed CHOKe algorithm. The SAC scheme has kept the advantages of simplicity and lower processing cost of RED and CHOKe, while solving their unfair bandwidth allocation properties. In particular, the SAC scheme treats TCP and UDP flows differently, and can adaptively adjust its parameters according to the current traffic status. As a result, using the SAC, bandwidth is distributed evenly among different flows, no matter how different these flows are. This will be demonstrated and compared to CHOKe using experimental results under various traffic scenarios.\",\"PeriodicalId\":356589,\"journal\":{\"name\":\"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC.2003.1214249\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2003.1214249","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Self adjustable CHOKe: an active queue management algorithm for congestion control and fair bandwidth allocation
Queue management and congestion control are very important to the robustness and fairness of the Internet. In this paper, a new queue management algorithm, termed self adjustable choke (SAC) is proposed to achieve both fairness and congestion control in an Internet router. It is based on the well-known RED algorithm and a recently proposed CHOKe algorithm. The SAC scheme has kept the advantages of simplicity and lower processing cost of RED and CHOKe, while solving their unfair bandwidth allocation properties. In particular, the SAC scheme treats TCP and UDP flows differently, and can adaptively adjust its parameters according to the current traffic status. As a result, using the SAC, bandwidth is distributed evenly among different flows, no matter how different these flows are. This will be demonstrated and compared to CHOKe using experimental results under various traffic scenarios.