Randomization Does Not Reduce the Average Delay in Parallel Packet Switches

DOI10.1137/050648250MaRDI QIDQ3532579zbMATH OpenOpenAlexFDO

Authors Hagit Attiya, David Hay

Publication date 28 October 2008

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

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

zbMATH Keywords

Clos networksinverse multiplexingload balancingpacket switchingqueuing delayrandomization

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• scientific article; zbMATH DE number 2163016
• Randomized parallel communications on an extension of the omega network
• STACS 2005
• Bounds on delays and queue lengths in input-queued cell switches
• scientific article; zbMATH DE number 1256754

Cited in

(5)

• Port partitioning and dynamic queueing for IP forwarding
• scientific article; zbMATH DE number 2163016 (Why is no real title available?)
• The Switch Reordering Contagion: Preventing a Few Late Packets from Ruining the Whole Party
• Randomized scheduling algorithm for input-queued switches
• STACS 2005

This page was built for publication: Randomization Does Not Reduce the Average Delay in Parallel Packet Switches

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