By Topic

Analysis of Discrete-Time Queues with Space and Service Priorities for Arbitrary Arrival Processes

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

2 Author(s)
Awan, I. ; Networks & Performance Eng. Res. Group, Bradford Univ. ; Fretwell, R.

Finite buffer queues with service and space priorities are of great importance towards effective congestion control and quality of service (QoS) protection in high speed networks. This paper presents closed-form analytical solutions, based on the principle of maximum entropy (ME), for the performance evaluation of single server finite capacity G/G/1/N censored queues with R (R>1) distinct priority classes under preemptive-resume (PR) or head-of-line (HoL) service disciplines. Buffer management for these queues employs either partial buffer sharing (PBS) or complete buffer sharing (CBS) schemes. A vector, N, representing a sequence of thresholds (N1, N2,... ,NR) for each priority class jobs, is used to implement these buffer management schemes in order to provide quality of service constraints. Closed-form expressions for various performance metrics have been derived

Published in:

Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on  (Volume:2 )

Date of Conference:

22-22 July 2005