This paper considers buffer overflow probabilities for stable queueing systems with one server and different classes of arrivals. The service priority is given to the class of customers whose current weighted queue size is the largest (weighted-serve-the-longest-queue policy). We explicitly identify the exponential decay rate for the rare-event probabilities of interest, and construct asymptoti...

We consider a collection of queues operating in parallel and sharing a common server via a “randomized” service priority sharing rule. We assume that the service times of the customers (cells) are all constant and identical. This paper is concerned with estimating the sensitivity of the tail of the distribution of the typical sojourn time through these queues to the fraction of server bandwidth...

Optimal control of many-server heterogenous service systems with service times that have a special hyper-exponential distribution, denoted by H ∗ 2 , which is a mixture of an exponential distribution and a unit point mass at 0, is considered. A static priority policy that assigns priorities to server pools based on their service time distributions is proposed. This policy is shown to be asympto...

Customers' perceptions of value have a direct impact on their overall experience and behavioral intentions purchasing product. Analyzing customers' motivations behind food service experiences can shed light the factors that influence decision to visit specific establishments, likelihood revisiting, willingness recommend place others. The purpose this study was explore characteristics servicing ...

Abstract Pay-for-priority is a common practice in congestion-prone service systems. The extant literature on this topic restricts attention to the case where only epoch for customers purchase priority upon arrival , and if choose not upgrade when they arrive, cannot do so later during their wait. A natural alternative let pay at any time stay queue, even initially. This paper builds queueing-ga...

proposing a concrete CAC algorithm that is optimal This work focuses on connection admission control given a certain priority scheme. Hardly any paper (CAC) 2 of a single buffer with a two-type (high discusses the trade-off between the gain in performand low) priority management. The quantity of ance and the increase in complexity by introducing interest for CAC is the maximum allowable load a ...

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

This paper aims to investigate customer perceptions of the concept of CRM and its relevance to customer satisfaction and loyalty in the UK retail banking industry. It also seeks to identify the critical factors that can impact on a consumer’s choice of bank. The main research instrument is a questionnaire. 240 questionnaires are randomly distributed. Two statistical modelling techniques namely ...

This paper analyzes a communication network with heterogeneous customers. We investigate priority queueing as a way to differentiate between these users. Customers join the network as long as their utility (which is a function of the queueing delay) is larger than the price of the service. We focus on the specific situation in which two types of users play a role: one type is delay-sensitive (‘...