FIFO Queueing Policies for Packets with Heterogeneous Processing

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

Abstract

We consider the problem of managing a bounded size FirstIn-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 the policy is permitted to drop already admitted packets) and non-push-out cases. In particular, we provide analytical guarantees for the throughput performance of our algorithms. We further conduct a comprehensive simulation study which experimentally validates the predicted theoretical behaviour.

Original languageEnglish
Title of host publicationDesign and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings
EditorsGuy Even, Dror Rawitz
PublisherSpringer Science and Business Media Deutschland GmbH
Pages248-260
Number of pages13
ISBN (Print)9783642348617
DOIs
StatePublished - 2012
Externally publishedYes
Event1st Mediterranean Conference on Algorithms, MedAlg 2012 - Kibbutz Ein Gedi, Israel
Duration: 3 Dec 20125 Dec 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7659 LNNS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st Mediterranean Conference on Algorithms, MedAlg 2012
Country/TerritoryIsrael
CityKibbutz Ein Gedi
Period3/12/125/12/12

Keywords

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

Fingerprint

Dive into the research topics of 'FIFO Queueing Policies for Packets with Heterogeneous Processing'. Together they form a unique fingerprint.

Cite this