Gijs van Kessel
Sem Borst
Abstract
We study the joint queue length distribution of the Discriminatory Processor Sharing model, assuming all classes have phase-type service requirement distributions. We show that the moments of the joint queue length distribution can be obtained by solving linear equations. We use this to study the system in two asymptotic regimes. In the first regime, the different user classes operate on strictly separated time scales. Then we study the system in heavy traffic.
- Altman, E., Jimenez, T., Kofman, D. (2003). DPS queues with stationary ergodic service times and the performance of TCP in overload. In: Proc. IEEE Infocom 2004, Hong Kong.Google Scholar
- Van den Berg, J. L., Boxma, O. J. (1991). The M/G/1 queue with processor sharing and its relation to a feedback queue. Queueing Systems9, 365--401. Google ScholarDigital Library
- Cohen, J. W. (1979). The multiple phase service network with generalized processor sharing. Acta Informatica12, 245--284.Google Scholar
- Fayolle, G., Mitrani, I., Iasnogorodski, R. (1980). Sharing a processor among many job classes. J. ACM27, 519--532. Google ScholarDigital Library
- Haviv, M., Van der Wal, J. (2004). Waiting times in queues and in processor sharing systems with relative priorities. Submitted for publication.Google Scholar
- Kelly, F. P. (1979). Reversibility and Stochastic Networks. Wiley, Chichester.Google Scholar
- Kleinrock, L. (1967). Time-shared systems: a theoretical treatment. Journal of the Association for Computing Machinery14, 242--261. Google ScholarDigital Library
- Massoulié, L., Roberts, J. W. (1999). Bandwidth sharing: objectives and algorithms. In: Proc. IEEE Infocom '99, New York NY, USA, 1395--1403.Google ScholarCross Ref
- Rege, K. M., Sengupta, B. (1996). Queue length distribution for the discriminatory processor-sharing queue. Oper. Res.44, 653--657.Google ScholarDigital Library
- Sakata, M., Noguchi, S., Oizumi, J. (1971). An analysis of the M/G/1 queue under round-robin scheduling. Oper. Res.19, 371--385.Google ScholarDigital Library
Recommendations
Slowdown in the M/M/1 discriminatory processor-sharing queue
We consider a queue with multiple K job classes, Poisson arrivals, and exponentially distributed required service times in which a single processor serves according to the discriminatory processor-sharing (DPS) discipline. For this queue, we obtain the ...
Queue-Length Distribution for the Discriminatory Processor-Sharing Queue
In this paper, we study a multiple class discriminatory processor-sharing queue. The queue is assumed to have Poisson input and exponentially distributed service times. In this discipline there are K classes of customers. When there are n i ...
Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing
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 ...
Comments