Generalized connection caching

Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wide web. They extensively studied uniform connection caching, where the establishment cost is uniform for all connections [5, 6]. They showed that ordinary paging algorithms can be used to derive algorithms for uniform connection caching and analyzed various algorithms such as Belady's rule, LRU and Marking strategies. In particular, in [5] Cohen et al. showed that LRU yields a

• Type: Conference
• Year: 2000
• Where: SPAA
• Authors: Susanne Albers
• Keywords: Algorithms, Connection Caching, Distributed And Parallel Computing, Generalized Connection Caching, SPAA 2000