DOC PREVIEW
CMU CS 15744 - lecture

This preview shows page 1-2-3-4-5 out of 16 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Slide 1Slide 2Slide 3Slide 4Slide 5Slide 6Slide 7Slide 8Slide 9Slide 10Slide 11Slide 12Slide 13Slide 14Slide 15Slide 16Networking Named ContentVan Jacobson, Diana K. Smetters, James D. Thornton, Michael F. Plass, Nicholas H. Briggs, Rebecca L. BraynardContent Centric NetworkingNetwork use has evolved since IP was designedUsage of the Internet is in terms of what not whereCCN: architecure built on named data rather than named hostsProvides security, scalability, performance.Content Centric NetworkingTwo packet types: Interest and DataHeirarchical content naming schemeAllows dynamic content generation: active namesCCN node has 3 components: FIB, Content Store and PITFIB: Forwarding table, allows multiple output facesContent Store: Buffer, also caches Data packetsPIT: Pending Interest TableCCN NodesProcessing an Interest:–Matching Data is found in the Content Store => send it and consume Interest–Pending Interest in PIT=> add this face to RequestingFaces list–Use FIB to forward Interest on outgoing faces, add to PITProcessing Data:Data follows a chain if PIT entries back to the sourceDuplicate and unsolicited Data is discardedReliability and Flow ControlInterests serve the role of window advertisementsEach packet is independent => TCP SACK is implicitFlow balance is maintained at each hop, not end-to-end like TCPThus additional, TCP-like congestion control mechanisms not required.Naming ContentHierarchical content names with a flexible formatIndividual name consists of a number of componentsNames can be relative to some known name, e.g. next/previousSame content can have multiple names! Problems with caching?A source of data performs a Register operation for a prefixRoutingRouting between CCN nodes can occur over unmodified OSPF. Incremental deployment of CCN nodes is possibleIntegration with BGP is also possibleRouters do not construct spanning treesLoops are not possible anywayMultiple paths can be usedContent Based SecuritySecurity travels with the content, it is not a property of the connectionCCN authenticates name-content bindings by signing the name and content in each data packetArbitrary key management schemes can be used over CCNKeys can be sent over CCN since they are just another piece of dataIf we trust some public keys, we can infer moreNetwork SecuritySending a malicious packet to a host is difficult because CCN talks only about content, not to hostsData based DoS attacks are impossible because only one Data packet is forwarded per InterestInterest flooding:Multiple Interests for the same content are combinedLimit the forwarding of unsuccesful interestsWhat if sender and receiver collude?EvaluationTransfer time vs Number of SinksEvaluationFailoverAn Architecture for Internet Data TransferNiraj Tolia, Michael Kaminsky, David G. Andersen, and Swapnil PatilData Oriented Transfer ServiceSeperate control from dataControl logic is application specific; use DOT for all data transferBenefits:Transfer techniques can reused and new ones triedCoding, multi-pass compression, caching etc. can be applied by the transfer serviceMulti-path transfersCross application data processorsDOTDOT provides an API and a plugin architectureTransfer Plugins: eg. Multi-path, portable storageStorage Plugins: access to local data, divide data into chunks, compute hashesBasic API: Sender calls put with data, gets back an OIDReceiver uses OID to get dataEvaluationMultipath Plugin: Using two 100 Mbit/s Ethernet links, transfer time went down from 3.59 seconds to 1.90 secondsModified Postfix mail server to use DOTMinimal modification: 184 LoCDOT saves 20% of total message bytes transferredDuplicated messagesPartial redundancies in messagesThank


View Full Document

CMU CS 15744 - lecture

Documents in this Course
Lecture

Lecture

25 pages

Lecture

Lecture

10 pages

Lecture

Lecture

10 pages

Lecture

Lecture

45 pages

Lecture

Lecture

48 pages

Lecture

Lecture

19 pages

Lecture

Lecture

97 pages

Lecture

Lecture

39 pages

Lecture

Lecture

49 pages

Lecture

Lecture

33 pages

Lecture

Lecture

21 pages

Lecture

Lecture

52 pages

Problem

Problem

9 pages

Lecture

Lecture

6 pages

03-BGP

03-BGP

13 pages

Lecture

Lecture

42 pages

lecture

lecture

54 pages

lecture

lecture

21 pages

Lecture

Lecture

18 pages

Lecture

Lecture

18 pages

Lecture

Lecture

58 pages

lecture

lecture

17 pages

lecture

lecture

46 pages

Lecture

Lecture

72 pages

Lecture

Lecture

44 pages

Lecture

Lecture

13 pages

Lecture

Lecture

22 pages

Lecture

Lecture

48 pages

lecture

lecture

73 pages

17-DNS

17-DNS

52 pages

Lecture

Lecture

10 pages

lecture

lecture

53 pages

lecture

lecture

51 pages

Wireless

Wireless

27 pages

lecture

lecture

14 pages

lecture

lecture

18 pages

Lecture

Lecture

16 pages

Lecture

Lecture

14 pages

Lecture

Lecture

16 pages

Lecture

Lecture

37 pages

Lecture

Lecture

44 pages

Lecture

Lecture

11 pages

Lecture

Lecture

61 pages

Multicast

Multicast

61 pages

Lecture

Lecture

19 pages

Lecture

Lecture

8 pages

Lecture

Lecture

81 pages

Lecture

Lecture

9 pages

Lecture

Lecture

6 pages

Lecture

Lecture

63 pages

Lecture

Lecture

13 pages

Lecture

Lecture

63 pages

Lecture

Lecture

50 pages

lecture

lecture

35 pages

Lecture

Lecture

47 pages

Lecture

Lecture

29 pages

Lecture

Lecture

92 pages

Load more
Download lecture
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view lecture and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view lecture 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?