On queuing lengths in on-line switching

DOI10.1016/J.TCS.2005.03.025zbMath1087.68016OpenAlexW1998482902MaRDI QIDQ557908

Peter Damaschke, Zhen Zhou

Publication date: 30 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.025

zbMATH Keywords

competitive ratioqueuingonline switching

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Cites Work

• Competitive on-Line switching policies
• Balanced scheduling toward loss-free packet queuing and delay fairness
• Bounds on delays and queue lengths in input-queued cell switches
• Unnamed Item
• Unnamed Item

This page was built for publication: On queuing lengths in on-line switching