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.Th...

Full description

Saved in:
Bibliographic Details
Main Authors: ZHANG Lian-ming1, CHEN Zhi-gang2, ZHAO Ming2, WANG Lei3
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2007-01-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/74660693/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1000-436X