A non-uniform traffic oriented scheduling algorithm in combined input-crosspoint-queued (CICQ) switches

DOI10.1080/17445760600568113MaRDI QIDQ5481722zbMATH OpenOpenAlexFDO

Authors Junzhou Luo, Yong Lee, Jun Wu

Publication date 10 August 2006

Published in International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/17445760600568113

zbMATH Keywords

packet schedulingtime complexityround-robinCICQ switch

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)

Recommendations

• Scheduling of an input-queued switch to achieve maximal throughput
• Online packet scheduling for CIOQ and buffered crossbar switches
• Scheduling policies for CIOQ switches
• scientific article; zbMATH DE number 2165697
• An improved algorithm for CIOQ switches

Cited in

(8)

• A numerical study of the upper bound of the throughput of a crossbar switch utilizing MiMa-algorithm
• Asymptotic Performance Limits of Switches With Buffered Crossbars Supporting Multicast Traffic
• scientific article; zbMATH DE number 2088474 (Why is no real title available?)
• Scheduling policies for CIOQ switches
• A traffic adaptive iSLIP scheduling algorithm
• Scheduling of an input-queued switch to achieve maximal throughput
• scientific article; zbMATH DE number 2165697 (Why is no real title available?)
• Achieving fair service with a hybrid scheduling scheme for CICQ switches

This page was built for publication: A non-uniform traffic oriented scheduling algorithm in combined input-crosspoint-queued (CICQ) switches

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