The critical greedy server on the integers is recurrent

DOI10.1214/18-AAP1434zbMath1425.60076arXiv1712.03026OpenAlexW2772358464MaRDI QIDQ1737969

James R. Cruise, Andrew R. Wade

Publication date: 24 April 2019

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

recurrencequeueing systemiterated logarithm lawgreedy server

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (1)

Random walks avoiding their convex hull with a finite memory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability and performance of greedy server systems
• On the greedy walk problem
• Polling and greedy servers on a line
• Stability of polling systems with exhaustive service policies and state-dependent routing
• Greedy walk on the real line
• Stochastic-Process Limits
• The Gillis–Domb–Fisher correlated random walk
• Random Geometric Graphs
• Absolute Estimates of the Rate of Convergence to Stable Laws
• Probability

This page was built for publication: The critical greedy server on the integers is recurrent