Two queues with non-stochastic arrivals

This article presents a paradigm where no stochastic assumptions are made on a queue’s arrival process. To this end, we study two queueing systems which exhibit a form of stability under an arbitrary arrival process. The first queueing system applies Blackwell’s Approachability Theorem and the second analyzes the Vacuum Cleaner Problem.