Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks

DOI10.1137/S0097539700369168zbMath1029.68027OpenAlexW2034245857MaRDI QIDQ4706197

David Gamarnik

Publication date: 19 June 2003

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

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

zbMATH Keywords

schedulingcongestionmulticommodity flow

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Robust Queueing Theory ⋮ Stable routing scheduling algorithms in multi-hop wireless networks ⋮ Maximum throughput of multiple access channels in adversarial environments ⋮ Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks ⋮ Universal stability in multi-hop radio networks ⋮ On deciding stability of multiclass queueing networks under buffer priority scheduling policies

This page was built for publication: Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks