Bounds for multiplexing leaky-bucket enforced sources in ATM networks

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Electrical Engineering > journal & Dissertation > Item 987654321/29328

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29328

Title:	Bounds for multiplexing leaky-bucket enforced sources in ATM networks
Authors:	Wu,JS;Kuo,FJ
Contributors:	電機工程研究所
Date:	1996
Issue Date:	2010-06-29 20:21:54 (UTC+8)
Publisher:	中央大學
Abstract:	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.
Relation:	INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS
Appears in Collections:	[Graduate Institute of Electrical Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	481	View/Open

社群 sharing