Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms

DOI10.1016/J.TCS.2017.02.014zbMATH Open1369.68068OpenAlexW2593250799MaRDI QIDQ528490FDOQ528490

Authors: Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe 

Publication date: 12 May 2017

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

Full work available at URL: http://hdl.handle.net/2433/226938

Recommendations

• Management of multi-queue switches in QoS networks
• Buffer management of multi-queue QoS switches with class segregation
• Improved online algorithms for buffer management in QoS switches
• Algorithms – ESA 2004
• Comparison-based buffer management in QoS switches

zbMATH Keywords

competitive analysisscheduling algorithmmulti-queue switchonline buffer management

Mathematics Subject Classification ID

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

Cites Work

• Maximizing throughput in multi-queue switches
• Improved competitive performance bounds for CIOQ switches
• An improved algorithm for CIOQ switches
• Competitive queue policies for differentiated services
• Title not available (Why is that?)
• Buffer Overflow Management in QoS Switches
• Best effort and priority queuing policies for buffered crossbar switches
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• Harmonic buffer management policy for shared memory switches
• Title not available (Why is that?)
• An optimal lower bound for buffer management in multi-queue switches
• On the Performance of Greedy Algorithms in Packet Buffering
• Scheduling policies for CIOQ switches
• Management of multi-queue switches in QoS networks
• Competitive management of non-preemptive queues with multiple values
• Improved competitive guarantees for QoS buffering
• The zero-one principle for switching networks
• Nearly optimal FIFO buffer management for two packet classes.
• Analysis of queueing policies in QoS switches
• Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers
• STACS 2005
• Buffer overflow management with class segregation
• Essential traffic parameters for shared memory switch performance
• Lower and Upper Bounds on FIFO Buffer Management in QoS Switches

Cited In (11)

• Title not available (Why is that?)
• Algorithms – ESA 2004
• Algorithms – ESA 2004
• Buffer management of multi-queue QoS switches with class segregation
• Title not available (Why is that?)
• Tight Analysis of Priority Queuing for Egress Traffic
• Competitive buffer management for shared-memory switches
• Maximizing throughput in multi-queue switches
• Online packet scheduling for CIOQ and buffered crossbar switches
• Automata, Languages and Programming
• Management of multi-queue switches in QoS networks

This page was built for publication: Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms

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