This paper deals with the transient analysis of batch arrival retrial queueing system with general retrial times, priority service, balking, second optional service, Bernoulli vacation, extended vacation, breakdown, delayed repair and stand by server. Here we assume that customers arrive in batches according to compound Poisson processes, where the blocked customers either with probability p jo...

We consider a service provider facing a continuum of delay-sensitive strategic customers. The service provider maximizes revenue by charging customers for the privilege of joining an M/G/1 queue and assigning them service priorities. Each customer has a valuation for the service, with a waiting cost per unit time that is proportional to their valuation; customer types are drawn from a continuou...

We consider a service provider facing a continuum of delay-sensitive strategic customers. The service provider maximizes revenue by charging customers for the privilege of joining an M/G/1 queue and assigning them service priorities. Each customer has a valuation for the service, with a waiting cost per unit time that is proportional to their valuation; customer types are drawn from a continuou...

We study a first passage time problem for a class of spectrally positive Lévy processes. By considering the special case where the Lévy process is a compound Poisson process with negative drift, we obtain the Laplace-Stieltjes transform of the steady-state waiting time distribution of low-priority customers in a twoclass M/GI/1 queue operating under a dynamic non-preemptive priority discipline....

 This study considers a system of multi-server queues with two classes of impatient customers: high-priority and low-priority. Customers join the system according to a Poisson process and customers may abandon service after entering the queue for an exponentially distributed duration with distinct rates. In this paper, we consider last come-first served (LCFS) and first come-first served (FCFS...

We consider the dimensioning problem for Internet access links carrying TCP traffic with two priority classes. To this end, we study the behaviour of TCP at the flow level described by a multiple-server Processor Sharing (PS) queueing model with two customer classes, where the customers represent flows generated by downloading Internet objects; the sojourn times represent the object transfer ti...

In this paper we present a queueing model for the performance analysis of ABR tra c in ATM networks. We consider a multi-channel service station with two types of customers, the rst having preemptive priority over the second. The arrivals occur according to two independent Poisson processes and the service times are assumed to be exponentially distributed. Each type-1 customer requires a single...

A multi-server queueing system with two types of customers and an infinite buffer operating in a random environment as a model of a contact center is investigated. The arrival flow of customers is described by a marked Markovian arrival process. Type 1 customers have a non-preemptive priority over type 2 customers and can leave the buffer due to a lack of service. The service times of different...

In this paper, we model a call center as a preemptive-resume priority queue with time-varying arrival rates and two priority classes of customers. The low priority customers have a dynamic priority where they become high priority if their waiting-time in queue exceeds a given service-level time. The performance of the call center is measured by the mean number in system for the two customer cla...

Many service providers utilize priority queues. Many consumers revile priority queues. However, some form of priority service may be necessary to maximize social welfare. Consequently, it is useful to understand how the priority scheme chosen by a revenue-maximizing firm differs from that a social planner would impose. We examine this in a single server-queue with customers that draw their valu...