QoS的性能分析保证了在可扩展数量的流上调度规则

Y. Kado, R. Konuma, M. Fujita, M. Murata, H. Miyahara
{"title":"QoS的性能分析保证了在可扩展数量的流上调度规则","authors":"Y. Kado, R. Konuma, M. Fujita, M. Murata, H. Miyahara","doi":"10.1109/ATM.1999.786775","DOIUrl":null,"url":null,"abstract":"Scalability is one of key issues for cell scheduling disciplines in ATM (asynchronous transfer mode) switches when QoS of individual flows are guaranteed. In this paper, we show that a classed and chained queue (CCQ) scheduling discipline can provide better bandwidth guarantees of scalable number of flows compared with existing methods.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Performance analysis of QoS guarantees scheduling disciplines over scalable number of flows\",\"authors\":\"Y. Kado, R. Konuma, M. Fujita, M. Murata, H. Miyahara\",\"doi\":\"10.1109/ATM.1999.786775\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scalability is one of key issues for cell scheduling disciplines in ATM (asynchronous transfer mode) switches when QoS of individual flows are guaranteed. In this paper, we show that a classed and chained queue (CCQ) scheduling discipline can provide better bandwidth guarantees of scalable number of flows compared with existing methods.\",\"PeriodicalId\":266412,\"journal\":{\"name\":\"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATM.1999.786775\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATM.1999.786775","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在保证单个流的QoS的情况下,可伸缩性是ATM(异步传输模式)交换机中单元调度学科的关键问题之一。在本文中,我们证明了与现有方法相比,分类和链式队列(CCQ)调度规则可以提供更好的可伸缩流数量的带宽保证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Performance analysis of QoS guarantees scheduling disciplines over scalable number of flows
Scalability is one of key issues for cell scheduling disciplines in ATM (asynchronous transfer mode) switches when QoS of individual flows are guaranteed. In this paper, we show that a classed and chained queue (CCQ) scheduling discipline can provide better bandwidth guarantees of scalable number of flows compared with existing methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信