This paper aims to present an approach for modeling and analyzing an M/G/1//2 retrial queue, using the MRSPN ( Markov Regenerative Stochastic Petri Nets ) tool. The consideration of the retrials and finite source population introduce analytical di culties. The expressive power of the MRSPN formalism provides us with a detailed modeling of retrial systems. In addition to this modeling, this form...

This paper studies a discrete-time queueing system in which customer who enters the with server occupied may choose to go retrial group or begin its service displacing that was server. If is idle arriving begins immediately. Retrial and times are general, only repeated can directly one situated at first place of group. A complete study model has been curried out noting specially analysis recurs...

We consider a GI/G/c/K-type retrial queueing system with constant retrial rate. The system consists of a primary queue and an orbit queue. The primary queue has c identical servers and can accommodate the maximal number of K jobs. If a newly arriving job finds the full primary queue, it joins the orbit. The original primary jobs arrive to the system according to a renewal process. The jobs have...

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

In the previous chapter we assumed that replenishment is instantaneous and no shortage is permitted (shortage cost infinity).In this chapter we assume that replenishment of inventory does not materialize immediately as placement of order ,rather takes a random amount of time for order materialization .Thus we have now a finite shortage cost situation. Another salient feature of this chapter is ...

Abstract: This paper deals with the steady state behavior of an M/G/1 retrial queue with two successive phases of service and general retrial times under Bernoulli vacation schedule for an unreliable server. While the server is working with any phase of service, it may breakdown at any instant and the service channel will fail for a short interval of time. The primary customers finding the serv...

This paper considers a retrial queueing model for a base station in cellular networks where fresh calls and handover calls are available. Fresh calls are initiated from the cell of the base station. On the other hand, a handover call has been connecting to a base station and moves to another one. In order to keep the continuation of the communication, it is desired that an available channel in ...

Consider a single server retrial queueing system with pre-emptive priority service and single working vacation in which two types of customers arrive in a Poisson process with arrival rates ?1 for low and ?2 for high priority customers. We assume that regular service times follow an exponential distribution with parameters μ1 and μ2 correspondingly. The retrial is introduced for low priority cu...