Single-server queues with spatially distributed arrivals
DOI10.1007/BF01158698zbMATH Open0806.60084WikidataQ118141965 ScholiaQ118141965MaRDI QIDQ1339062FDOQ1339062
Authors: Dirk P. Kroese, Volker Schmidt 
Publication date: 14 February 1995
Published in: Queueing Systems (Search for Journal in Brave)
Recommendations
Brownian motionsingle-server queueregenerative processesequilibrium equationsstochastic decompositionmean queue lengthsteady-state performance characteristicsTweedie's lemma
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- An introduction to the theory of point processes
- Poisson Arrivals See Time Averages
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- Strengthening ergodicity to geometric ergodicity for markov chains
- A Review of Regenerative Processes
- Title not available (Why is that?)
- A splitting technique for Harris recurrent Markov chains
- Polling systems and multitype branching processes
- Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules
- Monotonicity and stability of periodic polling models
- Title not available (Why is that?)
- Polling and greedy servers on a line
- Stability of token passing rings
- Stability, monotonicity and invariant quantities in general polling systems
- A continuous polling system with general service times
- Polling on a space with general arrival and service time distribution
- Title not available (Why is that?)
- Queueing in space
- Queues with Periodic Service and Changeover Time
- A New Approach to the Limit Theory of Recurrent Markov Chains
- Queueing systems on a circle
- Light-Traffic Analysis for Queues with Spatially Distributed Arrivals
- Pseudo-conservation laws in cyclic-service systems
- Title not available (Why is that?)
- Criteria for classifying general Markov chains
- The existence of moments for stationary Markov chains
- Ergodicity of a polling network
- The Analysis of Random Polling Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Queues Served in Cyclic Order
- On pathwise rate conservation for a class of semi-martingales
- Symmetric queues served in cyclic order
- Waiting Lines and Times in a System with Polling
- Multiqueue Systems with Nonexhaustive Cyclic Service
- Work-conserving priorities
- Construction of a stationary regenerative process
- Rate conservation laws: A survey
- Cyclic Bernoulli polling
Cited In (17)
- A continuous polling system with general service times
- Polling on a space with general arrival and service time distribution
- Continuous polling models and application to ferry assisted WLAN
- Stability of a spatial polling system with greedy myopic service
- Stability of polling systems with exhaustive service policies and state-dependent routing
- Polling: past, present, and perspective
- From polling to snowplowing
- Spatial no-waiting stations with moving customers
- Title not available (Why is that?)
- Queueing in space
- Queueing systems on a circle
- \(M/G/\infty\) with alternating renewal breakdowns
- On polling systems with infinitely many stations
- Controlled mobility in stochastic and dynamic wireless networks
- Stability and performance of greedy server systems
- Retrial queues with constant retrial times
- Greedy walk on the real line
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)
