Article ID: | iaor201526402 |
Volume: | 66 |
Issue: | 2 |
Start Page Number: | 88 |
End Page Number: | 97 |
Publication Date: | Sep 2015 |
Journal: | Networks |
Authors: | Chlebus Bogdan S, Cholvi Vicent, Kowalski Dariusz R |
Keywords: | networks: scheduling, combinatorial optimization, simulation |
We consider the impact of scheduling disciplines on performance of routing in the framework of adversarial queuing. We propose an adversarial model which reflects stalling of packets due to transient failures and explicitly incorporates feedback produced by a network when packets are stalled. This adversarial model provides a methodology to study stability of routing protocols when flow‐control and congestion‐control mechanisms affect the volume of traffic. We show that any scheduling policy that is universally stable, in the regular model of routing that additionally allows packets to have two priorities, remains stable in the proposed adversarial model.