同时提高高优先级和低优先级吞吐量的条件

K. Yamaoka, K. Katoh, Loong Chee-yuh, Y. Sakai
{"title":"同时提高高优先级和低优先级吞吐量的条件","authors":"K. Yamaoka, K. Katoh, Loong Chee-yuh, Y. Sakai","doi":"10.1109/PACRIM.2001.953707","DOIUrl":null,"url":null,"abstract":"There is a conservation law that states that the sum of the average queuing delays within a set of multiplexed flow is independent of priority control. However with reference to ARQ specifically, we can adopt the idea of \"goodput\" (normalized throughput) to evaluate the efficiency of the transmission. With this, we discover that there are cases when the goodput of high-prioritized and low-prioritized flows can both improve at the same time. To achieve this, we will need routers that are able to handle priority control adaptively. This is confirmed theoretically in this paper, which uses a simple go-back-N model as a basis for calculation.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The condition of improving throughput both of high and low priority at the same time\",\"authors\":\"K. Yamaoka, K. Katoh, Loong Chee-yuh, Y. Sakai\",\"doi\":\"10.1109/PACRIM.2001.953707\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There is a conservation law that states that the sum of the average queuing delays within a set of multiplexed flow is independent of priority control. However with reference to ARQ specifically, we can adopt the idea of \\\"goodput\\\" (normalized throughput) to evaluate the efficiency of the transmission. With this, we discover that there are cases when the goodput of high-prioritized and low-prioritized flows can both improve at the same time. To achieve this, we will need routers that are able to handle priority control adaptively. This is confirmed theoretically in this paper, which uses a simple go-back-N model as a basis for calculation.\",\"PeriodicalId\":261724,\"journal\":{\"name\":\"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.2001.953707\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2001.953707","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

有一个守恒定律指出,在一组多路复用流中,平均排队延迟的总和与优先级控制无关。但具体到ARQ,我们可以采用“goodput”(标准化吞吐量)的概念来评估传输效率。有了这个,我们发现在某些情况下,高优先级和低优先级的流的goodput可以同时提高。为了实现这一点,我们需要能够自适应处理优先级控制的路由器。本文从理论上证实了这一点,并使用简单的go-back-N模型作为计算基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The condition of improving throughput both of high and low priority at the same time
There is a conservation law that states that the sum of the average queuing delays within a set of multiplexed flow is independent of priority control. However with reference to ARQ specifically, we can adopt the idea of "goodput" (normalized throughput) to evaluate the efficiency of the transmission. With this, we discover that there are cases when the goodput of high-prioritized and low-prioritized flows can both improve at the same time. To achieve this, we will need routers that are able to handle priority control adaptively. This is confirmed theoretically in this paper, which uses a simple go-back-N model as a basis for calculation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信