Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T15:42:17.667Z Has data issue: false hasContentIssue false

Optimal Server Selection in a Queueing Loss Model with Heterogeneous Exponential Servers, Discriminating Arrivals, and Arbitrary Arrival Times

Published online by Cambridge University Press:  30 January 2018

Sheldon M. Ross*
Affiliation:
University of Southern California
*
∗ Postal address: Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089, USA. Email address: smross@usc.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider a multiple server queueing loss system where the service times of server i are exponential with rate μi , where μi decreases in i. Arrivals have associated vectors (X 1, …, X n ) of binary variables, with X i = 1 indicating that server iis eligible to serve that arrival. Arrivals finding no idle eligible servers are lost. Letting I j be the indicator variable for the event that the jth arrival enters service, we show that, for any arrival process, the policy that assigns arrivals to the smallest numbered idle eligible server stochastically maximizes the vector (I 1, …, I r ) for every r if the eligibility vector of arrivals is either (a) exchangeable, or (b) a vector of independent variables for which P(X i = 1) increases in i.

Information

Type
Research Article
Copyright
© Applied Probability Trust