A Characterization of Universal Stability in the Adversarial Queuing Model

DOI10.1137/S0097539703435522zbMath1077.68656OpenAlexW2086025549MaRDI QIDQ4651525

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

Publication date: 21 February 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539703435522

zbMATH Keywords

interconnection networksgraph algorithmsnetwork stabilityadversarial queueing theorygreedy scheduling protocols

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items (14)

Maria Serna's contributions to adversarial queuing theory ⋮ Stable routing scheduling algorithms in multi-hop wireless networks ⋮ Maximum throughput of multiple access channels in adversarial environments ⋮ Stability in Heterogeneous Dynamic Multimedia Networks ⋮ The complexity of deciding stability under FFS in the adversarial queueing model ⋮ 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 ⋮ Instability behaviour of heterogeneous multimedia networks under dynamic adversarial attacks ⋮ Adversarial models for priority‐based networks ⋮ Adversarial queueing model for continuous network dynamics ⋮ The increase of the instability of networks due to quasi-static link capacities ⋮ Optimal Algorithms for Detecting Network Stability ⋮ Adversarial queuing theory with setups

This page was built for publication: A Characterization of Universal Stability in the Adversarial Queuing Model