The throughput characteristics of contention-based random access channels which use Q-ary splitting algorithms (where Q is the number of groups into which colliding users are split) are analyzed. The algorithms considered are of the Capetanakis-Tsybakov-Mikhailov-Vvedenskaya (CTMV) type and are studied for infinite populations of identical users generating packets according to a discrete time b...

Abstract This paper is concerned with the analysis of an infinite-capacity batch arrival multi-server queueing system Bernoulli feedback, synchronous multiple and single working vacation policies, waiting servers, reneging retention reneged customers. The steady-state solution obtained by using probability generating function (PGF). In addition, important performance measures are derived. Then,...

This paper aims to investigate M[X]/(G1, G2)/1/VAC(J) queuing system with a random(p) vacation policy and optional second service, where X is the batch arrival number of customers. When no customers are in system, server immediately goes on vacation. And when returns from finds that at least one customer waiting will provide First Essential Service (FES). After complete first essential some con...

Although the concept of Batch Markovian Arrival Processes (BMAPs) has gained widespread use in stochastic modelling of communication systems and other application areas, there are few statistical methods of parameter estimation proposed yet. However, in order to practically use BMAPs for modelling, statistical model fitting from empirical time series is an essential task. The present paper cont...

In this paper we consider a like-queue production system in which server startup and breakdowns are possible. The server is turned on (i.e. begins startup) when N units are accumulated in the system and off when the system is empty. We model this system by an M/M/1 queue with server breakdowns and startup time under the N policy. The arrival rate varies according to the server’s status: off, st...

This paper analyzes a discrete-time batch arrival queue with working vacations. In a GeoX/G/1 system, the server works at a lower speed during the vacation period which becomes a lower speed operation period. This model is more appropriate for the communication systemswith the transmit units arrived in batches.We formulate the system as an embeddedMarkov chain at the departure epoch and by theM...

A single-server queueing system of MX/G/1 type with unlimited buffer size is considered. Whenever the system becomes empty, the server takes a single compulsory vacation that is independent of the arrival process. The service of the first customer after the vacation is preceded by a random setup time. We distinguish two cases of the evolution of the system: when the setup time begins after the ...