Interacting queues in heavy traffic
From MaRDI portal
Publication:975795
DOI10.1007/S11134-010-9174-1zbMATH Open1203.90053OpenAlexW2126260018MaRDI QIDQ975795FDOQ975795
Publication date: 11 June 2010
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-010-9174-1
asymptotic expansioncoupled processorsperturbationheavy trafficgeneralized processor sharingbandwidth sharingfirst-order approximationtime scale decompositionstate-dependent service rates
Cites Work
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Title not available (Why is that?)
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- The asymptotic workload behavior of two coupled queues
- Processor-sharing of two parallel lines
- Fluid and heavy traffic diffusion limits for a generalized processor sharing model
- Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
- Heavy traffic analysis of two coupled processors
- The heavy traffic limit of an unbalanced generalized processor sharing model
- Analysis of generalized processor-sharing systems with two classes of customers and exponential services
- Generalized processor sharing queues with heterogeneous traffic classes
- Diffusion Approximation for Head-of-the-Line Processor Sharing for Two Parallel Queues
- Large deviations analysis of the generalized processor sharing policy
- Large deviations and the generalized processor sharing scheduling for a multiple-queue system
- Analysis of the fluid weighted fair queueing system
Cited In (10)
- Two coupled queues with vastly different arrival rates: critical loading case
- Heavily loaded queue coupled to two underloaded queues
- Analysis of a two-class single-server discrete-time FCFS queue: the effect of interclass correlation
- Title not available (Why is that?)
- On the optimization of two-class work-conserving parameterized scheduling policies
- Heavy-traffic asymptotics of a priority polling system with threshold service policy
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
- Title not available (Why is that?)
- Asymptotic analysis of two coupled queues with vastly different arrival rates and finite customer capacities
- On the three-queue priority polling system with threshold service policy
Recommendations
- 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 π π
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)