The robustness of stability under link and node failures
From MaRDI portal
Publication:650924
DOI10.1016/J.TCS.2011.08.038zbMATH Open1227.68018OpenAlexW2059581902MaRDI QIDQ650924FDOQ650924
Authors: Carme Àlvarez, Maria J. Blesa, Maria Serna 
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.038
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
- Reaching Agreement in the Presence of Faults
- Adversarial queuing theory
- A note on models for non-probabilistic analysis of packet switching networks.
- Adversarial queueing model for continuous network dynamics
- The complexity of deciding stability under FFS in the adversarial queueing model
- Universal-stability results and performance bounds for greedy contention-resolution protocols
- Deciding the FIFO Stability of Networks in Polynomial Time
- Stability of load balancing algorithms in dynamic adversarial systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- New Stability Results for Adversarial Queuing
- A Characterization of Universal Stability in the Adversarial Queuing Model
- Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model
- Adversarial models for priority‐based networks
- Experimental and Efficient Algorithms
Cited In (3)
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)
