A theoretical model for connection caching was proposed to study this kind of connection management. While the ordinary off-line caching problem is easily solved in polynomial time, the off-line connection caching problem is NP-complete, and in fact also APX-complete, that is, it is even hard to approximate. This result was complemented by showing that a distributed version of Belady's algorithm, which is optimal for a single cache, is a 2-approximation algorithm for off-line connection-caching. Examples that show that the analysis of this algorithm is tight are provided.
|Number of pages||10|
|Journal||Conference Proceedings of the Annual ACM Symposium on Theory of Computing|
|State||Published - 1999|
|Event||Proceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 - Atlanta, GA, USA|
Duration: 1 May 1999 → 4 May 1999