Analysis of queueing policies in QoS switches
From MaRDI portal
(Redirected from Publication:3159486)
Recommendations
Cited in
(19)- Queues with switchover. -- A review and critique
- Comparison-based buffer management in QoS switches
- Preemptive and delay-based mechanisms to provide preference to emergency traffic
- A universal randomized packet scheduling algorithm
- The impact of processing order on performance: a taxonomy of semi-FIFO policies
- scientific article; zbMATH DE number 1330063 (Why is no real title available?)
- scientific article; zbMATH DE number 2079410 (Why is no real title available?)
- Competitive analysis of constrained queueing systems
- An optimal lower bound for buffer management in multi-queue switches
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
- Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
- On queuing lengths in on-line switching
- Management of multi-queue switches in QoS networks
- Competitive management of non-preemptive queues with multiple values
- An optimal algorithm for 2-bounded delay buffer management with lookahead
- Bounded delay packet scheduling in a bounded buffer
- Breaking the barrier of 2 for the competitiveness of longest queue drop
- Randomized competitive algorithms for online buffer management in the adaptive adversary model
- Breaking the barrier of 2 for the competitiveness of longest queue drop
This page was built for publication: Analysis of queueing policies in QoS switches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159486)
