Optimal buffer management for 2-frame throughput maximization

DOI10.1007/978-3-319-03578-9_23MaRDI QIDQ2868651zbMATH OpenOpenAlexFDO

Authors Jun Kawahara, Koji M. Kobayashi

Publication date 17 December 2013

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-03578-9_23

Mathematics Subject Classification ID

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

Recommendations

• Better bounds for online \(k\)-frame throughput maximization in network switches
• Better bounds for online \(k\)-frame throughput maximization in network switches
• On the performance of greedy algorithms in packet buffering
• On the Performance of Greedy Algorithms in Packet Buffering
• Nearly optimal FIFO buffer management for two packet classes.

Cites work

• Buffer Overflow Management in QoS Switches
• Competitive buffer management with packet dependencies
• Competitive management of non-preemptive queues with multiple values
• Competitive queue policies for differentiated services
• Competitive router scheduling with structured data
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2079410 (Why is no real title available?)
• Improved competitive guarantees for QoS buffering
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
• Online set packing and competitive scheduling of multi-part tasks

Cited in

(3)

• Better bounds for online \(k\)-frame throughput maximization in network switches
• Better bounds for online \(k\)-frame throughput maximization in network switches
• Competitive buffer management with packet dependencies

This page was built for publication: Optimal buffer management for 2-frame throughput maximization

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