Mean buffer contents in discrete-time single-server queues with heterogeneous sources

DOI10.1007/S11134-005-6480-0MaRDI QIDQ1775809zbMATH OpenOpenAlexFDO

Authors Tetsuya Takine

Publication date 4 May 2005

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11134-005-6480-0

zbMATH Keywords

discrete-time queue

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queueing theory (aspects of probability theory) (60K25) Processes in random environments (60K37) Queues and service in operations research (90B22)

Review text

One considers a discrete-time work-conserving single-server queue with \(K\) independent, heterogeneous sources. Each source becomes idle and active alternately, the idle and active periods form a discrete-time alternating renewal process. The lengths of idle periods are geometrically distributed and the length of an active period is determined by the first passage time to the absorbing state in an underlying absorbing Markov chain. The number of cells generated by an active source can depend on the state of the Markov chain, the service times of cells are constant and equal to one slot. One generalizes the results of \textit{M. F. Neuts} [Commun. Stat., Stochastic Models 6, No.~1, 87--98 (1990; Zbl 0704.60093)] by allowing multiple cell arrivals during discrete phase-type periods. The mean buffer contents is given in terms of the traffic intensity, the first two moments of active period lengths and the number of cells generated during an active period of each source. The essential assumption in obtaining a general formula is that the lengths of idle periods of each source are geometrically distributed and the dynamics of each source during active periods are characterized by the underlying absorbing Markov chain with finite states. The finite-state assumption can be cancelled in two directions, by introducing a special structure into the absorbing chain or to provide a sufficient condition under which the general formula is applicable to queues with independent sources. As examples there are considered two specific queues: a queue with Markovian autoregressive sources and a queue with greedy sources.

Recommendations

• On viterbi's formula for the mean delay in a queue of data packets
• Analysis of a discrete-time queueing system with a single server and heterogeneous Markovian arrivals
• Analysis of discrete-time buffers with heterogeneous session-based arrivals and general session lengths
• Loss asymptotics in large buffers fed by heterogeneous long-tailed sources
• Markov-modulated finite-source queueing models in evaluation of computer and communication systems

Cites work

• Approximating the stationary distribution of an infinite stochastic matrix
• Approximation of the invariant probability measure of an infinite stochastic matrix
• scientific article; zbMATH DE number 796286 (Why is no real title available?)
• On the exact analysis of a discrete-time queueing system with autoregressive inputs
• On viterbi's formula for the mean delay in a queue of data packets
• The waiting time analysis of a discrete-time queue with arrivals as a discrete autoregressive process of order 1

Cited in

(3)

• Analysis of discrete-time buffers with heterogeneous session-based arrivals and general session lengths
• On viterbi's formula for the mean delay in a queue of data packets
• The mean queue content of discrete-time queues with zero-regenerative arrivals

This page was built for publication: Mean buffer contents in discrete-time single-server queues with heterogeneous sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775809)