基于EDF调度的端到端延迟保证的流量整形

V. Sivaraman, F. Chiussi, Mario Gerla
{"title":"基于EDF调度的端到端延迟保证的流量整形","authors":"V. Sivaraman, F. Chiussi, Mario Gerla","doi":"10.1109/IWQOS.2000.847934","DOIUrl":null,"url":null,"abstract":"The provision of quality of service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Of the various packet scheduling schemes that have been proposed in the literature, earliest deadline first (EDF) scheduling in conjunction with per-hop traffic shaping (jointly referred to as rate-controlled EDF or RC-EDF) has been recognized as an effective means of end-to-end deterministic delay provisioning. An important aspect that has not been addressed satisfactorily in the literature, however, concerns the choice of RC-EDF shaping parameters that realize maximal network utilizations. In this paper, we first establish that except in trivial cases, it is infeasible to identify \"optimal\" shapers that realize maximal RC-EDF schedulable regions. Ascertaining the optimal flow shaper requires the state of the entire network to be considered, making it computationally impractical. We then propose an heuristic choice of shaper derived from the number of hops traversed by the flow. The resulting shaper is easy to compute, and varies gracefully between the known optimal shapers for limiting values of the hop-length. We show via simulations that for a realistic traffic mix, our choice of shaper allows RC-EDF to outperform the GPS (generalized processor sharing) scheduling discipline as well as RC-EDF disciplines that use shapers chosen independent of the flow hop-length.","PeriodicalId":416650,"journal":{"name":"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":"{\"title\":\"Traffic shaping for end-to-end delay guarantees with EDF scheduling\",\"authors\":\"V. Sivaraman, F. Chiussi, Mario Gerla\",\"doi\":\"10.1109/IWQOS.2000.847934\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The provision of quality of service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Of the various packet scheduling schemes that have been proposed in the literature, earliest deadline first (EDF) scheduling in conjunction with per-hop traffic shaping (jointly referred to as rate-controlled EDF or RC-EDF) has been recognized as an effective means of end-to-end deterministic delay provisioning. An important aspect that has not been addressed satisfactorily in the literature, however, concerns the choice of RC-EDF shaping parameters that realize maximal network utilizations. In this paper, we first establish that except in trivial cases, it is infeasible to identify \\\"optimal\\\" shapers that realize maximal RC-EDF schedulable regions. Ascertaining the optimal flow shaper requires the state of the entire network to be considered, making it computationally impractical. We then propose an heuristic choice of shaper derived from the number of hops traversed by the flow. The resulting shaper is easy to compute, and varies gracefully between the known optimal shapers for limiting values of the hop-length. We show via simulations that for a realistic traffic mix, our choice of shaper allows RC-EDF to outperform the GPS (generalized processor sharing) scheduling discipline as well as RC-EDF disciplines that use shapers chosen independent of the flow hop-length.\",\"PeriodicalId\":416650,\"journal\":{\"name\":\"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"35\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWQOS.2000.847934\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQOS.2000.847934","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 35

摘要

为实时应用提供端到端时延保证的服务质量(QoS)是新兴宽带分组网络中的一个重要问题。在文献中提出的各种包调度方案中,最早截止日期优先(EDF)调度结合每跳流量整形(统称为速率控制EDF或RC-EDF)已被认为是端到端确定性延迟供应的有效手段。然而,在文献中没有令人满意地解决的一个重要方面是,RC-EDF整形参数的选择,以实现最大的网络利用率。在本文中,我们首先证明了,除了在一些平凡的情况下,辨识出实现最大RC-EDF可调度区域的“最优”成形器是不可行的。确定最优流形器需要考虑整个网络的状态,这在计算上是不切实际的。然后,我们提出了一种启发式选择形状器,该形状器由流所经过的跳数推导而来。生成的形状器易于计算,并且在已知的最优形状器之间优雅地变化以限制跳长值。我们通过模拟表明,对于现实的流量组合,我们选择的整形器允许RC-EDF优于GPS(通用处理器共享)调度规则以及RC-EDF规则,这些规则使用独立于流跳长选择的整形器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Traffic shaping for end-to-end delay guarantees with EDF scheduling
The provision of quality of service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Of the various packet scheduling schemes that have been proposed in the literature, earliest deadline first (EDF) scheduling in conjunction with per-hop traffic shaping (jointly referred to as rate-controlled EDF or RC-EDF) has been recognized as an effective means of end-to-end deterministic delay provisioning. An important aspect that has not been addressed satisfactorily in the literature, however, concerns the choice of RC-EDF shaping parameters that realize maximal network utilizations. In this paper, we first establish that except in trivial cases, it is infeasible to identify "optimal" shapers that realize maximal RC-EDF schedulable regions. Ascertaining the optimal flow shaper requires the state of the entire network to be considered, making it computationally impractical. We then propose an heuristic choice of shaper derived from the number of hops traversed by the flow. The resulting shaper is easy to compute, and varies gracefully between the known optimal shapers for limiting values of the hop-length. We show via simulations that for a realistic traffic mix, our choice of shaper allows RC-EDF to outperform the GPS (generalized processor sharing) scheduling discipline as well as RC-EDF disciplines that use shapers chosen independent of the flow hop-length.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信