Three buffer-allocation schemes for a MAP/PH/1/K priority queue with vacations and an application to ATM networks

Imed Frigui; Attahiru Sule Alfa

doi:10.1117/12.290465

6 October 1997 Three buffer-allocation schemes for a MAP/PH/1/K priority queue with vacations and an application to ATM networks

Imed Frigui, Attahiru Sule Alfa

Author Affiliations +

Proceedings Volume 3233, Broadband Networking Technologies; (1997) https://doi.org/10.1117/12.290465
Event: Voice, Video, and Data Communications, 1997, Dallas, TX, United States

Abstract

A discrete-time finite buffer capacity queueing system for a generic multimedia shared medium is studied in this paper. In such an environment, the arrival process at the aggregate level (e.g., frame arrival rather than cell arrival) can be captured using the Markovian arrival process and the service time can be represented by the phase type service. The quality of service can be increased through the assignment of priority and buffer allocation scheme. In this paper, we consider two types of priorities and three buffer allocation schemes. First, we consider priority service and non-priority buffer allocation, second, priority service and fixed buffer allocation, and third, priority service with priority buffer allocation with push-out and threshold. Our analysis leads to the queue length distribution and the blocking probability. In addition, we show that the throughput can be obtained as a Markov renewal process described by two sub-stochastic matrices derived by partitioning the transition matrix. Through several numerical examples, we show the effect of buffer allocation scheme on the throughput, and present some results for the average queue length, blocking probability, and the throughput.

Citation Download Citation

Imed Frigui and Attahiru Sule Alfa "Three buffer-allocation schemes for a MAP/PH/1/K priority queue with vacations and an application to ATM networks", Proc. SPIE 3233, Broadband Networking Technologies, (6 October 1997); https://doi.org/10.1117/12.290465

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE