Analysis and Improvement of Name-based Packet

Transcript:Analysis and Improvement of Name-based Packet:
Analysis and Improvement of Name-based Packet Forwarding over Flat ID Network Architectures 2018-09-23 Carnegie Mellon University, PA, USA1 University of Porto, Portugal2 Instituto de Telecomunicações, Portugal3 António Rodrigues1,2,3 Peter Steenkiste1 Ana Aguiar2,3 adamiaonr@cmu.edu prs@cs.cmu.edu anaa@fe.up.pt Outline Hierarchical names, flat IDs and aggregation Packet Forwarding with Bloom Filters Impact of False Positive matches in Bloom Filters Evaluation in Realistic Topologies Conclusions Packet forwarding in ICNs: Names vs. Flat* IDs Hierarchical names Flat IDs Packet forwarding in ICNs: Names vs. Flat* IDs Hierarchical names Flat IDs C1 get(/acme/A/101) or get(012b337) S2 ✘ No aggregation → no FIB scalability ✘ Needs a name-to-ID lookup service ✔︎ Fixed-sized content labels ✔︎ Aggregation → FIB scalability ✔︎ No need for name lookups Variable size content labels id of ‘/acme/A/101’? Packet forwarding in ICNs: Names vs. Flat* IDs Hierarchical names Flat IDs Can we bring the advantages of hierarchical names to flat ID architectures? Outline Hierarchical names, flat IDs and aggregation Packet Forwarding with Bloom Filters [1] Name encoding Lookups Routing & aggregation Impact of False Positive matches in Bloom Filters Evaluation in Realistic Topologies Conclusions [1] : Papalini et al., Scalable Routing for Tag-based Information-Centric Networking. In ICN '14 3 sub-prefixes in ‘/a/b/c’ Bloom Filters : Name Encoding Hierarchical name encoding into Bloom Filters ✔︎ Fixed-sized content labels ✔︎ No name lookups hash(/a/b/c) hash(/a/) ‘/a/b/c’ hash(/a/b) ? Size of Request ID (RID) is the # of encoded sub-prefixes, or |R| = 3 Bloom Filters : Lookups rid(/a/z)= rid(/a/b)= RIDs in FIB ✔︎ |F| iface 2 2 A C 1 1 1 1 1 1 RID in request packet ✘ TP match No match Lookups on FIB : Longest Prefix Matching (on names) using Bloom Filters ✔︎ Simple forwarding semantics ✔︎ Longest-prefix matching ✘ 1 1 1 1 1 1 Bloom Filters : Routing & aggregation Routing & prefix aggregation /a/b /a/d /a prefix announcement link cost router /a/c Shortest path Aggregation ✔︎ Prefix aggregation cache /a/c /a /a/b /a/d Outline Hierarchical names, flat IDs and aggregation Packet Forwarding with Bloom Filters Impact of False Positive matches in Bloom Filters What is a False Positive match? Router-level impact Network-level impact Evaluation in Realistic Topologies Conclusions The problem with Bloom Filters: False Positive Matches Router-level Impact of FPs How likely are forwarding errors C5 and C6? Forwarding outcomes C5: C6: Forwarding Errors in Practice What’s the impact of FP matches on a network level? ~ 1 FP