FIFO双值数据包缓存的无记忆在线算法
A Better Memoryless Online Algorithm for FIFO Buffering Packets with Two Values
摘要：
我们考虑调度数据包的值在一个容量有限的缓冲区在一个在线设置。在该模型中，存在具有有限容量的缓冲区$B$。在任何时候，缓冲区都不能容纳超过$B$个数据包。数据包会随着时间的推移而到达。每个数据包都与一个非负值相关联。数据包离开缓冲区只是因为它们被发送或丢弃。那些已经离开缓冲区的数据包将不再被重新考虑进行传递。在每个时间步中，最多可以发送缓冲区中的一个分组。数据包的发送顺序应符合其到达时间的顺序。目标是最大化以在线方式发送的数据包的总价值。在本文中，我们研究了这种FIFO缓冲模型的一个变体，其中数据包的值为1或$α> 1$。我们提出了一个确定性的无记忆1.304竞争算法。该算法具有相同的竞争比（Lotker和Patt-Shamir. PODC 2002，计算机网络2003）。然而，我们的算法更简单，不使用任何标记位。在我们的算法中使用的想法是新颖的，不同于所有以前的方法适用于一般模型及其变体。我们不会在新数据包到达时主动抢占一个数据包。相反，当缓冲器包含足够多的$α$值分组时，我们可以抢占多于一个的1值分组。
英文摘要：
We consider scheduling packets with values in a capacity-bounded buffer in an online setting. In this model, there is a buffer with limited capacity $B$. At any time, the buffer cannot accommodate more than $B$ packets. Packets arrive over time. Each packet is associated with a non-negative value. Packets leave the buffer only because they are either sent or dropped. Those packets that have left the buffer will not be reconsidered for delivery any more. In each time step, at most one packet in the buffer can be sent. The order in which the packets are sent should comply with the order of their arrival time. The objective is to maximize the total value of the packets sent in an online manner. In this paper, we study a variant of this FIFO buffering model in which a packet's value is either 1 or $α> 1$. We present a deterministic memoryless 1.304-competitive algorithm. This algorithm has the same competitive ratio as the one presented in (Lotker and Patt-Shamir. PODC 2002, Computer Networks 2003). However, our algorithm is simpler and does not employ any marking bits. The idea used in our algorithm is novel and different from all previous approaches applied for the general model and its variants. We do not proactively preempt one packet when a new packet arrives. Instead, we may preempt more than one 1-value packet when the buffer contains sufficiently many $α$-value packets.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
