A Queueing Model with Varying Service Rate for ABR

Authors:
R. Nunez Queija
Affiliations:
-
Venue:
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Year:
1998

Citing 6
Cited 0

Matrix analysis

Matrix analysis
On a preemptive Markovian queue with multiple servers and two priority classes

Mathematics of Operations Research
Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method

Performance Evaluation
The symmetric eigenvalue problem

The symmetric eigenvalue problem
Performance Analysis of Rate Based Feedback Control for ATM Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Steady-state analysis of a queue with varying service rate

Steady-state analysis of a queue with varying service rate

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study a queueing model with a server that changes its service rate according to a finite birth and death process. The object of interest is the simultaneous distribution of the number of customers in the system and the state of the server in steady-state. Both infinite and finite storage capacity for customers is considered. The influence of the operating time-scale is investigated by letting the underlying birth-death process move infinitely fast as well as infinitely slow. The model can be applied to the performance analysis of (low priority) Available Bit Rate (ABR) traffic at an ATM switch in the presence of traffic with a higher priority such as Variable Bit Rate (VBR) traffic and Constant Bit Rate (CBR) traffic. For a specific example we illustrate by numerical experiments the influence of the latter traffic types on the ABR service.