Adversarial models for priority‐based networks

DOI10.1002/net.20044zbMath1061.68022OpenAlexW4230177240MaRDI QIDQ4651937

No author found.

Publication date: 23 February 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20044

zbMATH Keywords

stabilityadversarial queueing theorypacket-switched networks(contention-resolution) protocols

Mathematics Subject Classification ID

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

Related Items (9)

Maria Serna's contributions to adversarial queuing theory ⋮ Packet latency of deterministic broadcasting in adversarial multiple access channels ⋮ Stable routing scheduling algorithms in multi-hop wireless networks ⋮ Adversarial multiple access channels with individual injection rates ⋮ Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks ⋮ Universal stability in multi-hop radio networks ⋮ The robustness of stability under link and node failures ⋮ Adversarial queueing model for continuous network dynamics ⋮ Adversarial queuing theory with setups

Cites Work

• 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
• Stability of load balancing algorithms in dynamic adversarial systems
• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Adversarial models for priority‐based networks