Analysis of queueing networks with blocking under active queue management scheme

This paper presents a framework for the performance analysis of queueing networks with blocking under active queue management scheme. 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 ges 2) distinct traffic classes and {N = N₁, N₂, ..., N_R} buffer threshold values per class under first-come-first-serve (FCFS) service rule. The use of queue thresholds is a well known technique for network traffic congestion control. 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