FIFO queueing policies for packets with heterogeneous processing

  • Authors:

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

  • Affiliations:

  • School of Computer Science, University of Waterloo, Canada;School of Computer Science, University of Waterloo, Canada;Steklov Mathematical Institute, St. Petersburg, Russia, St. Petersburg Academic University, St. Petersburg, Russia;St. Petersburg Institute for Informatics and Automation of the RAS, St. Petersburg, Russia, St. Petersburg Academic University, St. Petersburg, Russia;St. Petersburg Academic University, St. Petersburg, Russia

  • Venue:
  • MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 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.