FLUID LIMIT OF A PS-QUEUE WITH MULTISTAGE SERVICE

Maria Frolkova, Bert Zwart

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

We consider a variation of the processor-sharing (PS) queue, inspired by freelance job websites where multiple freelancers compete for a single job. We develop fluid limit approximations for the overloaded PS-model with multiple (possibly infinitely many) service stages. Based on this approximation, we estimate what proportion of freelancers get the job they apply for. In addition, the PS model studied here is an instance of PS with routing and impatience, for which no Lyapunov function is known, and we suggest some partial solutions.

Original languageEnglish
Pages (from-to)1-27
Number of pages27
JournalProbability in the Engineering and Informational Sciences
Volume33
Issue number1
Early online date20 Dec 2017
DOIs
Publication statusPublished - Jan 2019

Keywords

  • fluid limits
  • freelance job websites
  • Lyapunov functions
  • processor-sharing
  • routing

Fingerprint Dive into the research topics of 'FLUID LIMIT OF A PS-QUEUE WITH MULTISTAGE SERVICE'. Together they form a unique fingerprint.

Cite this