5 results
Now showing1 - 5 of 5
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , Reducing content retrieval latency in ICNTo minimize content access latency within Information-centric Networking (ICN), its default caching strategy, 'Leave Copy Everywhere' (LCE), stores contents at each node along their delivery trajectory. However, this method inadvertently degrades caching efficiency due to the application of content replacement policies such as Least Recently Used (LRU). An indiscriminate replication of contents leads to lower cache hit ratios, decreased bandwidth utilization, and increased strain on content servers, resulting in longer content retrieval times. Thus, a nuanced modulation of contents' caching within the network is imperative to extend their proximity to their respective clientele. Identifying and strategically replicating high-demand contents across an optimum set of network nodes can maximize cache utilization and minimize cache pollution, notably improving network content accessibility and reducing retrieval times. We propose a caching strategy that dynamically, deterministically, and organically replicates the most popular contents to the optimum central cache nodes in the network, thus shortening the average path length that both requests and contents must traverse. Our caching strategy significantly outperforms LCE, achieving more than a 6% reduction in content retrieval path lengths. This paper comprehensively evaluates the proposed algorithm, elucidating its functionality and consequential repercussions on content redundancy, hit rate, and access time, which are paramount in the context of 6G systems. Leveraging the core principles of the introduced caching strategy, such as intelligent content distribution and proximity-based data access, can be vital for realizing Ultra-Reliable Low Latency Communications (URLLC) and enhanced Mobile Broadband (eMBB).Publicationtype: Conference Paper39 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , On popularity- and volume-based reduction of logistic costs in ICNInformation-centric networking (ICN) is structured as a distributed caching system in which user requests arrive at edge nodes and traverse the cache hierarchy to access their demanded contents. If an intermediate cache node holds a copy of the desired content, it is promptly delivered to the client within the local domain. Otherwise, it must be retrieved from external sources, causing longer access latencies and higher provisioning costs. To minimize the external logistic costs from the backhaul, we harness the potential of Interaction-based Caching to preserve the most popular and largest contents for a maximum time in the local network. This strategy increases the cache hit rate and reduces the total volume of data that needs to be imported from external sources and the associated logistic costs. Simulative performance evaluations prove the significant gains of the proposed algorithm in terms of hit ratio (over 10.64 %), external volume import (over 1.18 times relative to internal volume transport), and minimum content provisioning costs (over 5.1 times relative to internal transport costs) with respect to the Leave Copy Everywhere (LCE) strategy.Publicationtype: Conference Paper18 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , 41 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , Optimizing the Performance of the Interaction-based Caching in CCN(2022-12); LCE (Leave Copy Everywhere), as the default caching strategy of CCN (Content-Centric Networking), caches demanded contents in all en route routers. To optimally reduce the resulting redundancy, the dynamic features of contents, clients, and network elements must be entangled with those of the network's topology. Inspired by Quantum Field Theory and Newtonian Mechanics, we developed a model to comprehensively describe the clients' interactions with contents, which generate a “gravitational force” on the latter moving them toward their requesters. The “gravity” is then transformed into a topological metric to confine the replication of contents spatially to an optimum subset of caches. This Interaction-based Caching (IC) uses the couplings of contents and clients to regulate the kinematics of contents in the network deterministically. To maximize the IC's performance, the interaction terms must be adapted to the capacity and betweenness centrality degree of caches and the contents' popularity. The proposed algorithms are extensively analyzed and evaluated in various simulation scenarios showing that the IC significantly outperforms comparable caching strategies in terms of hit ratio.Publicationtype: Conference Paper38 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: without files , Interaction-based Caching in Content-Centric Networking(2022-05); CCN improves the hit performance, the content retrieval latency, and the bandwidth consumption of the network by increasing the availability of contents by in-network caching of them. To mitigate the resulting content redundancy issue, besides content replacement policies, deterministic and probabilistic caching strategies are developed to temporarily and spatially limit content replication. However, the entangling of content-related characteristics with topology-related specifics to jointly optimize caching requires further research. Inspired by Quantum Field Theory, we present a caching theory that interprets the interplay between the entities involved in caching as interaction. In the Interaction-based Caching (IC), clients of contents play the role of sources of gravitational fields, which couple to the demanded contents through intermediary force-carrying request quanta. The gravity on contents is then transformed to a graph-theoretical metric that enables the unification of the properties and states of the interacting entities with the network topology in coupling terms that describe the interactions. The multidimensional matrix structure of the coupling terms allows the differentiation between individual clients and contents, making the conduct of the kinematics of contents and requests in the network possible. This control gives rise to various policies for network management and prioritization of content clients and content producers. As a heterogeneous, implicitly cooperative, on-path as well as off-path caching strategy, the IC significantly increases the caching performance, especially concerning cache hit ratio, path length contraction, content retrieval latency, resource utilization, and service portfolio. We evaluated the performance of the IC model in a series of scenarios based on multiple simulation models with different parameterizations.Publicationtype: Conference Paper37