Stability and performance of greedy server systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 994725 (Why is no real title available?)
- scientific article; zbMATH DE number 4055548 (Why is no real title available?)
- scientific article; zbMATH DE number 1191608 (Why is no real title available?)
- scientific article; zbMATH DE number 953818 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- A continuous polling system with general service times
- From polling to snowplowing
- Heavy traffic analysis for continuous polling models
- Light-Traffic Analysis for Queues with Spatially Distributed Arrivals
- On the Stability of Greedy Polling Systems with General Service Policies
- Polling and greedy servers on a line
- Polling on a space with general arrival and service time distribution
- Polling, Greedy and Horizon Servers on a Circle
- Queueing in space
- Queueing systems on a circle
- Single-server queues with spatially distributed arrivals
- Stability of a spatial polling system with greedy myopic service
- Stability of polling networks with state-dependent server routing
- Stability of polling systems with exhaustive service policies and state-dependent routing
- The evolution of a spatial stochastic network
- The snowblower problem
Cited in
(14)- Comments on: ``Polling: past, present and perspective
- scientific article; zbMATH DE number 1191608 (Why is no real title available?)
- On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
- Polling: past, present, and perspective
- Controlled mobility in stochastic and dynamic wireless networks
- On the greedy walk problem
- Polling and greedy servers on a line
- Greedy walk on the real line
- Continuous polling models and application to ferry assisted WLAN
- Stability of a spatial polling system with greedy myopic service
- Stability of the greedy algorithm on the circle
- Retrial queues with constant retrial times
- Queueing systems on a circle
- The critical greedy server on the integers is recurrent
This page was built for publication: Stability and performance of greedy server systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383183)