Design and evaluation of cost-aware information centric routers

Abstract

Albeit an important goal of Information Centric Networking (ICNs) is traffic reduction, a perhaps even more important aspect follows from the above achievement: the reduction of ISP operational costs that comes as consequence of the reduced load on transit and provider links. Surprisingly, to date this crucial aspect has not been properly taken into account, neither in the architectural design, nor in the operation and management of ICN proposals.In this work, we instead design a distributed cost-aware scheme that explicitly considers the cost heterogeneity among different links. We contrast our scheme with both traditional cost-blind schemes and optimal results. We further propose an architectural design to let multiple schemes be interoperable, and finally assess whether overlooking implementation details could hamper the practical relevance of our design. Numerical results show that our cost-aware scheme can yield significant cost savings, that are furthermore consistent over a wide range of scenarios.

Coupling caching and forwarding

“…It can be seen that iNRR,LCD gain is sizeable, for both binary trees (µ = 0) and trees with full redundancy (µ = 1). Yet, we point out the ultimate goal for an ISP to deploy ICN is to ameliorate the service delivered to users, while possibly reducing the delivery costs [4]. Under this light, it is hard to assess whether the technical gains shown in this section translate into economic gains that are substantial enough to justifying ICN deployment -which is outside the scope of this paper and rather calls for technico-economic studies.…”

“…For instance, in the example provided in Fig. 1 for a 4-level tree, starting at node 15, onpath caching with SPR traverses 4 caches from the edge to the root (i.e., 15, 7, 3, 1): iNRR disposes of only 2 additional off-path nodes when µ = 0 (i.e., 6, 14), but of 6 nodes when µ = 1 (i.e., 4,5,6,12,13,14).…”

Spatial Multi-LRU Caching for Wireless Networks with Coverage Overlaps

“…3(b), 3(c) on a Lattice. We compare the multi-LRU-One/All performance with different existing policies mentioned in this paper, like LFU, single-LRU, PBP [7] and GFI [19], as well as the upper bound given in (2). The parameter α is chosen equal to 1% in Fig.…”

Cost-Aware Caching: Caching More (Costly Items) for Less (ISPs Operational Expenditures)

“…III-D). For space reasons, we instead refer the reader to [27] for more insights concerning the architectural aspects, including rationales that led to a cost-aware design that exploits the caching function (e.g., as opposed to exploiting routing, forwarding or naming components).…”

“…However, we choose to primarily focus on ICN, because it represents the most challenging case for our proposal: since all decisions need to be performed at line rate, potential distributed solutions need to be effective, simple and scalable at the same time. Building on [27], that focuses on the ICN cost-awareness from an architectural perspective, this work extend its preliminary performance evaluation along several directions. Our key contributions can be summarized as follows:…”