The Necessity of Timekeeping in Adversarial Queueing
نویسنده
چکیده
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze classes of queueing strategies. We introduce the class of queueing strategies that base their preferences on knowledge of the entire graph, the path of the packet and its progress. This restriction only rules out time keeping information like a packet’s age or its current waiting time. We show that all strategies without time stamping have exponential queue sizes, suggesting that time keeping is necessary to obtain subexponential performance bounds. We further introduce a new method to prove stability for strategies without time stamping and show how it can be used to completely characterize a large class of strategies as to their 1-stability and universal stability.
منابع مشابه
Using fluid models to prove stability of adversarial queueing networks
A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is defined to be stable if the number of packets stays bounded over time. A central question is to determine which adversarial queueing networks are stable under every work-conserving packet routing policy. Our main result is that stability of an adversarial queueing network is imp...
متن کاملGamarnik : Using Fluid Models to Prove Stability of Adversarial Queueing Networks
| A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is deened to be stable if the number of packets stays bounded over time. A central question is to determine which adversarial queueing networks are stable under every work-conserving packet routing policy. Our main result is that stability of an adversarial queueing network is im...
متن کاملStability of Adversarial Queues via Fluid Models
The subject of this paper is stability properties of adversarial queueing networks. Such queueing systems are used to model packet switch communication networks, in which packets are generated and routed dynamically, and have become a subject of research focus recently. Adversarial queueing networks are defined to be stable, if the number of packets stays bounded over time. A central question i...
متن کاملAdversarial Models for Priority-Based Networks
We propose several variations of the adversarial queueing model to cope with packets that can have different priorities, the priority and variable priority models, and link failures, the failure and reliable models. We address stability issues in the proposed adversarial models. We show that the set of universally stable networks in the adversarial model remains the same in the four introduced ...
متن کاملPanayiotis Tsaparas : Stability in Generalized Adversarial Queueing Theory 3
Queueing networks are important models of complex systems, such as packet routing networks, manufacturing systems, and time shared computer systems. In this paper, we investigate the question of stability of multiclass queueing networks within the adversarial queueing theory model, where workload is induced by an adversary. Prior work in the adversarial model considers only a special case of qu...
متن کامل