Perturbation analysis of a multiclass queueing system with admission control

1991 ◽  
Vol 36 (6) ◽  
pp. 707-723 ◽  
Author(s):  
W.-B. Gong ◽  
C.G. Cassandras ◽  
J. Pan
Keyword(s):  
Admission Control ◽  
Perturbation Analysis ◽  
Queueing System ◽  
Multiclass Queueing

scholarly journals A Paradox for Admission Control of Multiclass Queueing Network with Differentiated Service

2007 ◽  
Vol 44 (02) ◽  
pp. 321-331
Author(s):  
Heng-Qing Ye
Keyword(s):  
Admission Control ◽  
Network Performance ◽  
Queueing Network ◽  
Differentiated Service ◽  
Service Station ◽  
Multiclass Queueing ◽  
Multiclass Queueing Network ◽  
Service Priority

In this paper we present counter-intuitive examples for the multiclass queueing network, where each station may serve more than one job class with differentiated service priority and each job may require service sequentially by more than one service station. In our examples, the network performance is improved even when more jobs are admitted for service.

scholarly journals A Paradox for Admission Control of Multiclass Queueing Network with Differentiated Service

2007 ◽  
Vol 44 (2) ◽  
pp. 321-331
Author(s):  
Heng-Qing Ye
Keyword(s):  
Admission Control ◽  
Network Performance ◽  
Queueing Network ◽  
Differentiated Service ◽  
Service Station ◽  
Multiclass Queueing ◽  
Multiclass Queueing Network ◽  
Service Priority

In this paper we present counter-intuitive examples for the multiclass queueing network, where each station may serve more than one job class with differentiated service priority and each job may require service sequentially by more than one service station. In our examples, the network performance is improved even when more jobs are admitted for service.

scholarly journals Optimal Switching Strategy between Admission Control and Pricing Control Policies with Two Types of Customers and Search Costs

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Jae-Dong Son
Keyword(s):  
Admission Control ◽  
Queueing System ◽  
Search Costs ◽  
Optimal Switching ◽  
Search Cost ◽  
Control Policies ◽  
Switching Strategy ◽  
Net Profit ◽  
Search Option ◽  
Pricing Control

This paper presents a switching strategy between the admission control and the pricing control policies in a queueing system with two types of customers. For an arriving first-type customer, the decision maker has an option on which policy to choose between the two control policies; that is, one determines whether or not to admit the customer’s request for the service (admission control) or decides a price of the customer’s request and offers it to the customer (pricing control). The second-type customers are only served when no first-type customers are present in the system in order to prevent the system from being idle. This would yield an extra income, which we refer to as the sideline profit. The so-called search cost, which is a cost paid to search for customers, creates the search option on whether to continue the search or not. We clarify the properties of the optimal switching strategy as well as the optimal search policy in relation to the sideline profit in order to maximize the total expected net profit. In particular, we show that when the sideline profit is sufficiently large, the two optimal switching thresholds exist with respect to the number of first-type customers in the system.

BIAS OPTIMALITY IN A QUEUE WITH ADMISSION CONTROL

1999 ◽  
Vol 13 (3) ◽  
pp. 309-327 ◽  
Author(s):  
Mark E. Lewis ◽  
Hayriye Ayhan ◽  
Robert D. Foley
Keyword(s):  
Admission Control ◽  
Queueing System ◽  
Average Reward ◽  
Objective Functions ◽  
Finite Capacity ◽  
Long Run ◽  
Blackwell Optimality ◽  
Optimal Policies ◽  
Bias Optimality ◽  
Long Run Average Reward

We consider a finite capacity queueing system in which each arriving customer offers a reward. A gatekeeper decides based on the reward offered and the space remaining whether each arriving customer should be accepted or rejected. The gatekeeper only receives the offered reward if the customer is accepted. A traditional objective function is to maximize the gain, that is, the long-run average reward. It is quite possible, however, to have several different gain optimal policies that behave quite differently. Bias and Blackwell optimality are more refined objective functions that can distinguish among multiple stationary, deterministic gain optimal policies. This paper focuses on describing the structure of stationary, deterministic, optimal policies and extending this optimality to distinguish between multiple gain optimal policies. We show that these policies are of trunk reservation form and must occur consecutively. We then prove that we can distinguish among these gain optimal policies using the bias or transient reward and extend to Blackwell optimality.

Heavy Traffic Convergence of a Controlled, Multiclass Queueing System

1996 ◽  
Vol 34 (6) ◽  
pp. 2133-2171 ◽  
Author(s):  
L. F. Martins ◽  
S. E. Shreve ◽  
H. M. Soner
Keyword(s):  
Queueing System ◽  
Heavy Traffic ◽  
Multiclass Queueing
Sign in / Sign up

Export Citation Format

Share Document