Abstract
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
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
