Adaptive packet routing for bursty adversarial traffic
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Stability and non-stability of the FIFO protocol
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
New Stability Results for Adversarial Queuing
SIAM Journal on Computing
A Characterization of Universal Stability in the Adversarial Queuing Model
SIAM Journal on Computing
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model
SIAM Journal on Computing
The Impact of Network Structure on the Stability of Greedy Protocols
Theory of Computing Systems
Source routing and scheduling in packet networks
Journal of the ACM (JACM)
The impact of dynamic adversarial attacks on the stability of heterogeneous multimedia networks
Computer Communications
Hi-index | 5.23 |
In this work, we study the impact of the dynamic changing of the network link capacities on the stability properties of packet-switched networks. Especially, we consider the Adversarial, Quasi-Static Queuing Theory model, where each link capacity may take on only two possible (integer) values, namely 1 and C1 under a (w,@r)-adversary. We obtain the following results: *Allowing such dynamic changes to the link capacities of a network with just ten nodes that uses the LIS (Longest-in-System) protocol for contention-resolution results in instability at rates @r2-1 and for large enough values of C. *The combination of dynamically changing link capacities with compositions of contention-resolution protocols on network queues suffices for similar instability bounds: The composition of LIS with any of SIS (Shortest-in-System), NTS (Nearest-to-Source), and FTG (Furthest-to-Go) protocols is unstable at rates @r2-1 for large enough values of C. *The instability bound of the network subgraphs that are forbidden for stability is affected by the dynamic changes to the link capacities: we present improved instability bounds for all the directed subgraphs that were known to be forbidden for stability on networks running a certain greedy protocol.