We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Why (and when) do asymptotic methods work so well?
- Authors
Gast, Nicolas
- Abstract
Object I k i is requested according to a Poisson process of intensity HT <math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi> </mi><mi>k</mi></msub></math> ht . The TTL-approximation [[5]] is to do as if all objects were removed from the cache after HT <math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi> </mi><mi>n</mi></msup></math> ht seconds. Let HT <math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>X</mi><mi>k</mi></msub></math> ht be the time since the last request of object I k i and let HT <math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>X</mi><mrow><mo stretchy="false">(</mo><msup><mi>C</mi><mi>n</mi></msup><mo stretchy="false">)</mo></mrow></msub></math> ht be HT <math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mi>C</mi><mi>n</mi></msup></math> ht th smallest value of HT <math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>X</mi><mi>k</mi></msub></math> ht .
- Subjects
COMPUTER networks; WIRELESS communications
- Publication
Queueing Systems, 2022, Vol 100, Issue 3/4, p297
- ISSN
0257-0130
- Publication type
Article
- DOI
10.1007/s11134-022-09834-y