An improved algorithm for CIOQ switches
From MaRDI portal
Publication:2944517
DOI10.1145/1150334.1150342zbMath1321.68018OpenAlexW2078182186MaRDI QIDQ2944517
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2005/67/
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (10)
The impact of processing order on performance: a taxonomy of semi-FIFO policies ⋮ Buffer Management for Packets with Processing Times ⋮ Essential Traffic Parameters for Shared Memory Switch Performance ⋮ Better bounds for online \(k\)-frame throughput maximization in network switches ⋮ Scheduling with deadlines and buffer management with processing requirements ⋮ Tight Analysis of Priority Queuing for Egress Traffic ⋮ Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms ⋮ Online packet scheduling for CIOQ and buffered crossbar switches ⋮ Admission control in shared memory switches ⋮ Online scheduling FIFO policies with admission and push-out
This page was built for publication: An improved algorithm for CIOQ switches
