Heavy Traffic Approximation of Equilibria in Resource Sharing Games

Wu, Yu; Bui, Loc; Johari, Ramesh

doi:10.1007/978-3-642-25510-6_30

Cited by 8 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We refer to the next section for more details on heavy-traffic results. Game-theoretic aspects of DPS have been studied in [26] and [12]. For an extensive overview of the literature on DPS we refer to the survey [1].…”

Section: Introductionmentioning

confidence: 99%

Sojourn time approximations in a multi-class time-sharing server

Izagirre

Ayesta

Verloop

2014

IEEE INFOCOM 2014 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

We study a multi-class 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. We develop closedform approximations for the mean conditional and unconditional sojourn times. The main benefits of the approximations lie in its simplicity, the fact that it applies for general service requirements with finite second moments, and that it provides insights into the dependency of the performance on the system parameters. We show that the approximation for the mean (un)conditional sojourn time of a customer is decreasing as its relative priority increases. We also show that the approximation is exact in various scenarios, and that it is uniformly bounded in the second moments of the service requirements. Finally we numerically illustrate that the approximation is accurate across a broad range of parameters.

show abstract

Section: Introductionmentioning

confidence: 99%

Sojourn time approximations in a multi-class time-sharing server

Izagirre

Ayesta

Verloop

2014

IEEE INFOCOM 2014 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

show abstract

“…• 100% (28) and lim µ1↑∞ Rel.Error = lim µ2↓0 Rel.Error. The intuition behind the latter equation can be seen as follows: having µ 1 → ∞ and λ 1 → ∞, i.e., having many class-1 arrivals of small size, is equivalent to having µ 2 → 0 and λ 2 → 0, i.e., having very few class-2 arrivals of large size.…”

Section: Mean Unconditional Sojourn Time For An Arbitrary Customermentioning

confidence: 99%

“…We refer to Section 2 for more details on heavy-traffic results. Gametheoretic aspects of DPS have been studied in [28] and [12]. For an extensive overview of the literature on DPS we refer to the survey [1].…”

Section: Introductionmentioning

confidence: 99%

Sojourn Time Approximations for a Discriminatory Processor Sharing Queue

Izagirre¹,

Ayesta

Verloop

2016

ACM Trans. Model. Perform. Eval. Comput. Syst.

View full text Add to dashboard Cite

We study a multi-class 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. We develop closed-form approximations for the mean conditional (on the service requirement) and unconditional sojourn times. The main benefits of the approximations lie in its simplicity, the fact that it applies for general service requirements with finite second moments, and that it provides insights into the dependency of the performance on the system parameters. We show that the approximation for the mean conditional and unconditional sojourn time of a customer is decreasing as its relative priority increases. We also show that the approximation is exact in various scenarios, and that it is uniformly bounded in the second moments of the service requirements. Finally we numerically illustrate that the approximation for exponential, hyperexponential and Pareto service requirements is accurate across a broad range of parameters.

show abstract

“…Recently there has been more interest in related problems, cf. Adlakha, Johari, and Weintraub [1], Arcaute et al [2], Iyer, Johari, and Moallemi [13], Wu, Bui, and Johari [17], Zhang, Johari, and Rajagopal [18].…”

Section: Introductionmentioning

confidence: 99%

Fluid Limit of a Ps-Queue With Multistage Service

Frolkova¹,

Zwart

2017

Prob. Eng. Inf. Sci.

View full text Add to dashboard Cite

The PS-model treated in this paper is motivated by freelance job websites where multiple freelancers compete for a single job. In the context of such websites, multistage service of a job means collection of applications from multiple freelancers. Under Markovian stochastic assumptions, we develop fluid limit approximations for the PS-model in overload. Based on this approximation, we estimate what proportion of freelancers get the jobs they apply for. In addition, the PS-model studied here is an instant of PS with routing and impatience, for which no Lyapunov function is known, and we suggest some partial solutions.

show abstract

Heavy Traffic Approximation of Equilibria in Resource Sharing Games

Cited by 8 publications

References 16 publications

Sojourn time approximations in a multi-class time-sharing server

Sojourn time approximations in a multi-class time-sharing server

Sojourn Time Approximations for a Discriminatory Processor Sharing Queue

Fluid Limit of a Ps-Queue With Multistage Service

Contact Info

Product

Resources

About