A class of discrete-time M=G=1 queues, including both round robin and last come rst served service, in which customers are subject to permutations is considered. These time slotted queues, analogous to the symmetric queues of Kelly, are analyzed by examination of the time reversed process. Product form stationary distributions are found for a type of doubly stochastic server of Schassberger [5]...

The class of Gaussian processes is one of the most widely used families of stochastic processes for modeling dependent data observed over time, or space, or time and space. The popularity of such processes stems primarily from two essential properties. First, a Gaussian process is completely determined by its mean and covariance functions. This property facilitates model fitting as only the fir...

An efficient yet accurate estimation of the tail distribution of the queue length has been considered as one of the most important issues in call admission and congestion controls in ATM networks. The arrival process in ATM networks is essentially a superposition of sources which are typically bursty and periodic either due to their origin or their periodic slot occupation after traffic shaping...

This paper studies a discrete-time queueing system in which customer who enters the with server occupied may choose to go retrial group or begin its service displacing that was server. If is idle arriving begins immediately. Retrial and times are general, only repeated can directly one situated at first place of group. A complete study model has been curried out noting specially analysis recurs...

In this paper we consider a large deviations problem for a discrete-time polling system consisting of two-parallel queues and a single server. The arrival process of each queue is a superposition of traffic streams generated by a number of mutually independent and identical Markovian on/off sources, and the single server serves the two queues according to the so-called Bernoulli service schedul...