Bounds for multiplexing leaky-bucket enforced sources in ATM networks

NCU Institutional Repository > 資訊電機學院 > 電機工程研究所 > 期刊論文 > Item 987654321/29328

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29328

题名:	Bounds for multiplexing leaky-bucket enforced sources in ATM networks
作者:	Wu,JS;Kuo,FJ
贡献者:	電機工程研究所
日期:	1996
上传时间:	2010-06-29 20:21:54 (UTC+8)
出版者:	中央大學
摘要:	Leaky-bucket (LB) based traffic parameters are widely used for traffic declaration and monitoring (enforcing) in asynchronous transfer mode (ATM) networks. For such a system, every traffic source is policed by an LB enforcer before entering the access node at the edge of the network. In this article, we investigate the characteristics of the model that such traffic sources are multiplexed together by a multiplexer in the edge node. Based on the worst case performance, we derive the upper bound and the lower bound of queue length at the multiplexer as functions of the LB parameters and number of connections. In particular, we also take the peak cell rate, which is an important parameter, into consideration. We also modify the well-known Little's formula which is derived based on long-term average, to be suitable for a complete busy period. It helps us to derive bounds on average waiting time by way of average queue length.
關聯:	INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS
显示于类别:	[電機工程研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	481	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing