Performance analysis of networks of queues under active queue management scheme

被引:4
作者
Awan, Irfan [1 ]
Ahmad, Bashir
Ahmad, Shakeel
机构
[1] Univ Bradford, Dept Comp, Mobile Comp Networks & Secur Res Grp, Bradford BD7 1DP, W Yorkshire, England
[2] Gomal Univ, Inst Comp & Informat Technol, Dera Ismail Khan, NWFP, Pakistan
关键词
queue thresholds; queueing networks; performance evaluation;
D O I
10.1016/j.simpat.2006.11.013
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Analysis of networks of queues under repetitive service blocking mechanism has been presented in this paper. Nodes are connected according to an arbitrary configuration and each node in the networks employs an active queue management (AQM) based queueing policy to guarantee certain quality of service for multiple class external traffic. This buffer management scheme has been implemented using queue thresholds. The use of queue thresholds is a well known technique for network traffic congestion control. The analysis is based on a queue-by-queue decomposition technique where each queue is modelled as a GE/GE/1/N queue with single server, R (R >= 2) distinct traffic classes and {N = N-1, N-2, ... N-R) buffer threshold values per class under first-come-first-serve (FCFS) service rule. The external traffic is modelled using the generalised exponential (GE) distribution which can capture the bursty property of network traffic. The analytical solution is obtained using the maximum entropy (ME) principle. The forms of the state and blocking probabilities are analytically established at equilibrium via appropriate mean value constraints. The initial numerical results demonstrate the credibility of the proposed analytical solution. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:416 / 425
页数:10
相关论文
共 20 条
[1]  
AHMAD S, 2004, RES0406 ICIT GOM U
[2]  
Akyildiz I. F, 1992, P 2 INT WORKSH QUEUE, P258
[3]  
Altiok Tayfur., 1987, Annals of Operations Research, V9, P481
[4]  
[Anonymous], RFC
[5]  
Balsamo S., 2001, Analysis of queueing networks with block- ing
[6]   OPEN, CLOSED, AND MIXED NETWORKS OF QUEUES WITH DIFFERENT CLASSES OF CUSTOMERS [J].
BASKETT, F ;
CHANDY, KM ;
MUNTZ, RR ;
PALACIOS, FG .
JOURNAL OF THE ACM, 1975, 22 (02) :248-260
[7]   APPROXIMATE ANALYSIS OF GENERAL QUEUING NETWORKS [J].
CHANDY, KM ;
HERZOG, U ;
WOO, L .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1975, 19 (01) :43-49
[8]  
FERNADES PM, 2002, 1 WORKSH HOT TOP NET
[9]  
HONG D, 1991, IEEE NETWORK MAG JUL, P10
[10]   INFORMATION THEORY AND STATISTICAL MECHANICS [J].
JAYNES, ET .
PHYSICAL REVIEW, 1957, 106 (04) :620-630