The authors consider a system of parallel queues with Poisson arrivals and exponentially distributed service requirements. The various queues are coupled through their service rates, causing a complex dynamic interaction. Specifically, the system consists of one primary queue and several secondary queues whose service rates depend on whether the primary queue is empty or not. Conversely, the service rate of the primary queue depends on which of the secondary queues are empty. An important special case arises when the service rates satisfy a specific relationship so that the various queues form a work-conserving system. This case is, in fact, equivalent to a so-called Generalized Processor Sharing (GPS) system. GPS-based scheduling algorithms have emerged as popular mechanisms for achieving service differentiation while providing statistical multiplexing gains. They consider a heavy-traffic scenario, and assume that each of the secondary queues is underloaded when the primary queue is busy. Using a perturbation procedure, they derive the lowest-order asymptotic approximation to the joint stationary distribution of the queue lengths, in terms of a small positive parameter measuring the closeness of the system to instability. Heuristic derivations of these results are presented. They also treat two extensions: (i) the more general work-conserving case where the service rate of a secondary queue may depend on its own length, and is a slowly varying function of the length of the primary queue; and (ii) the non-work-conserving case where the service rate of a secondary queue may depend on its own length, but not on the length of the primary queue. In my opinion it is a high quality paper.
- Heavily loaded queue coupled to two underloaded queues
- Two queues with vastly different arrival rates and processor-sharing factors
- Heavy traffic analysis of two coupled processors
- Two coupled queues with vastly different arrival rates: critical loading case
- Asymptotic Analysis of Two Coupled Large Capacity Queues with Vastly Different Arrival Rates
- Analysis of generalized processor-sharing systems with two classes of customers and exponential services
- Analysis of the fluid weighted fair queueing system
- Diffusion Approximation for Head-of-the-Line Processor Sharing for Two Parallel Queues
- Fluid and heavy traffic diffusion limits for a generalized processor sharing model
- Generalized processor sharing queues with heterogeneous traffic classes
- Heavy traffic analysis of two coupled processors
- scientific article; zbMATH DE number 3814724 (Why is no real title available?)
- Large deviations analysis of the generalized processor sharing policy
- Large deviations and the generalized processor sharing scheduling for a multiple-queue system
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Processor-sharing of two parallel lines
- Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
- The asymptotic workload behavior of two coupled queues
- The heavy traffic limit of an unbalanced generalized processor sharing model
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- Analysis of a two-class single-server discrete-time FCFS queue: the effect of interclass correlation
- Interference queueing networks on grids
- Asymptotic analysis of two coupled queues with vastly different arrival rates and finite customer capacities
- scientific article; zbMATH DE number 2088578 (Why is no real title available?)
- On the optimization of two-class work-conserving parameterized scheduling policies
- Heavy-traffic asymptotics of a priority polling system with threshold service policy
- On the three-queue priority polling system with threshold service policy
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
- Two coupled queues with vastly different arrival rates: critical loading case
- Heavily loaded queue coupled to two underloaded queues
- scientific article; zbMATH DE number 7707395 (Why is no real title available?)
- Interacting queues with server selection and coordinated scheduling-application to cellular data networks
This page was built for publication: Interacting queues in heavy traffic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975795)
