Sojourn Time Approximations for a Discriminatory Processor Sharing Queue [PDF]
We study a multiclass time-sharing discipline with relative priorities known as discriminatory processor sharing (DPS), which provides a natural framework to model service differentiation in systems. The analysis of DPS is extremely challenging, and analytical results are scarce.
U Ayesta
exaly +4 more sources
Fluid approximation of closed queueing networks with discriminatory processor sharing [PDF]
Abstract As a multi-class variant of the classical egalitarian processor-sharing (EPS) discipline, discriminatory processor sharing (DPS) provides a suitable paradigm to model systems where share exists to control the service access of heterogeneous jobs.
Giuliano Casalé, Iker Perez
exaly +4 more sources
Higher response time moments for M/M/1 discriminatory processor sharing queues [PDF]
Obtaining response time moments in processor sharing (PS) queues is difficult due to serving of multiple jobs. Egalitarian PS (EPS) queues are limited to one class of arriving jobs.
Tiberiu Chis, Peter Harrison
doaj +4 more sources
Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing [PDF]
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 ...
U Ayesta, R Núñez-Queija
exaly +7 more sources
Heavy-traffic limits for Discriminatory Processor Sharing models with joint batch arrivals [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R Núñez-Queija
exaly +9 more sources
Pricing for Heterogeneous Services at a Discriminatory Processor Sharing Queue [PDF]
In order to deal with applications with different quality of service requirements, service differentiation has to be implemented, especially in case of congestion. Different scheduling policies can be applied at a queue, such as strict priorities, generalized processor sharing, or discriminatory processor sharing.
Hayel, Yezekael, Tuffin, Bruno
openaire +4 more sources
Comparison of the Discriminatory Processor Sharing Policies
Discriminatory Processor Sharing policy introduced by Kleinrock is of a great interest in many application areas, including telecommunications, web applications and TCP flow modelling. Under the DPS policy the job priority is controlled by the vector of weights.
Osipova, Natalia
core +8 more sources
User equilibria in heterogeneous discriminatory processor sharing queues
We consider a strategic routing game for a two-class discriminatory processor-sharing queue with an additional cost for joining the premium class. We show that, depending on the specific parameters of the system, various equilibria can coexist, including equilibria where the queueing system is not ergodic for the equilibrium traffic split.
Fiems, Dieter, Prabhu, Balakrishna
openaire +3 more sources
Strategic Routing in Heterogeneous Discriminatory Processor Sharing Queues
We consider strategic routing for a two-class discriminatory processor queue with an additional cost for joining the premium class. We show that, depending on the specific parameters of the system, various equilibria can coexist, including equilibria where the queueing system is not ergodic for the equilibrium traffic split. We also investigate how the
Fiems, Dieter, Prabhu, Balakrishna J.
openaire +4 more sources
Heavy-traffic analysis of the M/PH/1 discriminatory processor sharing queue with phase-dependent weights [PDF]
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 phase-type distributed service requirements and allow that customers have different weights in various phases of their service.
I.M. Verloop (Maaike) +2 more
openaire +6 more sources

