基于简单改进FIFO的ATM网络QoS控制

Wen-Tsuen Chen, Wen Lin, Jung-Jyh Lin
{"title":"基于简单改进FIFO的ATM网络QoS控制","authors":"Wen-Tsuen Chen, Wen Lin, Jung-Jyh Lin","doi":"10.1109/ICC.1998.683122","DOIUrl":null,"url":null,"abstract":"Although earliest-deadline-first (EDF) is recognized as the optimal scheduling discipline to support the bounded-delay service in ATM networks, it lacks of the support of a prioritizing scheme for cell loss control. We modify the simple FIFO to implement a near-EDF scheduling discipline with loss control. The proposed scheme can guarantee the stringent delay bound and minimize the cell loss rate. The adaptive queue lengths in the proposed buffer structure can be determined dynamically according to the traffic load and cell delay constraints to minimize the cell loss rates. With the different deterministic adaptive queue lengths, the proposed scheme is equivalent to the other previous schemes. Performance evaluation shows that the proposed scheme's accessible offered load is better than the other schemes.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"QoS control by simple modified FIFO in ATM networks\",\"authors\":\"Wen-Tsuen Chen, Wen Lin, Jung-Jyh Lin\",\"doi\":\"10.1109/ICC.1998.683122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Although earliest-deadline-first (EDF) is recognized as the optimal scheduling discipline to support the bounded-delay service in ATM networks, it lacks of the support of a prioritizing scheme for cell loss control. We modify the simple FIFO to implement a near-EDF scheduling discipline with loss control. The proposed scheme can guarantee the stringent delay bound and minimize the cell loss rate. The adaptive queue lengths in the proposed buffer structure can be determined dynamically according to the traffic load and cell delay constraints to minimize the cell loss rates. With the different deterministic adaptive queue lengths, the proposed scheme is equivalent to the other previous schemes. Performance evaluation shows that the proposed scheme's accessible offered load is better than the other schemes.\",\"PeriodicalId\":218354,\"journal\":{\"name\":\"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.1998.683122\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1998.683122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

虽然最早截止日期优先(EDF)被认为是ATM网络中支持有界延迟业务的最优调度原则,但它缺乏对小区丢失控制的优先级方案的支持。我们修改了简单的FIFO,以实现具有损失控制的近edf调度规则。该方案既能保证严格的延迟约束,又能使小区损失率最小化。所提出的缓冲结构中的自适应队列长度可以根据流量负载和单元延迟约束动态确定,以最小化单元损失率。该方案具有不同的确定性自适应队列长度,与其他方案等效。性能评估表明,该方案的可访问提供负载优于其他方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
QoS control by simple modified FIFO in ATM networks
Although earliest-deadline-first (EDF) is recognized as the optimal scheduling discipline to support the bounded-delay service in ATM networks, it lacks of the support of a prioritizing scheme for cell loss control. We modify the simple FIFO to implement a near-EDF scheduling discipline with loss control. The proposed scheme can guarantee the stringent delay bound and minimize the cell loss rate. The adaptive queue lengths in the proposed buffer structure can be determined dynamically according to the traffic load and cell delay constraints to minimize the cell loss rates. With the different deterministic adaptive queue lengths, the proposed scheme is equivalent to the other previous schemes. Performance evaluation shows that the proposed scheme's accessible offered load is better than the other schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信