Stability results for networks with input and output blocking
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
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
A note on models for non-probabilistic analysis of packet switching networks
Information Processing Letters
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Simple Routing Strategies for Adversarial Systems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Achieving stability in networks of input-queued switches
IEEE/ACM Transactions on Networking (TON)
New Stability Results for Adversarial Queuing
SIAM Journal on Computing
The complexity of deciding stability under FFS in the adversarial queueing model
Information Processing Letters
On delivery times in packet networks under adversarial traffic
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
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
Adversarial Queueing Model for Continuous Network Dynamics
Theory of Computing Systems
Deciding the FIFO stability of networks in polynomial time
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The necessity of timekeeping in adversarial queueing
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 5.23 |
In the area of communication systems, stability refers to the property of keeping the amount of traffic in the system always bounded over time. Different communication system models have been proposed in order to capture the unpredictable behavior of some users and applications. Among those proposed models the adversarial queueing theory (aqt) model turned out to be the most adequate to analyze an unpredictable network. Until now, most of the research done in this field did not consider the possibility of the adversary producing failures on the network structure. The adversarial models proposed in this work incorporate the possibility of dealing with node and link failures provoked by the adversary. Such failures produce temporal disruptions of the connectivity of the system and increase the collisions of packets in the intermediate hosts of the network, and thus the average traffic load. Under such a scenario, the network is required to be equipped with some mechanism for dealing with those collisions. In addition to proposing adversarial models for faulty systems we study the relation between the robustness of the stability of the system and the management of the queues affected by the failures. When the adversary produces link or node failures the queues associated to the corresponding links can be affected in many different ways depending on whether they can receive or serve packets, or rather that they cannot. In most of the cases, protocols and networks containing very simple topologies, which were known to be universally stable in the aqt model, turn out to be unstable under some of the newly proposed adversarial models. This shows that universal stability of networks is not a robust property in the presence of failures.