Hash-routing Schemes for Information Centric Networking Lorenzo - - PowerPoint PPT Presentation

▶
hash routing schemes for information centric networking
SMART_READER_LITE
LIVE PREVIEW

Hash-routing Schemes for Information Centric Networking Lorenzo - - PowerPoint PPT Presentation

Dec 02, 2022 19 likes •352 views

Hash-routing Schemes for Information Centric Networking Lorenzo Saino, Ioannis Psaras, George Pavlou Communications and Information Systems Group Department of Electrical and Electronics Engineering University College London

slide-1
SLIDE 1

Hash-routing Schemes for Information Centric Networking

Lorenzo Saino, Ioannis Psaras, George Pavlou

Communications and Information Systems Group Department of Electrical and Electronics Engineering University College London {l.saino,i.psaras,g.pavlou}@ucl.ac.uk

slide-2
SLIDE 2

In-network Caching Challenges1

Cache placement Content placement Request-to- cache routing

  • 1D. Kutscher and et al. ICN Research Challenges. IRTF draft

draft-kutscher-icnrg-challenges-01, July 2013.

slide-3
SLIDE 3

In-network Caching Challenges1

Cache placement Content placement Request-to- cache routing

  • 1D. Kutscher and et al. ICN Research Challenges. IRTF draft

draft-kutscher-icnrg-challenges-01, July 2013.

slide-4
SLIDE 4

Content Placement and Request-to-cache Routing

◮ On-path caching with opportunistic request-to-cache routing

◮ Very scalable but limited cache hits due to redundant caching of

contents

◮ Examples: LCE, ProbCache, centrality-based caching

◮ Off-path caching with co-ordinated request-to-cache routing

◮ High cache hits but limited scalability due to per-content state

required for routing

◮ Hybrid Techniques

◮ Mix features of on-path and off-path techniques ◮ E.g. SCAN

slide-5
SLIDE 5

Hash-routing

Hash-routing is a well-known Web caching technique to map content requests to nodes of a cache cluster using a hash function.

. . .

1 2 3 N Req(C) N = H(C)

Internet Enterprise network

slide-6
SLIDE 6

Hash-routing for Information Centric Networking

Functional entities:

◮ Edge nodes: Compute hash function and forward request and

content packets to the responsible cache nodes

◮ Cache nodes: Store content objects for which they are responsible

Proposed routing schemes:

◮ Base schemes: Symmetric, Asymmetric, Multicast ◮ Hybrid schemes: Asymmetric-Multicast, Symmetric-Multicast

slide-7
SLIDE 7

Request routing

RECEIVER SOURCE

The ingress edge node computes hash function to map the content identifier to the responsible cache node

slide-8
SLIDE 8

Request routing

RECEIVER SOURCE

The ingress edge node forwards request to resolved cache node

slide-9
SLIDE 9

Request routing

RECEIVER SOURCE

If the responsible cache node has a copy of the requested content, it serves it to receiver

slide-10
SLIDE 10

Request routing

RECEIVER SOURCE

Otherwise, it forwards the request towards the original content source

slide-11
SLIDE 11

Content routing - Symmetric

RECEIVER SOURCE

slide-12
SLIDE 12

Content routing - Symmetric

RECEIVER SOURCE

◮ Content packets follow the same path of the request

slide-13
SLIDE 13

Content routing - Symmetric

RECEIVER SOURCE

◮ Content packets follow the same path of the request ◮ This approach can achieve high cache hit rate but at the cost of

possibly increasing intradomain link load

slide-14
SLIDE 14

Content routing - Asymmetric

RECEIVER SOURCE

slide-15
SLIDE 15

Content routing - Asymmetric

RECEIVER SOURCE

◮ Content packets are always forwarded over the shortest path

slide-16
SLIDE 16

Content routing - Asymmetric

RECEIVER SOURCE

◮ Content packets are always forwarded over the shortest path ◮ This approach has minor impact on link load but cache nodes with

small betweenness centrality may be underutilized

slide-17
SLIDE 17

Content routing - Multicast

RECEIVER SOURCE

slide-18
SLIDE 18

Content routing - Multicast

RECEIVER SOURCE

◮ Content packets are multicast to receiver and cache nodes

slide-19
SLIDE 19

Content routing - Multicast

RECEIVER SOURCE

◮ Content packets are multicast to receiver and cache nodes ◮ This approach can achieve high cache hits and low latency, but may

increase link load depending on network topology

slide-20
SLIDE 20

Content routing - Symmetric-Multicast Hybrid

RECEIVER SOURCE

Edge nodes decide to forward content packets in a multicast or symmetric manner in order to minimize the total cost of the traversed path

slide-21
SLIDE 21

Content routing - Symmetric-Multicast Hybrid

RECEIVER SOURCE

Edge nodes decide to forward content packets in a multicast or symmetric manner in order to minimize the total cost of the traversed path

slide-22
SLIDE 22

Content routing - Symmetric-Multicast Hybrid

RECEIVER SOURCE

Edge nodes decide to forward content packets in a multicast or symmetric manner in order to minimize the total cost of the traversed path

slide-23
SLIDE 23

Content routing - Symmetric-Multicast Hybrid

RECEIVER SOURCE

Edge nodes decide to forward content packets in a multicast or symmetric manner in order to minimize the total cost of the traversed path

slide-24
SLIDE 24

Content routing - Asymmetric-Multicast Hybrid

RECEIVER SOURCE

Edge nodes select multicast delivery only if the marginal cost of the multicast path with respect to the source-receiver shortest path is smaller than a predefined threshold.

slide-25
SLIDE 25

Content routing - Asymmetric-Multicast Hybrid

RECEIVER SOURCE

S =

  • MULTICAST

if C = CMCAST −CASYMM

CMAX

< kMAX ∈ (0, 1) ASYMM

  • therwise
slide-26
SLIDE 26

Content routing - Asymmetric-Multicast Hybrid

RECEIVER SOURCE

◮ We use unitary link weights to calculate path costs and KMAX = 0.3 ◮ CASYMM = 3, CMCAST = 4, CMAX = 4 ◮ C = 0.25 < KMAX = 0.3: multicast is used

slide-27
SLIDE 27

Content routing - Asymmetric-Multicast Hybrid

RECEIVER SOURCE

◮ We use unitary link weights to calculate path costs and KMAX = 0.3 ◮ CASYMM = 3, CMCAST = 4, CMAX = 4 ◮ C = 0.25 < KMAX = 0.3: multicast is used

slide-28
SLIDE 28

Content routing - Asymmetric-Multicast Hybrid

RECEIVER SOURCE

◮ We use unitary link weights to calculate path costs and KMAX = 0.3 ◮ CASYMM = 3, CMCAST = 5, CMAX = 4 ◮ C = 0.5 > KMAX = 0.3: asymmetric is used

slide-29
SLIDE 29

Content routing - Asymmetric-Multicast Hybrid

RECEIVER SOURCE

◮ We use unitary link weights to calculate path costs and KMAX = 0.3 ◮ CASYMM = 3, CMCAST = 5, CMAX = 4 ◮ C = 0.5 > KMAX = 0.3: asymmetric is used

slide-30
SLIDE 30

Performance evaluation

◮ Evaluation was carried out using using our Icarus simulator. We made

all code required to reproduce this paper’s results publicly available2

◮ We investigate the performance of the proposed schemes in terms of

cache-hit ratio and link load and analyse their sensitivity against:

◮ cache to content population ratio (C): 0.04% - 5% ◮ content popularity skewness (α): 0.6 - 1.1

◮ Real network topologies:

◮ GEANT: European academic network ◮ GARR: Italian academic network ◮ WIDE: Japanese academic network ◮ Tiscali: pan-European commercial ISP

2http://www.ee.ucl.ac.uk/~lsaino/software/icarus/

slide-31
SLIDE 31

Performance evaluation

Cache hits and intradomain link load vs α (GEANT, C = 0.2%)

0.6 0.7 0.8 0.9 1.0 1.1 Content popularity skewness (α) 0.0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 Cache hit ratio HR Symm HR Asymm HR Hybrid AM ProbCache Ubiquitous Optimal

(a) Cache hits

0.6 0.7 0.8 0.9 1.0 1.1 Content popularity skewness (α) 400 500 600 700 800 900 1000 Average link load (Mbps) HR Symm HR Multicast HR Asymm HR Hybrid AM HR Hybrid SM ProbCache Ubiquitous No caching

(b) Link load

slide-32
SLIDE 32

Performance evaluation

Cache hits and intradomain link load vs C (GEANT, α = 0.8)

10−3 10−2 Cache to population ratio (C) 0.0 0.1 0.2 0.3 0.4 0.5 0.6 Cache hit ratio HR Symm HR Asymm HR Hybrid AM ProbCache Ubiquitous Optimal

(c) Cache hits

10−3 10−2 Cache to population ratio (C) 550 600 650 700 750 800 850 900 950 Average link load (Mbps) HR Symm HR Multicast HR Asymm HR Hybrid AM HR Hybrid SM ProbCache Ubiquitous No caching

(d) Link load

slide-33
SLIDE 33

Conclusions

◮ Hash-routing techniques are a viable solution for improving cache hits

in a scalable and incrementally deployable manner in an ICN environment.

◮ The hash-routing schemes proposed provide different trade-offs

between intradomain link load and cache hit ratios.

◮ In particular, asymmetric and symmetric-multicast schemes can

provide substantial reduction in interdomain traffic (and average latency) at the cost of a very limited increase in intradomain traffic.