Skip to main content
Article thumbnail
Location of Repository

Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers

By Marcin Bienkowski and Aleksander Mądry

Abstract

We study packet buffering, a basic problem occurring in network switches. We construct an optimal 16/13-competitive randomized online algorithm PB for the case of two input buffers of arbitrary sizes. Our proof is based on geometrical transformations which allow to identify the set of sequences incurring extremal competitive ratios. Later we may analyze the performance of PB on these sequences only

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.133.985
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ii.uni.wroc.pl/~mbi... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.