scientific article; zbMATH DE number 2079410
From MaRDI portal
Publication:4471370
Recommendations
Cited in
(35)- Lower and upper bounds on FIFO buffer management in QoS switches
- Scheduling multiclass packet streams to minimize weighted loss
- Comparison-based buffer management in QoS switches
- Collecting weighted items from a dynamic queue
- The impact of processing order on performance: a taxonomy of semi-FIFO policies
- Maximizing throughput in multi-queue switches
- Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
- Non-preemptive buffer management for latency sensitive packets
- Online packet scheduling with bounded delay and lookahead
- Online competitive algorithms for maximizing weighted throughput of unit jobs
- The loss of serving in the dark
- scientific article; zbMATH DE number 1717155 (Why is no real title available?)
- Optimal buffer management for 2-frame throughput maximization
- Tight Analysis of Priority Queuing for Egress Traffic
- Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
- Competitive queue policies for differentiated services
- Analysis of queueing policies in QoS switches
- Better bounds for online \(k\)-frame throughput maximization in network switches
- Randomized Algorithms for Buffer Management with 2-Bounded Delay
- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
- Competitive buffer management with packet dependencies
- 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
- FP/FIFO scheduling: coexistence of deterministic and probabilistic QoS guarantees
- Scheduling policies for CIOQ switches
- Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
- Competitive management of non-preemptive queues with multiple values
- An optimal algorithm for 2-bounded delay buffer management with lookahead
- Buffer management for colored packets with deadlines
- 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
- Improved competitive guarantees for QoS buffering
- An experimental study of new and known online packet buffering algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471370)
