Scheduling policies for CIOQ switches
From MaRDI portal
Publication:5483512
DOI10.1016/J.JALGOR.2004.09.003zbMATH Open1101.68416OpenAlexW2070119082WikidataQ115041880 ScholiaQ115041880MaRDI QIDQ5483512FDOQ5483512
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
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
competitive analysisscheduling policiesCIOQ switchesBuffer managementCombined Input and Output Queued architectures
Cited In (23)
- Harmonic buffer management policy for shared memory switches
- Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
- Fast ping-pong arbitration for input-output queued packet switches
- Anchored opportunity queueing: a low-latency scheduler for fair arbitration among virtual channels.
- Best Effort and Priority Queuing Policies for Buffered Crossbar Switches
- On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Achieving fair service with a hybrid scheduling scheme for CICQ switches
- Best effort and priority queuing policies for buffered crossbar switches
- A non-uniform traffic oriented scheduling algorithm in combined input-crosspoint-queued (CICQ) switches
- Tight Analysis of Priority Queuing for Egress Traffic
- Title not available (Why is that?)
- Scheduling of an input-queued switch to achieve maximal throughput
- Optimum Scheduling and Memory Management in Input Queued Switches With Finite Buffer Space
- Improved competitive performance bounds for CIOQ switches
- Improved Competitive Performance Bounds for CIOQ Switches
- Online packet scheduling for CIOQ and buffered crossbar switches
- Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
- Better bounds for online \(k\)-frame throughput maximization in network switches
- An experimental study of new and known online packet buffering algorithms
- On the speedup required for combined input- and output-queued switching
- Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
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)
