Better bounds for online \(k\)-frame throughput maximization in network switches

DOI10.1016/J.TCS.2016.10.009zbMath1355.68029arXiv1309.4919OpenAlexW1501474073MaRDI QIDQ346256

Jun Kawahara, Shuichi Miyazaki, Koji M. Kobayashi

Publication date: 5 December 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.4919

zbMATH Keywords

competitive analysisbuffer managementonline problempacket fragmentation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online scheduling with interval conflicts
• Competitive buffer management with packet dependencies
• An optimal lower bound for buffer management in multi-queue switches
• Improved competitive guarantees for QoS buffering
• Lower and upper bounds on FIFO buffer management in QoS switches
• Harmonic buffer management policy for shared memory switches
• Maximizing throughput in multi-queue switches
• Improved competitive performance bounds for CIOQ switches
• Competitive router scheduling with structured data
• An improved algorithm for CIOQ switches
• Competitive queue policies for differentiated services
• Buffer Overflow Management in QoS Switches
• Online set packing and competitive scheduling of multi-part tasks
• On the Performance of Greedy Algorithms in Packet Buffering
• Scheduling policies for CIOQ switches
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• Management of multi-queue switches in QoS networks
• Distributed Computing

This page was built for publication: Better bounds for online \(k\)-frame throughput maximization in network switches