Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing

I. M. Verloop (), U. Ayesta () and R. Núñez-Queija ()
Additional contact information
I. M. Verloop: BCAM---Basque Center for Applied Mathematics, 48170 Derio, Spain; CWI, 1090 GB Amsterdam, The Netherlands
U. Ayesta: BCAM---Basque Center for Applied Mathematics, 48170 Derio, Spain; IKERBASQUE, Basque Foundation for Science, 48011 Bilbao, Spain
R. Núñez-Queija: CWI, 1090 GB Amsterdam, The Netherlands; University of Amsterdam, 1018 WB Amsterdam, The Netherlands

Operations Research, 2011, vol. 59, issue 3, 648-660

Abstract: We analyze a generalization of the discriminatory processor-sharing (DPS) queue in a heavy-traffic setting. Customers present in the system are served simultaneously at rates controlled by a vector of weights. We assume that customers have phase-type distributed service requirements and allow that customers have different weights in various phases of their service.In our main result we establish a state-space collapse for the queue-length vector in heavy traffic. The result shows that in the limit, the queue-length vector is the product of an exponentially distributed random variable and a deterministic vector. This generalizes a previous result by Rege and Sengupta [Rege, K. M., B. Sengupta. 1996. Queue length distribution for the discriminatory processor-sharing queue. Oper. Res. 44 (4) 653--657], who considered a DPS queue with exponentially distributed service requirements. Their analysis was based on obtaining all moments of the queue-length distributions by solving systems of linear equations. We undertake a more direct approach by showing that the probability-generating function satisfies a partial differential equation that allows a closed-form solution after passing to the heavy-traffic limit.Making use of the state-space collapse result, we derive interesting properties in heavy traffic: (i) For the DPS queue, we obtain that, conditioned on the number of customers in the system, the residual service requirements are asymptotically independent and distributed according to the forward recurrence times. (ii) We then investigate how the choice for the weights influences the asymptotic performance of the system. In particular, for the DPS queue we show that the scaled holding cost reduces as classes with a higher value for d k / E ( B k fwd ) obtain a larger share of the capacity, where d k is the cost associated to class k , and E ( B k fwd ) is the forward recurrence time of the class- k service requirement. The applicability of this result for a moderately loaded system is investigated by numerical experiments.

Keywords: discriminatory processor sharing; heavy traffic; phase-type service requirements; residual service requirements; scheduling (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1110.0914 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:59:y:2011:i:3:p:648-660

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().