FRINK Linked Data Fragments server

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

• W2949272603 abstract "We investigate the problem of optimal request routing and content caching in a heterogeneous network supporting in-network content caching with the goal of minimizing average content access delay. Here, content can either be accessed directly from a back-end server (where content resides permanently) or be obtained from one of multiple in-network caches. To access a piece of content, a user must decide whether to route its request to a cache or to the back-end server. Additionally, caches must decide which content to cache. We investigate the problem complexity of two problem formulations, where the direct path to the back-end server is modeled as i) a congestion-sensitive or ii) a congestion-insensitive path, reflecting whether or not the delay of the uncached path to the back-end server depends on the user request load, respectively. We show that the problem is NP-complete in both cases. We prove that under the congestion-insensitive model the problem can be solved optimally in polynomial time if each piece of content is requested by only one user, or when there are at most two caches in the network. We also identify a structural property of the user-cache graph that potentially makes the problem NP-complete. For the congestion-sensitive model, we prove that the problem remains NP-complete even if there is only one cache in the network and each content is requested by only one user. We show that approximate solutions can be found for both models within a (1-1/e) factor of the optimal solution, and demonstrate a greedy algorithm that is found to be within 1% of optimal for small problem sizes. Through trace-driven simulations we evaluate the performance of our greedy algorithms, which show up to a 50% reduction in average delay over solutions based on LRU content caching." @default.
• W2949272603 created "2019-06-27" @default.
• W2949272603 creator A5002314395 @default.
• W2949272603 creator A5026702529 @default.
• W2949272603 creator A5029159157 @default.
• W2949272603 creator A5029278506 @default.
• W2949272603 creator A5030680142 @default.
• W2949272603 creator A5036683370 @default.
• W2949272603 creator A5037538509 @default.
• W2949272603 creator A5088400668 @default.
• W2949272603 date "2014-12-31" @default.
• W2949272603 modified "2023-09-27" @default.
• W2949272603 title "On the Complexity of Optimal Routing and Content Caching in Heterogeneous Networks" @default.
• W2949272603 cites W1564544031 @default.
• W2949272603 cites W1598605111 @default.
• W2949272603 cites W1968143987 @default.
• W2949272603 cites W1972738071 @default.
• W2949272603 cites W1976986662 @default.
• W2949272603 cites W2000108799 @default.
• W2949272603 cites W2005042647 @default.
• W2949272603 cites W2018682510 @default.
• W2949272603 cites W2064540085 @default.
• W2949272603 cites W2083766832 @default.
• W2949272603 cites W2096220631 @default.
• W2949272603 cites W2129866531 @default.
• W2949272603 cites W2147020715 @default.
• W2949272603 cites W2157505978 @default.
• W2949272603 cites W2953336572 @default.
• W2949272603 cites W86044744 @default.
• W2949272603 hasPublicationYear "2014" @default.
• W2949272603 type Work @default.
• W2949272603 sameAs 2949272603 @default.
• W2949272603 citedByCount "1" @default.
• W2949272603 countsByYear W29492726032017 @default.
• W2949272603 crossrefType "posted-content" @default.
• W2949272603 hasAuthorship W2949272603A5002314395 @default.
• W2949272603 hasAuthorship W2949272603A5026702529 @default.
• W2949272603 hasAuthorship W2949272603A5029159157 @default.
• W2949272603 hasAuthorship W2949272603A5029278506 @default.
• W2949272603 hasAuthorship W2949272603A5030680142 @default.
• W2949272603 hasAuthorship W2949272603A5036683370 @default.
• W2949272603 hasAuthorship W2949272603A5037538509 @default.
• W2949272603 hasAuthorship W2949272603A5088400668 @default.
• W2949272603 hasConcept C115537543 @default.
• W2949272603 hasConcept C120314980 @default.
• W2949272603 hasConcept C2777735758 @default.
• W2949272603 hasConcept C31258907 @default.
• W2949272603 hasConcept C41008148 @default.
• W2949272603 hasConceptScore W2949272603C115537543 @default.
• W2949272603 hasConceptScore W2949272603C120314980 @default.
• W2949272603 hasConceptScore W2949272603C2777735758 @default.
• W2949272603 hasConceptScore W2949272603C31258907 @default.
• W2949272603 hasConceptScore W2949272603C41008148 @default.
• W2949272603 hasLocation W29492726031 @default.
• W2949272603 hasOpenAccess W2949272603 @default.
• W2949272603 hasPrimaryLocation W29492726031 @default.
• W2949272603 hasRelatedWork W1551092876 @default.
• W2949272603 hasRelatedWork W1981984261 @default.
• W2949272603 hasRelatedWork W2074019773 @default.
• W2949272603 hasRelatedWork W2118187651 @default.
• W2949272603 hasRelatedWork W2168360046 @default.
• W2949272603 hasRelatedWork W2236240782 @default.
• W2949272603 hasRelatedWork W2283564952 @default.
• W2949272603 hasRelatedWork W2581505013 @default.
• W2949272603 hasRelatedWork W2766867902 @default.
• W2949272603 hasRelatedWork W2775506037 @default.
• W2949272603 hasRelatedWork W2975214596 @default.
• W2949272603 hasRelatedWork W2999556202 @default.
• W2949272603 hasRelatedWork W3014585419 @default.
• W2949272603 hasRelatedWork W3080417643 @default.
• W2949272603 hasRelatedWork W3086283803 @default.
• W2949272603 hasRelatedWork W3100338043 @default.
• W2949272603 hasRelatedWork W3163357621 @default.
• W2949272603 hasRelatedWork W3168491270 @default.
• W2949272603 hasRelatedWork W3200969873 @default.
• W2949272603 hasRelatedWork W2737175610 @default.
• W2949272603 isParatext "false" @default.
• W2949272603 isRetracted "false" @default.
• W2949272603 magId "2949272603" @default.
• W2949272603 workType "article" @default.