The robustness of stability under link and node failures
From MaRDI portal
Recommendations
- Adversarial models for priority‐based networks
- Mathematical Foundations of Computer Science 2003
- Using fluid models to prove stability of adversarial queueing networks
- Stability of networks and protocols in the adversarial queueing model for packet routing
- The increase of the instability of networks due to quasi-static link capacities
Cites work
- scientific article; zbMATH DE number 2013824 (Why is no real title available?)
- scientific article; zbMATH DE number 1775422 (Why is no real title available?)
- A Characterization of Universal Stability in the Adversarial Queuing Model
- A note on models for non-probabilistic analysis of packet switching networks.
- Adversarial models for priority‐based networks
- Adversarial queueing model for continuous network dynamics
- Adversarial queuing theory
- Deciding the FIFO Stability of Networks in Polynomial Time
- Experimental and Efficient Algorithms
- Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model
- New Stability Results for Adversarial Queuing
- Reaching Agreement in the Presence of Faults
- Stability of load balancing algorithms in dynamic adversarial systems
- The complexity of deciding stability under FFS in the adversarial queueing model
- Universal-stability results and performance bounds for greedy contention-resolution protocols
Cited in
(4)
This page was built for publication: The robustness of stability under link and node failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650924)
