Pages that link to "Item:Q4651481"
From MaRDI portal
The following pages link to Buffer Overflow Management in QoS Switches (Q4651481):
Displayed 38 items.
- Online scheduling FIFO policies with admission and push-out (Q255276) (← links)
- Measuring the impact of adversarial errors on packet scheduling strategies (Q282242) (← links)
- Better bounds for online \(k\)-frame throughput maximization in network switches (Q346256) (← links)
- Competitive buffer management with packet dependencies (Q388119) (← links)
- A comprehensive study of an online packet scheduling algorithm (Q391217) (← links)
- A near-optimal memoryless online algorithm for FIFO buffering two packet classes (Q391237) (← links)
- An optimal lower bound for buffer management in multi-queue switches (Q476433) (← links)
- Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms (Q528490) (← links)
- Bounded delay packet scheduling in a bounded buffer (Q613334) (← links)
- Buffer management for colored packets with deadlines (Q693758) (← links)
- Randomized competitive algorithms for online buffer management in the adaptive adversary model (Q719250) (← links)
- An experimental study of new and known online packet buffering algorithms (Q973006) (← links)
- Lower and upper bounds on FIFO buffer management in QoS switches (Q1016522) (← links)
- Online buffer management for transmitting packets with processing cycles (Q1708032) (← links)
- Comparison-based buffer management in QoS switches (Q1742380) (← links)
- Collecting weighted items from a dynamic queue (Q1939667) (← links)
- Scheduling packets with values and deadlines in size-bounded buffers (Q1944386) (← links)
- Online stochastic optimization under time constraints (Q1958625) (← links)
- A universal randomized packet scheduling algorithm (Q2017873) (← links)
- Online ascending auctions for gradually expiring items (Q2253832) (← links)
- Admission control in shared memory switches (Q2317132) (← links)
- The impact of processing order on performance: a taxonomy of semi-FIFO policies (Q2361355) (← links)
- Scheduling with deadlines and buffer management with processing requirements (Q2408172) (← links)
- Online packet scheduling with bounded delay and lookahead (Q2419122) (← links)
- Randomized two-valued bounded delay online buffer management (Q2661627) (← links)
- The loss of serving in the dark (Q2680226) (← links)
- Optimal Buffer Management for 2-Frame Throughput Maximization (Q2868651) (← links)
- Tight Analysis of Priority Queuing for Egress Traffic (Q2942419) (← links)
- Serving in the Dark should be done Non-Uniformly (Q3448776) (← links)
- Buffer Management for Packets with Processing Times (Q3452767) (← links)
- Essential Traffic Parameters for Shared Memory Switch Performance (Q3460707) (← links)
- Randomized Algorithms for Buffer Management with 2-Bounded Delay (Q3602832) (← links)
- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers (Q3638455) (← links)
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines (Q5048294) (← links)
- Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing (Q5894501) (← links)
- Overflow management with self-eliminations (Q5918714) (← links)
- An optimal algorithm for 2-bounded delay buffer management with lookahead (Q5925532) (← links)
- Overflow management with self-eliminations (Q5925615) (← links)