On queuing lengths in on-line switching

DOI10.1016/J.TCS.2005.03.025MaRDI QIDQ557908zbMATHOpenAlexFDO

Authors 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

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) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 2119707
• Competitive on-Line switching policies
• Approximation and Online Algorithms
• Analysis of queueing policies in QoS switches
• Buffer size requirements under longest queue first

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Balanced scheduling toward loss-free packet queuing and delay fairness
• Bounds on delays and queue lengths in input-queued cell switches
• Competitive on-Line switching policies

Cited in

(6)

• On Queue-Size Scaling for Input-Queued Switches
• scientific article; zbMATH DE number 2119707 (Why is no real title available?)
• Queues with switchover. -- A review and critique
• Competitive on-Line switching policies
• Computing the Optimal Longest Queue Length in Torus Networks
• Buffer size requirements under longest queue first

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557908)