Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Stability of load balancing algorithms in dynamic adversarial systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Simple Routing Strategies for Adversarial Systems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On delivery times in packet networks under adversarial traffic
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
The Impact of Failure Management on the Stability of Communication Networks
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model
SIAM Journal on Computing
The necessity of timekeeping in adversarial queueing
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
The impact of dynamic adversarial attacks on the stability of heterogeneous multimedia networks
Computer Communications
Heterogenous networks can be unstable at arbitrarily low injection rates
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
| Hi-index | 0.00 |
In this paper we start the study of generalizing the Adversarial Queueing Theory aqt model towards a continuous scenario in which the usually assumed synchronicity of the evolution is not required anymore. We consider a model, named continuous AQT (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. We show that, in such a general model, having bounded queues implies bounded end-to-end packet delays and vice versa. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the protocols and the traffic patterns used in it, and that this even holds for traffic patterns that make links to be fully loaded. Concerning packet scheduling protocols, we show that the well-known lis, sis,ftg and nfs protocols remain universally stable in our model. We also show that the caqt model is strictly stronger than the aqt model by presenting scheduling policies that are unstable under the former while they are universally stable under the latter.