This paper studies a discrete-time Geo/G/1 retrial queue where the server is subject to starting failures. We analyse the Markov chain underlying the regarded queueing system and present some performance measures of the system in steady-state. Then, we give two stochastic decomposition laws and find a measure of the proximity between the system size distributions of our model and the correspond...

This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...

The “Horizontal Y” shaped queuing model in which there is bulk infinite arrival of patients, but available M services are limited. discrete flow patients the system reduced continuous and a diffusion equation used. In terms means variances inter-arrival time distribution, this process number servers used, imposing reflecting boundaries. inspiration for analysis came from Aradhye Kallurkar [2], ...

A class of discrete time GI/D/k systems is considered for which the interarrival times have finite support and customers are served in first-in first-out FIFO order. The system is formulated as a single server queue with new general independent interarrival times and constant service duration by assuming cyclic assignment of customers to the identical servers. Then the queue length is set up as...

In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...

The control of a network of signalized intersections is studied using a discrete-event simulator called ‘point queue’ (.Q). Vehicles arrive at entry links from outside the network in a continuous Poisson stream, independently make turns at intersections, and eventually leave from exit links. There is a separate queue at each intersection for each turn movement. The control at each intersection ...

Over the last two decades there has been considerable growth in digital communication systems which operate on a slotted system. In several applications, transmission of packets over the network takes place in batches of varying size, and transmission time depends upon the size of the batch. Performance modelling of these systems is usually done using discrete-time queues. In view of this, we c...

The event queue problem is one of the oldest problems in the field of discrete event simulation. However, processing models developed in the PDEVS formalism requires additional event queue methods which are not part of the standard event queue realizations. We present several event queues to be used for PDEVS models, as well as experimental performance results.

Calendar queues (CQ) are often employed in discrete event simulators to store pending events. They can achieve O(1) access time as long as the CQ resizes often enough to ensure that events are not skewed but evenly distributed in the queue structure. However, a resize operation would involve creating a new CQ structure and then moving each item from the old CQ to the new CQ before discarding th...

We propose a method to approximate the transient performance measures of a discrete time queueing system via a steady state analysis. The main idea is to approximate the system state at time slot t or on the n-th arrival—depending on whether we are studying the transient queue length or waiting time distribution—by the system state after a negative binomially distributed number of slots or arri...