We study a service system in which, in each service period, the server performs the current set B of tasks as a batch, taking time s(B), where the function s() is subadditive. A natural deenition of \traac intensity under congestion" in this setting is := lim t!1 t ?1 Es(all tasks arriving during time 0; t]): We show that < 1, and nite mean of individual service times, are necessary and suucien...

| Discrete time queueing systems have gained attention recently due to their applications in the performance analysis of ATM and other systems. In this paper, we analyze generic discrete-time queueing models with general distribution for batch arrivals and departures. Our models allow correlation and distributions with arbitrary rational probability generating functions. Our solution methodolog...

We present structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties. In addition to linear holding costs, we impose either lump sum switching costs or batch set-up delays which are incurred at each instant the server processes a job in a queue different from the previous one. We use ...

Abstract. A batch arrival retrial queue with general retrial times, state dependent admission, modified vacation policy and feed back is analysed in this paper. Arrivals are controlled according to the state of the server. If the orbit is empty, the server takes at most J vacations until at least one customer is received in the orbit when the server returns from the vacation. At the service com...

This paper analyzes a discrete-time, finite capacity, deterministic service time queueing system (MMBP + Ml\!fBP(XljD(N)jljK) with superposing non-renewal arrival processes. This queueing system models a switch in high speed networks, where multiple applications which generate correlated and bursty traffic are supported simultaneously using fast packet switching. A designated arrival stream (VC...

In this paper we analyze a tollbooth tandem queueing problem with an infinite number of servers. A customer starts service immediately upon arrival but cannot leave the system before all customers who arrived before himlher have left, i.e. customers depart the system in the same order as they arrive. Distributions of the total number of customers in the system, the number of departure-delayed c...

We consider in this paper the stability of retrial queues with a versatile retrial policy. We obtain sufficient conditions for the stability by the strong coupling convergence to a stationary ergodic regime for various models of retrial queues including a model with two types of customers, a model with breakdowns of the server, a model with negative customers, and a model with batch arrivals. F...

Burst contention is a major problem in the Optical Burst Switching (OBS) networks. Due to inadequate contention resolution techniques, the burst loss is prominent in OBS. In order to resolve contention fiber delay lines, wavelength converters, deflection routing, burst segmentation, and retransmission are used. Each one has its own limitations. In this paper, a new hybrid scheme is proposed whi...

In this paper, we consider a discrete-time finite-capacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and serves the customers only when the number of customers in system is at least a certain threshold value. For this queue, we first obtain the queue-length distribution just after a service completion, using the embedded M...