{"title":"RIO的分数指数耦合","authors":"Wen-Ping Lai, Zhen Liu","doi":"10.1109/CSE.2010.35","DOIUrl":null,"url":null,"abstract":"The IETF Differentiated Service (DiffServ) architecture can allow for establishing a modern large scale network which guarantees the quality of service. In order to realize the multiple levels of packet drop precedence required for the Assured Forwarding (AF) framework of DiffServ, a multi-level RED algorithm is needed. RIO (RED with In/Out) is suitable for the AF scheme, and two major RIO variants such as RIO-D and RIO-C have been proposed and widely used. Both use the average lengths of virtual queues to determine the multiple levels of drop precedence and have different coupling strengths between virtual queues. The key difference between RIO-C and RIO-D lies with the fact that RIO-C takes full coupling and RIO-D has zero coupling. In this paper, a novel algorithm called RIO-FEC (RIO based on Fractional Exponent Coupling for determining the coupling strength) is proposed, and can achieve partial coupling with a controllable coupling power for calculating each average virtual queue length. The effects of the fractional exponent based coupling on the drop rates and throughputs of color-labeled virtual queues are analyzed, and a fractional power 1/3 is found to be optimal. The queue weight factor for calculating the EWMAs (Exponential Weighted Moving Averages) of virtual queue lengths, thus affecting the drop probability, is also presented. The results show that the proposed algorithm can achieve a total drop rate and a total throughput as good as RIO-D. Furthermore, RIO-FEC outperforms RIO-C and RIO-D in terms of preventing the lowest-priority virtual queue from bandwidth starvation, and can effectively adjudge the coupling strengths to gain the desired control on the allocation of priority and fairness.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Fractional Exponent Coupling of RIO\",\"authors\":\"Wen-Ping Lai, Zhen Liu\",\"doi\":\"10.1109/CSE.2010.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The IETF Differentiated Service (DiffServ) architecture can allow for establishing a modern large scale network which guarantees the quality of service. In order to realize the multiple levels of packet drop precedence required for the Assured Forwarding (AF) framework of DiffServ, a multi-level RED algorithm is needed. RIO (RED with In/Out) is suitable for the AF scheme, and two major RIO variants such as RIO-D and RIO-C have been proposed and widely used. Both use the average lengths of virtual queues to determine the multiple levels of drop precedence and have different coupling strengths between virtual queues. The key difference between RIO-C and RIO-D lies with the fact that RIO-C takes full coupling and RIO-D has zero coupling. In this paper, a novel algorithm called RIO-FEC (RIO based on Fractional Exponent Coupling for determining the coupling strength) is proposed, and can achieve partial coupling with a controllable coupling power for calculating each average virtual queue length. The effects of the fractional exponent based coupling on the drop rates and throughputs of color-labeled virtual queues are analyzed, and a fractional power 1/3 is found to be optimal. The queue weight factor for calculating the EWMAs (Exponential Weighted Moving Averages) of virtual queue lengths, thus affecting the drop probability, is also presented. The results show that the proposed algorithm can achieve a total drop rate and a total throughput as good as RIO-D. Furthermore, RIO-FEC outperforms RIO-C and RIO-D in terms of preventing the lowest-priority virtual queue from bandwidth starvation, and can effectively adjudge the coupling strengths to gain the desired control on the allocation of priority and fairness.\",\"PeriodicalId\":342688,\"journal\":{\"name\":\"2010 13th IEEE International Conference on Computational Science and Engineering\",\"volume\":\"2018 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 13th IEEE International Conference on Computational Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSE.2010.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 13th IEEE International Conference on Computational Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSE.2010.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
IETF差分服务(DiffServ)体系结构可以建立保证服务质量的现代大规模网络。为了实现DiffServ的保证转发(AF)框架所要求的多级丢包优先级,需要一种多级RED算法。里约热内卢(RED with In/Out)适用于AF方案,目前已有两种主要的里约热内卢变体RIO- d和RIO- c被提出并广泛使用。两者都使用虚拟队列的平均长度来确定多级丢弃优先级,并且在虚拟队列之间具有不同的耦合强度。RIO-C和RIO-D的关键区别在于RIO-C采用全耦合,而RIO-D为零耦合。本文提出了一种基于分数指数耦合(里约热内卢based on Fractional Exponent Coupling,用于确定耦合强度)的新算法RIO- fec,该算法可以实现部分耦合,并以可控的耦合功率计算每个平均虚拟队列长度。分析了基于分数次幂的耦合对彩色标记虚拟队列的丢包率和吞吐量的影响,发现分数次幂为1/3是最优的。本文还提出了用于计算虚拟队列长度的指数加权移动平均(ewma)从而影响掉线概率的队列权重因子。结果表明,该算法可以达到与RIO-D相同的总丢包率和总吞吐量。此外,RIO-FEC在防止最低优先级虚拟队列带宽耗尽方面优于RIO-C和RIO-D,并能有效地判断耦合强度以获得所需的优先级分配控制和公平性。
The IETF Differentiated Service (DiffServ) architecture can allow for establishing a modern large scale network which guarantees the quality of service. In order to realize the multiple levels of packet drop precedence required for the Assured Forwarding (AF) framework of DiffServ, a multi-level RED algorithm is needed. RIO (RED with In/Out) is suitable for the AF scheme, and two major RIO variants such as RIO-D and RIO-C have been proposed and widely used. Both use the average lengths of virtual queues to determine the multiple levels of drop precedence and have different coupling strengths between virtual queues. The key difference between RIO-C and RIO-D lies with the fact that RIO-C takes full coupling and RIO-D has zero coupling. In this paper, a novel algorithm called RIO-FEC (RIO based on Fractional Exponent Coupling for determining the coupling strength) is proposed, and can achieve partial coupling with a controllable coupling power for calculating each average virtual queue length. The effects of the fractional exponent based coupling on the drop rates and throughputs of color-labeled virtual queues are analyzed, and a fractional power 1/3 is found to be optimal. The queue weight factor for calculating the EWMAs (Exponential Weighted Moving Averages) of virtual queue lengths, thus affecting the drop probability, is also presented. The results show that the proposed algorithm can achieve a total drop rate and a total throughput as good as RIO-D. Furthermore, RIO-FEC outperforms RIO-C and RIO-D in terms of preventing the lowest-priority virtual queue from bandwidth starvation, and can effectively adjudge the coupling strengths to gain the desired control on the allocation of priority and fairness.