CSTalks - Named Data Networks - 9 Feb


Published on

  • Be the first to comment

  • Be the first to like this

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide

CSTalks - Named Data Networks - 9 Feb

  1. 1. Presenter: Mostafa RezazadSupervisor: Profesor Y. C. Tay The third talk of CSTalk series
  2. 2. Please ask as manyquestions as you can 24 pages 2/14/2011 2
  3. 3.  Motivation Current Projects Introducing NDN Packet types and node structure Name Structure Routing Conclusion 24 pages 2/14/2011 3
  4. 4.  Despite internets success, it is far from ideal. Why? Now services and data are not the first class internet objects (the first class is the place) Difficulties with mobility and multi homing Redundancy Security Middle Boxes problem (NATs, firewalls) 24 pages 2/14/2011 4
  5. 5.  Resource sharing was the primary problem that networking aimed to solve during 60 and 70s. The communication model is a conversation between exactly two machines. Almost all the traffic on the Internet consists of TCP conversations between pairs of hosts But what is the main goal of using network (Internet) todays? Accessing data or accessing machines! 24 pages 2/14/2011 5
  6. 6.  Networks and consequently Internet were designed to accommodate communication between machines not applications and data. ◦ DNS and IP two global namespaces are very rigid When an application request a service or data it only cares about the content. However DNS based names for services force application to resolve service and data names down to IP address. 24 pages 2/14/2011 6
  7. 7.  The increasing user demand for seamless communication on the move brings about new challenges that stress the current Internet, originally designed to support communications between fixed end-points. 24 pages 2/14/2011 7
  8. 8.  Increase performance via Redundancy elimination ◦ Mostly on application layer like web proxy caches  Reduces the bandwidth usage of static content ◦ Attempt to eliminate redundancy bellow the APP layer  They are not tied to a single application  More redundant information can be removed 24 pages 2/14/2011 8
  9. 9.  In order to have a secure communication we need to secure every part of the network, hosts, links, content and even clients. Many threats comes to picture when the container is the subject of security. 24 pages 2/14/2011 9
  10. 10.  They are designed to remedy the situation but they increase the complication They are not generally part of the TCP/IP stack 24 pages 2/14/2011 10
  11. 11.  There are four major funded projects each one worth up to $8 million over three years started from August 2010 (NSF site): ◦ Named Data Networking Principal Investigator: Lixia Zhang, UCLA ◦ Collaborating Institutions: Colorado State University, PARC, University of Arizona, University of Illinois/Urbana-Champaign, UC Irvine, University of Memphis, UC San Diego, Washington University, and Yale University 24 pages 2/14/2011 11
  12. 12.  MobilityFirst Principal Investigator: Dipankar Raychaudhuri, Rutgers University/New Brunswick Collaborating Institutions: Duke University, Massachusetts Institute of Technology, University of Massachusetts/Amherst, University of Massachusetts/Lowell, University of Michigan, University of Nebraska/Lincoln, University of North Carolina/Chapel Hill The project focuses on the tradeoffs between mobility and scalability and on opportunistic use of network resources to achieve effective communications among mobile endpoints. 24 pages 2/14/2011 12
  13. 13.  NEBULA Principal Investigator: Jonathan Smith, University of Pennsylvania Collaborating Institutions: Cornell University, Massachusetts Institute of Technology, Princeton University, Purdue University, Stanford University, Stevens Institute of Technology, University of California/Berkley, University of Delaware, University of Illinois/Urbana- Champaign, University of Texas, University of Washington The project focuses on developing new trustworthy data, control and core networking approaches to support the emerging cloud computing model of always-available network services. This project addresses the technical challenges in creating a cloud-computing-centric architecture. 24 pages 2/14/2011 13
  14. 14.  eXpressive Internet Architecture Principal Investigator: Peter Steenkiste, Carnegie Mellon University Collaborating Institutions: Boston University, University of Wisconsin/Madison XIA enables flexible context-dependent mechanisms for establishing trust between the communicating principals, bridging the gap between human and intrinsically secure identifiers. 24 pages 2/14/2011 14
  15. 15.  They claim that the unified way to solve these problems is to replace where (or who) with What. CCN or NDN has no notion of host at its lower level. A packet address names, not location. NDN protocol stack is quite similar as the TCP/IP except Network layer and some refinement on layer 2. One advantage of NDN is that it can be layered over anything, including IP itself. 24 pages 2/14/2011 15
  16. 16.  Data satisfies an interest if the content name in the interest is a prefix of the content name in the data packet DATA Interest Interest DATA Interest Interest Interest DATA Interest DATA Interest Interest DATA Interest DATA Interest 24 pages 2/14/2011 16
  17. 17.  A node has three data structure: ◦ FIB: Forwarding Information Base  It has a list of out going faces. It forwards interest packets toward potential source(s) ◦ Content Store: buffer memory  Something like caches ◦ PIT: Pending Interest Table  Keeps track of upstream sending requests. Can be used to down stream data 24 pages 2/14/2011 17
  18. 18.  When an Interest packets appears on some interface, a longest match lookup is done on its content name. ◦ first the content will be searched from content store ◦ then over PIT table ◦ And finally through the FIB table 24 pages 2/14/2011 18
  19. 19. Interest1 Interest1 Interest1 DATA Interest1 Interest1 Interest1 DATA PIT Interest1 (2) Interest1 1 1,2 DATA Interest1 DATA DATA Interest1 (2) 24 pages 2/14/2011 19
  20. 20. Interest1 Interest1/NUS/mostafa DATA /NUS/mostafa DATA FIB Interest1 Interest1 FIB /NUS/mostafa 1 /NUS/mostafa 2 3 4 FIB Interest1 /NUS/mostafa 3,4 Interest1 24 pages 2/14/2011 20
  21. 21.  CCN name identify an information collection (not an information container) Name hierarchy indicates membership The same information can have many names (web like links) The hierarchical structure is used to do longest match lookups (similar to IP prefix lookups) which helps guarantee log(n) state scaling for globally accessible data. 24 pages 2/14/2011 21
  22. 22. 24 pages 2/14/2011 22
  23. 23.  Existing link-state routing protocols can be used, unmodified, to construct a CCN FIB 24 pages 2/14/2011 23
  24. 24.  Redundancy elimination No mobility restriction More secure Directly accessing the services without knowing the place 24 pages 2/14/2011 24