Single-server queues with spatially distributed arrivals
From MaRDI portal
Recommendations
Cites work
- A continuous polling system with general service times
- A New Approach to the Limit Theory of Recurrent Markov Chains
- A Review of Regenerative Processes
- A splitting technique for Harris recurrent Markov chains
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- An introduction to the theory of point processes
- Construction of a stationary regenerative process
- Criteria for classifying general Markov chains
- Cyclic Bernoulli polling
- Ergodicity of a polling network
- scientific article; zbMATH DE number 4055548 (Why is no real title available?)
- scientific article; zbMATH DE number 3692406 (Why is no real title available?)
- scientific article; zbMATH DE number 19794 (Why is no real title available?)
- scientific article; zbMATH DE number 3595945 (Why is no real title available?)
- scientific article; zbMATH DE number 3796940 (Why is no real title available?)
- scientific article; zbMATH DE number 837692 (Why is no real title available?)
- Light-Traffic Analysis for Queues with Spatially Distributed Arrivals
- Monotonicity and stability of periodic polling models
- Multiqueue Systems with Nonexhaustive Cyclic Service
- On pathwise rate conservation for a class of semi-martingales
- Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules
- Poisson Arrivals See Time Averages
- Polling and greedy servers on a line
- Polling on a space with general arrival and service time distribution
- Polling systems and multitype branching processes
- Pseudo-conservation laws in cyclic-service systems
- Queueing in space
- Queueing systems on a circle
- Queues Served in Cyclic Order
- Queues with Periodic Service and Changeover Time
- Rate conservation laws: A survey
- Stability of token passing rings
- Stability, monotonicity and invariant quantities in general polling systems
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- Strengthening ergodicity to geometric ergodicity for markov chains
- Symmetric queues served in cyclic order
- The Analysis of Random Polling Systems
- The existence of moments for stationary Markov chains
- Waiting Lines and Times in a System with Polling
- Work-conserving priorities
Cited in
(17)- A continuous polling system with general service times
- On polling systems with infinitely many stations
- Polling on a space with general arrival and service time distribution
- Polling: past, present, and perspective
- Stability of a spatial polling system with greedy myopic service
- Continuous polling models and application to ferry assisted WLAN
- \(M/G/\infty\) with alternating renewal breakdowns
- Stability of polling systems with exhaustive service policies and state-dependent routing
- Greedy walk on the real line
- From polling to snowplowing
- Controlled mobility in stochastic and dynamic wireless networks
- Stability and performance of greedy server systems
- Queueing systems on a circle
- Queueing in space
- scientific article; zbMATH DE number 6729643 (Why is no real title available?)
- Spatial no-waiting stations with moving customers
- Retrial queues with constant retrial times
This page was built for publication: Single-server queues with spatially distributed arrivals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1339062)
