A Unified Approach to the Proportional Relation for Discrete-Time Single-Server Queues

Authors:
Naoto Miyoshi;Fumio Ishizaki
Affiliations:
Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo 152-8552, Japan miyoshi@is.titech.ac.jp;Department of Information and Telecommunication Engineering, Nanzan University, Seto 489-0863, Japan fumio@ieee.org
Venue:
Queueing Systems: Theory and Applications
Year:
2002

Citing 4
Cited 0

Blocking probability for M/G/1 vacation systems with occupancy level dependent schedules

Operations Research
Loss probability in a finite discrete-time queue in terms of the steady state distribution of an infinite queue

Queueing Systems: Theory and Applications
ON TRUNCATION PROPERTIES OF FINITE-BUFFER QUEUES AND QUEUEING NETWORKS

Probability in the Engineering and Informational Sciences
Introduction to Discrete Event Systems

Introduction to Discrete Event Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is well known that a simple relation called proportional relation holds for some queueing models, that is, the stationary queue length distribution of one system can be expressed as the product of a constant and the distribution of another system which is different only in the buffer capacity. Recently, the proportional relation has been verified for various discrete-time single-server queues with correlated arrivals, where it has been also shown that the proportional constant can be expressed in terms of the distribution of one system. This implies that the stationary queue length distribution of one system can be completely expressed in terms of the distribution of the other system. In this paper, we consider a generalized model of discrete-time single-server queue, which covers all previous ones, and give a simple and unified proof to the proportional relation as well as the expression of the proportional constant.