Best Effort and Priority Queuing Policies for Buffered Crossbar Switches

DOI10.1007/978-3-540-69355-0_15MaRDI QIDQ3511396zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Kirill Kogan, Michael Segal, Alex Kesselman

Publication date 10 July 2008

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69355-0_15

Mathematics Subject Classification ID

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

Recommendations

• Best effort and priority queuing policies for buffered crossbar switches
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• Scheduling policies for CIOQ switches
• Online packet scheduling for CIOQ and buffered crossbar switches

Cited in

(10)

• Performance analysis of clock-regulated queues with output multiplexing in three different 2x2 crossbar switch architectures
• Resource allocation for quality of service provision in multistage buffered crossbar switches
• Design of a crossbar VOQ real-time switch with clock-driven scheduling for a guaranteed delay bound
• Improved competitive performance bounds for CIOQ switches
• Packetized smooth switching for buffered crossbar switches
• Birkhoff-von Neumann input-buffered crossbar switches for guaranteed-rate services
• Best effort and priority queuing policies for buffered crossbar switches
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• High-performance switching based on buffered crossbar fabrics

This page was built for publication: Best Effort and Priority Queuing Policies for Buffered Crossbar Switches

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