Near optimality of the discrete persistent access caching algorithm (Q5485326)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Near optimality of the discrete persistent access caching algorithm |
scientific article; zbMATH DE number 5050591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near optimality of the discrete persistent access caching algorithm |
scientific article; zbMATH DE number 5050591 |
Statements
29 August 2006
0 references
persistent-access-caching
0 references
least-recently-used caching
0 references
least-frequently-used caching
0 references
move-to-front searching
0 references
generalized Zipf's law distributions
0 references
heavy-tailed distributions
0 references
Web caching
0 references
cache fault probability
0 references
average-case analysis
0 references
0.9366711378097534
0 references
0.8072249293327332
0 references
0.7917706370353699
0 references
0.7917061448097229
0 references
0.7866761088371277
0 references
