Online Tree Caching

Online Tree Caching

Abstract

We initiate the study of a natural and practically relevant new variant of online caching with bypassing where the to-be-cached items can have dependencies. We assume that the universe is a tree T and items are tree nodes; we require that if a node v is cached then the whole subtree T(v) rooted at v is cached as well. This theoretical problem finds an immediate application in the context of forwarding table optimization in IP routing and software-defined networks. We present an elegant online deterministic algorithm TC for this problem, and rigorously prove that its competitive ratio is O(height(T)·kONL/(kONL−kOPT+1)), where kONL and kOPT denote the cache sizes of an online and the optimal offline algorithm, respectively. The result is optimal up to a factor of O(height(T)).

Grafik Top
Authors
  • Bienkowski, Marcin
  • Marcinkowski, Jan
  • Pacut, Maciej
  • Schmid, Stefan
  • Spyra, Aleksandra
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
Divisions
Communication Technologies
Subjects
Informatik Allgemeines
Event Location
Washington D.C., USA
Event Type
Conference
Event Dates
July 2017
Date
2017
Export
Grafik Top