The complexity of deciding stability under FFS in the adversarial queueing model

DOI10.1016/J.IPL.2004.02.016MaRDI QIDQ2390263zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 21 July 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.02.016

zbMATH Keywords

graph algorithmsinterconnection networksnetwork stabilityadversarial queueing theorygreedy scheduling protocolspacket-switched interconnection networks

Mathematics Subject Classification ID

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

Recommendations

• Distributed Computing
• Stability of networks and protocols in the adversarial queueing model for packet routing
• Adversarial models for priority‐based networks
• Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks
• New Stability Results for Adversarial Queuing

Cites work

• A Characterization of Universal Stability in the Adversarial Queuing Model
• Adversarial queuing theory
• Stability of networks and protocols in the adversarial queueing model for packet routing
• Universal-stability results and performance bounds for greedy contention-resolution protocols

Cited in

(7)

• Maria Serna's contributions to adversarial queuing theory
• Distributed Computing
• Optimal Algorithms for Detecting Network Stability
• A Characterization of Universal Stability in the Adversarial Queuing Model
• Adversarial models for priority‐based networks
• New Stability Results for Adversarial Queuing
• The robustness of stability under link and node failures

This page was built for publication: The complexity of deciding stability under FFS in the adversarial queueing model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390263)