On the Relevance of Adversarial Queueing Theory in Practice

Adversarial Queueing Theory (AQT) has shown that seem-ingly innocent traffic injection rates might lead to unbounded queues in packet-switched networks- depending on schedul-ing strategies as well as topological characteristics. Little attention has been given to quantifying these effects in real-istic network configurations. In particular, the existing AQT literature makes two unrealistic assumptions: infinite buffers and perfect synchrony. Because finite buffers inherently limit queue sizes, adversarial effects ultimately lead to packet loss which we address in this work. In addition, we study the effect of imperfect network synchronization under the packet loss metric. Our results, using analysis and simulation, in-dicate that classical AQT examples appear harmless under realistic assumptions but for a novel class of adversaries con-siderably higher loss can be observed. We introduce this class by giving examples of two new AQT concepts to con-struct loss-efficient network adversaries. Our analysis proves the robustness of these new adversaries against randomized de-synchronization effects in terms of variable link delays and nodal processing