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}
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.