Performance and stability bounds for dynamic networks

In this work, we study the impact of dynamically changing link capacities on the delay bounds of LIS (longest-in-system) and SIS (shortest-in-system) protocols on specific networks (that can be modelled as directed acyclic graphs - DAGs) and stability bounds of greedy contention-resolution protocols running on arbitrary networks under the adversarial queueing theory. Especially, we consider the model of dynamic capacities, where each link capacity may take on integer values from [1,C] with C > 1, under a (w,p)-adversary.