Maximizing throughput in multi-queue switches

DOI10.1007/978-3-540-30140-0_7MaRDI QIDQ5464637zbMATH OpenOpenAlexFDO

Authors Arik Litichevskey, Yossi Azar

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

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

Recommendations

• Maximizing throughput in multi-queue switches
• Management of multi-queue switches in QoS networks
• An optimal lower bound for buffer management in multi-queue switches
• An optimal lower bound for buffer management in multi-queue switches
• Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms

Cited in

(14)

• Throughput of the set of ring channels. II: Ring switches
• Competitive on-Line switching policies
• Port partitioning and dynamic queueing for IP forwarding
• Buffer management of multi-queue QoS switches with class segregation
• Maximizing throughput in multi-queue switches
• Scheduling with deadlines and buffer management with processing requirements
• Scheduling of an input-queued switch to achieve maximal throughput
• An improved algorithm for CIOQ switches
• Buffer management for packets with processing times
• Resource Management in Large Networks
• Competitive analysis of constrained queueing systems
• scientific article; zbMATH DE number 2119707 (Why is no real title available?)
• Optimal Node Routing
• Management of multi-queue switches in QoS networks

This page was built for publication: Maximizing throughput in multi-queue switches

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