An easily applicable algorithm to solve problems involving bulk-arrival queues with a breakdown of one of the heterogeneous servers in case of steady state is introduced. A Monte Carlo study for numerically finding the limiting distribution of the number in the system for the bulk arrival, multi-server queueing model (M[x]/EK/C; C1/FCFS) with heterogeneous servers is presented. The system consi...

In this paper, we have considered a Markovian bulk-service queue for cloud computing architecture. The multiple class i users from the public cloud entering into the queue are naturally based on the FCFS discipline. Partial batch service mode and full batch service mode have considered for accessing cloud database. The requesting and service of the public cloud has been modelled using queueing ...

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

one of the most important issues in the plant layout design especially in mass production organizations with high inter-plant logistics is‘material flow and inter-plant traffic analysis and its effects on the production capabilities or pauses in production lines. in this paper the inter-plant traffic analysis issue on the basis of single channel queue model (m/m/1) is analyzed in a carmaker c...

This paper analyzes a finite-buffer queueing system, where customers arrive in batches and the accepted are served by single server. The service is assumed to be dependent on batch-size follows general bulk rule. inter-arrival times of correlated they represented through batch Markovian arrival process (BMAP). Computation procedure queue-length distributions at post-batch-service completion, an...

In this paper, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.? 

A single server queue with Bernoulli vacation has been considered. In addition the admission to queue is based on a Bernoulli process and the server gives two type of services. For this model the probability generating function for the number of customers in the queue at different server's state are obtained using supplementary variable technique. Some performance measures are calculated. Some ...