Scheduling policies for CIOQ switches
From MaRDI portal
Publication:5483512
DOI10.1016/j.jalgor.2004.09.003zbMath1101.68416WikidataQ115041880 ScholiaQ115041880MaRDI QIDQ5483512
Adi Rosén, Alexander 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
competitive analysis; scheduling policies; CIOQ switches; Buffer management; Combined Input and Output Queued architectures
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing, Better bounds for online \(k\)-frame throughput maximization in network switches, Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms, An experimental study of new and known online packet buffering algorithms, Online packet scheduling for CIOQ and buffered crossbar switches, Improved competitive performance bounds for CIOQ switches, Tight Analysis of Priority Queuing for Egress Traffic