Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Content centric networking
open-in-new
<h2 id="history">History</h2> <p>The principles behind information-centric networks were first described in the original 17 rules of <a href="/facts/Ted_Nelson/bpuF5gNy">Ted Nelson</a>'s <a href="/facts/Project_Xanadu/qrACU3LQ">Project Xanadu</a> in 1979. In 2002, Brent Baccala submitted an <a href="/facts/Internet_Draft/h13QYxXa">Internet-Draft</a> differentiating between connection-oriented and data-oriented networking and suggested that the Internet web architecture was rapidly becoming more data-oriented.<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a> In 2006, the DONA<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> project at UC Berkeley and ICSI proposed an information-centric network architecture, which improved TRIAD<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> by incorporating security (authenticity) and persistence as first-class primitives in the architecture. On August 30, 2006, PARC Research Fellow <a href="/facts/Van_Jacobson/WD2r6Mll">Van Jacobson</a> gave a talk titled "A new way to look at Networking" at Google.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> The CCN project was officially launched at PARC in 2007. In 2009, PARC announced the CCNx project (Content-Centric Network), publishing the interoperability specifications and an open-source implementation on the <a href="http://ccnx.org">Project CCNx website</a> on September 21, 2009. The original CCN design was described in a paper published at the International Conference on Emerging Networking EXperiments and Technologies (CoNEXT) in December 2009.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> </p><p>Annual CCNx Community meetings were held in 2011,<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> 2012,<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> 2013<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a> and 2015.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> </p><p>The <a href="http://www.ccnx.org/publications/">protocol specification</a> for CCNx 1.0 has been made available for comment and discussion. Work on CCNx happens openly in the <a href="https://trac.tools.ietf.org/group/irtf/trac/wiki/icnrg">ICNRG</a> <a href="/facts/Internet_Research_Task_Force/2m4oy1b2">IRTF</a> research group. </p> <h2 id="specification">Specification</h2> <p>The CCNx specification was published in some <a href="/facts/IETF/tIcCsFhX">IETF</a> drafts. The specifications included: </p> <ul><li><a href="https://tools.ietf.org/html/draft-irtf-icnrg-ccnxsemantics-01">draft-irtf-icnrg-ccnxsemantics-01</a></li> <li><a href="https://tools.ietf.org/html/draft-irtf-icnrg-ccnxmessages-01">draft-irtf-icnrg-ccnxmessages-01</a></li> <li><a href="https://tools.ietf.org/html/draft-mosko-icnrg-ccnxurischeme-00">draft-mosko-icnrg-ccnxurischeme-00</a></li></ul> <p>Seamless data integration within an open-run environment was proposed as a major contributing factor in protecting the security of <a href="/facts/Cloud_computing/guhg0FGV">cloud-based analytics</a> and key network encryption.<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a> The driving force in adopting these heuristics was twofold: Batch-interrupted data streams remaining confined to an optimal run environment, and secure shared cloud access depending upon integrative analytic processes.<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a> </p> <h2 id="software">Software</h2> <p>The CCNx software was available on <a href="/facts/GitHub/n1hNCsc3">GitHub</a>. </p> <h2 id="motivation-and-benefits">Motivation and benefits</h2> <p>The functional goal of the Internet Protocol as conceived and created in the 1970s was to enable two machines, one comprising resources and the other desiring access to those resources, to have a conversation with each other. The operating principle was to assign addresses to endpoints, thereby enabling these endpoints to locate and connect with one another. </p><p>Since those early days, there have been fundamental changes in the way the Internet is used — from the proliferation of social networking services to viewing and sharing digital content such as videos, photographs, documents, etc. Instead of providing basic connectivity, the Internet has become largely a distribution network with massive amounts of video and web page content flowing from content providers to viewers. Increasingly, today's internet users demand faster, more efficient, and more secure access to content without concern about where that content might be located. </p><p>Networks are also used in many environments where the traditional TCP/IP communication model doesn't fit. The <a href="/facts/Internet_of_Things/rwwGAxn3">Internet of Things (IoT)</a> and sensor networks are environments where the source-destination communication model doesn't always provide the best solution. </p><p>CCN was designed to work in many environments from high-speed data centers to resource-constrained sensors. CCN aims to be: </p> <ul><li>Secure - The CCN communication model secures data and not the communication pipe between two specific end hosts. However, ubiquitous content caching and the absence of a secure communication pipe between end hosts introduce the challenge to content protection against unauthorized access, which requires extra care and solutions. <a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a></li> <li>Flexible - CCN uses names to communicate. Names can be location-independent and are much more adaptable than IP addresses. Network elements can make more advanced choices based on the named requests and data.</li> <li>Scalable - CCN enables the network to scale by allowing caching, enabling native multicast traffic, providing native load balancing, and facilitating resource planning.</li></ul> <h2 id="basic-concepts">Basic concepts</h2> <p>Content Object messages are named payloads that are network-sized chunks of data. Names are a hierarchical series of binary name segments that are assigned to Content Objects by content publishers. Signatures are cryptographic bindings between a name, a payload, and the Key ID of the publisher. This is used for provenance. Interest messages are requests for Content Objects that match the name along with some optional restrictions on that object. </p><p>The core protocol operates as follows: Consumers request content by sending an Interest message with the name of the desired content. The network routes the interest based on the name using <a href="/facts/Longest_prefix_match/CmE4EM8v">longest prefix match</a>. The interest leaves the state as it traverses the network. This state is stored in the Pending Interest Table (PIT). When a match is found (when an Interest matches a Content Object) the content is sent back on the reverse path of the Interest, following the PIT state created by the Interest. </p><p>Because the content is self-identifiable (via the name and the security binding) any Content Object can be cached. Interest messages may be matched against caches along the way, not only at the publishers. </p><p>Distributed caching within a content-centric network is also possible, requiring multi-functional access parameters across the database. This essentially enables shared network encryption algorithms to employ role-based access limitations to users based on defined authorization levels. <a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> </p> <h2 id="ccnx-releases">CCNx releases</h2> <h3>CCNx 0.x</h3> <p>Interests match Content Objects based on name prefixes. For example, an Interest for /a/b would match a Content Object named /a/b/c/d or /a/b. Interests include restrictions in the form of selectors. These help the network select which of the possible prefix matches are actual matches. For example, an Interest might exclude certain names, ask for a minimum or a maximum number of extra name segments, etc. </p><p>Content Objects have an implicit final name component that is equal to the hash of the Content Object. This may be used for matching to a name. </p><p>Packet encoding is done using CCNB (a proprietary format based on a type of binary XML). </p><p>The last version of this branch is 0.8.2 Software is <a href="http://www.ccnx.org/download/">available</a> under a GPL license. <a href="http://www.ccnx.org/releases/ccnx-0.8.2/doc/">Specifications and documentation</a> are also available. </p> <h3>CCNx 1.x</h3> <p>CCNx 1.x differs from CCNx 0.x in the following ways:<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> </p><p>Interests match Content Objects on exact names, not name prefixes. Therefore, an Interest for /a/b/ will only match a Content Object with the name /a/b. Interests can restrict matches on the publisher KeyID or the object's ContentObjectHash. </p><p>A nested <a href="/facts/Type%E2%80%93length%E2%80%93value/IMeVVbpK">type–length–value</a> (TLV) format is used to encode all messages on the wire. Each message is composed of a set of packet headers and a protocol message that includes the name, the content (or <a href="/facts/Payload_(computing)/zN2Pgfq6">payload</a>), and information used to cryptographically validate the message – all contained in nested TLVs. </p><p>The specification of CCNx 1.0 is available at: <a href="https://blogs.parc.com/ccnx/specifications/">http://blogs.parc.com/ccnx/specifications/</a> </p> <h2 id="derivative-works">Derivative works</h2> <ul><li><a href="/facts/Named_data_networking/hAt3XFWW">Named data networking</a> is an NSF-funded project based on the original CCNx 0.x code.</li> <li><a href="https://web.archive.org/web/20200228024942/http://ccn-lite.net/">CCN-lite</a> is a lightweight version of CCNx functionally interoperable with CCN 0.x.</li></ul> <ul><li></li></ul> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Information-centric_networking/wPwwCDU9">Information-centric networking</a></li> <li><a href="/facts/Named_data_networking/hAt3XFWW">Named data networking</a></li> <li><a href="/facts/Information-centric_networking_caching_policies/efUkMUd2">Information-centric networking caching policies</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Baccala, Brent (Aug 2002). "Data Oriented Networking" <a href="http://www.freesoft.org/blogs/soapbox/data-oriented-networking/" target="_blank">http://www.freesoft.org/blogs/soapbox/data-oriented-networking/</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Koponen, Teemu; Chawla, Mohit; Chun, Byung-Gon; Ermolinskiy, Andrey; Kim, Kye Hyun; Shenker, Scott; and Stoica, Ion. (August 2007). "A data-oriented (and beyond) network architecture." SIGCOMM Comput. Commun. Rev. 37, 4, 181-192. <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>TRIAD project page Archived 2016-03-05 at the Wayback Machine, Stanford University Distributed Systems Group, Retrieved 1 August 2014. <a href="http://gregorio.stanford.edu/triad/" target="_blank">http://gregorio.stanford.edu/triad/</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Jacobson, Van. (Aug 30, 2006). "A new way of looking at networking." <a href="https://www.youtube.com/watch?v=oCZMoY3q2uM" target="_blank">https://www.youtube.com/watch?v=oCZMoY3q2uM</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Jacobson, Van; Smetters, Diana K.; Thornton, James D.; Plass, Michael F.; Briggs, Nicholas H.; Braynard, Rebecca L. (Dec 1-4, 2009). "Networking named content." Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies. Rome, Italy. Retrieved 1 August 2014. <a href="http://dl.acm.org/citation.cfm?id=1658941&CFID=515870947&CFTOKEN=33230744" target="_blank">http://dl.acm.org/citation.cfm?id=1658941&CFID=515870947&CFTOKEN=33230744</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>"Cicn - fd.io". <a href="http://www.ccnx.org/events/ccnxcon-2011/" target="_blank">http://www.ccnx.org/events/ccnxcon-2011/</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>"Cicn - fd.io". <a href="http://www.ccnx.org/events/ccnxcon-2012/" target="_blank">http://www.ccnx.org/events/ccnxcon-2012/</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>"Cicn - fd.io". <a href="http://www.ccnx.org/events/ccnxcon-2013/" target="_blank">http://www.ccnx.org/events/ccnxcon-2013/</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>"CCNxCon 2015". Archived from the original on 2016-02-22. Retrieved 2016-02-22. <a href="https://web.archive.org/web/20160222111146/http://www.ccnx.org/ccnxcon-2015/" target="_blank">https://web.archive.org/web/20160222111146/http://www.ccnx.org/ccnxcon-2015/</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>Bartolomeo; et al. (2016). Identification and Management of Distributed Data: NGN, Content-Centric Networks and the Web. CRC Press. pp. 39–257. <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>Ahmed, Hussein; et al. (2016). Content-Centric Networks: An Overview, Applications, and Research Challenges. Springer. pp. 17–64. <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>Bilal, Muhammad; et al. (2019). "Secure Distribution of Protected Content in Information-Centric Networking". IEEE Systems Journal. 14 (2): 1921–1932. arXiv:1907.11717. Bibcode:2020ISysJ..14.1921B. doi:10.1109/JSYST.2019.2931813. S2CID 198967720. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>Fricker, C (2012). "Impact of traffic mix on caching performance in a content-centric network". Proceedings IEEE INFOCOM Workshops. arXiv:1202.0108. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>Solis, Ignacio (July 2014). "CCNx 1.0 Changes from 0.x", IETF-90 Proceedings. Toronto, Ontario. Retrieved 1 August 2014. <a href="http://www.ietf.org/proceedings/90/slides/slides-90-icnrg-10.pdf" target="_blank">http://www.ietf.org/proceedings/90/slides/slides-90-icnrg-10.pdf</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> </ol>