.png){kind=icon}
返回
A network calculus with effective bandwidth
.png){kind=icon}
PRE
AI
DOI：10.1109/TNET.2007.896501.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper establishes a link between two principal tools for the analysis of network traffic, namely, effective bandwidth and network calculus. It is shown that a general version of effective bandwidth can be expressed within the framework of a probabilistic version of the network calculus, where both arrivals and service are specified in terms of probabilistic bounds. By formulating well-known effective bandwidth expressions in terms of probabilistic envelope functions, the developed network calculus can be applied to a wide range of traffic types, including traffic that has self-similar characteristics. As applications, probabilistic lower bounds are presented on the service given by three different scheduling algorithms: Static Priority, Earliest Deadline First, and Generalized Processor Sharing. Numerical examples show the impact of specific traffic models and scheduling algorithms on the multiplexing gain in a network.
Keyword:
effective bandwidth
network calculus
QoS
statistical multiplexing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
.png){kind=icon}
Chlorinated Phenols as Metabolites of Lindane. Evaluation of the Degree of Conjugation in Rat Urine
PREAI
分享收藏分享收藏
查看更多内容