Fluid Limit of a PS-queue with Multistage Service

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.

[1]  Mor Harchol-Balter,et al.  Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates , 2006, Queueing Syst. Theory Appl..

[2]  Ram Rajagopal,et al.  Competition and Coalition Formation of Renewable Power Producers , 2015, IEEE Transactions on Power Systems.

[3]  Philippe Robert.  Stochastic Networks and Queues , 2003 .

[4]  Philippe Robert,et al.  Fluid Limits for Processor-Sharing Queues with Impatience , 2008, Math. Oper. Res..

[5]  Shie Mannor,et al.  Dynamics in tree formation games , 2013, Games Econ. Behav..

[6]  Alan Scheller-Wolf,et al.  Understanding Response Time in the Redundancy-d System , 2016, PERV.

[7]  Ramesh Johari,et al.  Information Aggregation and Allocative Efficiency in Smooth Markets , 2010 .

[8]  Alan Scheller-Wolf,et al.  A Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size , 2016, IEEE/ACM Transactions on Networking.

[9]  Sem C. Borst,et al.  The equivalence between processor sharing and service in random order , 2003, Oper. Res. Lett..

[10]  Jamol Pender,et al.  Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues , 2017, INFORMS J. Comput..

[11]  R. Johari,et al.  Equilibria of Dynamic Games with Many Players: Existence, Approximation, and Market Structure , 2011 .

[12]  Avishai Mandelbaum,et al.  Strong approximations for Markovian service networks , 1998, Queueing Syst. Theory Appl..

[13]  Bert Zwart,et al.  Fluid limits for an ALOHA-type model with impatient customers , 2011, Queueing Systems.

[14]  Yu Wu,et al.  Heavy Traffic Approximation of Equilibria in Resource Sharing Games , 2012, IEEE J. Sel. Areas Commun..

[15]  Alan Scheller-Wolf,et al.  Queueing with redundant requests: exact analysis , 2016, Queueing Syst. Theory Appl..

[16]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[17]  Jamol Pender,et al.  Strong approximations for time-varying infinite-server queues with non-renewal arrival and service processes , 2018 .

[18]  Maury Bramson,et al.  Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks , 1996, Queueing Syst. Theory Appl..

[19]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .