We present an analysis of the number of losses, caused by the buffer overflows, in a finite-buffer queue with batch arrivals and autocorrelated interarrival times. Using the batchMarkovian arrival process, the formulas for the average number of losses in a finite time interval and the stationary loss ratio are shown. In addition, several numerical examples are presented, including illustrations...

We consider a bulk service G I / M / l queue with service rates depending on service batch size. If there are n customers waiting at the completion of service, min(n, I\) customers enter service. We show that the queue size and the service batch size at points of arrivals form an embedded Markov chain and the steady-state probabilities of this Markov chain have the matrix geometric form. We des...

Abstract Here a two-state batch arrivals and batch service Markovian queue with server vacation model has been taken into consideration for its mathematical modelling and performance analysis under transient state. The present Markovian queueing model considers a single server with multiple vacations and both arrivals and services in batches of variable size. Arriving customers are processed by...

The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc. The communication tasks in such wireless networks often involve an inquiry over a shared channel, which can be invoked for: discovery of neighboring devices in ad hoc networks, counting the number of active sensors in...

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...