Stability of a spatial polling system with greedy myopic service

DOI10.1007/S10479-010-0762-6MaRDI QIDQ1761787zbMATH OpenOpenAlexWikidataFDO

Authors Lasse Leskelä, Falk Unger

Publication date 15 November 2012

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0908.4585

zbMATH Keywords

dynamic traveling repairmanquadratic Lyapunov functionalspatial birth-and-death processspatial queueing systemspatial--temporal point process

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Abstract: This paper studies a spatial queueing system on a circle, polled at random locations by a myopic server that can only observe customers in a bounded neighborhood. The server operates according to a greedy policy, always serving the nearest customer in its neighborhood, and leaving the system unchanged at polling instants where the neighborhood is empty. This system is modeled as a measure-valued random process, which is shown to be positive recurrent under a natural stability condition that does not depend on the server's scan range. When the interpolling times are light-tailed, the stable system is shown to be geometrically ergodic. The steady-state behavior of the system is briefly discussed using numerical simulations and a heuristic light-traffic approximation.

Recommendations

• On the Stability of Greedy Polling Systems with General Service Policies
• Light-Traffic Analysis for Queues with Spatially Distributed Arrivals
• Stability and performance of greedy server systems
• Stability of polling systems with exhaustive service policies and state-dependent routing
• Polling and greedy servers on a line

Cites work

• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• An Introduction to the Theory of Point Processes
• Characterization and sufficient conditions for normed ergodicity of Markov chains
• From polling to snowplowing
• scientific article; zbMATH DE number 1022658 (Why is no real title available?)
• scientific article; zbMATH DE number 3069542 (Why is no real title available?)
• Light-Traffic Analysis for Queues with Spatially Distributed Arrivals
• Markov chains and stochastic stability
• On spatial thinning-replacement processes based on Voronoi cells
• On the Stability of Greedy Polling Systems with General Service Policies
• Perfect simulation for interacting point processes, loss networks and Ising models.
• Polling and greedy servers on a line
• Polling on a space with general arrival and service time distribution
• Queueing in space
• Single-server queues with spatially distributed arrivals
• Spatial birth and death processes as solutions of stochastic equations
• Stability of polling systems with exhaustive service policies and state-dependent routing
• Stochastic relations of random variables and processes
• Strengthening ergodicity to geometric ergodicity for markov chains
• The evolution of a spatial stochastic network
• The snowblower problem
• The travel time in carousel systems under the nearest item heuristic

Cited in

(5)

• Greedy walk on the real line
• Controlled mobility in stochastic and dynamic wireless networks
• Stability and performance of greedy server systems
• Comments on: ``Polling: past, present and perspective
• The evolution of a spatial stochastic network

This page was built for publication: Stability of a spatial polling system with greedy myopic service

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761787)