Advertisement
Published in:
2009 | OriginalPaper | Chapter
Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
Author : Fei Li
Published in: Algorithmic Aspects in Information and Management
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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).