Maximum entropy and the G/G/1/N queue
Acta Informatica
Queueing networks with blocking
Queueing networks with blocking
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Analysis of Queueing Networks with Blocking
Analysis of Queueing Networks with Blocking
Analytical modeling of a multi-queue nodes network router
International Journal of Automation and Computing
ISIICT'09 Proceedings of the Third international conference on Innovation and Information and Communication Technology
Hi-index | 0.00 |
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/l/N queue vrith single server, R (R \geqslant 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 use of queue thresholds is a well known technique for network trafic 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.