The subject matter of this application is related to the subject matter in the following applications:
Field
This disclosure is generally related to distribution of digital content. More specifically, this disclosure is related to a method and system for facilitating random access to a piece of content in a content centric network.
Related Art
The proliferation of the Internet and e-commerce continues to create a vast amount of digital content. Content-centric network (CCN) architectures have been designed to facilitate accessing and processing such digital content. A CCN includes entities, or nodes, such as network clients, forwarders (e.g., routers), and content producers, which communicate with each other by sending interest packets for various content items and receiving content object packets in return. CCN interests and content objects are identified by their unique names, which are typically hierarchically structured variable length identifiers (HSVLI). An HSVLI can include contiguous name components ordered from a most general level to a most specific level.
A content producer may serve as a proxy between data sources (e.g., other content producers) and content consumers. For example, a consumer may send to the producer an interest request to perform a function based on data collected by the producer. The producer may obtain the data from the data sources, perform or compute the requested function, and return the result of the function to the consumer in the form of a content object. However, the rate at which the producer is able to obtain or receive updated data from the data sources may cause the producer to re-compute the function each time it receives a request from a consumer. If the computation is expensive, the producer may become overwhelmed with requests from multiple consumers, which can result in congestion and network inefficiency.
While a CCN brings many desired features to a network, some issues remain unsolved for a producer in handling multiple consumer requests that require computationally expensive operations and that are based on data from multiple data sources.
One embodiment provides a system that facilitates content closures in a CCN. During operation, the system generates, by a client computing device, an initial interest with a name that is a hierarchically structured variable length identifier which comprises contiguous name components ordered from a most general level to a most specific level, wherein the initial interest indicates a request for a result of a computation. The system receives from a content producing device a content object which indicates a function that outputs the requested result and data to be used as input to the function. The system performs the function based on the indicated data, which outputs the requested result, thereby facilitating a content producing device to offload computation of the function to the client computing device.
In some embodiments, the content object further indicates names for the data. The system obtains the indicated data based on the names for the data.
In some embodiments, the system generates interests for the data based on the data names. In response to the interests, the system receives corresponding content objects based on the data names.
In some embodiments, the data is indicated in the content object as one or more of: embedded directly in the content object; and included as a link in the content object.
In some embodiments, the function indicated in the content object is further based on an encoding of logic that allows the client computing device to decode and perform the function.
In some embodiments, the content object includes a payload that indicates the function and a link to the function, and the payload further indicates the data as a list of content objects and a link to a respective content object.
In some embodiments, the content object is a manifest which indicates a set of member content objects and their corresponding names and digests, wherein the set of member content objects comprises the data to be used as input to the function as indicated in the content object.
Another embodiment provides a system that facilitates content closures in a CCN. During operation, the system receives, by a content producing device, an initial interest with a name that is a hierarchically structured variable length identifier which comprises contiguous name components ordered from a most general level to a most specific level, wherein the initial interest indicates a request by a client computing device for a result of a computation. The system generates a content object which indicates a function that outputs the requested result and data to be used as input to the function. The system transmits the content object to the client computing device, which causes the client computing device to obtain the data indicated in the content object and perform the function based on the obtained data, thereby facilitating the content producing device to offload computation of the function to the client computing device.
In some embodiments, in response to determining that a previous content object corresponding to the initial interest is stored by the content producing device, wherein the previous content object indicates the function that outputs the requested result and the data to be used as input to the function, the system transmits the previous content object to the client computing device, which causes the client computing device to obtain the data indicated in the previous content object and perform the function indicated in the previous content object based on the obtained data.
In some embodiments, the system determines data needed to compute the requested result, wherein the data includes data names. The system indicates in the content object the determined data names as names for the data to be used as input to the function. The system identifies the function that outputs the requested result.
In some embodiments, in response to detecting changes to the data needed to compute the requested result, the system generates the content object which indicates the function that outputs the requested result and the data to be used as input to the function.
In some embodiments, the system indicates the data in the content object by one or more of: embedding the data directly in the content object; and included a link to the data in the content object. The system indicates the function in the content object based on an encoding of logic that allows the client computing device to decode and perform the function.
In some embodiments, the system includes in the content object a payload that indicates the function and a link to the function, wherein the payload further indicates the data as a list of content objects and a link to a respective content object.
In the figures, like reference numerals refer to the same figure elements.
The following description is presented to enable any person skilled in the art to make and use the embodiments, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present disclosure. Thus, the present invention is not limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.
Overview
Embodiments of the present invention solve the problem of offloading computation of a function from a producer to a consumer by creating a network message that can be executed by the consumer like a function or a program to generate content. In an environment where the producer acts as a proxy between data sources and content consumers, a consumer may send to the producer an interest request to perform a function based on data collected by the producer. The producer may obtain the data from the data sources, perform or compute the requested function, and return the result of the function to the consumer in the form of a content object. However, the rate at which the producer is able to obtain or receive updated data from the data sources may cause the producer to re-compute the function each time it receives a request from a consumer. If the computation is expensive, the producer may become overwhelmed with requests from the consumers, which can result in congestion and network inefficiency.
Embodiments of the present invention address this problem by creating a system that allows the producer to offload the computation of the function to the consumer via a type of content object that mimics functional programming closures. Instead of performing the requested computation on behalf of the consumer, the producer generates a content object (e.g., a “content closure message”) which indicates the function or code needed to perform the computation, and also indicates the data needed to perform the function. The content closure message can indicate the function and the data via direct embedding or linking. The content closure message allows a consumer to retrieve and use the indicated data as input to perform the computation.
In the functional programming paradigm, a “closure” is a function that refers to independent or free variables, or a function that can be stored as a variable. In CCN, a “content closure message” is a type of CCN content object that encapsulates the logic of a function ƒ(·) and the variables or data used to compute the function ƒ(·). The function may be encoded as a Lua function, or any other suitable representation. For example, a consumer may issue an interest for a content object (e.g., data or the result of a computation) with the name N. If the producer (or proxy) has not previously created a content closure content object to compute the data for N (e.g., has not previously computed ƒ(N), the producer can generate a content closure content object with links to the logic of ƒ(·) and the data necessary as input to ƒ(·). If the producer has previously created such a content closure, the producer returns that previously created content closure content object. Upon receiving the content closure content object, the consumer can obtain the indicated data, and perform the indicated function ƒ(·) based on the obtained data. In this way, the producer offloads the computation of the function to the consumer, which can result in increased network efficiency.
In CCN and in examples described in this disclosure, each piece of content is individually named, and each piece of data is bound to a unique name that distinguishes the data from any other piece of data, such as other versions of the same data or data from other sources. This unique name allows a network device to request the data by disseminating a request or an Interest that indicates the unique name, and can obtain the data independent from the data's storage location, network location, application, and means of transportation. The following terms are used to describe the CCN architecture:
Content Object: A single piece of named data, which is bound to a unique name. Content Objects are “persistent,” which means that a Content Object can move around within a computing device, or across different computing devices, but does not change. If any component of the Content Object changes, the entity that made the change creates a new Content Object that includes the updated content, and binds the new Content Object to a new unique name.
Unique Names: A name in a CCN is typically location independent and uniquely identifies a Content Object. A data-forwarding device can use the name or name prefix to forward a packet toward a network node that generates or stores the Content Object, regardless of a network address or physical location for the Content Object. In some embodiments, the name may be a hierarchically structured variable-length identifier (HSVLI). The HSVLI can be divided into several hierarchical components, which can be structured in various ways. For example, the individual name components parc, home, ccn, and test.txt can be structured in a left-oriented prefix-major fashion to form the name “/parc/home/ccn/test.txt.” Thus, the name “/parc/home/ccn” can be a “parent” or “prefix” of “/parc/home/ccn/test.txt.” Additional components can be used to distinguish between different versions of the content item, such as a collaborative document. In some embodiments, the name can include a non-hierarchical identifier, such as a hash value that is derived from the Content Object's data (e.g., a checksum value) and/or from elements of the Content Object's name. A description of a hash-based name is described in U.S. patent application Ser. No. 13/847,814. A name can also be a flat label. Hereinafter, “name” is used to refer to any name for a piece of data in a name-data network, such as a hierarchical name or name prefix, a flat name, a fixed-length name, an arbitrary-length name, or a label (e.g., a Multiprotocol Label Switching (MPLS) label).
Interest: A packet that indicates a request for a piece of data, and includes a name (or a name prefix) for the piece of data. A data consumer can disseminate a request or Interest across an information-centric network, which CCN routers can propagate toward a storage device (e.g., a cache server) or a data producer that can provide the requested data to satisfy the request or Interest.
The methods disclosed herein are not limited to CCN networks and are applicable to other architectures as well. A description of a CCN architecture is described in U.S. patent application Ser. No. 12/338,175 which is herein incorporated by reference.
Exemplary Network and Exemplary Communication in a System
During operation, consumer or client computing device 116 can generate an interest 130 with a name 130.1 of “/producer/service/req=getAvgTemp/param1=last2Hrs,” where the terms are defined as follows: “/producer/service” is the routable prefix for content producing device 118 which serves as a proxy or service between data sources and content consumers; “req=getAvgTemp” indicates a request to obtain the average temperature; and “param1=last2Hrs” indicates that the request is for the average temperature for the last 2 hours. Interest 130 can also include an optional payload 130.2 with a value of “<data>.” Interest 130 can travel through network 100 via nodes 102, 110, and 112, before reaching producer or content producing device 118. Device 118 can receive interest 130 and determine that in order to satisfy interest 130, device 118 must perform a compute function 140. Function 140 may depend upon data received from a source or source device 120. Such data can be received via a push message (e.g., in a payload of an interest 136 generated by device 120) or via a content object 138 (e.g., in response to an interest 136 generated by device 118). For example, source device 120 can be a temperature sensor which collects and stores readings for the temperature in a lab with equipment that requires a certain temperature at varying intervals. Device 118 can subsequently return a content object 132 with a name 132.1 of “/producer/service/req=getAvgTemp/param1=last2Hrs” and a payload 132.2 which includes the result of computed function 140.
Multiple consumers may submit requests similar to interest 130, and function 140 may depend upon data similar to content object 130 received from multiple sources. In this case, depending on the rate at which producer 118 receives data from each source, each interest received from a consumer may force producer 118 to re-compute function 140 in order to return the data response. If the computation is complex or expensive, producer 118 may become overwhelmed with requests, creating a bottleneck or other inefficiencies in the network.
Embodiments of the present invention solve this problem by allowing the producer to offload the computation to the consumer by returning a content object which indicates a function that outputs the requested result and also indicates the data to be used as input to the function.
Upon receiving content object 152, consumer 116 can determine or retrieve the data indicated in the list of inputs 156 (not shown) and subsequently perform a compute function 160 based on the indicated function 154 and the retrieved data inputs. In this manner, the system can offload a complex computation from the producer to the consumer, thereby increasing efficiency and facilitating content closures in a content centric network.
Exemplary Communication in a System for Facilitating Content Closures in a CCN
Note that while consumers 206 are depicted as client computing devices and service 204 is depicted as a producer or proxy (e.g., a content producing device) in
Role of Client Computing Device in Facilitating Content Closures in a CCN
The client computing device obtains the indicated data based on names for the data included in the content object (operation 306). For example, the client computing device can generate interests for the data based on the data names, and, in response to the interests, receive corresponding content objects. The client computing device performs the indicated function based on the indicated data, and the function outputs the requested result (operation 308).
Role of Content Producing Device in Facilitating Content Closures in a CCN
If a previous corresponding content object does exist (decision 404), the content producing device determines whether it detects any changes to the data needed to compute the function (decision 406). If it does detect changes, the operation continues as described above for operations 410 and 412. If it does not detect any changes to the data needed to compute the function (decision 406), the content producing device transmits the previous content object to the client computing device, which causes the client computing device to obtain the data indicated in the previous content object and perform the function indicated in the previous content object based on the obtained data (operation 408).
Exemplary Format of Content Closure Content Objects
Content closure payload 522 can include an optional access control specification (“ACS”), a function, and a list of inputs. An ACS 524 field contains a link to a list which specifies policies, permissions, and other control related features for accessing the function and the list of inputs. Function 526 includes a directly embedded function encoding or a link to the function encoding. Function encoding 528 indicates the logic for the encoded function. List of inputs 530 contains a list of data items that are function inputs. Function input 532 includes a directly embedded content object that is the input or a link to the data or content object that is the input. A link 540 includes a target name 542 field that is the CCN name of the link target, a target KeyId 544 field that is the KeyId restriction for the link target, and a target hash 546 field which contains a content object hash restriction for the link target.
Exemplary Computer and Communication System
HERE HERE HERE Content-processing system 718 can include instructions, which when executed by computer and communication system 702, can cause computer and communication system 702 to perform methods and/or processes described in this disclosure. Specifically, content-processing system 718 may include instructions for sending and/or receiving data packets to/from other network nodes across a computer network, such as a content centric network (communication module 720). A data packet can include an interest packet or a content object packet with a name which is an HSVLI that includes contiguous name components ordered from a most general level to a most specific level.
Specifically, content-processing system 718 may include instructions for generating an initial interest that indicates a request for a result of a computation (interest-generating module 722). Content-processing system 718 may include instructions for receiving from a content producing device a content object which indicates a function that outputs the requested result and data to be used as input to the function (communication module 720). Content-processing system 718 may also include instructions for performing the function based on the indicated data, which outputs the requested result (function-performing module 726). Content-processing system 718 may include instructions for obtaining the indicated data based on names for the data indicated in the content object (input-obtaining module 724). Content-processing system 718 may also include instructions for generating interests for the data based on the data names (interest-generating module 722), and, in response to the interests, receiving corresponding content objects based on the data names (communication module 720).
Content-processing system 718 may further include instructions for receiving an initial interest that indicates a request by a client computing device for a result of a computation (communication module 720). Content-processing system 718 may include instructions for generating a content object which indicates a function that outputs the requested result and data to be used as input to the function (content closure-generating module 728), and for transmitting the content object to the client computing device (communication module 720).
Content-processing system 718 may further include instructions for, in response to determining that a previous content object corresponding to the initial interest is stored by the content producing device (content-processing module 730), transmitting the previous content object to the client computing device (communication module 720). Content-processing system 718 may include instructions for: determining data needed to compute the requested result, wherein the data includes data names; indicating in the content object the determined data names as names for the data to be used as input to the function; and identifying the function that outputs the requested result (content closure-generating module 728). Content-processing system 718 may also include instructions for, in response to detecting changes to the data needed to compute the requested result (content-processing module 730), generating the content object which indicates the function that outputs the requested result and the data to be used as input to the function (content closure-generating module 728).
Content-processing system 718 may also include instructions for indicating the data in the content object by one or more of: embedding the data directly in the content object; and included a link to the data in the content object (content closure-generating module 728). Content-processing system 718 can include instructions for indicating the function in the content object based on an encoding of logic that allows the client computing device to decode and perform the function (content closure-generating module 728). Content-processing system 718 may also include instructions for including in the content object a payload that indicates the function and a link to the function, wherein the payload further indicates the data as a list of content objects and a link to a respective content object (content closure-generating module 728).
Data 732 can include any data that is required as input or that is generated as output by the methods and/or processes described in this disclosure. Specifically, data 732 can store at least: an interest; a name for an interest that is an HSVLI which comprises contiguous name components ordered from a most general level to a most specific level; an interest that indicates a request for a result of a computation; the result of the computation; a content object; a function or encoding for a function; a link to the function; data to be used as input to the function; a link to the data to be used as input to the function; a content closure content object that indicates the function and the data to be used as input to the function; names for the data; a manifest that indicates the function and the data to be used as input to the function; a previously stored content closure content object; and a payload that indicates the function and the data to be used as input to the function.
The data structures and code described in this detailed description are typically stored on a computer-readable storage medium, which may be any device or medium that can store code and/or data for use by a computer system. The computer-readable storage medium includes, but is not limited to, volatile memory, non-volatile memory, magnetic and optical storage devices such as disk drives, magnetic tape, CDs (compact discs), DVDs (digital versatile discs or digital video discs), or other media capable of storing computer-readable media now known or later developed.
The methods and processes described in the detailed description section can be embodied as code and/or data, which can be stored in a computer-readable storage medium as described above. When a computer system reads and executes the code and/or data stored on the computer-readable storage medium, the computer system performs the methods and processes embodied as data structures and code and stored within the computer-readable storage medium.
Furthermore, the methods and processes described above can be included in hardware modules or apparatus. The hardware modules or apparatus can include, but are not limited to, application-specific integrated circuit (ASIC) chips, field-programmable gate arrays (FPGAs), dedicated or shared processors that execute a particular software module or a piece of code at a particular time, and other programmable-logic devices now known or later developed. When the hardware modules or apparatus are activated, they perform the methods and processes included within them.
The foregoing descriptions of embodiments of the present invention have been presented for purposes of illustration and description only. They are not intended to be exhaustive or to limit the present invention to the forms disclosed. Accordingly, many modifications and variations will be apparent to practitioners skilled in the art. Additionally, the above disclosure is not intended to limit the present invention. The scope of the present invention is defined by the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
5649109 | Griesmer | Jul 1997 | A |
6021464 | Yao | Feb 2000 | A |
6047331 | Medard | Apr 2000 | A |
6128623 | Mattis | Oct 2000 | A |
6128627 | Mattis | Oct 2000 | A |
6182133 | Horvitz | Jan 2001 | B1 |
6209003 | Mattis | Mar 2001 | B1 |
6289358 | Mattis | Sep 2001 | B1 |
6292880 | Mattis | Sep 2001 | B1 |
6363067 | Chung | Mar 2002 | B1 |
6366947 | Kavner | Apr 2002 | B1 |
6775258 | vanValkenburg | Aug 2004 | B1 |
6834272 | Naor | Dec 2004 | B1 |
6915307 | Mattis | Jul 2005 | B1 |
6957228 | Graser | Oct 2005 | B1 |
7007024 | Zelenka | Feb 2006 | B2 |
7043637 | Bolosky | May 2006 | B2 |
7080073 | Jiang | Jul 2006 | B1 |
RE39360 | Aziz | Oct 2006 | E |
7149750 | Chadwick | Dec 2006 | B2 |
7233948 | Shamoon | Jun 2007 | B1 |
7426696 | Hwang | Sep 2008 | B1 |
7535926 | Deshpande | May 2009 | B1 |
7636767 | Lev-Ran | Dec 2009 | B2 |
7711684 | Sundaresan | May 2010 | B2 |
7747749 | Aamodt | Jun 2010 | B1 |
7801069 | Cheung | Sep 2010 | B2 |
7814425 | O'Shaugnessy | Oct 2010 | B1 |
7873619 | Faibish | Jan 2011 | B1 |
7979912 | Roka | Jul 2011 | B1 |
8069023 | Frailong | Nov 2011 | B1 |
8239331 | Shanmugavelayutham | Aug 2012 | B2 |
8271687 | Turner | Sep 2012 | B2 |
8332357 | Chung | Dec 2012 | B1 |
8375420 | Farrell | Feb 2013 | B2 |
8688727 | Das | Apr 2014 | B1 |
8861356 | Kozat | Oct 2014 | B2 |
8863227 | Zhang | Oct 2014 | B2 |
9002921 | Westphal | Apr 2015 | B2 |
9009465 | Zhang | Apr 2015 | B2 |
9032095 | Traina | May 2015 | B1 |
9137152 | Xie | Sep 2015 | B2 |
9253087 | Zhang | Feb 2016 | B2 |
9270598 | Oran | Feb 2016 | B1 |
9280610 | Gruber | Mar 2016 | B2 |
9380326 | Corley | Jun 2016 | B1 |
9400852 | Kim | Jul 2016 | B2 |
9466212 | Stumphauzer, II | Oct 2016 | B1 |
9609014 | Solis | Mar 2017 | B2 |
20010051927 | London | Dec 2001 | A1 |
20020002680 | Carbajal | Jan 2002 | A1 |
20030009365 | Tynan | Jan 2003 | A1 |
20030046421 | Horvitz et al. | Mar 2003 | A1 |
20040049541 | Swahn | Mar 2004 | A1 |
20040196783 | Shinomiya | Oct 2004 | A1 |
20040218548 | Kennedy | Nov 2004 | A1 |
20040233916 | Takeuchi | Nov 2004 | A1 |
20040246902 | Weinstein | Dec 2004 | A1 |
20040267902 | Yang | Dec 2004 | A1 |
20050066121 | Keeler | Mar 2005 | A1 |
20050132207 | Mourad | Jun 2005 | A1 |
20060242155 | Moore | Oct 2006 | A1 |
20060248078 | Gross | Nov 2006 | A1 |
20060288237 | Goodwill | Dec 2006 | A1 |
20070156998 | Gorobets | Jul 2007 | A1 |
20080005223 | Flake | Jan 2008 | A1 |
20080082509 | Bessieres | Apr 2008 | A1 |
20080082662 | Dandliker | Apr 2008 | A1 |
20080095159 | Suzuki | Apr 2008 | A1 |
20080123536 | Johnson | May 2008 | A1 |
20080244460 | Louch | Oct 2008 | A1 |
20080291923 | Back | Nov 2008 | A1 |
20090132642 | Ortal et al. | May 2009 | A1 |
20090135728 | Shen | May 2009 | A1 |
20090198832 | Shah | Aug 2009 | A1 |
20090216910 | Duchesneau | Aug 2009 | A1 |
20090274158 | Sharp | Nov 2009 | A1 |
20090276396 | Gorman | Nov 2009 | A1 |
20090287853 | Carson | Nov 2009 | A1 |
20090288076 | Johnson | Nov 2009 | A1 |
20090296719 | Maier | Dec 2009 | A1 |
20090307286 | Laffin | Dec 2009 | A1 |
20100195655 | Jacobson | Aug 2010 | A1 |
20100217985 | Fahrny | Aug 2010 | A1 |
20100257149 | Cognigni | Oct 2010 | A1 |
20100316052 | Petersen | Dec 2010 | A1 |
20100332595 | Fullagar | Dec 2010 | A1 |
20110131308 | Eriksson | Jun 2011 | A1 |
20110137919 | Ryu | Jun 2011 | A1 |
20110219093 | Ragunathan | Sep 2011 | A1 |
20110219727 | May | Sep 2011 | A1 |
20110225293 | Rathod | Sep 2011 | A1 |
20110280214 | Lee | Nov 2011 | A1 |
20120045064 | Rembarz | Feb 2012 | A1 |
20120079056 | Turanyi et al. | Mar 2012 | A1 |
20120102136 | Srebrny | Apr 2012 | A1 |
20120110159 | Richardson | May 2012 | A1 |
20120158912 | Jacobson | Jun 2012 | A1 |
20120166433 | Tseng | Jun 2012 | A1 |
20120166806 | Zhang | Jun 2012 | A1 |
20120237028 | Khazan | Sep 2012 | A1 |
20120300669 | Zahavi | Nov 2012 | A1 |
20120307629 | Vasseur | Dec 2012 | A1 |
20120317655 | Zhang | Dec 2012 | A1 |
20130016695 | Ravindran | Jan 2013 | A1 |
20130039249 | Ravindran | Feb 2013 | A1 |
20130061084 | Barton | Mar 2013 | A1 |
20130073882 | Inbaraj | Mar 2013 | A1 |
20130090942 | Robinson | Apr 2013 | A1 |
20130091237 | Ambalavanar | Apr 2013 | A1 |
20130110781 | Golab | May 2013 | A1 |
20130121489 | Pestoni | May 2013 | A1 |
20130128786 | Sultan | May 2013 | A1 |
20130139245 | Thomas | May 2013 | A1 |
20130163758 | Viswanathan | Jun 2013 | A1 |
20130227048 | Xie | Aug 2013 | A1 |
20130258878 | Wakikawa | Oct 2013 | A1 |
20130262698 | Schwan | Oct 2013 | A1 |
20130275544 | Westphal | Oct 2013 | A1 |
20130332955 | Hong | Dec 2013 | A1 |
20130332971 | Fisher | Dec 2013 | A1 |
20130346877 | Borovoy | Dec 2013 | A1 |
20140003424 | Matsuhira | Jan 2014 | A1 |
20140023076 | Calo | Jan 2014 | A1 |
20140033193 | Palaniappan | Jan 2014 | A1 |
20140043987 | Watve | Feb 2014 | A1 |
20140082661 | Krahnstoever | Mar 2014 | A1 |
20140090761 | Foucher | Apr 2014 | A1 |
20140096269 | Amidei | Apr 2014 | A1 |
20140098685 | Shattil | Apr 2014 | A1 |
20140122587 | Petker | May 2014 | A1 |
20140129690 | Jaisinghani | May 2014 | A1 |
20140181140 | Kim | Jun 2014 | A1 |
20140192677 | Chew | Jul 2014 | A1 |
20140204945 | Byun | Jul 2014 | A1 |
20140237095 | Bevilacqua-Linn et al. | Aug 2014 | A1 |
20140298248 | Kang | Oct 2014 | A1 |
20140304389 | Reavis | Oct 2014 | A1 |
20150033365 | Mellor | Jan 2015 | A1 |
20150036535 | Mosko | Feb 2015 | A1 |
20150117253 | Scott | Apr 2015 | A1 |
20150120663 | LeScouarnec | Apr 2015 | A1 |
20150169758 | Assom | Jun 2015 | A1 |
20150222424 | Mosko | Aug 2015 | A1 |
20150270957 | Uzun | Sep 2015 | A1 |
20150279348 | Cao | Oct 2015 | A1 |
20150281071 | Mosko | Oct 2015 | A1 |
20150288755 | Mosko | Oct 2015 | A1 |
20150312300 | Mosko | Oct 2015 | A1 |
20150349961 | Mosko | Dec 2015 | A1 |
20150372903 | Hui | Dec 2015 | A1 |
20150381546 | Mahadevan | Dec 2015 | A1 |
20160014027 | Oran | Jan 2016 | A1 |
20160019275 | Mosko | Jan 2016 | A1 |
20160020990 | Mahadevan et al. | Jan 2016 | A1 |
20160021172 | Mahadevan | Jan 2016 | A1 |
20160062840 | Scott | Mar 2016 | A1 |
20160094553 | Azgin | Mar 2016 | A1 |
20160110466 | Uzun | Apr 2016 | A1 |
20160149913 | Eriksson | May 2016 | A1 |
20160170964 | Xu | Jun 2016 | A1 |
20160171184 | Solis | Jun 2016 | A1 |
20160173604 | Panigrahi | Jun 2016 | A1 |
20160350294 | Nefedov | Dec 2016 | A1 |
20160364419 | Stanton | Dec 2016 | A1 |
20170250798 | Enga | Aug 2017 | A1 |
Number | Date | Country |
---|---|---|
103873371 | Jun 2014 | CN |
1383265 | Jan 2004 | EP |
1473889 | Nov 2004 | EP |
2120419 | Nov 2009 | EP |
2299754 | Mar 2011 | EP |
2323346 | May 2011 | EP |
2552083 | Jan 2013 | EP |
2562978 | Oct 2014 | EP |
2869537 | May 2015 | EP |
2214356 | May 2016 | EP |
2005041527 | May 2005 | WO |
2007122620 | Nov 2007 | WO |
2011159715 | Dec 2011 | WO |
2012077073 | Jun 2012 | WO |
2014023072 | Feb 2014 | WO |
2014090761 | Jun 2014 | WO |
2014102371 | Jul 2014 | WO |
2015084327 | Jun 2015 | WO |
Entry |
---|
International Search Report and Written Opinion in corresponding International Application No. PCT/US2017/020836, dated May 23, 2017, 12 pages. |
Anonymous, “Content Centric Networking—Wikipedia”, https://en.wikipedia.org/w/index.php?title=Content_centric_networking&oldid=706204894, Retrieved from the Internet on Feb. 5, 2018, 4 pgs. |
Marc Mosko: “CCNx 1.0 Protocol Introduction” Apr. 2, 2014 [Retrieved from the Internet Jun. 8, 2016] http://www.ccnx.org/pubs/hhg/1.1%20CCNx%201.0%20Protocol%20Introduction.pdf *paragraphs [01.3], [002], [02.1], [0003]. |
Akash Baid et al: “Comparing alternative approaches for networking of named objects in the future Internet”, Computer Communications Workshops (Infocom Wkshps), 2012 IEEE Conference on, IEEE, Mar. 25, 2012, pp. 298-303, *Paragraph [002]* *figure 1*. |
Priya Mahadevan: “CCNx 1.0 Tutorial”, Mar. 16, 2014, pp. 1-11, Retrieved from the Internet: http://www.ccnx.org/pubs/hhg/1.2%20CCNx%201.0%20Tutorial.pdf [retrieved on Jun. 8, 2016] *paragraphs [003]-[006], [0011], [0013]* *figures 1,2*. |
Marc Mosko et al “All-In-One Streams for Content Centric Networks”, May 24, 2015, retrieved from the Internet: http://www.ccnx.org/pubs/AllinOne.pdf [downloaded Jun. 9, 2016] *the whole document*. |
Cesar Ghali et al. “Elements of Trust in Named-Data Networking”, Feb. 13, 2014 Retrieved from the internet Jun. 17, 2016 http://arxiv.org/pdf/1402.3332v5.pdf *p. 5, col. 1* *p. 2, col. 1-2* * Section 4.1; p. 4, col. 2* *Section 4.2; p. 4, col. 2*. |
Priya Mahadevan et al. “CCN-KRS”, Proceedings of the 1st International Conference on Information-Centric Networking, Inc. '14, Sep. 24, 2014. |
Flavio Roberto Santos Et al. “Funnel: Choking Polluters in BitTorrent File Sharing Communities”, IEEE Transactions on Network and Service Management, IEEE vol. 8, No. 4, Dec. 1, 2011. |
Liu Wai-Xi et al: “Multisource Dissemination in content-centric networking”, 2013 Fourth International conference on the network of the future (NOF), IEEE, Oct. 23, 2013, pp. 1-5. |
Marie-Jose Montpetit et al.: “Network coding meets information-centric networking”, Proceedings of the 1st ACM workshop on emerging Name-Oriented mobile networking design, architecture, algorithms, and applications, NOM '12, Jun. 11, 2012, pp. 31-36. |
Asokan et al.: “Server-Supported Signatures”, Computer Security Esorics 96, Sep. 25, 1996, pp. 131-143, Section 3. |
Mandl et al.: “A Fast FPGA Based Coprocessor Supporting Hard Real-Time Search”, New Frontiers of Information Technology, Proceedings of the 23rd Euromicro Conference Budapest, Sep. 1, 1997, pp. 499-506 *The Whole Document*. |
Sun et al.: “Content-Based Route Lookup Using CAMs”, Global Communications Conference, IEEE, Dec. 3, 2012 *The Whole Document*. |
Gelenbe et al.: “Networks With Cognitive Packets”, Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2000. IEEE, Aug. 29, 2000, pp. 3-10. |
Vangelis et al.: “On the Role of Semantic Descriptions for Adaptable Protocol Stacks in the Internet of Things”, 2014 28th International Conference on Advanced Information Networking and Applications Workshops, IEEE, May 13, 2014, pp. 437-443, *last paragraph of section II.B*. |
Smetters et al. “Securing Network Content” Technical Report, PARC TR-2009-1, Oct. 1 2009, Retrieved from the internet URL:http//www.parc.com/content/attachments/TR-2009-01.pdf [retrieved Nov. 1, 2016]. |
Marc Mosko “CCNx Label Forwarding (CCNLF)” Jul. 21, 2014. |
Gallo Alcatel-Lucent Bell Labs “Content-Centric Networking Packet Header Format” Jan. 26, 2015. |
Huard J-F et al. “A Programmable Transport Architecture with QOS Guarantees” IEEE Communications Magazine, vol. 36, No. 10, Oct. 1, 1998. |
Microsoft Computer Dictionary, Fifth Edition, 2002, Microsoft Press, p. 23. |
Mind—A Brief Introduction, John R. Searle, 2004, Oxford University Press, pp. 62-67. |
J.J. Garcia-Luna-Aceves “Name-Based Content Routing in Information Centric Networks Using Distance Information”, Proceedings of the 1st International Conference on Information-Centric Networking, INC '14, Sep. 24, 2014, pp. 7-16, *p. 10, left-hand column, first paragraph*. |
Lan Wang et al.: “OSPFN: An OSPF Based Routing Protocol for Named Data Networking”, Jul. 25, 2012, URL: http://new.named-data.net/wp-content/uploads/TROSPFN.pdf [Retreived on Jul. 25, 2012], *section 3.1; p. 4*. |
Number | Date | Country | |
---|---|---|---|
20170257461 A1 | Sep 2017 | US |