.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
We present an end-to-end delay guarantee theorem for a class of guaranteed-deadline (GD) servers. The theorem can be instantiated to obtain end-to end delay bounds for a variety of source control mechanisms and GD servers, We then propose the idea of group priority, and specialize the theorem to a subclass of GD servers that use group priority in packet scheduling. With the use of group priority, the work of packet schedulers can be substantially reduced, We work out a detailed example, for the class of burst scheduling networks, to illustrate how group sizes can be designed such that the worst case end-to-end delay of application data units in a real-time how is unaffected by the use of group priority, Group priority also fan be used in packet schedulers that provide integrated services (best effort as well as real-time services) to achieve statistical performance gains, which we illustrate with empirical results from simulation experiments.
Keyword:
AgM block transfer
burst scheduling network
delay guarantee
group priority
integrated services
packet scheduling
real-time flow
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享.png){kind=icon}
收藏Carbocyclic ring expansions with alkyne and carbene sources mediated by nickel(0) complexes: Structure of the critical organonickel intermediates.png)
Tetrahedron.png)
TetrahedronIF0
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容