ANALYSIS OF A FINITE-BUFFER HEAD-OF-THE-LINE PRIORITY QUEUE WITH BUFFER RESERVATION SCHEME AS SPACE PRIORITY

This paper presents a finite buffer M/G/1 queue with two classes of cu stomers who are served by a combination of head-of-the-line priority a nd buffer reservation schemes. This combination gives each class of cu stomers high or low priorities in terms of both delay and loss. The sc heme is analyzed for the model in which one class of customers has hig h priorities over the other class of customers with respect to both de lay and loss. First, steady-state joint probability distribution of th e number of each class of customers in the buffer and remaining servic e time is derived by a supplementary variable method. Second, loss pro bability and mean waiting time for each class of customers are provide d using this probability distribution. Finally, a combination of head- of-the-line priority and buffer reservation schemes is numerically com pared with other buffer management schemes in terms of admissible offe red load to show its effectiveness under differing QoS requirements.