A note on models for non-probabilistic analysis of packet switching networks.

DOI10.1016/S0020-0190(02)00312-5zbMath1042.68020MaRDI QIDQ1853146

Adi Rosén

Publication date: 21 January 2003

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

zbMATH Keywords

SchedulingPacket switching network

Mathematics Subject Classification ID

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

Related Items (5)

Maria Serna's contributions to adversarial queuing theory ⋮ Maximum throughput of multiple access channels in adversarial environments ⋮ Adversarial multiple access channels with individual injection rates ⋮ The robustness of stability under link and node failures ⋮ On deciding stability of multiclass queueing networks under buffer priority scheduling policies

Cites Work

• Unnamed Item
• Adaptive packet routing for bursty adversarial traffic
• Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
• Adversarial queuing theory
• Universal-stability results and performance bounds for greedy contention-resolution protocols

This page was built for publication: A note on models for non-probabilistic analysis of packet switching networks.