{"title":"一种具有优先动态阈值部署的RED方案","authors":"Lijun Sun, Lihong Wang","doi":"10.1109/CIS.WORKSHOPS.2007.147","DOIUrl":null,"url":null,"abstract":"Congestion control mechanisms in Internet have attracted more attention in network studies. To the high loss rate and synchronization resulted from drop tail policy, random early detection (RED) and its variations were reported. In this paper, a novel algorithm named preferential dynamic threshold - RED (PDT-RED) and its optimized scheme OPDT-RED are proposed. They can adjust dynamically average queue length thresholds basing on packets' priority and unused buffer space, and accordingly realizes differentiated service. Compared with RED, OPDT-RED algorithm has three features: 1) it reduces greatly the loss rate of packets with higher priority and the average loss rate of all packets; 2) it is simple for implementation; 3) it satisfies higher buffer utilization.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Novel RED Scheme with Preferential Dynamic Threshold Deployment\",\"authors\":\"Lijun Sun, Lihong Wang\",\"doi\":\"10.1109/CIS.WORKSHOPS.2007.147\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Congestion control mechanisms in Internet have attracted more attention in network studies. To the high loss rate and synchronization resulted from drop tail policy, random early detection (RED) and its variations were reported. In this paper, a novel algorithm named preferential dynamic threshold - RED (PDT-RED) and its optimized scheme OPDT-RED are proposed. They can adjust dynamically average queue length thresholds basing on packets' priority and unused buffer space, and accordingly realizes differentiated service. Compared with RED, OPDT-RED algorithm has three features: 1) it reduces greatly the loss rate of packets with higher priority and the average loss rate of all packets; 2) it is simple for implementation; 3) it satisfies higher buffer utilization.\",\"PeriodicalId\":409737,\"journal\":{\"name\":\"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)\",\"volume\":\"89 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.WORKSHOPS.2007.147\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.147","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Novel RED Scheme with Preferential Dynamic Threshold Deployment
Congestion control mechanisms in Internet have attracted more attention in network studies. To the high loss rate and synchronization resulted from drop tail policy, random early detection (RED) and its variations were reported. In this paper, a novel algorithm named preferential dynamic threshold - RED (PDT-RED) and its optimized scheme OPDT-RED are proposed. They can adjust dynamically average queue length thresholds basing on packets' priority and unused buffer space, and accordingly realizes differentiated service. Compared with RED, OPDT-RED algorithm has three features: 1) it reduces greatly the loss rate of packets with higher priority and the average loss rate of all packets; 2) it is simple for implementation; 3) it satisfies higher buffer utilization.