{"title":"Workconserving vs. non-workconserving packet scheduling: an issue revisited","authors":"org Liebeherr, Erhan Yilmaz","doi":"10.1109/IWQOS.1999.766500","DOIUrl":null,"url":null,"abstract":"Many packet schedulers for QoS networks are equipped with a rate control mechanism. The function of a rate control mechanism (rate controller) is to buffer packets from flows which exceed their negotiated traffic profile. It has been established that rate controllers lead to reduced buffer requirements at packet switches, and do not increase the worst-case delays in a deterministic service. On the other hand, rate controllers make a scheduler non-workconserving, and, thus, may yield higher average end-to-end delays. In this study, we show that by properly modifying a rate controller, one can design a scheduler which balances buffer requirements against average delays. We present a scheduler, called earliness-based earliest deadline first (EEDF), which achieves such a balancing using a tunable rate control mechanism. In simulation experiments, we compare EEDP with a rate-controlled EDF scheduler and a workconserving version of EDF.","PeriodicalId":435117,"journal":{"name":"1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQOS.1999.766500","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22
Abstract
Many packet schedulers for QoS networks are equipped with a rate control mechanism. The function of a rate control mechanism (rate controller) is to buffer packets from flows which exceed their negotiated traffic profile. It has been established that rate controllers lead to reduced buffer requirements at packet switches, and do not increase the worst-case delays in a deterministic service. On the other hand, rate controllers make a scheduler non-workconserving, and, thus, may yield higher average end-to-end delays. In this study, we show that by properly modifying a rate controller, one can design a scheduler which balances buffer requirements against average delays. We present a scheduler, called earliness-based earliest deadline first (EEDF), which achieves such a balancing using a tunable rate control mechanism. In simulation experiments, we compare EEDP with a rate-controlled EDF scheduler and a workconserving version of EDF.