Online computation and competitive analysis
Online computation and competitive analysis
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing
An optimal online algorithm for packet scheduling with agreeable deadlines
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Better online buffer management
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Considering suppressed packets improves buffer management in QoS switches
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized Algorithms for Buffer Management with 2-Bounded Delay
Approximation and Online Algorithms
Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Buffer management for colored packets with deadlines
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A survey of buffer management policies for packet switches
ACM SIGACT News
Non-preemptive buffer management for latency sensitive packets
INFOCOM'10 Proceedings of the 29th conference on Information communications
Scheduling packets with values and deadlines in size-bounded buffers
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
A near-optimal memoryless online algorithm for FIFO buffering two packet classes
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
One to rule them all: a general randomized algorithm for buffer management with bounded delay
ESA'11 Proceedings of the 19th European conference on Algorithms
Online scheduling of packets with agreeable deadlines
ACM Transactions on Algorithms (TALG)
Open problems in throughput scheduling
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
A φ-competitive algorithm for collecting items with increasing weights from a dynamic queue
Theoretical Computer Science
Scheduling Packets with Values and Deadlines in Size-Bounded Buffers
Journal of Combinatorial Optimization
The loss of serving in the dark
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A near-optimal memoryless online algorithm for FIFO buffering two packet classes
Theoretical Computer Science
Hi-index | 0.00 |
We consider the following buffer management problem arising in QoS networks: Packets with specified weights and deadlines arrive at a network switch and need to be forwarded so that the total weight of forwarded packets is maximized. Packets not forwarded before their deadlines are lost. The main result of the article is an online 64/33 ≈ 1.939-competitive algorithm, the first deterministic algorithm for this problem with competitive ratio below 2. For the 2-uniform case we give an algorithm with ratio ≈ 1.377 and a matching lower bound.