Better online buffer management
From MaRDI portal
Recommendations
Cited in
(22)- A comprehensive study of an online packet scheduling algorithm
- A near-optimal memoryless online algorithm for FIFO buffering two packet classes
- A universal randomized packet scheduling algorithm
- Buffer management for colored packets with deadlines
- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
- Comparison-based buffer management in QoS switches
- Breaking the barrier of 2 for the competitiveness of longest queue drop
- Dynamic buffering
- Breaking the barrier of 2 for the competitiveness of longest queue drop
- Bounded delay packet scheduling in a bounded buffer
- Prompt Mechanisms for Online Auctions
- scientific article; zbMATH DE number 1670668 (Why is no real title available?)
- Online packet scheduling for CIOQ and buffered crossbar switches
- Collecting weighted items from a dynamic queue
- Competitive buffer management with packet dependencies
- An optimal lower bound for buffer management in multi-queue switches
- The loss of serving in the dark
- Jitter regulation in an Internet router with delay constraint
- Online buffer management for transmitting packets with processing cycles
- Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time
- Improved online algorithms for buffer management in QoS switches
This page was built for publication: Better online buffer management
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934598)
