Management of multi-queue switches in QoS networks

DOI10.1007/S00453-005-1159-9MaRDI QIDQ5896813zbMATH OpenOpenAlexFDO

Authors Yossi Azar, Yossi Richter

Publication date 21 March 2006

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-005-1159-9

zbMATH Keywords

quality of service

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

• Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
• Comparison-based buffer management in QoS switches
• Buffer management of multi-queue QoS switches with class segregation
• Algorithms – ESA 2004
• Analysis of queueing policies in QoS switches

Cited in

(26)

• Lower and upper bounds on FIFO buffer management in QoS switches
• Deferred on-line bipartite matching
• Online packet scheduling for CIOQ and buffered crossbar switches
• Buffer management of multi-queue QoS switches with class segregation
• Maximizing throughput in multi-queue switches
• Non-preemptive buffer management for latency sensitive packets
• Improved competitive performance bounds for CIOQ switches
• Tight Analysis of Priority Queuing for Egress Traffic
• Research on per-flow queue management and scheduling
• Analysis of queueing policies in QoS switches
• On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
• Better bounds for online \(k\)-frame throughput maximization in network switches
• Resource Management in Large Networks
• scientific article; zbMATH DE number 2080430 (Why is no real title available?)
• An optimal lower bound for buffer management in multi-queue switches
• scientific article; zbMATH DE number 1900301 (Why is no real title available?)
• Considering suppressed packets improves buffer management in quality of service switches
• Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
• Algorithms – ESA 2004
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• Bounded delay packet scheduling in a bounded buffer
• Breaking the barrier of 2 for the competitiveness of longest queue drop
• Class fairness in online matching
• Breaking the barrier of 2 for the competitiveness of longest queue drop
• On-line maximum matching in complete multi-partite graphs with an application to optical networks
• An experimental study of new and known online packet buffering algorithms

This page was built for publication: Management of multi-queue switches in QoS networks

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