Scheduling policies for CIOQ switches

DOI10.1016/J.JALGOR.2004.09.003MaRDI QIDQ5483512zbMATHOpenAlexWikidataFDO

Authors Adi Rosén, Alex Kesselman

Publication date 14 August 2006

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.09.003

zbMATH Keywords

competitive analysisscheduling policiesCIOQ switchesBuffer managementCombined Input and Output Queued architectures

Mathematics Subject Classification ID

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

Recommendations

• Scheduling multicast input-queued switches
• scientific article; zbMATH DE number 2079410
• scientific article; zbMATH DE number 2119695
• Scheduling protocols for switches with large envelopes
• Online packet scheduling for CIOQ and buffered crossbar switches
• Achieving fair service with a hybrid scheduling scheme for CICQ switches
• Scheduling of an input-queued switch to achieve maximal throughput
• A non-uniform traffic oriented scheduling algorithm in combined input-crosspoint-queued (CICQ) switches
• scientific article; zbMATH DE number 2185540

Cited in

(23)

• Improved competitive performance bounds for CIOQ switches
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• Improved Competitive Performance Bounds for CIOQ Switches
• scientific article; zbMATH DE number 2112373 (Why is no real title available?)
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• Best effort and priority queuing policies for buffered crossbar switches
• On the speedup required for combined input- and output-queued switching
• scientific article; zbMATH DE number 2088477 (Why is no real title available?)
• A non-uniform traffic oriented scheduling algorithm in combined input-crosspoint-queued (CICQ) switches
• Optimum Scheduling and Memory Management in Input Queued Switches With Finite Buffer Space
• Tight Analysis of Priority Queuing for Egress Traffic
• scientific article; zbMATH DE number 2080898 (Why is no real title available?)
• An experimental study of new and known online packet buffering algorithms
• Better bounds for online \(k\)-frame throughput maximization in network switches
• Anchored opportunity queueing: a low-latency scheduler for fair arbitration among virtual channels.
• Best Effort and Priority Queuing Policies for Buffered Crossbar Switches
• Harmonic buffer management policy for shared memory switches
• Fast ping-pong arbitration for input-output queued packet switches
• Scheduling of an input-queued switch to achieve maximal throughput
• On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing
• Online packet scheduling for CIOQ and buffered crossbar switches
• Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
• Achieving fair service with a hybrid scheduling scheme for CICQ switches

This page was built for publication: Scheduling policies for CIOQ switches

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