Asymptotic optimality of balanced routing in a multiclass G/G/1 queue

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we consider a multiclass G/G/1 queueing system. When the server is idle, we use a balanced routing control policy to determine what kind of customer is served. Under such a balanced policy, we derive the diffusion limits of the queue length processes and the workload processes. The diffusion limits are the same for these processes regardless the choice of c as long as c ≥ 2. We further show that the proposed balanced routing policy for any fixed c ≥ 2 is asymptotically optimal in the sense that it minimizes the workload over all time in the diffusion limit. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Xiao, X., & Wu, L. (2013). Asymptotic optimality of balanced routing in a multiclass G/G/1 queue. Advances in Intelligent Systems and Computing, 212, 73–79. https://doi.org/10.1007/978-3-642-37502-6_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free