111 citations · 503 across the 40 of their papers we have counts for
6 papers · 1 filter
Online Packet Scheduling with Bounded Delay and Lookahead
Martin Böhm, Marek Chrobak, Łukasz Jeż +3
We study the online bounded-delay packet scheduling problem (BDPS), where packets of unit size arrive at a router over time and need to be transmitted over a network link. Each pac…
A Comprehensive Study of an Online Packet Scheduling Algorithm
Fei Li
We study the \emph{bounded-delay model} for Qualify-of-Service buffer management. Time is discrete. There is a buffer. Unit-length jobs (also called \emph{packets}) arrive at the b…
Scheduling Packets with Values and Deadlines in Size-bounded Buffers
Fei Li
Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A n…
A Better Memoryless Online Algorithm for FIFO Buffering Packets with Two Values
Fei Li
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 . At any time, the buffer ca…
Packet Scheduling in a Size-Bounded Buffer
Fei Li
We consider algorithms to schedule packets with values and deadlines in a size-bounded buffer. At any time, the buffer can store at most B packets. Packets arrive over time. Each p…
Algorithms for Scheduling Weighted Packets with Deadlines in a Bounded Queue
Fei Li
Motivated by the Quality-of-Service (QoS) buffer management problem, we consider online scheduling of packets with hard deadlines in a finite capacity queue. At any time, a queue c…