This paper considers a general class of discrete time systems with batch arrivals and departures. Such models appear frequently in the teletraffic analysis of computer and communications networks. Our arrival models are assumed to be quite general. They could be independent and identically distributed (i.i.d) in successive slots, be periodic, be Markovian or described by the moving average time...

In this paper, we consider a discrete-time single-server queueing system with a generalized switched batch Bernoulli arrival and a general service time processes (a generalized SBBP/G/1 queue). Customers arrive to the system in batches and service times of customers are generally distributed. The batch size and the service time distributions are governed by a discrete-time alternating renewal p...

We analyze the latency or sojourn time L(m,n) for the last customer in a batch of n customers to exit from the m-th queue in a tandem of m queues in the setting where the queues are in equilibrium before the batch of customers arrives at the first queue. We first characterize the distribution of L(m,n) exactly for every m and n, under the assumption that the queues have unlimited buffers and th...

In this paper, we consider a discrete-time single-server queueing system with a generalized switched batch Bernoulli arrival and a general service time processes (a generalized SBBP=G=1 queue). Customers arrive to the system in batches and service times of customers are generally distributed. The batch size and the service time distributions are governed by a discrete-time alternating renewal p...

The expected wait in the Gi/G/1 queue is related to the mean and variance of the idle time. For arrival distributions which are 1FR or have mean residual life bounded by r-, simple bounds are obtained which A. give, for example, the expected number in queue to within at most one customer. By equating input with output, relations between random variables are used to obtain expressions foi the mo...

In multiple access protocols, channel resources (such as time or code) can be reallocated following the variation of queue length status, and such a reactive control scheme may thus provide flexibility in reducing traffic congestion; the flexibility that a fixed assignment protocol does not have. In this paper, we conduct queueing analysis for a specific connection in a hybrid TDMA/CDMA protoco...

The M/M/1 retrial queue with working vacations and negative customers is introduced. The arrival processes of positive customers and negative customers are Poisson. Upon the arrival of a positive customer, if the server is busy the customer would enter an orbit of infinite size and the orbital customers send their requests for service with a constant retrial rate. The single server takes an exp...

In this paper we discuss modifications to tracking models, and sequential Monte Carlo algorithms for their estimation from sequential and batch data. New models for tracking are proposed which involve a dynamical model on both the hidden state value and its arrival times. In this way we aim to have a more flexible and parsimonious representation of time-varying state characteristics which is mo...

Simulation results suggest that a maximum size matching (MSM) algorithm will lead to 100% throughput for uniform Bernoulli i.i.d traffic. Previous analysis on the throughput of MSM algorithms enforce deterministic constraints on the joint arrival traffic. In this paper we explore MSM algorithms under Bernoulli arrivals. We show that when the arrival traffic is admissible and cells are scheduled...

A single-server queueing system with a batch Markovian arrival process (BMAP) and MAP-input of disasters causing all customers to leave the system instantaneously is considered. The system has two operation modes, which depend on the current queue length. The embedded and arbitrary time stationary queue length distribution has been derived and the optimal control threshold strategy has been det...