Optimal smoothing schedules for real-time streams (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Nearly optimal FIFO buffer management for DiffServ
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Loss-bounded analysis for differentiated services
Journal of Algorithms
Management of multi-queue switches in QoS networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing
Three dozen papers on online algorithms
ACM SIGACT News
Randomized qeue management for DiffServ
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Competitive queue policies for differentiated services
Journal of Algorithms
A tight bound on online buffer management for two-port shared-memory switches
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
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
A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches
IEICE - Transactions on Information and Systems
Competitive FIFO Buffer Management for Weighted Packets
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Buffer management for colored packets with deadlines
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
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
How much information about the future is needed?
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Geometric aspects of online packet buffering: an optimal randomized algorithm for two buffers
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Non-preemptive buffer management for latency sensitive packets
INFOCOM'10 Proceedings of the 29th conference on Information communications
An optimal lower bound for buffer management in multi-queue switches
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The loss of serving in the dark
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We consider FIFO buffer management for switches providing differentiated services. In each time step, an arbitrary number of packets arrive, and only one packet can be sent. The buffer can store a limited number of packets, and, due to the FIFO property, the sequence of sent packets has to be a subsequence of the arriving packets. The differentiated service model is abstracted by attributing each packet with a value according to its service level. A buffer management strategy can drop packets. The goal is to maximize the sum of values of sent packets. For only two different packet values, we introduce the account strategy and prove that this strategy achieves an optimal competitive ratio of ≈ 1.282, if the buffer size tends to infinity, and an optimal competitive ratio of (√13-1)/2 ≈ 1.303, for arbitrary buffer sizes. For general packet values, the simple preemptive greedy strategy (PG) is studied. We show that PG achieves a competitive ratio of √3 ≈ 1.732 which is the best known upper bound on the competitive ratio of this problem. In addition, we give a lower bound of of 1+1/√2 ≈ 1.707 on the competitive ratio of PG which improves the previously known lower bound. As a consequence, the competitive ratio of PG cannot be further improved significantly.