{"title":"提出了一种新的数据包调度算法，可以减少小数据包的延迟","authors":"T. Matsuda, E. Horiuchi, T. Yokotani","doi":"10.1109/GCCE.2012.6379596","DOIUrl":null,"url":null,"abstract":"Eligibility Based Round Robin (EBRR) scheduler proposed by Lenzini et al. is a packet scheduling algorithm which can be considered as an extension of Surplus Round Robin (SRR), computational complexity of which is O(1) even when quantum size is less than the maximum packet size. In this paper, we propose an extension of EBRR which makes it possible to transmit packets smaller than a threshold prior to packets larger than the threshold among packets received in one scheduling round. It can be used in Home Gateway. The computational complexity of the proposed algorithm is O(1).","PeriodicalId":299732,"journal":{"name":"The 1st IEEE Global Conference on Consumer Electronics 2012","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A proposal of a new packet scheduling algorithm which can reduce the delay of small packets\",\"authors\":\"T. Matsuda, E. Horiuchi, T. Yokotani\",\"doi\":\"10.1109/GCCE.2012.6379596\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Eligibility Based Round Robin (EBRR) scheduler proposed by Lenzini et al. is a packet scheduling algorithm which can be considered as an extension of Surplus Round Robin (SRR), computational complexity of which is O(1) even when quantum size is less than the maximum packet size. In this paper, we propose an extension of EBRR which makes it possible to transmit packets smaller than a threshold prior to packets larger than the threshold among packets received in one scheduling round. It can be used in Home Gateway. The computational complexity of the proposed algorithm is O(1).\",\"PeriodicalId\":299732,\"journal\":{\"name\":\"The 1st IEEE Global Conference on Consumer Electronics 2012\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 1st IEEE Global Conference on Consumer Electronics 2012\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCCE.2012.6379596\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 1st IEEE Global Conference on Consumer Electronics 2012","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCCE.2012.6379596","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
Lenzini等人提出的基于资格的轮询调度(Eligibility Based Round Robin, EBRR)是一种数据包调度算法，可以看作是盈余轮询调度(Surplus Round Robin, SRR)的扩展，即使量子大小小于最大数据包大小，其计算复杂度也为0(1)。在本文中，我们提出了EBRR的一种扩展，使得在一个调度轮中接收的数据包可以在大于阈值的数据包之前发送小于阈值的数据包。可用于家庭网关。该算法的计算复杂度为0(1)。
A proposal of a new packet scheduling algorithm which can reduce the delay of small packets
Eligibility Based Round Robin (EBRR) scheduler proposed by Lenzini et al. is a packet scheduling algorithm which can be considered as an extension of Surplus Round Robin (SRR), computational complexity of which is O(1) even when quantum size is less than the maximum packet size. In this paper, we propose an extension of EBRR which makes it possible to transmit packets smaller than a threshold prior to packets larger than the threshold among packets received in one scheduling round. It can be used in Home Gateway. The computational complexity of the proposed algorithm is O(1).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
