Online Scheduling FIFO Policies with Admission and Push-Out

Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Alexander V. Sirotkin

Research output: Contribution to journalArticlepeer-review

14 Scopus citations


We consider the problem of managing a bounded size First-In-First-Out (FIFO) queue buffer, where each incoming unit-sized packet requires several rounds of processing before it can be transmitted out. Our objective is to maximize the total number of successfully transmitted packets. We consider both push-out (when a policy is permitted to drop already admitted packets) and non-push-out cases. We provide worst-case guarantees for the throughput performance of our algorithms, proving both lower and upper bounds on their competitive ratio against the optimal algorithm, and conduct a comprehensive simulation study that experimentally validates predicted theoretical behavior.

Original languageEnglish
Pages (from-to)322-344
Number of pages23
JournalTheory of Computing Systems
Issue number2
StatePublished - 1 Feb 2016
Externally publishedYes


  • Buffer management
  • Competitive analysis
  • First-in-first-out queueing
  • Online algorithms
  • Scheduling
  • Switches


Dive into the research topics of 'Online Scheduling FIFO Policies with Admission and Push-Out'. Together they form a unique fingerprint.

Cite this