Deterministic upper bounds on performance of generalized processor sharing based on fractal regulators
|更新时间:2024-10-14
|
Deterministic upper bounds on performance of generalized processor sharing based on fractal regulators
Issue 2, Pages: 51-57(2007)
作者机构:
湖南师范大学物理与信息科学学院 2. 中南大学信息科学与工程学院 3. 清华大学计算机科学与技术系
作者简介:
基金信息:
DOI:
CLC:P228.4
Published:2007
稿件说明:
移动端阅览
ZHANG Lian-ming1, CHEN Zhi-gang2, ZHAO Ming2, et al. Deterministic upper bounds on performance of generalized processor sharing based on fractal regulators[J]. 2007, (2): 51-57.
DOI:
ZHANG Lian-ming1, CHEN Zhi-gang2, ZHAO Ming2, et al. Deterministic upper bounds on performance of generalized processor sharing based on fractal regulators[J]. 2007, (2): 51-57.DOI:
Deterministic upper bounds on performance of generalized processor sharing based on fractal regulators
In order to get exact bounds problems encountered in networking with self-similar input traffic
a fractal regu-lator was introduced into the ingress of a generalized processor sharing(GPS) system for regulating the self-similar traf-fic
and a model was presented based on fractal regulator and GPS.The deterministic bounds on queue length
delay
de-lay jitter and effective bandwidth of the system with self-similar input traffic were derived using network calculus.Nu-merical simulations demonstrate that the bound models of a GPS system based on fractal regulators using network calcu-lus are suited for the networks with self-similar input traffic.