Online packet scheduling for CIOQ and buffered crossbar switches
DOI10.1007/S00453-018-0421-XzbMath1401.68022OpenAlexW2793973911WikidataQ130188122 ScholiaQ130188122MaRDI QIDQ1799227
Matthias Westermann, Matthias Englert, Kamal Al-Bawani
Publication date: 18 October 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/99884/1/WRAP-online-packet-scheduling-crossbar-switches-Englert-2018.pdf
schedulingcompetitive analysisonline algorithmsbuffer managementbuffered crossbar switchesCIOQ switches
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Lower and upper bounds on FIFO buffer management in QoS switches
- Buffer overflow management with class segregation
- Maximizing throughput in multi-queue switches
- Improved competitive performance bounds for CIOQ switches
- Online scheduling of packets with agreeable deadlines
- An improved algorithm for CIOQ switches
- Essential Traffic Parameters for Shared Memory Switch Performance
- The zero-one principle for switching networks
- Considering Suppressed Packets Improves Buffer Management in Quality of Service Switches
- Competitive buffer management for shared-memory switches
- Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers
- On the Performance of Greedy Algorithms in Packet Buffering
- Scheduling policies for CIOQ switches
- STACS 2005
- Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
- Management of multi-queue switches in QoS networks
This page was built for publication: Online packet scheduling for CIOQ and buffered crossbar switches
