{"title":"Optimization of Scheduling Algorithms Parameters in a DiffServ Environment","authors":"D. Adami, S. Giordano, M. Pagano, R. Secchi","doi":"10.1109/SAINTW.2005.91","DOIUrl":null,"url":null,"abstract":"In this paper, we evaluate the performance achieved by DWRR and WFQ, the widespread implementations of frame-based and sorted-priority schedulers respectively, in a high speed DiffServ environment. Using deterministic upper bounds of the end-to-end delay, we evaluate the schedulers behavior for a wide range of bandwidth configurations. Our analysis highlights the drawbacks of using frame-based scheduling with respect to sorted-priority when dealing with multiple classes of service. As a consequence, we propose a configuration of scheduler weights, which allows to contain the loss in performance of frame-based schemes, while minimizing the end-to-end delay for premium classes. Extensive simulations confirm our theoretical propositions and show the effectiveness of our method in satisfying hard quality of service requirements even in highly congested networks.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAINTW.2005.91","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper, we evaluate the performance achieved by DWRR and WFQ, the widespread implementations of frame-based and sorted-priority schedulers respectively, in a high speed DiffServ environment. Using deterministic upper bounds of the end-to-end delay, we evaluate the schedulers behavior for a wide range of bandwidth configurations. Our analysis highlights the drawbacks of using frame-based scheduling with respect to sorted-priority when dealing with multiple classes of service. As a consequence, we propose a configuration of scheduler weights, which allows to contain the loss in performance of frame-based schemes, while minimizing the end-to-end delay for premium classes. Extensive simulations confirm our theoretical propositions and show the effectiveness of our method in satisfying hard quality of service requirements even in highly congested networks.