The robustness of stability under link and node failures

DOI10.1016/J.TCS.2011.08.038zbMath1227.68018OpenAlexW2059581902MaRDI QIDQ650924

Carme Àlvarez, Maria J. Serna, Maria J. Blesa

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

zbMATH Keywords

stabilityadversarial queueing theorypacket-switched networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Maria Serna's contributions to adversarial queuing theory ⋮ Stability in Heterogeneous Dynamic Multimedia Networks ⋮ Universal stability in multi-hop radio networks

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Adversarial queuing theory
• 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
• Reaching Agreement in the Presence of Faults
• 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

This page was built for publication: The robustness of stability under link and node failures