FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4375869462> ?p ?o ?g. }

• W4375869462 abstract "In this paper, we investigate the problem of caching in a single server setting from the stochastic optimization viewpoint. The goal here is to optimize the time average cache hit subject to a time average constraint on the fetching cost and the cache constraint when the demands are non-stationary and possibly correlated across time. We propose a modified Drift-Plus-Penalty (DPP) algorithm where at each time slot, we greedily minimize the $color{Blue}{text{difference}}$ of fetching cost and an estimated cache hit multiplied by a factor V > 0. Since the problem does not exhibit an equilibrium optimal solution, we use a T slot lookahead metric where we benchmark the performance of the proposed algorithm with respect to a genie aided cache hit which has access to demands of the future T slots. We show that with a probability of at least 1 ‒ δ, the cache hit of the proposed algorithm with respect to the genie scales as $mathcal{O}left( {frac{{{T^2} + Tlog R}}{{Vsqrt R }} + frac{T}{V}} right) + {text{ms}}{{text{e}}_{R,T}}$ and a fetching cost of $mathcal{O}left( {frac{{Vlog left( {frac{1}{delta }} right)}}{R}} right)$ is achievable, $color{Blue}{text{here}};{text{we}};{text{divide}};{text{time}};{text{into}};R;{text{blocks}};{text{of}};T;{text{slots}};{text{each}}$ and mse <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>R,T</inf> is the Mean Squared Error (MSE) of the predictor. We make the following observations to achieve better performance: (i) the MSE of the predictor should be less, (ii) V should be chosen large to achieve better cache hit but results in higher fetching cost, (iii) higher R to compensate for larger V , i.e., more time is required to achieve lower fetching cost. We corroborate these findings using a real world dataset, and show that the proposed algorithm outperforms some well known caching algorithms." @default.
• W4375869462 created "2023-05-10" @default.
• W4375869462 creator A5032473460 @default.
• W4375869462 creator A5090487504 @default.
• W4375869462 date "2023-06-04" @default.
• W4375869462 modified "2023-09-27" @default.
• W4375869462 title "Online Caching with Fetching cost for Arbitrary Demand Pattern: a Drift-Plus-Penalty Approach" @default.
• W4375869462 cites W1965569561 @default.
• W4375869462 cites W1972738071 @default.
• W4375869462 cites W1985573567 @default.
• W4375869462 cites W2039189705 @default.
• W4375869462 cites W2145357326 @default.
• W4375869462 cites W2333682396 @default.
• W4375869462 cites W2919316173 @default.
• W4375869462 cites W2963220642 @default.
• W4375869462 cites W2970917425 @default.
• W4375869462 cites W2990530686 @default.
• W4375869462 cites W3002080107 @default.
• W4375869462 cites W3034766183 @default.
• W4375869462 cites W3188959416 @default.
• W4375869462 cites W3194229936 @default.
• W4375869462 cites W3196925044 @default.
• W4375869462 cites W4301852635 @default.
• W4375869462 doi "https://doi.org/10.1109/icassp49357.2023.10097152" @default.
• W4375869462 hasPublicationYear "2023" @default.
• W4375869462 type Work @default.
• W4375869462 citedByCount "0" @default.
• W4375869462 crossrefType "proceedings-article" @default.
• W4375869462 hasAuthorship W4375869462A5032473460 @default.
• W4375869462 hasAuthorship W4375869462A5090487504 @default.
• W4375869462 hasBestOaLocation W43758694621 @default.
• W4375869462 hasConcept C11413529 @default.
• W4375869462 hasConcept C114614502 @default.
• W4375869462 hasConcept C115537543 @default.
• W4375869462 hasConcept C118615104 @default.
• W4375869462 hasConcept C13280743 @default.
• W4375869462 hasConcept C162324750 @default.
• W4375869462 hasConcept C173608175 @default.
• W4375869462 hasConcept C176217482 @default.
• W4375869462 hasConcept C185798385 @default.
• W4375869462 hasConcept C205649164 @default.
• W4375869462 hasConcept C21547014 @default.
• W4375869462 hasConcept C2524010 @default.
• W4375869462 hasConcept C2776036281 @default.
• W4375869462 hasConcept C33923547 @default.
• W4375869462 hasConcept C41008148 @default.
• W4375869462 hasConceptScore W4375869462C11413529 @default.
• W4375869462 hasConceptScore W4375869462C114614502 @default.
• W4375869462 hasConceptScore W4375869462C115537543 @default.
• W4375869462 hasConceptScore W4375869462C118615104 @default.
• W4375869462 hasConceptScore W4375869462C13280743 @default.
• W4375869462 hasConceptScore W4375869462C162324750 @default.
• W4375869462 hasConceptScore W4375869462C173608175 @default.
• W4375869462 hasConceptScore W4375869462C176217482 @default.
• W4375869462 hasConceptScore W4375869462C185798385 @default.
• W4375869462 hasConceptScore W4375869462C205649164 @default.
• W4375869462 hasConceptScore W4375869462C21547014 @default.
• W4375869462 hasConceptScore W4375869462C2524010 @default.
• W4375869462 hasConceptScore W4375869462C2776036281 @default.
• W4375869462 hasConceptScore W4375869462C33923547 @default.
• W4375869462 hasConceptScore W4375869462C41008148 @default.
• W4375869462 hasLocation W43758694621 @default.
• W4375869462 hasOpenAccess W4375869462 @default.
• W4375869462 hasPrimaryLocation W43758694621 @default.
• W4375869462 hasRelatedWork W1485630101 @default.
• W4375869462 hasRelatedWork W1605665967 @default.
• W4375869462 hasRelatedWork W2356060994 @default.
• W4375869462 hasRelatedWork W2357388125 @default.
• W4375869462 hasRelatedWork W2366024859 @default.
• W4375869462 hasRelatedWork W2372542233 @default.
• W4375869462 hasRelatedWork W2957999883 @default.
• W4375869462 hasRelatedWork W3033597088 @default.
• W4375869462 hasRelatedWork W4286566639 @default.
• W4375869462 hasRelatedWork W4383645891 @default.
• W4375869462 isParatext "false" @default.
• W4375869462 isRetracted "false" @default.
• W4375869462 workType "article" @default.