Models of integrated services data networks with moving customers (e.g., mobiles with calls in progress) and level dependent spatial Markov-additive processes of arrivals are considered. It is assumed that waiting is not allowed and, accordingly, two types of service models are examined: with infinite number of servers and loss models with finite number of servers. In general, arrivals can be o...

We consider a single server queuing system with repeated attempts in which customers arrive according a Markov arrival process (MAP) and with a LCFS PR discipline. The service times are independent and have a common general distribution. After service completion time the server initiates his search time with an arbitrary distribution function. We consider two cases where the maximum number of r...

In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. Two types of customers arrive at the first queue: high and low priority customers. For this situation the following service disciplines are considered: gated, globally gated, and exhaustive. We study the cycle time dis...

This paper investigates optimal pricing policies for a service facility modeled as a queueing system. Arriving customers are accepted if they are willing to pay the price charged by the service provider and if there is room in the waiting area. Capacity of the waiting area can be either finite or infinite. We determine expressions for the optimal prices that maximize the service provider’s long...

We study the customers’ Nash equilibrium behavior in a single server observable queue with a Poisson arrival process and general service times. Each customer takes one decision: to join or not to join. Furthermore, he takes it upon arrival and no future regrets. The customers are homogenous with respect to their waiting cost linear function and with the reward associated with service completion...

We consider a two-heterogeneous-server queueing system with Bernoulli vacation in which customers arrive according to a Markovian arrival process MAP . Servers returning from vacation immediately take another vacation if no customer is waiting. Using matrix-geometric method, the steady-state probability of the number of customers in the system is investigated. Some important performance measure...

In this paper, the performance of a telephone system in which there are both patient and impatient customers is studied. Depending on the waiting time in the buuer, a customer may become impatient and therefore the call is incomplete. A impatient customer still consumes real processing time. The impact of impatient customers on the system is much more remarkable than people would expect. We for...

This paper studies optimal pricing for a GI/M/k/N queueing system with several types of customers. An arrival joins the queue, if the price of service is not higher than the maximum amount that the arrival is willing to pay, and this maximum amount is defined by the customer type. A system manager chooses a price depending on the number of customers in the system. In addition, the system incurs...

The mathematical model of the retrial queuing system \(M^{[n]}/M/1\) with feedback and batch Poisson arrival is constructed. Customers arrive in groups. If server free, one arriving customers starts his service, rest join orbit. service times are exponentially distributed. customer whose completed leaves system, or reservice, goes to method asymptotic diffusion analysis proposed for finding pro...