Online computation and competitive analysis
Online computation and competitive analysis
Introduction to Algorithms
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
Improved online algorithms for buffer management in QoS switches
ACM Transactions on Algorithms (TALG)
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
SIAM Journal on Computing
Multiplexing packets with arbitrary deadlines in bounded buffers
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
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
Bounded delay packet scheduling in a bounded buffer
Operations Research Letters
Scheduling Packets with Values and Deadlines in Size-Bounded Buffers
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Motivated by providing differentiated services in the Internet, we consider online buffer management algorithms for quality-of-service network switches. We study a multi-buffer model . Packets have values and deadlines; they arrive at a switch over time. The switch consists of multiple buffers whose sizes are bounded. In each time step, only one pending packet can be sent. Our objective is to maximize the total value of the packets sent by their deadlines. We employ competitive analysis to measure an online algorithm's performance. In this paper, we first show that the lower bound of competitive ratio of a broad family of online algorithms is 2. Then we propose a ($3 + \sqrt{3} \approx 4.723$)-competitive deterministic algorithm, which is improved from the previously best-known result 9.82 (Azar and Levy. SWAT 2006).