By Topic

Analysis of queueing networks with blocking under active queue management scheme

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
I. Awan ; Dept. of Comput., Bradford Univ., UK ; A. Yar ; M. E. Woodward

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 = N1, N2, ..., NR} 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

Published in:

12th International Conference on Parallel and Distributed Systems - (ICPADS'06)  (Volume:2 )

Date of Conference:

0-0 0