Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie

Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie

Abstract

This paper presents an asymptotically optimal online algorithm for compressing the Forwarding Information Base (FIB) of a router under a stream of updates (namely insert rule, delete rule, and change port of prefix). The objective of the algorithm is to dynamically aggregate forwarding rules into a smaller but equivalent set of rules while taking into account FIB update costs. The problem can be regarded as a new variant of ski rental on the FIB trie, and we prove that our deterministic algorithm is 3.603-competitive. Moreover, a lower bound of 1.636 is derived for any online algorithm.

Grafik Top
Authors
  • Bienkowski, Marcin
  • Schmid, Stefan
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
20th International Colloquium on Structural Information and Communication Complexity (SIROCCO)
Divisions
Communication Technologies
Subjects
Informatik Allgemeines
Event Location
Ischia, Italy
Event Type
Conference
Event Dates
July 2013
Date
July 2013
Export
Grafik Top