Improved competitive performance bounds for CIOQ switches

DOI10.1007/S00453-011-9539-9MaRDI QIDQ2429338zbMATH OpenOpenAlexWikidataFDO

Authors Alex Kesselman, Kirill Kogan, Michael Segal

Publication date 26 April 2012

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-011-9539-9

zbMATH Keywords

competitive analysiscontrol policiesbuffered crossbar switchescombined input and output queued (CIOQ) architectures

Mathematics Subject Classification ID

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

Recommendations

• Improved Competitive Performance Bounds for CIOQ Switches
• Scheduling policies for CIOQ switches
• An improved algorithm for CIOQ switches
• Online packet scheduling for CIOQ and buffered crossbar switches
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing

Cites work

• scientific article; zbMATH DE number 5159825 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2079411 (Why is no real title available?)
• An Experimental Study of New and Known Online Packet Buffering Algorithms
• Best Effort and Priority Queuing Policies for Buffered Crossbar Switches
• Buffer overflows of merging streams
• Harmonic buffer management policy for shared memory switches
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
• Management of multi-queue switches in QoS networks
• Maximizing throughput in multi-queue switches
• On the Performance of Greedy Algorithms in Packet Buffering
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• Scheduling policies for CIOQ switches
• The zero-one principle for switching networks

Cited in

(14)

• Buffer management for packets with processing times
• Improved Competitive Performance Bounds for CIOQ Switches
• Effect of global FCFS and relative load distribution in two-class queues with dedicated servers
• A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline
• Tight Analysis of Priority Queuing for Egress Traffic
• The impact of processing order on performance: a taxonomy of semi-FIFO policies
• Better bounds for online \(k\)-frame throughput maximization in network switches
• Essential traffic parameters for shared memory switch performance
• Online scheduling FIFO policies with admission and push-out
• Admission control in shared memory switches
• 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
• Scheduling with deadlines and buffer management with processing requirements

This page was built for publication: Improved competitive performance bounds for CIOQ switches

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