Future Internet with Information Centric Networks

  Future Internet with Information Centric

  Networks

  Arsitektur Jaringan Terkini

  Motivation

  Motivation Current Network

  Motivation

• Networking was introduced for resource sharing _{– Named hosts}

  The Problem

  ISP

  ISP Communication Vs Distribution

  Communication Distribution Naming ^{Endpoints Content} Security ^{Secure Process Secure Content}

  Motivation

• Movement of content _{– Predicted global IP trafc in 2014: 64 exabytes/month (4 fold from 2009) (1) – Current solutions: P2P and CDNs – Global mobile trafc will double every year (mostly streaming content) – 180 exabytes of content created in 2006}

  (2) ₍₂₎

• Location orientation of content _{– Content associated with named hosts}
• Sender orientation _{– Sender can send anywhere}
• Securing content _{– TLS and SSL secures endpoints – Point-to-point model}

  Motivation

• Mobility and multi-homing _{– Device mobility is the norm}
• _{– Mobility currently based on routing or indirection} – Multiple attachments
>Adaptation to disruptions _{– Challenged networks – sparse connectivity, high-speed mobility, disruptions}
• Problems with network based caching _{– Security – DRM issues}

  Known Architectures

• Architectures _{– Data Oriented Networking Architecture (DONA) – Sienna (Publish/Subscribe) – Content Centric Networking (CCN) – Network of Information (NetInf)} – Publish Subscribe Internet Routing Paradigm (PSIRP)
• Operation Diferentiation _{– Security – Naming – Content existence knowledge – Caching} – Routing
• – Producer-consumer meeting

  Today

  X dst src

  Path determined by global routing, not local choice

Structural asymmetry precludes market mechanisms and

  Producer Consumer ^{? a /b/c}

  

NDN(Named Data Networking)

related to CCN approach

  Producer Consumer ^{a/b/c/d Data a/b/c/d ? a /b/c}

  

NDN(Named Data Networking)

related to CCN approach

  

NDN(Named Data Networking)

related to CCN approach

  Producer Consumer ^a/b

• ^{Packets say ‘what’ not ‘where’ (no src or dst)}
• ^{Forwarding decision is local ? a /b/c /e}

  We envision replacing this:

  ISP

  ISP

  ISP

  ISP With THIS: Content Centric Networks – Operation _{Data Interest Interests Table} Check Pending _{Interests Table Check Pending Store} Check Content _{Information Base} Check Forwarding

  Content Centric Networks – Stack

_{• Change of network abstraction from “named hosts” to}

(1) _{• Security built-in: secures content and not the hosts} “named content” _{• Can handle static as well as dynamic content} • Mobility is present by design
• Use of 2 messages: Interest and Data Object _{(1) Van Jacobson, et al, Networking Named Content, CoNEXT 2009}

  Content Centric Networks – Architecture

• Each CCN entity has 3 main data structures _{– Content Store, Pending Interest Table, Forwarding Information Base • Uses multicast/broadcast}
• Uses “longest prefx matching” lookup for content names ^{Content Store Pending Interest Table (PIT) Forwarding Information Base (FIB) CCN Forwarding Engine Face 1 Wireless Wired Application Face 2 Face 3 CCN Forwarding Logic}

  Content Centric Networks – Messages

• Purpose of messages _{– Interests request for content – Data serves these requests}
• No fxed length felds and uses an XML encoding _format ^{ContentName Selector Nonce}
^{ContentName Signature Signature Information Interest Packet Data Data Packet}

  Content Centric Networks – Names

• Core of CCN uses content names for forwarding
• Applications can interpret names the way they want ^{/uni-bremen.de/comnets/lecture/Kommunikationsnetze-I.pdf/v1/s0 User/Application Name Versioning & Segmentation}

  Content Centric Networks - CS

• Uses “longest prefx matching” _{• Implements policies such as LRU or LFU for content} replacement

  _{• Content do not necessarily have to be persistent (only cached)}

  ^...
^{... Name /uni-bremen.de/comnets/lecture/Kommunikationsnetze-I.pdf/v1/s0 ... ... ... Data Content Store}

  Content Centric Networks – PIT Prefix _... ^{Pending Faces} _...

  /uni-bremen.de/comnets/lecture/Kommunikationsnetze-I.pdf/v1/s1 _{... ...} ² PIT

• Uses “longest prefx matching”
• An entry may point to multiple faces
• Must time out and not held

  Content Centric Networks – FIB _{Prefix Forwarding Faces /uni-bremen.de/comnets} ... _{1, 2} ^...

  ... ^...

  FIB

• Uses “longest prefx matching”
• Similar to IP FIB
• Destination may have number of faces

  Content Centric Networks – Interest

  Content Centric Networks – Data

  Routing

• Three general approaches
• – Name Resolution Routing (NRR)
• – Content-based Routing (CBR)
• – Name-based routing (NBR)
• Two phases
• – Routing of NDO requests
• – Routing of NDO back to the requester

  Name-Based Routing

• • Client asks for a data object sending interest packets

  _{which are routed toward the publisher of the name}

  _{forwarding information base (FIB) of each node.} prefx using longest-prefx matching in the
• The FIB is built using routing protocols of the _Internet.

• • When a note receives multiple requests for the same

  _{NDO, only the frst is forwarded to the source.}
• When a copy of the data object is encountered on _{the path, a data packet containing the requested and all nodes along the path cache a copy.}

  object is sent on the reverse path back to the client

  Content Centric Network (CCN)

Chart notes describe numbered steps

  CCN packets

  There are two CCN packet types:

interest (similar to http “get”) and data

(similar to http response). Both are encoded in an efcient binary XML.

  CCN node model

_{WidgetA.mpg/v3/s2 /parc.com/videos/} Get Publish-Subscribe Internet Routing Paradigm (PSIRP) Chart notes describe numbered steps

  Content-based Publish-Subscribe Routing

  Content-based Pub/Sub Routing Content-based Pub-Sub Routing

Forwarding on Bloomed link _{• The FI encodes the network links (rather than the nodes) on} ids

• _{• FI is encoded in a probabilistic data structure called a Bloom}

  the path of interest between the producer and consumers _{forward an NDO.} flter that routers use for selecting interfaces on which to _{– Bloom flters encode source route-style forwarding information into – Routers do not need to keep forwarding state. Forwarding end addressing.} packet headers, enabling forwarding without depending on end-to- _{• The use of Bloom flters result in a certain number of false allowing faster, smaller, and more energy-efcient switches.} decisions are simple and forwarding tables are small, potentially _{interfaces where there are no receivers.} positives; in this case this means forwarding on some
Pub/Sub Routing using Link ID and FI zFilter: FI Bloom Filter

  Network of Information

• _{• Use a Name Resolution Service (NRS) that stores the} Name Resolution Routing _{pointing to corresponding storage locations in the network.}

  bindings from object names to topology-based locators

• Three conceptual routing phases: _{– Routing the request message to the responsible NRS node where the object name is translated into one or multiple source – Routing the data from the source(s) to the requester. – Routing the request message to the source address(es)}

  addresses

• All phases can potentially use diferent routing algorithms. _{– The second and third phases might use a topology-based routing – A name-based routing method might be used for the frst phase. – There are multiple alternatives to loosely or tightly integrate the phases in an ICN architecture.} like IP. Summary of characteristics of the

  ICN approaches Content-Based Security

• Name-content mapping verifcation via per- _{data packet signature}
• – Data packet is authenticated with digital signature _{content namespaces w/ public keys}

  ICN trust establishment by associating Basic ICN forwarding

• Consumer ‘broadcasts’ an ‘interest’ over

  any & all available communications media:

  _{get ‘/rutgers/ECE544/Lecture06-14.pdf’}
• Interest identifes a collection of data - all

  data items whose name has the interest as a prefx.

• • Anything that hears the interest and has an

  element of the collection can respond with

  that data: _{HereIs ‘/rutgers/ECE544/presentation.pdf/p1’ <data>}

  Basic ICN transport

• Data that matches an interest ‘consumes’ it.
• Interest must be re-expressed to get new data. (Controlling the re- expression allows for trafc management and environmental adaptation.)
• Multiple (distinct) interests in same collection may be expressed (similar

  Caching

• Storage for caching NDOs is an integral part of the ICN service.
• All nodes potentially have caches;

  requests for NDOs can be satisfed by

  any node holding a copy in the cache.

• ICN combines caching at the network edge as in P2P and other overlay networks with in-network caching (e.g., transparent web caches)

  References

• A Survey of Information-Centric Networking, B. Ahlgren, et. al. IEEE

  Communications Magazine, July 2012

  • Named Data Networking. IEEE CCW.

  Oct 10, 2011. based on Van Jacobson

• Bloom Filters •