Fluid and heavy traffic diffusion limits for a generalized processor sharing model
The paper considers a single server queueing system with several customer classes. Each customer arriving into the system brings in a certain amount of work. The server processes the incoming work using a generalized processor sharing discipline. According to this discipline, any excess capacity is split among remaining customer classes in proportion to components of some weight vector. The paper contains fluid and heavy traffic limit theorems for unfinished work, queue length, sojourn time and waiting time processes.
generalized processor sharing discipline
scientific article; zbMATH DE number 1906141
scientific article