By Topic

Performance Modelling of Finite Capacity Queues with Complete Buffer Partitioning Scheme for Bursty Traffic

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
$31 $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)
Ahmad, S. ; Inst. of Comput. & Inf. Technol., Gomal Univ. ; Awan, I. ; Ahmad, B.

Finite buffer queues under complex management schemes are of great importance towards effective congestion control and quality of service (QoS) provision in the telecommunication networks. This paper analyses a single server G/G/1/N censored queue with R (R ges 2) traffic classes under complete buffer partitioning scheme and first come first served (FCFS) service discipline. A finite capacity vector, N, represents the capacity of partitions for each class (N1, N2, ..., NR). The forms of the state probabilities, as well as basic performance measures such as blocking probability are analytically established at equilibrium via appropriate mean value constraints based on the principle of maximum entropy (ME). Typical numerical experiments are included to illustrate the credibility of the proposed analysis in the context of generalised exponential (GE)-type queues

Published in:

Modelling & Simulation, 2007. AMS '07. First Asia International Conference on

Date of Conference:

27-30 March 2007