Deterministic end-to-end delay guarantees with rate controlled EDF scheduling

Performance Evaluation(2006)

引用 11|浏览0
暂无评分
摘要
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. Earliest Deadline First (EDF) scheduling, in conjunction with per-hop traffic shaping (jointly called Rate Controlled EDF or RC-EDF) has been recognised as an effective means of end-to-end deterministic delay provisioning. This paper addresses the issue of identifying RC-EDF shaping parameters that realize maximal network utilizations. We first prove that finding "optimal" shapers is in general infeasible, and then propose a heuristic choice derived from the flow's hop-length. Our choice varies gracefully between known optimal settings for the limiting values of the hop-length, and outperforms shaper selections proposed previously in the literature.
更多
查看译文
关键词
deterministic end-to-end delay guarantee,rate controlled edf,end-to-end deterministic delay,optimal setting,edf scheduling,end-to-end delay guarantee,important issue,per-hop traffic shaping,end-to-end delay guarantee.,earliest deadline first,effective mean,general infeasible,broadband packet network,heuristic choice,traffic shaping,shape parameter,quality of service,end to end delay
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要