On queuing lengths in on-line switching

DOI10.1016/J.TCS.2005.03.025zbMATH Open1087.68016OpenAlexW1998482902MaRDI QIDQ557908FDOQ557908

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds on delays and queue lengths in input-queued cell switches
• Competitive on-Line switching policies
• Balanced scheduling toward loss-free packet queuing and delay fairness

Cited In (6)

• Buffer size requirements under longest queue first
• Computing the Optimal Longest Queue Length in Torus Networks
• Title not available (Why is that?)
• Competitive on-Line switching policies
• On Queue-Size Scaling for Input-Queued Switches
• Queues with switchover. -- A review and critique

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)