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 queueing networks, where all customers require unit service times. We extend this model to include more general queueing networks, where the customers may require diierent service times at diierent servers of the network. We prove that, unlike the previous model, in the generalized model, the unidirectional ring topology is no longer universally stable (stable against all adversaries). Nevertheless, the queueing policies proven to be universally stable for the previous model, remain universally stable in the generalized adversarial model. We also deene four new queueing policies that are natural generalizations of the queueing policies for the new model, and we examine their 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...
متن کامل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 ...
متن کامل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...
متن کامل