Pages that link to "Item:Q1909398"
From MaRDI portal
The following pages link to Polling systems with zero switchover times: A heavy-traffic averaging principle (Q1909398):
Displayed 34 items.
- A two-queue polling model with priority on one queue and heavy-tailed on/off sources: a heavy-traffic limit (Q298173) (← links)
- Waiting times in queueing networks with a single shared server (Q364620) (← links)
- Diffusion approximation for an overloaded \(X\) model via a stochastic averaging principle (Q475095) (← links)
- Lingering issues in distributed scheduling (Q475112) (← links)
- On two-queue Markovian polling systems with exhaustive service (Q475140) (← links)
- Finite-buffer polling systems with threshold-based switching policy (Q518440) (← links)
- A note on polling models with renewal arrivals and nonzero switch-over times (Q1003506) (← links)
- Polling: past, present, and perspective (Q1617103) (← links)
- Polling models with multi-phase gated service (Q1761781) (← links)
- Multiple-input heavy-traffic real-time queues. (Q1872351) (← links)
- Heavy traffic limits for some queueing networks (Q1872421) (← links)
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline (Q1872459) (← links)
- Polling systems with periodic server routing in heavy traffic: renewal arrivals (Q1886793) (← links)
- Stability analysis of parallel server systems under longest queue first (Q1935898) (← links)
- The impact of scheduling policies on the waiting-time distributions in polling systems (Q2018945) (← links)
- Infinite server queues in a random fast oscillatory environment (Q2052947) (← links)
- Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times (Q2108909) (← links)
- An asymptotic property of branching-type overloaded polling networks (Q2111719) (← links)
- Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms (Q2240840) (← links)
- Mathematical methods to study the polling systems (Q2457500) (← links)
- Towards a unifying theory on branching-type polling systems in heavy traffic (Q2461589) (← links)
- POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS (Q2746222) (← links)
- Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies (Q2786424) (← links)
- ON THE OPTIMAL OPEN-LOOP CONTROL POLICY FOR DETERMINISTIC AND EXPONENTIAL POLLING SYSTEMS (Q3444646) (← links)
- POLLING SYSTEMS WITH TWO-PHASE GATED SERVICE (Q3541005) (← links)
- Polling systems with periodic server routeing in heavy traffic: distribution of the delay (Q4435676) (← links)
- Heavy traffic analysis of a polling model with retrials and glue periods (Q4634191) (← links)
- DELAYS AT SIGNALIZED INTERSECTIONS WITH EXHAUSTIVE TRAFFIC CONTROL (Q4911119) (← links)
- Heavy traffic analysis of roving server networks (Q4976515) (← links)
- Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees (Q5106351) (← links)
- A Fluid-Diffusion-Hybrid Limiting Approximation for Priority Systems with Fast and Slow Customers (Q5106384) (← links)
- An ODE for an Overloaded X Model Involving a Stochastic Averaging Principle (Q5168841) (← links)
- HEAVY-TRAFFIC ANALYSIS OF <i>K</i>-LIMITED POLLING SYSTEMS (Q5349303) (← links)
- Random Fluid Limit of an Overloaded Polling Model (Q5415094) (← links)
