IMDEA Networks Institute Publications Repository

Online Scheduling FIFO Policies with Admission and Push-Out

Kogan, Kirill and López-Ortiz, Alejandro and Nikolenko, Sergey and Sirotkin, Alexander V. (2015) Online Scheduling FIFO Policies with Admission and Push-Out. [Journal Articles]

[img]
Preview
PDF (Online Scheduling FIFO Policies with Admission and Push-Out) - Published Version
Download (1137Kb) | Preview

Abstract

We consider the problem of managing a bounded size First-InFirst-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.

Item Type: Journal Articles
Uncontrolled Keywords: Scheduling, buffer management, first-in-first-out queueing, switches, online algorithms, competitive analysis.
Subjects: UNSPECIFIED
Divisions: UNSPECIFIED
Depositing User: Kirill Kogan
Date Deposited: 09 Mar 2015 10:49
Last Modified: 30 Nov 2016 12:21
URI: http://eprints.networks.imdea.org/id/eprint/995

Actions (login required)

View Item View Item