Content negotiation in a content centric network
One embodiment provides a system that facilitates content negotiation in a content centric network. During operation, the system receives, by a content producing device, a packet that corresponds to a first interest, wherein an encoded name for the interest indicates a plurality of qualifiers for acceptable types of requested content, and wherein a name is a hierarchically structured variable length identifier which comprises contiguous name components. The system generates a first content object that satisfies one of the indicated plurality of qualifiers, wherein a name for the content object is the encoded name, and wherein a content object indicates data and a content type corresponding to the satisfied qualifier.
Latest Cisco Technology, Inc. Patents:
The subject matter of this application is related to the subject matter in the following applications:
-
- U.S. patent application Ser. No. 13/847,814, entitled “ORDERED-ELEMENT NAMING FOR NAME-BASED PACKET FORWARDING,” by inventor Ignacio Solis, filed 20 Mar. 2013 (hereinafter “U.S. patent application Ser. No. 13/847,814”), and
- U.S. patent application Ser. No. 12/338,175 (now U.S. Pat. No. 9,456,054), entitled “CONTROLLING THE SPREAD OF INTERESTS AND CONTENT IN A CONTENT CENTRIC NETWORK,” by inventors Van L. Jacobson and Diana K. Smetters, filed 18 Dec. 2008 (hereinafter “U.S. patent application Ser. No. 12/338,175”);
the disclosures of which are herein incorporated by reference in their entirety.
Field
This disclosure is generally related to distribution of digital content. More specifically, this disclosure is related to a system and method for negotiating content in a content centric network (CCN) based on encoding acceptable responses in a CCN name.
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. As an interest packet is routed through the network from a content requesting node to a content producing node, each intermediate CCN router adds an entry in its pending interest table (PIT) corresponding to the interest and forwards the interest to the next CCN router. When a matching content object packet is sent from the content producing node back to the requesting node, it follows the reverse path of the interest. Each intermediate CCN router forwards the content object along the requesting interfaces listed in the corresponding PIT entry and subsequently removes the PIT entry, indicating that the interest has been fulfilled.
The increasing amount of digital content also creates a need for flexible access to content, such as allowing a content requesting node or a client to specify a response with qualifiers. Content negotiation in hypertext transfer protocol (HTTP) is one technique that permits this flexible access. The HTTP protocol allows a client to transmit a “GET” request to an HTTP server and include additional meta-data in the request to obtain a specific set of resources, such as a document in a certain language or encoding. As CCN architectures evolve, there is a need to provide a similar, content negotiation technique to content requesting nodes or clients.
SUMMARYOne embodiment provides a system that facilitates content negotiation in a content centric network. During operation, the system receives, by a content producing device, a packet that corresponds to a first interest, wherein an encoded name for the interest indicates a plurality of qualifiers for acceptable types of requested content, and wherein a name is a hierarchically structured variable length identifier which comprises contiguous name components. The system generates a first content object that satisfies one of the indicated plurality of qualifiers, wherein a name for the content object is the encoded name, and wherein a content object indicates data and a content type corresponding to the satisfied qualifier.
In some embodiments, the system generates a second content object that indicates a multipart content object, wherein a name for the multipart content object is the encoded name, wherein the multipart content object indicates a plurality of member content objects, and wherein a member content object indicates a content-specific name. Responsive to determining that the content producing device can satisfy another qualifier, the system generates a corresponding content object that satisfies the other qualifier. The system also adds the corresponding content object to the multipart content object as a member content object.
In some embodiments, the system encrypts data associated with the corresponding content object based on authentication information, and prepends the authentication information to the corresponding content object.
In some embodiments, the system encrypts data associated with the corresponding content object based on authentication information, and replaces the encrypted data with the authentication information.
In some embodiments, the first content object further indicates a second content object that indicates authentication information for the first content object.
In some embodiments, the first content object further indicates a content-specific name.
In some embodiments, the system generates an unrequested content object based on the first interest and application logic of the content producing device. The system then transmits the generated unrequested content object to a requesting device associated with the first interest.
In some embodiments, the system generates a third content object that indicates information and a content-specific name to be used in a new interest for content based on an indicated qualifier, wherein a name for the third content object is the encoded name. The system receives a packet that corresponds to a second interest, wherein a name for the second interest is the content-specific name indicated in the third content object. The system also generates a fourth content object that satisfies the second interest, wherein a name for the fourth content object is the content-specific name for the second interest.
In another embodiment of the present invention, the system receives, by a forwarding device, a packet that corresponds to a first interest, wherein an encoded name for the interest indicates a plurality of qualifiers for acceptable types of requested content, and wherein a name is a hierarchically structured variable length identifier which comprises contiguous name components. The system adds an entry in a pending interest table for the first interest based on the encoded name. Subsequently, the system receives a packet that corresponds to a first content object that satisfies one of the indicated plurality of qualifiers, wherein a name for the first content object is the encoded name, and wherein a content object indicates data and a content type corresponding to the satisfied qualifier.
In a variation on this embodiment, the system generates a second interest based on the first content object and application logic of the forwarding device. The system adds an entry in a pending interest table for the second interest, and transmits the second interest to a content producing device.
In some embodiments, the system receives a packet that corresponds to a second content object that matches the second interest. The system stores the second content object in a cache.
In some embodiments, responsive to determining that the first content object indicates a multipart content object, the system partitions the multipart content object into one or more member content objects, wherein a member content object includes a content-specific name. The system stores the multipart content object in a cache based on the encoded name. The system also stores the one or more member content objects in the cache based on the corresponding content-specific name.
In some embodiments, the system identifies the entry in the pending interest table for the encoded name and a corresponding interface associated with the first interest. The system transmits the multipart content object via the identified interface. The system also removes the identified entry from the pending interest table.
In the figures, like reference numerals refer to the same figure elements.
DETAILED DESCRIPTIONThe 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 provide a system which facilitates content negotiation in a content centric network (CCN). In a traditional content negotiation method, such as based on HTTP, a client can transmit a “GET” request which can include metadata or qualifiers for requested content, e.g., a specific language or encoding type. In CCN, all content (including an interest or a request for content) can be identified by a name, such as “photo.jpg.” However, a CCN name typically does not contain any information regarding the content, the encoding, or even whether the data is, e.g., a photo. A client that requests a JPG, but can accept a GIF, therefore has no way of including this qualifying information in a standard CCN interest. In addition, a producer can generate a JPG, which can be cached by an intermediate router. The producer can subsequently move to a GIF format, which may result in a client's interest for a JPG passing through intermediate nodes which do not have a cached version of the JPG. Thus, the producer's format change may leave the client without a reliable means to retrieve the previously generated JPG from the producer.
The system of the present invention addresses these content negotiation issues by encoding qualifiers into a CCN name, such as: “/name_component{types},” where “/name_component” can be the beginning of the requested document name, and “types” can be a list of qualifiers for acceptable encodings of requested content. For example, a CCN interest with a name of “/photo{jpg|gif}” is a request for a document entitled “/photo” with data that must be encoded in either JPG or GIF format. Note that there is no limit on the number of qualifiers that can be included an encoded name.
A content producer that receives the interest can send back content based on three methods. In the first method, content negotiation by abstraction, the producer can send back a response that satisfies at least one of the qualifiers, e.g., either JPG or GIF. Because the request was for either JPG or GIF, either format will satisfy the response. The name of the responsive content object is the encoded name, “/photo{jpg|gif}” with data corresponding to the specifically encoded content object. A first producer can respond with a JPG encoded content object, and a second producer can respond with a GIF encoded content object. This can result in intermediate forwarders or routers caching two content objects with the same encoded name and different data. Either of these content objects can satisfy a subsequent request for “/photo{jpg|gif}.”
In the second method, content negotiation by oversupply, the producer can include as many content objects as it can, e.g., both JPG and GIF. The producer can create a multipart content object with the encoded name, and include both the JPG and the GIF encoded data as member content objects in the multipart content object. The client is then responsible for parsing or partitioning the received multipart content object into its member content objects.
In the third method, content negotiation by redirection, the producer can return a content object that includes a list of non-encoded names and metadata to use in a new request for content. The can review the list, determine which name to use for a specific encoding or content type, and transmit a new interest with a specific name (e.g., a non-encoded name).
In addition, both a producer and a forwarder can perform optimization operations. For example, based on a producer's application logic, the producer can “pre-seed” the network by pushing additional or related content in response to receiving an interest with the encoded name. Similarly, based on a forwarder's application logic, the forwarder can “pre-fetch” content for the network by issuing new interests for content in response to receiving interests or content with an encoded name. The forwarder can also parse or partition a multipart content object so that each member content object can be cached and made available for future requests.
In CCN, 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.
Exemplary Network and Communication
During operation, a first client (e.g., device 116) can generate an interest 130 with an encoded name of “/photo{jpg|gif}” and send interest 130 to node 102. Node 102 can add an entry for interest 130 in its pending interest table (PIT), and send interest 130 to nodes 110 and 112, each of which perform similar operations. Node 112 can send interest 130 to a first content producer (e.g., device 118). Producer 118 can determine a content negotiation method of abstraction and satisfy interest 130 by sending back a content object 132 with the encoded name, a content-type of “photo/jpg,” and corresponding JPG encoded data. Content object 132 travels the reverse path as interest 130 (e.g., via nodes 112, 110, and 102 back to client 116), with each intermediate node caching content object 132 with the encoded name and the JPG encoded data.
Multiple copies of the content with the same encoded name but different data (e.g., encoding or data types) can exist on the network. For example, a second client (e.g., device 120) can generate an interest 134 with the same name as interest 130 (e.g., “/photo{jpg|gif}”), and send interest 134 to node 104. Node 104 adds an entry for interest 134 in its PIT, and sends interest 134 to node 102. Node 102, having a cached copy of the requested content with the encoded name and JPG encoded data, can satisfy interest 134 and return responsive content object 132 back to client 120 via node 104. Alternatively, upon receiving interest 134, node 104 can send interest 134 along a different path to node 106. Node 106 can cache interest 134 in its PIT, and send interest 134 on to node 114, which again caches interest 134 in its PIT and sends interest 134 to a second content producer (e.g., device 122). Producer 122 can determine a content negotiation method of abstraction and satisfy interest 134 by sending back a content object 136 with the encoded name, a content-type of “photo/gif,” and GIF encoded data. Content object 136 travels the reverse path as interest 134 (e.g., via nodes 114, 106, and 104 back to client 120), with each intermediate node caching content object 136 with the encoded name and the GIF encoded data. In this way, multiple copies of content with the same encoded name but different data can exist on network 100.
Role of Content Producing Device
Subsequently, upon performing operations related to all three content negotiation methods, the producer can optionally perform optimization operations (operation 216). For example, the producer can generate an unrequested content object based on the first content object and application logic of the producer. The producer can then transmit the unrequested content object to a device associated with the first interest. This intelligent “pre-seeding” operation allows the producer to predict, based on a received interest, subsequent requests for content, and push the predicted content to the client (and simultaneously create cached copies of the content at intermediate routers in the network).
Role of Forwarding Device or Intermediate Router
Next, the forwarder can optionally perform optimization operations (operation 324). The forwarder can intelligently “pre-fetch” content based on the first interest or the first content object and application logic of the forwarder. For example, the forwarder can generate one or more interests based on the received first content object. The forwarder can receive and cache one or more content objects corresponding to the generated interests. The forwarder can also transmit the received content objects to a device associated with the first interest (e.g., a client). This pre-fetching operation results in pre-seeding of unrequested and predicted content, which pushes the predicted content to the client and the network, as described above in relation to
Security and Access Control
A client can request different types of content by including qualifiers in an encoded name. However, the different types of content may reside under different security or access control policies. For example, a client can request content in either HD or SD from a video-encoding service, but only a paying subscriber can retrieve the HD encoded video content. To address these needs, access control semantics can be integrated into the content negotiation protocol based on the specific content negotiation method.
When the producer chooses the abstraction method (operation 414), the producer generates a first content object that satisfies one of the indicated qualifiers, where a name for the first content object is the encoded name (operation 416). The first content object can indicate data and a content type corresponding to the satisfied qualifier. The first content object can also indicate a second content object, which indicates authentication information for the first content object. Because the producer decides which data format to use in a responding content object, and because access control policies may differ based on the selected data format, the producer can again tie access control to each of its possible responses. For example, if the producer returns a GIF image in response to an interest for a JPG or a GIF, the access control information for the GIF (e.g., a name to an access control specification content object) can be included in the content object response.
When the producer chooses the redirection method (not shown in
Exemplary Apparatuses
In some embodiments, communication module 502 can send and/or receive data packets (including interests and content objects) to/from other network nodes across a computer network. Packet-constructing module 506 can generate a first content object that satisfies a qualifier indicated in an encoded name for an interest. Packet-constructing module 506 can also generate a second content object that indicates a multipart content object with a name that is the encoded name, and where the multipart content object indicates member content objects. Packet-processing module 504 can determine that a device can satisfy an indicated qualifier. Packet-constructing module 506 can generate a content object that satisfies the indicated qualifier, and further add the content object to the multipart content object. Packet-constructing module 506 can generate a third content object that indicates information and a content-specific name to be used in a new interest for content based on an indicated qualifier. Packet-constructing module 506 can also generate a fourth content object that satisfies a second interest with a name that is the content-specific name indicated in the third content object.
Packet-seeding module 508 can generate an unrequested content object based on a first interest and application logic of a content producing device, and further transmit the unrequested content object to a device associated with the first interest. Security module 510 can encrypt data associated with a content object based on authentication information, and prepend the authentication information to the corresponding content object. Security module 510 can also replace the encrypted data with the authentication information.
Packet-seeding module 560 can generate a second interest based on a first content object and application logic of a forwarding device. PIT maintenance module 558 can add an entry in a PIT for the second interest, communication module 552 can transmit the second interest to a content producing device. Packet-seeding module 560 can store a received second content object in a cache. Packet-processing module 554 can determine that the first content object indicates a multipart content object. Packet-processing module 554 can further partition the multipart content object into member content objects. Packet-processing module 554 can store the multipart content object and the member content objects in a cache. PIT maintenance module 558 can identify the PIT entry for an encoded name and a corresponding interface, and remove the identified entry from the PIT. Communication module 552 can transmit the multipart content object via an identified interface.
Exemplary Computer and Communication Systems
Content-processing system 618 can include instructions, which when executed by computer and communication system 602, can cause computer and communication system 602 to perform methods and/or processes described in this disclosure. Specifically, content-processing system 618 may include instructions for receiving, by a content producing device, a packet that corresponds to a first interest, where an encoded name for the interest indicates a plurality of qualifiers for acceptable types of requested content (communication module 620). Content-processing system 618 can include instructions for generating a first content object that satisfies one of the indicated qualifiers, where a name for the content object is the encoded name, and where a content object indicates data and a content type corresponding to the satisfied qualifier (packet-constructing module 624).
Content-processing system 618 can also include instructions for generating a second content object that indicates a multipart content object (packet-constructing module 624), and, responsive to determining that the content producing device can satisfy another qualifier (packet-processing module 622), generating a corresponding content object that satisfies the other qualifier (packet-constructing module 624). Content-processing system 618 can also include instructions for adding the corresponding content object to the multipart content object as a member content object.
Additionally, content-processing system 618 can include instructions for generating an unrequested content object based on a first interest and application logic of a content producing device (packet-seeding module 626), and further transmitting the unrequested content object to a device associated with the first interest (communication module 620). Content-processing system 618 can include instructions for encrypting data associated with a content object based on authentication information, and prepending the authentication information to the corresponding content object (security module 628). Content-processing system 618 can further include instructions for replacing the encrypted data with the authentication information (security module 628).
Content-processing system 618 can further include instructions for generating a third content object that indicates information and a content-specific name to be used in a new interest for content based on an indicated qualifier (packet-constructing module 624). Content-processing system 618 can include instructions for receiving a packet that corresponds to a second interest, where a name for the second interest is the content-specific name indicated in the third content object (communication module 620). Content-processing system 618 can also include instructions for generating a fourth content object that satisfies the second interest, where a name for the fourth content object is the content-specific name for the second interest (packet-constructing module 624).
Data 630 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 630 can store at least: a packet that corresponds to a first interest with an encoded name; an encoded name that indicates a plurality of qualifiers for acceptable types of requested content; a name that is an HSVLI; a first content object that satisfies a qualifier indicated in an encoded name; a second content object that is a multipart content object; member content objects as indicated in a multipart content object; a content type; a content name; data representing content; authentication information; a digital certificate; a private key; a shared symmetric key; a public key; a KeyId; an unrequested content object or interest; application logic associated with a content producing device or a forwarding device; a third content object that indicates information and a content-specific name for a subsequent interest; a second interest with an non-encoded name; and a fourth content object corresponding to the second interest.
Content-processing system 668 can include instructions, which when executed by computer and communication system 652, can cause computer and communication system 652 to perform methods and/or processes described in this disclosure. Specifically, content-processing system 668 may include instructions for receiving, by a forwarding device, a packet that corresponds to a first interest, wherein an encoded name for the interest indicates a plurality of qualifiers for acceptable types of requested content (communication module 670).
Content-processing system 668 can include instructions for adding an entry in a PIT for the first interest based on the encoded name (PIT maintenance module 676). Content-processing system 668 can include instructions for receiving a packet that corresponds to a first content object that satisfies a qualifier (communication module 670). Content-processing system 668 can also include instructions for generating a second interest based on the first content object and application logic of a forwarding device (packet-seeding module 678). Content-processing system 668 can include instructions for adding an entry in the PIT for the second interest (PIT maintenance module 676), and for transmitting the second interest to a content producing device (communication module 670).
Content-processing system 668 can further include instructions for storing a received second content object in a cache (packet-processing module 672). Content-processing system 668 can include instructions for determining that the first content object indicates a multipart content object (packet-processing module 672). Content-processing system 668 can also include instructions for partitioning the multipart content object into member content objects, and for storing the multipart content object and the member content objects in a cache (packet-processing module 672). Content-processing system 668 can also include instructions for identifying the PIT entry for an encoded name and a corresponding interface, and removing the identified entry from the PIT (PIT maintenance module 676), and for transmitting the multipart content object via an identified interface (communication module 670).
Data 680 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 630 can store at least: a packet that corresponds to a first interest with an encoded name; an encoded name that indicates a plurality of qualifiers for acceptable types of requested content; a name that is an HSVLI; a first content object that satisfies a qualifier indicated in an encoded name; a second interest based on the first content object and application logic of a forwarding device; a second content object that matches the second interest; a multipart content object; member content objects as indicated in a multipart content object; a content type; a content name; data representing content; a pending interest table (PIT); a PIT entry; and an interface.
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.
Claims
1. A computer system for forwarding packets, the computer system comprising:
- a processor; and
- a storage device storing instructions that when executed by the processor cause the processor to perform a method, the method comprising: receiving, by a content producing device, a packet that corresponds to a first interest, wherein a plurality of qualifiers for acceptable types of requested content is encoded in a first name associated with the first interest; selecting a content negotiation method for the first interest, the content negotiation method selected from a group consisting of an oversupply method, an abstraction method, and a redirection method; based on the selected content negotiation method for the first interest, generating a first content object that satisfies at least one of the plurality of qualifiers encoded in the first name, wherein the first content object is identified by the first name, and wherein the first content object includes data with a content type corresponding to the at least one satisfied qualifier; forwarding the first content object to a network node that sent the packet that corresponds to the first interest; performing an optimization operation by generating an unrequested content object based on the first interest, the unrequested content object satisfying a qualifier that is different than the at least one of the plurality of qualifiers encoded in the first name associated with the first interest; and forwarding the unrequested content object to an intermediate network node between the content producing device and the network node that sent the packet that corresponds to the first interest.
2. The computer system of claim 1, wherein the method further comprises:
- encrypting data associated with the first content object based on authentication information; and
- prepending the authentication information to the first content object.
3. The computer system of claim 1, wherein the method further comprises:
- encrypting data associated with the first content object based on authentication information; and
- replacing the encrypted data with the authentication information.
4. The computer system of claim 1, wherein the method further comprises:
- associating a first access control policy with the first content object; and
- associating a second access control policy with a second content object.
5. The computer system of claim 4, wherein the unrequested content object is the second content object associated with the second access control policy.
6. The computer system of claim 1, wherein the method further comprises:
- selecting the oversupply method for the content negotiation method for the first interest;
- generating the first content object as a multipart content object identified by the first name, wherein the first content object includes a plurality of member content objects, and wherein each member content object is identified by a content specific name; and
- generating each member content object to satisfy a corresponding qualifier of the plurality of qualifiers encoded in the first name, wherein each member content object is identified by a corresponding content specific name encoding the corresponding qualifier.
7. A computer system for forwarding packets, the system comprising:
- a processor; and
- a storage device storing instructions that when executed by the processor cause the processor to perform a method, the method comprising;
- receiving, by a content producing device, a packet that corresponds to a first interest, wherein a plurality of qualifiers for acceptable types of requested content is encoded in a first name;
- selecting a redirection method for a content negotiation method of the first interest;
- based on the redirection method selected for the content negotiation method of the first interest, generating a first content object that satisfies at least one of the plurality of qualifiers encoded in the first name, wherein the first content object is identified by the first name, and wherein the first content object indicates at least one content-specific name corresponding to the at least one satisfied qualifier;
- forwarding the first content object to a network node that sent the packet that corresponds to the first interest;
- receiving a packet that corresponds to a second interest, wherein the second interest is associated with a second name selected from the at least one content-specific names indicated in the first content object;
- generating a second content object that satisfies the second interest, wherein the second content object is identified by the second name associated with the second interest;
- forwarding the second content object to a network node that sent the packet that corresponds to the first interest;
- performing an optimization operation by generating an unrequested content object based on the first interest, the unrequested content object satisfying a qualifier that is different than the at least one of the plurality of qualifiers encoded in the first name; and
- forwarding the unrequested content object to an intermediate network node between the content producing device and the network node that sent the packet that corresponds to the first interest.
8. A computer-implemented method for forwarding packets, the method comprising:
- receiving, by a content producing device, a packet that corresponds to a first interest, wherein a plurality of qualifiers for acceptable types of requested content is encoded in a first name associated with the first interest;
- selecting a content negotiation method for the first interest, the content negotiation method selected from a group consisting of an oversupply method, an abstraction method, and a redirection method;
- based on the selected content negotiation method for the first interest, generating a first content object that satisfies at least one of the plurality of qualifiers encoded in the first name, wherein the first content object is identified by the first name, and wherein the first content object includes data with a content type corresponding to the at least one satisfied qualifier;
- forwarding the first content object to a network node that sent the packet that corresponds to the first interest;
- performing an optimization operation by generating an unrequested content object based on the first interest, the unrequested content object satisfying a qualifier that is different than the at least one of the plurality of qualifiers encoded in the first name associated with the first interest; and
- forwarding the unrequested content object to an intermediate network node between the content producing device and the network node that sent the packet that corresponds to the first interest.
9. The method of claim 8, further comprising:
- encrypting data associated with the first content object based on authentication information; and
- prepending the authentication information to the first content object.
10. The method of claim 8, further comprising:
- encrypting data associated with the first content object based on authentication information; and
- replacing the encrypted data with the authentication information.
11. The method of claim 8, further comprising:
- associating a first access control policy with the first content object; and
- associating a second access control policy with a second content object.
12. The method of claim 11, wherein the unrequested content object is the second content object associated with the second access control policy.
13. The method of claim 8, further comprising:
- selecting the oversupply method for the content negotiation method for the first interest;
- generating the first content object as a multipart content object identified by the first name, wherein the first content object includes a plurality of member content objects, and wherein each member content object is identified by a content specific name; and
- generating each member content object to satisfy a corresponding qualifier of the plurality of qualifiers encoded in the first name, wherein each member content object is identified by a corresponding content specific name encoding the corresponding qualifier.
14. A computer implemented method for forwarding packets, the method comprising:
- receiving, by a content producing device, a packet that corresponds to a first interest, wherein a plurality of qualifiers for acceptable types of requested content is encoded in a first name;
- selecting a redirection method for a content negotiation method of the first interest;
- based on the redirection method selected for the content negotiation method of the first interest, generating a first content object that satisfies at least one of the plurality of qualifiers encoded in the first name, wherein the first content object is identified by the first name, and wherein the first content object indicates at least one content-specific name corresponding to the at least one satisfied qualifier;
- receiving a packet that corresponds to a second interest, wherein the second interest is associated with a second name selected from the at least one content-specific names indicated in the first content object;
- generating a second content object that satisfies the second interest, wherein the second content object is identified by the second name associated with the second interest;
- forwarding the second content object to a network node that sent the packet that corresponds to the first interest;
- performing an optimization operation by generating an unrequested content object based on the first interest, the unrequested content object satisfying a qualifier that is different than the at least one of the plurality of qualifiers encoded in the first name; and
- forwarding the unrequested content object to an intermediate network node between the content producing device and the network node that sent the packet that corresponds to the first interest.
15. An apparatus comprising:
- a communication module configured to send and receive data packets to and from network nodes across a computer network; and
- a processor configured to: receive, via the communication module, a packet that corresponds to a first interest, wherein a plurality of qualifiers for acceptable types of requested content is encoded in a first name associated with the first interest; select a content negotiation method for the first interest, the content negotiation method selected from a group consisting of an oversupply method, an abstraction method, and a redirection method; based on the selected content negotiation method for the first interest, generate a first content object that satisfies at least one of the plurality of qualifiers encoded in the first name, wherein the first content object is identified by the first name, and wherein the first content object includes data with a content type corresponding to the at least one satisfied qualifier; cause the communication module to forward the first content object to a network node that sent the packet that corresponds to the first interest; perform an optimization operation by generating an unrequested content object based on the first interest, the unrequested content object satisfying a qualifier that is different than the at least one of the plurality of qualifiers encoded in the first name associated with the first interest; and cause the communication module to forward the unrequested content object to an intermediate network node between the apparatus and the network node that sent the packet that corresponds to the first interest.
16. The apparatus of claim 15, wherein the processor is further configured to:
- encrypt data associated with the first content object based on authentication information; and
- prepend the authentication information to the first content object.
17. The apparatus of claim 15, wherein the processor is further configured to:
- encrypt data associated with the first content object based on authentication information; and
- replace the encrypted data with the authentication information.
18. The apparatus of claim 15, wherein the processor is further configured to:
- associate a first access control policy with the first content object; and
- associate a second access control policy with a second content object.
19. The apparatus of claim 18, wherein the unrequested content object is the second content object associated with the second access control policy.
20. The apparatus of claim 15, wherein the processor is further configured to:
- select the oversupply method for the content negotiation method for the first interest;
- generate the first content object as a multipart content object identified by the first name, wherein the first content object includes a plurality of member content objects, and wherein each member content object is identified by a content specific name; and
- generate each member content object to satisfy a corresponding qualifier of the plurality of qualifiers encoded in the first name, wherein each member content object is identified by a corresponding content specific name encoding the corresponding qualifier.
| 817441 | April 1906 | Niesz |
| 4309569 | January 5, 1982 | Merkle |
| 4921898 | May 1, 1990 | Lenney |
| 5070134 | December 3, 1991 | Oyamada |
| 5110856 | May 5, 1992 | Oyamada |
| 5214702 | May 25, 1993 | Fischer |
| 5377354 | December 27, 1994 | Scannell |
| 5506844 | April 9, 1996 | Rao |
| 5629370 | May 13, 1997 | Freidzon |
| 5845207 | December 1, 1998 | Amin |
| 5870605 | February 9, 1999 | Bracho |
| 6021464 | February 1, 2000 | Yao |
| 6047331 | April 4, 2000 | Medard |
| 6052683 | April 18, 2000 | Irwin |
| 6085320 | July 4, 2000 | Kaliski, Jr. |
| 6091724 | July 18, 2000 | Chandra |
| 6128623 | October 3, 2000 | Mattis |
| 6128627 | October 3, 2000 | Mattis |
| 6173364 | January 9, 2001 | Zenchelsky |
| 6209003 | March 27, 2001 | Mattis |
| 6226618 | May 1, 2001 | Downs |
| 6233617 | May 15, 2001 | Rothwein |
| 6233646 | May 15, 2001 | Hahm |
| 6289358 | September 11, 2001 | Mattis |
| 6292880 | September 18, 2001 | Mattis |
| 6332158 | December 18, 2001 | Risley |
| 6363067 | March 26, 2002 | Chung |
| 6366988 | April 2, 2002 | Skiba |
| 6574377 | June 3, 2003 | Cahill |
| 6654792 | November 25, 2003 | Verma |
| 6667957 | December 23, 2003 | Corson |
| 6681220 | January 20, 2004 | Kaplan |
| 6681326 | January 20, 2004 | Son |
| 6732273 | May 4, 2004 | Byers |
| 6769066 | July 27, 2004 | Botros |
| 6772333 | August 3, 2004 | Brendel |
| 6775258 | August 10, 2004 | vanValkenburg |
| 6834272 | December 21, 2004 | Naor |
| 6862280 | March 1, 2005 | Bertagna |
| 6901452 | May 31, 2005 | Bertagna |
| 6915307 | July 5, 2005 | Mattis |
| 6917985 | July 12, 2005 | Madruga |
| 6957228 | October 18, 2005 | Graser |
| 6968393 | November 22, 2005 | Chen |
| 6981029 | December 27, 2005 | Menditto |
| 7007024 | February 28, 2006 | Zelenka |
| 7013389 | March 14, 2006 | Srivastava |
| 7031308 | April 18, 2006 | Garcia-Luna-Aceves |
| 7043637 | May 9, 2006 | Bolosky |
| 7061877 | June 13, 2006 | Gummalla |
| 7080073 | July 18, 2006 | Jiang |
| RE39360 | October 17, 2006 | Aziz |
| 7149750 | December 12, 2006 | Chadwick |
| 7152094 | December 19, 2006 | Jannu |
| 7177646 | February 13, 2007 | ONeill |
| 7206860 | April 17, 2007 | Murakami |
| 7206861 | April 17, 2007 | Callon |
| 7210326 | May 1, 2007 | Kawamoto |
| 7233948 | June 19, 2007 | Shamoon |
| 7246159 | July 17, 2007 | Aggarwal |
| 7257837 | August 14, 2007 | Xu |
| 7287275 | October 23, 2007 | Moskowitz |
| 7315541 | January 1, 2008 | Housel |
| 7339929 | March 4, 2008 | Zelig |
| 7350229 | March 25, 2008 | Lander |
| 7362727 | April 22, 2008 | ONeill |
| 7382787 | June 3, 2008 | Barnes |
| 7395507 | July 1, 2008 | Robarts |
| 7430755 | September 30, 2008 | Hughes |
| 7444251 | October 28, 2008 | Nikovski |
| 7466703 | December 16, 2008 | Arunachalam |
| 7472422 | December 30, 2008 | Agbabian |
| 7496668 | February 24, 2009 | Hawkinson |
| 7509425 | March 24, 2009 | Rosenberg |
| 7523016 | April 21, 2009 | Surdulescu |
| 7535926 | May 19, 2009 | Deshpande |
| 7542471 | June 2, 2009 | Samuels |
| 7543064 | June 2, 2009 | Juncker |
| 7552233 | June 23, 2009 | Raju |
| 7555482 | June 30, 2009 | Korkus |
| 7555563 | June 30, 2009 | Ott |
| 7564812 | July 21, 2009 | Elliott |
| 7567547 | July 28, 2009 | Mosko |
| 7567946 | July 28, 2009 | Andreoli |
| 7580971 | August 25, 2009 | Gollapudi |
| 7623535 | November 24, 2009 | Guichard |
| 7636767 | December 22, 2009 | Lev-Ran |
| 7647507 | January 12, 2010 | Feng |
| 7660324 | February 9, 2010 | Oguchi |
| 7685290 | March 23, 2010 | Satapati |
| 7693959 | April 6, 2010 | Leighton |
| 7698463 | April 13, 2010 | Ogier |
| 7698559 | April 13, 2010 | Chaudhury |
| 7769887 | August 3, 2010 | Bhattacharyya |
| 7779467 | August 17, 2010 | Choi |
| 7801069 | September 21, 2010 | Cheung |
| 7801177 | September 21, 2010 | Luss |
| 7816441 | October 19, 2010 | Elizalde |
| 7831733 | November 9, 2010 | Sultan |
| 7873619 | January 18, 2011 | Faibish |
| 7908337 | March 15, 2011 | Garcia-Luna-Aceves |
| 7924837 | April 12, 2011 | Shabtay |
| 7930264 | April 19, 2011 | Geppert |
| 7953014 | May 31, 2011 | Toda |
| 7953885 | May 31, 2011 | Devireddy |
| 7979912 | July 12, 2011 | Roka |
| 8000267 | August 16, 2011 | Solis |
| 8010691 | August 30, 2011 | Kollmansberger |
| 8069023 | November 29, 2011 | Frailong |
| 8074289 | December 6, 2011 | Carpentier |
| 8117441 | February 14, 2012 | Kurien |
| 8160069 | April 17, 2012 | Jacobson |
| 8204060 | June 19, 2012 | Jacobson |
| 8214364 | July 3, 2012 | Bigus |
| 8224985 | July 17, 2012 | Takeda |
| 8225057 | July 17, 2012 | Zheng |
| 8239331 | August 7, 2012 | Shanmugavelayutham |
| 8271578 | September 18, 2012 | Sheffi |
| 8271687 | September 18, 2012 | Turner |
| 8312064 | November 13, 2012 | Gauvin |
| 8332357 | December 11, 2012 | Chung |
| 8375420 | February 12, 2013 | Farrell |
| 8386622 | February 26, 2013 | Jacobson |
| 8447851 | May 21, 2013 | Anderson |
| 8462781 | June 11, 2013 | McGhee |
| 8467297 | June 18, 2013 | Liu |
| 8473633 | June 25, 2013 | Eardley |
| 8553562 | October 8, 2013 | Allan |
| 8572214 | October 29, 2013 | Garcia-Luna-Aceves |
| 8645702 | February 4, 2014 | Zhang et al. |
| 8654649 | February 18, 2014 | Vasseur |
| 8665757 | March 4, 2014 | Kling |
| 8667172 | March 4, 2014 | Ravindran |
| 8677451 | March 18, 2014 | Bhimaraju |
| 8688619 | April 1, 2014 | Ezick |
| 8699350 | April 15, 2014 | Kumar |
| 8718055 | May 6, 2014 | Vasseur |
| 8750820 | June 10, 2014 | Allan |
| 8761022 | June 24, 2014 | Chiabaut |
| 8762477 | June 24, 2014 | Xie |
| 8762570 | June 24, 2014 | Qian |
| 8762707 | June 24, 2014 | Killian |
| 8767627 | July 1, 2014 | Ezure |
| 8817594 | August 26, 2014 | Gero |
| 8826381 | September 2, 2014 | Kim |
| 8832302 | September 9, 2014 | Bradford |
| 8836536 | September 16, 2014 | Marwah |
| 8861356 | October 14, 2014 | Kozat |
| 8862774 | October 14, 2014 | Vasseur |
| 8868779 | October 21, 2014 | ONeill |
| 8874842 | October 28, 2014 | Kimmel |
| 8880587 | November 4, 2014 | Cobb et al. |
| 8880682 | November 4, 2014 | Bishop |
| 8903756 | December 2, 2014 | Zhao |
| 8923293 | December 30, 2014 | Jacobson |
| 8934496 | January 13, 2015 | Vasseur |
| 8937865 | January 20, 2015 | Kumar |
| 8972969 | March 3, 2015 | Gaither |
| 8977596 | March 10, 2015 | Montulli |
| 8977704 | March 10, 2015 | Liu et al. |
| 9002921 | April 7, 2015 | Westphal |
| 9032095 | May 12, 2015 | Traina |
| 9071498 | June 30, 2015 | Beser |
| 9112895 | August 18, 2015 | Lin |
| 9137152 | September 15, 2015 | Xie |
| 9253087 | February 2, 2016 | Zhang |
| 9270598 | February 23, 2016 | Oran |
| 9276922 | March 1, 2016 | Mosko |
| 9280610 | March 8, 2016 | Gruber |
| 9531679 | December 27, 2016 | Uzun |
| 9602596 | March 21, 2017 | Mosko |
| 9621354 | April 11, 2017 | Mosko |
| 9699198 | July 4, 2017 | Solis |
| 9712649 | July 18, 2017 | Lopez |
| 9736263 | August 15, 2017 | Royon |
| 9762490 | September 12, 2017 | Valencia Lopez |
| 9946743 | April 17, 2018 | Mosko |
| 20020002680 | January 3, 2002 | Carbajal |
| 20020010795 | January 24, 2002 | Brown |
| 20020038296 | March 28, 2002 | Margolus |
| 20020048269 | April 25, 2002 | Hong |
| 20020054593 | May 9, 2002 | Morohashi |
| 20020077988 | June 20, 2002 | Sasaki |
| 20020078066 | June 20, 2002 | Robinson |
| 20020138551 | September 26, 2002 | Erickson |
| 20020152305 | October 17, 2002 | Jackson |
| 20020176404 | November 28, 2002 | Girard |
| 20020188605 | December 12, 2002 | Adya |
| 20020199014 | December 26, 2002 | Yang |
| 20030004621 | January 2, 2003 | Bousquet |
| 20030009365 | January 9, 2003 | Tynan |
| 20030033394 | February 13, 2003 | Stine |
| 20030046396 | March 6, 2003 | Richter |
| 20030046421 | March 6, 2003 | Horvitz et al. |
| 20030046437 | March 6, 2003 | Eytchison |
| 20030048793 | March 13, 2003 | Pochon |
| 20030051100 | March 13, 2003 | Patel |
| 20030061384 | March 27, 2003 | Nakatani |
| 20030074472 | April 17, 2003 | Lucco |
| 20030088696 | May 8, 2003 | McCanne |
| 20030097447 | May 22, 2003 | Johnston |
| 20030099237 | May 29, 2003 | Mitra |
| 20030140257 | July 24, 2003 | Paterka |
| 20030193967 | October 16, 2003 | Fenton |
| 20030229892 | December 11, 2003 | Sardera |
| 20040010507 | January 15, 2004 | Bellew |
| 20040024879 | February 5, 2004 | Dingman |
| 20040030602 | February 12, 2004 | Rosenquist |
| 20040064737 | April 1, 2004 | Milliken |
| 20040071140 | April 15, 2004 | Jason |
| 20040073617 | April 15, 2004 | Milliken |
| 20040073715 | April 15, 2004 | Folkes |
| 20040139230 | July 15, 2004 | Kim |
| 20040196783 | October 7, 2004 | Shinomiya |
| 20040218548 | November 4, 2004 | Kennedy |
| 20040221047 | November 4, 2004 | Grover |
| 20040225627 | November 11, 2004 | Botros |
| 20040233916 | November 25, 2004 | Takeuchi |
| 20040246902 | December 9, 2004 | Weinstein |
| 20040252683 | December 16, 2004 | Kennedy |
| 20040267902 | December 30, 2004 | Yang |
| 20050003832 | January 6, 2005 | Osafune |
| 20050028156 | February 3, 2005 | Hammond |
| 20050043060 | February 24, 2005 | Brandenberg |
| 20050050211 | March 3, 2005 | Kaul |
| 20050066121 | March 24, 2005 | Keeler |
| 20050074001 | April 7, 2005 | Mattes |
| 20050132207 | June 16, 2005 | Mourad |
| 20050149508 | July 7, 2005 | Deshpande |
| 20050159823 | July 21, 2005 | Hayes |
| 20050198351 | September 8, 2005 | Nog |
| 20050249196 | November 10, 2005 | Ansari |
| 20050259637 | November 24, 2005 | Chu |
| 20050262217 | November 24, 2005 | Nonaka |
| 20050281288 | December 22, 2005 | Banerjee |
| 20050286535 | December 29, 2005 | Shrum |
| 20050289222 | December 29, 2005 | Sahim |
| 20060010249 | January 12, 2006 | Sabesan |
| 20060029102 | February 9, 2006 | Abe |
| 20060039379 | February 23, 2006 | Abe |
| 20060051055 | March 9, 2006 | Ohkawa |
| 20060072523 | April 6, 2006 | Richardson |
| 20060099973 | May 11, 2006 | Nair |
| 20060129514 | June 15, 2006 | Watanabe |
| 20060133343 | June 22, 2006 | Huang |
| 20060146686 | July 6, 2006 | Kim |
| 20060173831 | August 3, 2006 | Basso |
| 20060193295 | August 31, 2006 | White |
| 20060203804 | September 14, 2006 | Whitmore |
| 20060206445 | September 14, 2006 | Andreoli |
| 20060215684 | September 28, 2006 | Capone |
| 20060223504 | October 5, 2006 | Ishak |
| 20060242155 | October 26, 2006 | Moore |
| 20060256767 | November 16, 2006 | Suzuki |
| 20060268792 | November 30, 2006 | Belcea |
| 20060288237 | December 21, 2006 | Goodwill |
| 20070019619 | January 25, 2007 | Foster |
| 20070073888 | March 29, 2007 | Madhok |
| 20070094265 | April 26, 2007 | Korkus |
| 20070112880 | May 17, 2007 | Yang |
| 20070124412 | May 31, 2007 | Narayanaswami |
| 20070127457 | June 7, 2007 | Mirtorabi |
| 20070156726 | July 5, 2007 | Levy |
| 20070156998 | July 5, 2007 | Gorobets |
| 20070160062 | July 12, 2007 | Morishita |
| 20070162394 | July 12, 2007 | Zager |
| 20070171828 | July 26, 2007 | Dalal |
| 20070189284 | August 16, 2007 | Kecskemeti |
| 20070195765 | August 23, 2007 | Heissenbuttel |
| 20070204011 | August 30, 2007 | Shaver |
| 20070209067 | September 6, 2007 | Fogel |
| 20070239892 | October 11, 2007 | Ott |
| 20070240207 | October 11, 2007 | Belakhdar |
| 20070245034 | October 18, 2007 | Retana |
| 20070253418 | November 1, 2007 | Shiri |
| 20070255677 | November 1, 2007 | Alexander |
| 20070255699 | November 1, 2007 | Sreenivas |
| 20070255781 | November 1, 2007 | Li |
| 20070274504 | November 29, 2007 | Maes |
| 20070275701 | November 29, 2007 | Jonker |
| 20070276907 | November 29, 2007 | Maes |
| 20070283158 | December 6, 2007 | Danseglio |
| 20070294187 | December 20, 2007 | Scherrer |
| 20080005056 | January 3, 2008 | Stelzig |
| 20080005223 | January 3, 2008 | Flake |
| 20080010366 | January 10, 2008 | Duggan |
| 20080037420 | February 14, 2008 | Tang |
| 20080043989 | February 21, 2008 | Furutono |
| 20080046340 | February 21, 2008 | Brown |
| 20080059631 | March 6, 2008 | Bergstrom |
| 20080080440 | April 3, 2008 | Yarvis |
| 20080082662 | April 3, 2008 | Dandliker |
| 20080095159 | April 24, 2008 | Suzuki |
| 20080101357 | May 1, 2008 | Iovanna |
| 20080107034 | May 8, 2008 | Jetcheva |
| 20080107259 | May 8, 2008 | Satou |
| 20080123862 | May 29, 2008 | Rowley |
| 20080133583 | June 5, 2008 | Artan |
| 20080133755 | June 5, 2008 | Pollack |
| 20080151755 | June 26, 2008 | Nishioka |
| 20080159271 | July 3, 2008 | Kutt |
| 20080165775 | July 10, 2008 | Das |
| 20080186901 | August 7, 2008 | Itagaki |
| 20080200153 | August 21, 2008 | Fitzpatrick |
| 20080215669 | September 4, 2008 | Gaddy |
| 20080216086 | September 4, 2008 | Tanaka |
| 20080243992 | October 2, 2008 | Jardetzky |
| 20080250006 | October 9, 2008 | Dettinger |
| 20080256138 | October 16, 2008 | Sim-Tang |
| 20080256359 | October 16, 2008 | Kahn |
| 20080270618 | October 30, 2008 | Rosenberg |
| 20080271143 | October 30, 2008 | Stephens |
| 20080287142 | November 20, 2008 | Keighran |
| 20080288580 | November 20, 2008 | Wang |
| 20080291923 | November 27, 2008 | Back |
| 20080298376 | December 4, 2008 | Takeda |
| 20080320148 | December 25, 2008 | Capuozzo |
| 20090006659 | January 1, 2009 | Collins |
| 20090013324 | January 8, 2009 | Gobara |
| 20090022154 | January 22, 2009 | Kiribe |
| 20090024641 | January 22, 2009 | Quigley |
| 20090030978 | January 29, 2009 | Johnson |
| 20090037763 | February 5, 2009 | Adhya |
| 20090052660 | February 26, 2009 | Chen |
| 20090067429 | March 12, 2009 | Nagai |
| 20090077184 | March 19, 2009 | Brewer |
| 20090092043 | April 9, 2009 | Lapuh |
| 20090097631 | April 16, 2009 | Gisby |
| 20090103515 | April 23, 2009 | Pointer |
| 20090113068 | April 30, 2009 | Fujihira |
| 20090116393 | May 7, 2009 | Hughes |
| 20090117922 | May 7, 2009 | Bell |
| 20090132662 | May 21, 2009 | Sheridan |
| 20090135728 | May 28, 2009 | Shen |
| 20090144300 | June 4, 2009 | Chatley |
| 20090157887 | June 18, 2009 | Froment |
| 20090185745 | July 23, 2009 | Momosaki |
| 20090193101 | July 30, 2009 | Munetsugu |
| 20090198832 | August 6, 2009 | Shah |
| 20090222344 | September 3, 2009 | Greene |
| 20090228593 | September 10, 2009 | Takeda |
| 20090254572 | October 8, 2009 | Redlich |
| 20090268905 | October 29, 2009 | Matsushima |
| 20090274158 | November 5, 2009 | Sharp |
| 20090276396 | November 5, 2009 | Gorman |
| 20090285209 | November 19, 2009 | Stewart |
| 20090287835 | November 19, 2009 | Jacobson |
| 20090287853 | November 19, 2009 | Carson |
| 20090288076 | November 19, 2009 | Johnson |
| 20090288143 | November 19, 2009 | Stebila |
| 20090288163 | November 19, 2009 | Jacobson |
| 20090292743 | November 26, 2009 | Bigus |
| 20090293121 | November 26, 2009 | Bigus |
| 20090296719 | December 3, 2009 | Maier |
| 20090300079 | December 3, 2009 | Shitomi |
| 20090300407 | December 3, 2009 | Kamath |
| 20090300512 | December 3, 2009 | Ahn |
| 20090307286 | December 10, 2009 | Laffin |
| 20090307333 | December 10, 2009 | Welingkar |
| 20090323632 | December 31, 2009 | Nix |
| 20100005061 | January 7, 2010 | Basco |
| 20100027539 | February 4, 2010 | Beverly |
| 20100046546 | February 25, 2010 | Ram |
| 20100057929 | March 4, 2010 | Merat |
| 20100058346 | March 4, 2010 | Narang |
| 20100088370 | April 8, 2010 | Wu |
| 20100094767 | April 15, 2010 | Miltonberger |
| 20100094876 | April 15, 2010 | Huang |
| 20100098093 | April 22, 2010 | Ejzak |
| 20100100465 | April 22, 2010 | Cooke |
| 20100103870 | April 29, 2010 | Garcia-Luna-Aceves |
| 20100124191 | May 20, 2010 | Vos |
| 20100125911 | May 20, 2010 | Bhaskaran |
| 20100131660 | May 27, 2010 | Dec |
| 20100150155 | June 17, 2010 | Napierala |
| 20100165976 | July 1, 2010 | Khan |
| 20100169478 | July 1, 2010 | Saha |
| 20100169503 | July 1, 2010 | Kollmansberger |
| 20100180332 | July 15, 2010 | Ben-Yochanan |
| 20100182995 | July 22, 2010 | Hwang |
| 20100185753 | July 22, 2010 | Liu |
| 20100195653 | August 5, 2010 | Jacobson |
| 20100195654 | August 5, 2010 | Jacobson |
| 20100195655 | August 5, 2010 | Jacobson |
| 20100198687 | August 5, 2010 | Bang |
| 20100217874 | August 26, 2010 | Anantharaman |
| 20100217985 | August 26, 2010 | Fahrny |
| 20100232402 | September 16, 2010 | Przybysz |
| 20100232439 | September 16, 2010 | Dham |
| 20100235516 | September 16, 2010 | Nakamura |
| 20100246549 | September 30, 2010 | Zhang |
| 20100250497 | September 30, 2010 | Redlich |
| 20100250939 | September 30, 2010 | Adams |
| 20100257149 | October 7, 2010 | Cognigni |
| 20100268782 | October 21, 2010 | Zombek |
| 20100272107 | October 28, 2010 | Papp |
| 20100281263 | November 4, 2010 | Ugawa |
| 20100284309 | November 11, 2010 | Allan |
| 20100284404 | November 11, 2010 | Gopinath |
| 20100293293 | November 18, 2010 | Beser |
| 20100316052 | December 16, 2010 | Petersen |
| 20100322249 | December 23, 2010 | Thathapudi |
| 20100332595 | December 30, 2010 | Fullagar |
| 20110013637 | January 20, 2011 | Xue |
| 20110019674 | January 27, 2011 | Iovanna |
| 20110022812 | January 27, 2011 | vanderLinden |
| 20110029952 | February 3, 2011 | Harrington |
| 20110055392 | March 3, 2011 | Shen |
| 20110055921 | March 3, 2011 | Narayanaswamy |
| 20110060716 | March 10, 2011 | Forman |
| 20110060717 | March 10, 2011 | Forman |
| 20110090908 | April 21, 2011 | Jacobson |
| 20110106755 | May 5, 2011 | Hao |
| 20110119394 | May 19, 2011 | Wang |
| 20110125874 | May 26, 2011 | Park |
| 20110131308 | June 2, 2011 | Eriksson |
| 20110137919 | June 9, 2011 | Ryu |
| 20110145597 | June 16, 2011 | Yamaguchi |
| 20110145858 | June 16, 2011 | Philpott |
| 20110149858 | June 23, 2011 | Hwang |
| 20110153840 | June 23, 2011 | Narayana |
| 20110158122 | June 30, 2011 | Murphy |
| 20110161408 | June 30, 2011 | Kim |
| 20110202609 | August 18, 2011 | Chaturvedi |
| 20110219093 | September 8, 2011 | Ragunathan |
| 20110219427 | September 8, 2011 | Hito |
| 20110219727 | September 15, 2011 | May |
| 20110225293 | September 15, 2011 | Rathod |
| 20110231578 | September 22, 2011 | Nagappan |
| 20110239256 | September 29, 2011 | Gholmieh |
| 20110258049 | October 20, 2011 | Ramer |
| 20110264824 | October 27, 2011 | Venkata Subramanian |
| 20110265159 | October 27, 2011 | Ronda |
| 20110265174 | October 27, 2011 | Thornton |
| 20110271007 | November 3, 2011 | Wang |
| 20110276630 | November 10, 2011 | Ekblom |
| 20110280214 | November 17, 2011 | Lee |
| 20110286457 | November 24, 2011 | Ee |
| 20110286459 | November 24, 2011 | Rembarz |
| 20110295783 | December 1, 2011 | Zhao |
| 20110299454 | December 8, 2011 | Krishnaswamy |
| 20120011170 | January 12, 2012 | Elad |
| 20120011551 | January 12, 2012 | Levy |
| 20120023113 | January 26, 2012 | Ferren |
| 20120036180 | February 9, 2012 | Thornton |
| 20120045064 | February 23, 2012 | Rembarz |
| 20120047361 | February 23, 2012 | Erdmann |
| 20120066727 | March 15, 2012 | Nozoe |
| 20120079056 | March 29, 2012 | Turãnyi |
| 20120102136 | April 26, 2012 | Srebrny |
| 20120106339 | May 3, 2012 | Mishra |
| 20120110159 | May 3, 2012 | Richardson |
| 20120114313 | May 10, 2012 | Phillips |
| 20120120803 | May 17, 2012 | Farkas |
| 20120127994 | May 24, 2012 | Ko |
| 20120136676 | May 31, 2012 | Goodall |
| 20120136936 | May 31, 2012 | Quintuna |
| 20120136945 | May 31, 2012 | Lee |
| 20120137367 | May 31, 2012 | Dupont |
| 20120141093 | June 7, 2012 | Yamaguchi |
| 20120155348 | June 21, 2012 | Jacobson |
| 20120155464 | June 21, 2012 | Kim |
| 20120158973 | June 21, 2012 | Jacobson |
| 20120163373 | June 28, 2012 | Lo |
| 20120166433 | June 28, 2012 | Tseng |
| 20120170913 | July 5, 2012 | Isozaki |
| 20120179653 | July 12, 2012 | Araki |
| 20120197690 | August 2, 2012 | Agulnek |
| 20120198048 | August 2, 2012 | Ioffe |
| 20120221150 | August 30, 2012 | Arensmeier |
| 20120224487 | September 6, 2012 | Hui |
| 20120226902 | September 6, 2012 | Kim |
| 20120257500 | October 11, 2012 | Lynch |
| 20120284371 | November 8, 2012 | Begen |
| 20120284791 | November 8, 2012 | Miller |
| 20120290669 | November 15, 2012 | Parks |
| 20120290919 | November 15, 2012 | Melnyk |
| 20120291102 | November 15, 2012 | Cohen |
| 20120300669 | November 29, 2012 | Zahavi |
| 20120307629 | December 6, 2012 | Vasseur |
| 20120314580 | December 13, 2012 | Hong |
| 20120317307 | December 13, 2012 | Ravindran |
| 20120317655 | December 13, 2012 | Zhang |
| 20120322422 | December 20, 2012 | Frecks |
| 20120323933 | December 20, 2012 | He |
| 20120331112 | December 27, 2012 | Chatani |
| 20130016695 | January 17, 2013 | Ravindran |
| 20130024560 | January 24, 2013 | Vasseur |
| 20130029664 | January 31, 2013 | Lee |
| 20130041982 | February 14, 2013 | Shi |
| 20130051392 | February 28, 2013 | Filsfils |
| 20130054971 | February 28, 2013 | Yamaguchi |
| 20130060962 | March 7, 2013 | Wang |
| 20130061084 | March 7, 2013 | Barton |
| 20130066823 | March 14, 2013 | Sweeney |
| 20130073552 | March 21, 2013 | Rangwala |
| 20130073882 | March 21, 2013 | Inbaraj |
| 20130074155 | March 21, 2013 | Huh |
| 20130090942 | April 11, 2013 | Robinson |
| 20130091237 | April 11, 2013 | Ambalavanar |
| 20130091539 | April 11, 2013 | Khurana |
| 20130110987 | May 2, 2013 | Kim |
| 20130111063 | May 2, 2013 | Lee |
| 20130128786 | May 23, 2013 | Sultan |
| 20130132719 | May 23, 2013 | Kobayashi |
| 20130139245 | May 30, 2013 | Thomas |
| 20130151584 | June 13, 2013 | Westphal |
| 20130151646 | June 13, 2013 | Chidambaram |
| 20130152070 | June 13, 2013 | Bhullar |
| 20130163426 | June 27, 2013 | Beliveau |
| 20130166668 | June 27, 2013 | Byun |
| 20130173822 | July 4, 2013 | Hong |
| 20130182568 | July 18, 2013 | Lee |
| 20130182931 | July 18, 2013 | Fan |
| 20130185406 | July 18, 2013 | Choi |
| 20130191412 | July 25, 2013 | Kitamura |
| 20130197698 | August 1, 2013 | Shah |
| 20130198119 | August 1, 2013 | Eberhardt, III |
| 20130198351 | August 1, 2013 | Widjaja |
| 20130212185 | August 15, 2013 | Pasquero |
| 20130219038 | August 22, 2013 | Lee |
| 20130219081 | August 22, 2013 | Qian |
| 20130219478 | August 22, 2013 | Mahamuni |
| 20130223237 | August 29, 2013 | Hui |
| 20130227048 | August 29, 2013 | Xie |
| 20130227114 | August 29, 2013 | Vasseur |
| 20130227166 | August 29, 2013 | Ravindran |
| 20130242996 | September 19, 2013 | Varvello |
| 20130250809 | September 26, 2013 | Hui |
| 20130262365 | October 3, 2013 | Dolbear |
| 20130262698 | October 3, 2013 | Schwan |
| 20130275464 | October 17, 2013 | Kim |
| 20130275544 | October 17, 2013 | Westphal |
| 20130275618 | October 17, 2013 | Puttaswamy Naga |
| 20130282854 | October 24, 2013 | Jang |
| 20130282860 | October 24, 2013 | Zhang |
| 20130282920 | October 24, 2013 | Zhang |
| 20130304711 | November 14, 2013 | Resch |
| 20130304758 | November 14, 2013 | Gruber |
| 20130304937 | November 14, 2013 | Lee |
| 20130325888 | December 5, 2013 | Oneppo |
| 20130329696 | December 12, 2013 | Xu |
| 20130332971 | December 12, 2013 | Fisher |
| 20130336103 | December 19, 2013 | Vasseur |
| 20130336323 | December 19, 2013 | Srinivasan |
| 20130339481 | December 19, 2013 | Hong |
| 20130343408 | December 26, 2013 | Cook |
| 20140003232 | January 2, 2014 | Guichard |
| 20140003424 | January 2, 2014 | Matsuhira |
| 20140006354 | January 2, 2014 | Parkison |
| 20140006565 | January 2, 2014 | Muscariello |
| 20140029445 | January 30, 2014 | Hui |
| 20140032714 | January 30, 2014 | Liu |
| 20140033193 | January 30, 2014 | Palaniappan |
| 20140040505 | February 6, 2014 | Barton |
| 20140040628 | February 6, 2014 | Fort |
| 20140043987 | February 13, 2014 | Watve |
| 20140047513 | February 13, 2014 | vantNoordende |
| 20140074730 | March 13, 2014 | Arensmeier |
| 20140075567 | March 13, 2014 | Raleigh |
| 20140082135 | March 20, 2014 | Jung |
| 20140082661 | March 20, 2014 | Krahnstoever |
| 20140089454 | March 27, 2014 | Jeon |
| 20140096249 | April 3, 2014 | Dupont |
| 20140098685 | April 10, 2014 | Shattil |
| 20140108313 | April 17, 2014 | Heidasch |
| 20140108474 | April 17, 2014 | David |
| 20140115037 | April 24, 2014 | Liu |
| 20140122587 | May 1, 2014 | Petker et al. |
| 20140129736 | May 8, 2014 | Yu |
| 20140136814 | May 15, 2014 | Stark |
| 20140140348 | May 22, 2014 | Perlman |
| 20140143370 | May 22, 2014 | Vilenski |
| 20140146819 | May 29, 2014 | Bae |
| 20140149733 | May 29, 2014 | Kim |
| 20140237095 | August 21, 2014 | Petker |
| 20140156396 | June 5, 2014 | deKozan |
| 20140165207 | June 12, 2014 | Engel |
| 20140172783 | June 19, 2014 | Suzuki |
| 20140172981 | June 19, 2014 | Kim |
| 20140173034 | June 19, 2014 | Liu |
| 20140173076 | June 19, 2014 | Ravindran |
| 20140181140 | June 26, 2014 | Kim |
| 20140181186 | June 26, 2014 | Stevens |
| 20140181226 | June 26, 2014 | Xu |
| 20140192677 | July 10, 2014 | Chew |
| 20140192717 | July 10, 2014 | Liu |
| 20140195328 | July 10, 2014 | Ferens |
| 20140195641 | July 10, 2014 | Wang |
| 20140195666 | July 10, 2014 | Dumitriu |
| 20140201615 | July 17, 2014 | Rajkumar |
| 20140204945 | July 24, 2014 | Byun |
| 20140214942 | July 31, 2014 | Ozonat |
| 20140233575 | August 21, 2014 | Xie |
| 20140237085 | August 21, 2014 | Park |
| 20140245359 | August 28, 2014 | DeFoy |
| 20140254595 | September 11, 2014 | Luo |
| 20140258209 | September 11, 2014 | Eshleman |
| 20140280823 | September 18, 2014 | Varvello |
| 20140281489 | September 18, 2014 | Peterka |
| 20140281505 | September 18, 2014 | Zhang |
| 20140282816 | September 18, 2014 | Xie |
| 20140289325 | September 25, 2014 | Solis |
| 20140289790 | September 25, 2014 | Wilson |
| 20140298248 | October 2, 2014 | Kang |
| 20140314093 | October 23, 2014 | You |
| 20140337276 | November 13, 2014 | Iordanov |
| 20140365550 | December 11, 2014 | Jang |
| 20150006896 | January 1, 2015 | Franck |
| 20150018770 | January 15, 2015 | Baran |
| 20150032892 | January 29, 2015 | Narayanan |
| 20150033365 | January 29, 2015 | Mellor |
| 20150039890 | February 5, 2015 | Khosravi |
| 20150063802 | March 5, 2015 | Bahadur |
| 20150089081 | March 26, 2015 | Thubert |
| 20150095481 | April 2, 2015 | Ohnishi |
| 20150095514 | April 2, 2015 | Yu |
| 20150095762 | April 2, 2015 | Rajkumar |
| 20150113163 | April 23, 2015 | Jacobson |
| 20150113166 | April 23, 2015 | Mosko |
| 20150117253 | April 30, 2015 | Scott |
| 20150117449 | April 30, 2015 | Mosko |
| 20150117453 | April 30, 2015 | Mosko |
| 20150120663 | April 30, 2015 | LeScouarnec |
| 20150169758 | June 18, 2015 | Assom |
| 20150188770 | July 2, 2015 | Naiksatam |
| 20150195149 | July 9, 2015 | Vasseur |
| 20150207633 | July 23, 2015 | Ravindran |
| 20150207864 | July 23, 2015 | Wilson |
| 20150222603 | August 6, 2015 | Uzun |
| 20150248455 | September 3, 2015 | Sevilla |
| 20150256601 | September 10, 2015 | Mosko |
| 20150261775 | September 17, 2015 | Shin |
| 20150271267 | September 24, 2015 | Solis |
| 20150279348 | October 1, 2015 | Cao |
| 20150280918 | October 1, 2015 | Uzun |
| 20150280984 | October 1, 2015 | Mahadevan |
| 20150281101 | October 1, 2015 | Mosko |
| 20150281376 | October 1, 2015 | Mahadevan |
| 20150286844 | October 8, 2015 | Mosko |
| 20150288755 | October 8, 2015 | Mosko |
| 20150294025 | October 15, 2015 | Wellen |
| 20150296028 | October 15, 2015 | Scott |
| 20150312300 | October 29, 2015 | Mosko |
| 20150319241 | November 5, 2015 | Scott |
| 20150349961 | December 3, 2015 | Mosko |
| 20150350078 | December 3, 2015 | Azgin |
| 20150358436 | December 10, 2015 | Kim |
| 20150372903 | December 24, 2015 | Hui |
| 20150373162 | December 24, 2015 | Mosko |
| 20150381546 | December 31, 2015 | Mahadevan |
| 20160006747 | January 7, 2016 | Solis |
| 20160019275 | January 21, 2016 | Mosko |
| 20160020990 | January 21, 2016 | Mahadevan |
| 20160021170 | January 21, 2016 | Mosko |
| 20160021172 | January 21, 2016 | Mahadevan |
| 20160043960 | February 11, 2016 | Solis |
| 20160062840 | March 3, 2016 | Scott |
| 20160065677 | March 3, 2016 | Mosko |
| 20160072715 | March 10, 2016 | Mahadevan |
| 20160105394 | April 14, 2016 | Rangarajan |
| 20160105524 | April 14, 2016 | Farhadi |
| 20160110466 | April 21, 2016 | Uzun |
| 20160119194 | April 28, 2016 | Valencia Lopez |
| 20160119234 | April 28, 2016 | Valencia Lopez |
| 20160156714 | June 2, 2016 | Farhadi |
| 20160164952 | June 9, 2016 | Tur Nyi |
| 20160171184 | June 16, 2016 | Solis |
| 20160173410 | June 16, 2016 | Lopez |
| 20160191385 | June 30, 2016 | Lopez |
| 20160203170 | July 14, 2016 | Mosko |
| 20160205034 | July 14, 2016 | Solis |
| 20160205178 | July 14, 2016 | Mosko |
| 20160212277 | July 21, 2016 | Lopez |
| 20160241669 | August 18, 2016 | Royon |
| 20160277340 | September 22, 2016 | Mosko |
| 20160285671 | September 29, 2016 | Rangarajan |
| 20160352604 | December 1, 2016 | Valencia Lopez |
| 20160352614 | December 1, 2016 | Valencia Lopez |
| 20160366620 | December 15, 2016 | Royon |
| 20160380945 | December 29, 2016 | Wood |
| 20160380970 | December 29, 2016 | Jacobson |
| 20170012867 | January 12, 2017 | Royon |
| 20170091251 | March 30, 2017 | Wood |
| 20170134276 | May 11, 2017 | White |
| 20170163760 | June 8, 2017 | Wood |
| 20170201577 | July 13, 2017 | Wood |
| 20170214661 | July 27, 2017 | Wood |
| 20170249468 | August 31, 2017 | Wood |
| 20170257461 | September 7, 2017 | Wood |
| 103873371 | June 2014 | CN |
| 104052667 | September 2014 | CN |
| 1720277 | June 1967 | DE |
| 19620817 | November 1997 | DE |
| 0295727 | December 1988 | EP |
| 0757065 | July 1996 | EP |
| 1077422 | February 2001 | EP |
| 1383265 | January 2004 | EP |
| 1384729 | January 2004 | EP |
| 1473889 | November 2004 | EP |
| 2120402 | November 2009 | EP |
| 2120419 | November 2009 | EP |
| 2120419 | November 2009 | EP |
| 2124415 | November 2009 | EP |
| 2214357 | August 2010 | EP |
| 2299754 | March 2011 | EP |
| 2323346 | May 2011 | EP |
| 2552083 | January 2013 | EP |
| 2214356 | May 2016 | EP |
| 03005288 | January 2003 | WO |
| 03042254 | May 2003 | WO |
| 03049369 | June 2003 | WO |
| 03091297 | November 2003 | WO |
| 2005041527 | May 2005 | WO |
| 2007113180 | October 2007 | WO |
| 2007122620 | November 2007 | WO |
| 2007144388 | December 2007 | WO |
| 2011049890 | April 2011 | WO |
| 2012077073 | June 2012 | WO |
| WO 2012089004 | July 2012 | WO |
| WO 2013098468 | July 2013 | WO |
| 2013123410 | August 2013 | WO |
| 2014023072 | February 2014 | WO |
| 2015084327 | June 2015 | WO |
- Google Translation of CN104052667A.
- Lum et al “User-Centric Content Negotiation for Effective Adaptation Service in Mobile Computing,” IEEE Transactions on Software Engineering, vol. 29, No. 12, Dec. 2003, pp. 1100-1111 (Year: 2003).
- Hess et al “Content-Triggered Trust Negotiation,” ACM Transactions on Information and System Security, vol. 7, No. 3, Aug. 2004, pp. 428-456 (Year: 2004).
- Jacobson, Van et al., “Content-Centric Networking, Whitepaper Describing Future Assurable Global Networks”, Palo Alto Research Center, Inc., Jan. 30, 2007, pp. 1-9.
- Koponen, Teemu et al., “A Data-Oriented (and Beyond) Network Architecture”, SIGCOMM '07, Aug. 27-31, 2007, Kyoto, Japan, XP-002579021, p. 181-192.
- Fall, K. et al., “DTN: an architectural retrospective”, Selected areas in communications, IEEE Journal on, vol. 28, No. 5, Jun. 1, 2008, pp. 828-835.
- Gritter, M. et al., ‘An Architecture for content routing support in the Internet’, Proceedings of 3rd Usenix Symposium on Internet Technologies and Systems, 2001, pp. 37-48.
- “CCNx,” http://ccnx.org/. downloaded Mar. 11, 2015.
- “Content Delivery Network”, Wikipedia, Dec. 10, 2011, http://en.wikipedia.org/w/index.php?title=Content_delivery_network&oldid=465077460.
- “Digital Signature” archived on Aug. 31, 2009 at http://web.archive.org/web/20090831170721/http://en.wikipedia.org/wiki/Digital_signature.
- “Introducing JSON,” http://www.json.org/. downloaded Mar. 11, 2015.
- “Microsoft PlayReady,” http://www.microsoft.com/playready/.downloaded Mar. 11, 2015.
- “Pursuing a pub/sub internet (PURSUIT),” http://www.fp7-pursuit.ew/PursuitWeb/. downloaded Mar. 11, 2015.
- “The FP7 4WARD project,” http://www.4ward-project.eu/. downloaded Mar. 11, 2015.
- A. Broder and A. Karlin, “Multilevel Adaptive Hashing”, Jan. 1990, pp. 43-53.
- Detti, Andrea, et al. “CONET: a content centric inter-networking architecture.” Proceedings of the ACM SIGCOMM workshop on Information-centric networking. ACM, 2011.
- A. Wolman, M. Voelker, N. Sharma N. Cardwell, A. Karlin, and H.M. Levy, “On the scale and performance of cooperative web proxy caching,” ACM SIGHOPS Operating Systems Review, vol. 33, No. 5, pp. 16-31, Dec. 1999.
- Afanasyev, Alexander, et al. “Interest flooding attack and countermeasures in Named Data Networking.” IFIP Networking Conference, 2013. IEEE, 2013.
- Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante. Drafting Behind Akamai: Inferring Network Conditions Based on CDN Redirections. IEEE/ACM Transactions on Networking {Feb. 2009).
- B. Ahlgren et al., ‘A Survey of Information-centric Networking’ IEEE Commun. Magazine, Jul. 2012, pp. 26-36.
- Bari, MdFaizul, et al. ‘A survey of naming and routing in information-centric networks.’ Communications Magazine, IEEE 50.12 (2012): 44-53.
- Baugher, Mark et al., “Self-Verifying Names for Read-Only Named Data”, 2012 IEEE Conference on Computer Communications Workshops (INFOCOM Wkshps), Mar. 2012, pp. 274-279.
- Brambley, Michael, A novel, low-cost, reduced-sensor approach for providing smart remote monitoring and diagnostics for packaged air conditioners and heat pumps. Pacific Northwest National Laboratory, 2009.
- C. Gentry and A. Silverberg. Hierarchical ID-Based Cryptography. Advances in Cryptology—ASIACRYPT 2002. Springer Berlin Heidelberg (2002).
- C.A. Wood and E. Uzun, “Flexible end-to-end content security in CCN,” in Proc. IEEE CCNC 2014, Las Vegas, CA, USA, Jan. 2014.
- Carzaniga, Antonio, Matthew J. Rutherford, and Alexander L. Wolf. ‘A routing scheme for content-based networking.’ INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies. vol. 2. IEEE, 2004.
- Cho, Jin-Hee, Ananthram Swami, and Ray Chen. “A survey on trust management for mobile ad hoc networks.” Communications Surveys & Tutorials, IEEE 13.4 (2011): 562-583.
- Compagno, Alberto, et al. “Poseidon: Mitigating interest flooding DDoS attacks in named data networking.” Local Computer Networks (LCN), 2013 IEEE 38th Conference on. IEEE, 2013.
- Conner, William, et al. “A trust management framework for service-oriented environments.” Proceedings of the 18th international conference on World wide web. ACM, 2009.
- Content Centric Networking Project (CCN) [online], http://ccnx.org/releases/latest/doc/technical/, Downloaded Mar. 9, 2015.
- Content Mediator Architecture for Content-aware Networks (COMET) Project [online], http://www.comet-project.org/, Downloaded Mar. 9, 2015.
- D. Boneh and M. Franklin. Identity-Based Encryption from the Weil Pairing. Advances in Cryptology—CRYPTO 2001, vol. 2139, Springer Berlin Heidelberg (2001).
- D.K. Smetters, P. Golle, and J.D. Thornton, “CCNx access control specifications,” PARC, Tech. Rep., Jul. 2010.
- Dabirmoghaddam, Ali, Maziar Mirzazad Barijough, and J. J. Garcia-Luna-Aceves. ‘Understanding optimal caching and opportunistic caching at the edge of information-centric networks.’ Proceedings of the 1st international conference on Information-centric networking. ACM, 2014.
- Detti et al., “Supporting the Web with an information centric network that routes by name”, Aug. 2012, Computer Networks 56, pp. 3705-3702.
- Dijkstra, Edsger W., and Carel S. Scholten. ‘Termination detection for diffusing computations.’ Information Processing Letters 11.1 (1980): 1-4.
- Dijkstra, Edsger W., Wim HJ Feijen, and A_J M. Van Gasteren. “Derivation of a termination detection algorithm for distributed computations.” Control Flow and Data Flow: concepts of distributed programming. Springer Berlin Heidelberg, 1986. 507-512.
- E. Rescorla and N. Modadugu, “Datagram transport layer security,” IETF RFC 4347, Apr. 2006.
- E.W. Dijkstra, W. Feijen, and A.J.M. Van Gasteren, “Derivation of a Termination Detection Algorithm for Distributed Computations,” Information Processing Letter, vol. 16, No. 5, 1983.
- Fayazbakhsh, S. K., Lin, Y., Tootoonchian, A., Ghodsi, A., Koponen, T., Maggs, B., & Shenker, S. {Aug. 2013). Less pain, most of the gain: Incrementally deployable ICN. In ACM SIGCOMM Computer Communication Review (vol. 43, No. 4, pp. 147-158). ACM.
- G. Tyson, S. Kaune, S. Miles, Y. El-Khatib, A. Mauthe, and A. Taweel, “A trace-driven analysis of caching in content-centric networks,” in Proc. IEEE ICCCN 2012, Munich, Germany, Jul.-Aug. 2012, pp. 1-7.
- G. Wang, Q. Liu, and J. Wu, “Hierarchical attribute-based encryption for fine-grained access control in cloud storage services,” in Proc. ACM CCS 2010, Chicago, IL, USA, Oct. 2010, pp. 735-737.
- G. Xylomenos et al., “A Survey of Information-centric Networking Research,” IEEE Communication Surveys and Tutorials, Jul. 2013.
- Garcia, Humberto E., Wen-Chiao Lin, and Semyon M. Meerkov. “A resilient condition assessment monitoring system.” Resilient Control Systems (ISRCS), 2012 5th International Symposium on. IEEE, 2012.
- Garcia-Luna-Aceves, Jose J. ‘A unified approach to loop-free routing using distance vectors or link states.’ ACM SIGCOMM Computer Communication Review. vol. 19. No. 4. ACM, 1989.
- Garcia-Luna-Aceves, Jose J. ‘Name-Based Content Routing in Information Centric Networks Using Distance Information’ Proc ACM ICN 2014, Sep. 2014.
- Ghali, Cesar, GeneTsudik, and Ersin Uzun. “Needle in a Haystack: Mitigating Content Poisoning in Named-Data Networking.” Proceedings of NDSS Workshop on Security of Emerging Networking Technologies (SENT). 2014.
- Ghodsi, Ali, et al. “Information-centric networking: seeing the forest for the trees.” Proceedings of the 10th ACM Workshop on Hot Topics in Networks. ACM, 2011.
- Ghodsi, Ali, et al. “Naming in content-oriented architectures.” Proceedings of the ACM SIGCOMM workshop on Information-centric networking. ACM, 2011.
- Gupta, Anjali, Barbara Liskov, and Rodrigo Rodrigues. “Efficient Routing for Peer-to-Peer Overlays.” NSDI. vol. 4. 2004.
- Heckerman, David, John S. Breese, and Koos Rommelse. “Decision-Theoretic Troubleshooting.” Communications of the ACM. 1995.
- Heinemeier, Kristin, et al. “Uncertainties in Achieving Energy Savings from HVAC Maintenance Measures in the Field.” ASHRAE Transactions 118.Part 2 {2012).
- Herlich, Matthias et al., “Optimizing Energy Efficiency for Bulk Transfer Networks”, Apr. 13, 2010, pp. 1-3, retrieved for the Internet: URL:http://www.cs.uni-paderborn.de/fileadmin/informationik/ag-karl/publications/miscellaneous/optimizing.pdf (retrieved on Mar. 9, 2012).
- Hoque et al., ‘NLSR: Named-data Link State Routing Protocol’, Aug. 12, 2013, ICN 2013, pp. 15-20.
- I. Psaras, Psaras, R.G. Clegg, R. Landa, W.K. Chai, and G. Pavlou, “Modelling and evaluation of CCN-caching trees,” in Proc. IFIP Networking 2011, Valencia, Spain, May 2011, pp. 78-91.
- Intanagonwiwat, Chalermek, Ramesh Govindan, and Deborah Estrin. ‘Directed diffusion: a scalable and robust communication paradigm for sensor networks.’ Proceedings of the 6th annual international conference on Mobile computing and networking. ACM, 2000.
- J. Aumasson and D. Bernstein, “SipHash: a fast short-input PRF”, Sep. 18, 2012.
- J. Bethencourt, A, Sahai, and B. Waters, ‘Ciphertext-policy attribute-based encryption,’ in Proc. IEEE Security & Privacy 2007, Berkeley, CA, USA, May 2007, pp. 321-334.
- J. Hur, “Improving security and efficiency in attribute-based data sharing,” IEEE Trans. Knowledge Data Eng., vol. 25, No. 10, pp. 2271-2282, Oct. 2013.
- J. Shao and Z. Cao. CCA-Secure Proxy Re-Encryption without Pairings. Public Key Cryptography. Springer Lecture Notes in Computer Science vol. 5443 (2009).
- V. Jacobson et al., ‘Networking Named Content,’ Proc. IEEE CoNEXT '09, Dec. 2009.
- Jacobson, Van et al. ‘VoCCN: Voice Over Content-Centric Networks.’ Dec. 1, 2009. ACM ReArch'09.
- Jacobson et al., “Custodian-Based Information Sharing,” Jul. 2012, IEEE Communications Magazine: vol. 50 Issue 7 (p. 3843).
- Ji, Kun, et al. “Prognostics enabled resilient control for model-based building automation systems.” Proceedings of the 12th Conference of International Building Performance Simulation Association. 2011.
- K. Liang, L. Fang, W. Susilo, and D.S. Wong, “A Ciphertext-policy attribute-based proxy re-encryption with chosen-ciphertext security,” in Proc. INCoS 2013, Xian, China, Sep. 2013, pp. 552-559.
- Katipamula, Srinivas, and Michael R. Brambley. “Review article: methods for fault detection, diagnostics, and prognostics for building systemsa review, Part I.” HVAC&R Research 11.1 (2005): 3-25.
- Katipamula, Srinivas, and Michael R. Brambley. “Review article: methods for fault detection, diagnostics, and prognostics for building systemsa review, Part II.” HVAC&R Research 11.2 (2005): 169-187.
- L. Wang et al., ‘OSPFN: An OSPF Based Routing Protocol for Named Data Networking,’ Technical Report NDN-0003, 2012.
- L. Zhou, V. Varadharajan, and M. Hitchens, “Achieving secure role-based access control on encrypted data in cloud storage,” IEEE Trans. Inf. Forensics Security, vol. 8, No. 12, pp. 1947-1960, Dec. 2013.
- Li, Wenjia, Anupam Joshi, and Tim Finin. “Coping with node misbehaviors in ad hoc networks: A multi-dimensional trust management approach.” Mobile Data Management (MDM), 2010 Eleventh International Conference on. IEEE, 2010.
- 402Best Lopez, Javier, et al. “Trust management systems for wireless sensor networks: Best practices.” Computer Communications 33.9 (2010): 1086-1093.
- M. Blaze, G. Bleumer, and M. Strauss, ‘Divertible protocols and atomic prosy cryptography,’ in Proc. EUROCRYPT 1998, Espoo, Finland, May-Jun. 1998, pp. 127-144.
- M. Green and G. Ateniese, “Identity-based proxy re-encryption,” in Proc. ACNS 2007, Zhuhai, China, Jun. 2007, pp. 288-306.
- M. Ion, J. Zhang, and E.M. Schooler, “Toward content-centric privacy in ICN: Attribute-based encryption and routing,” in Proc. ACM SIGCOMM ICN 2013, Hong Kong, China, Aug. 2013, pp. 39-40.
- M. Naor and B. Pinkas “Efficient trace and revoke schemes,” in Proc. FC 2000, Anguilla, British West Indies, Feb. 2000, pp. 1-20.
- M. Nystrom, S. Parkinson, A. Rusch, and M. Scott, “PKCS#12: Personal information exchange syntax v. 1.1,” IETF RFC 7292, K. Moriarty, Ed., Jul. 2014.
- M. Parsa and J.J. Garcia-Luna-Aceves, “A Protocol for Scalable Loop-free Multicast Routing.” IEEE JSAC, Apr. 1997.
- M. Walfish, H. Balakrishnan, and S. Shenker, “Untangling the web from DNS,” in Proc. USENIX NSDI 2004, Oct. 2010, pp. 735-737.
- Mahadevan, Priya, et al. “Orbis: rescaling degree correlations to generate annotated internet topologies.” ACM SIGCOMM Computer Communication Review. vol. 37. No. 4. ACM, 2007.
- Mahadevan, Priya, et al. “Systematic topology analysis and generation using degree correlations.” ACM SIGCOMM Computer Communication Review. vol. 36. No. 4. ACM, 2006.
- Matocha, Jeff, and Tracy Camp. ‘A taxonomy of distributed termination detection algorithms.’ Journal of Systems and Software 43.3 (1998): 207-221.
- Matteo Varvello et al., “Caesar: A Content Router for High Speed Forwarding”, ICN 2012, Second Edition on Information-Centric Networking, New York, Aug. 2012.
- McWilliams, Jennifer A., and Iain S. Walker. “Home Energy Article: A Systems Approach to Retrofitting Residential HVAC Systems.” Lawrence Berkeley National Laboratory (2005).
- Merindol et al., “An efficient algorithm to enable path diversity in link state routing networks”, Jan. 10, Computer Networks 55 (2011), pp. 1132-1140.
- Mobility First Project [online], http://mobilityfirst.winlab.rutgers.edu/, Downloaded Mar. 9, 2015.
- Narasimhan, Sriram, and Lee Brownston. “HyDE—A General Framework for Stochastic and Hybrid Modelbased Diagnosis.” Proc. DX 7 (2007): 162-169.
- NDN Project [online], http://www.named-data.net/, Downloaded Mar. 9, 2015.
- Omar, Mawloud, Yacine Challal, and Abdelmadjid Bouabdallah. “Certification-based trust models in mobile ad hoc networks: A survey and taxonomy.” Journal of Network and Computer Applications 35.1 (2012): 268-286.
- P. Mahadevan, E.Uzun, S. Sevilla, and J. Garcia-Luna-Aceves, “CCN-krs: A key resolution service for ccn,” in Proceedings of the 1st International Conference on Information-centric Networking, Ser. INC 14 New York, NY, USA: ACM, 2014, pp. 97-106. [Online]. Available: http://doi.acm.org/10.1145/2660129.2660154.
- R. H. Deng, J. Weng, S. Liu, and K. Chen. Chosen-Ciphertext Secure Proxy Re-Encryption without Pairings. CANS. Spring Lecture Notes in Computer Science vol. 5339 (2008).
- Rosenberg, J. “Interactive Connectivity Establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal for Offer/Answer Protocols”, Apr. 2010, pp. 1-117.
- S. Chow, J. Weng, Y. Yang, and R. Deng. Efficient Unidirectional Proxy Re-Encryption. Progress in Cryptology—AFRICACRYPT 2010. Springer Berlin Heidelberg (2010).
- S. Deering, “Multicast Routing in Internetworks and Extended LANs,” Proc. ACM SIGCOMM '88, Aug. 1988.
- S. Deering et al., “The PIM architecture for wide-area multicast routing,” IEEE/ACM Trans, on Networking, vol. 4, No. 2, Apr. 1996.
- S. Jahid, P. Mittal, and N. Borisov, “EASiER: Encryption-based access control in social network with efficient revocation,” in Proc. ACM ASIACCS 2011, Hong Kong, China, Mar. 2011, pp. 411-415.
- S. Kamara and K. Lauter, “Cryptographic cloud storage,” in Proc. FC 2010, Tenerife, Canary Islands, Spain, Jan. 2010, pp. 136-149.
- S. Kumar et al. “Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking,” 2008, pp. 556-564.
- S. Misra, R. Tourani, and N.E. Majd, “Secure content delivery in information-centric networks: Design, implementation, and analyses,” in Proc. ACM SIGCOMM ICN 2013, Hong Kong, China, Aug. 2013, pp. 73-78.
- S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving secure, scalable, and fine-grained data access control in cloud computing,” in Proc. IEEE INFOCOM 2010, San Diego, CA, USA, Mar. 2010, pp. 1-9.
- S.J. Lee, M. Gerla, and C. Chiang, “On-demand Multicast Routing Protocol in Multihop Wireless Mobile Networks,” Mobile Networks and Applications, vol. 7, No. 6, 2002.
- Sandvine, Global Internet Phenomena Report—Spring 2012. Located online at http://www.sandvine.com/downloads/ documents/Phenomenal H 2012/Sandvine Global Internet Phenomena Report 1H 2012.pdf.
- Scalable and Adaptive Internet Solutions (SAIL) Project [online], http://sail-project.eu/ Downloaded Mar. 9, 2015.
- Schein, Jeffrey, and Steven T. Bushby. A Simulation Study of a Hierarchical, Rule-Based Method for System-Level Fault Detection and Diagnostics in HVAC Systems. US Department of Commerce,[Technology Administration], National Institute of Standards and Technology, 2005.
- Shani, Guy, Joelle Pineau, and Robert Kaplow. “A survey of point-based POMDP solvers.” Autonomous Agents and Multi-Agent Systems 27.1 (2013): 1-51.
- Sheppard, John W., and Stephyn GW Butcher. “A formal analysis of fault diagnosis with d-matrices.” Journal of Electronic Testing 23.4 (2007): 309-322.
- Shih, Eugene et al., ‘Wake on Wireless: An Event Driven Energy Saving Strategy for Battery Operated Devices’, Sep. 23, 2002, pp. 160-171.
- Shneyderman, Alex et al., ‘Mobile VPN: Delivering Advanced Services in Next Generation Wireless Systems’, Jan. 1, 2003, pp. 3-29.
- Solis, Ignacio, and J. J. Garcia-Luna-Aceves. ‘Robust content dissemination in disrupted environments.’ proceedings of the third ACM workshop on Challenged networks. ACM, 2008.
- Sun, Ying, and Daniel S. Weld. “A framework for model-based repair.” AAAI. 1993.
- T. Ballardie, P. Francis, and J. Crowcroft, “Core Based Trees (CBT),” Proc. ACM SIGCOMM '88, Aug. 1988.
- T. Dierts, “The transport layer security (TLS) protocol version 1.2,” IETF RFC 5246, 2008.
- T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K.H. Kim, S. Shenker, and I. Stoica, ‘A data-oriented (and beyond) network architecture,’ ACM SIGCOMM Computer Communication Review, vol. 37, No. 4, pp. 181-192, Oct. 2007.
- The Despotify Project (2012). Available online at http://despotify.sourceforge.net/.
- V. Goyal, 0. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in Proc. ACM CCS 2006, Alexandria, VA, USA, Oct.-Nov. 2006, pp. 89-98.
- V. Jacobson, D.K. Smetters, J.D. Thornton, M.F. Plass, N.H. Briggs, and R.L. Braynard, ‘Networking named content,’ in Proc. ACM CoNEXT 2009, Rome, Italy, Dec. 2009, pp. 1-12.
- V. K. Adhikari, S. Jain, Y. Chen, and Z.-L. Zhang. Vivisecting Youtube:An Active Measurement Study. In INFOCOM12 Mini-conference (2012).
- Verma, Vandi, Joquin Fernandez, and Reid Simmons. “Probabilistic models for monitoring and fault diagnosis.” The Second IARP and IEEE/RAS Joint Workshop on Technical Challenges for Dependable Robots in Human Environments. Ed. Raja Chatila. Oct. 2002.
- Vijay Kumar Adhikari, Yang Guo, Fang Hao, Matteo Varvello, Volker Hilt, Moritz Steiner, and Zhi-Li Zhang. Unreeling Netflix: Understanding and Improving Multi-CDN Movie Delivery. In the Proceedings of IEEE INFOCOM 2012 (2012).
- Vutukury, Srinivas, and J. J. Garcia-Luna-Aceves. A simple approximation to minimum-delay routing. vol. 29. No. 4. ACM, 1999.
- W.-G. Tzeng and Z.-J. Tzeng, “A public-key traitor tracing scheme with revocation using dynamic shares,” in Proc. PKC 2001, Cheju Island, Korea, Feb. 2001, pp. 207-224.
- Waldvogel, Marcel “Fast Longest Prefix Matching: Algorithms, Analysis, and Applications”, A dissertation submitted to the Swiss Federal Institute of Technology Zurich, 2002.
- Walker, Iain S. Best practices guide for residential HVAC Retrofits. No. LBNL-53592. Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US), 2003.
- Wang, Jiangzhe et al., “DMND: Collecting Data from Mobiles Using Named Data”, Vehicular Networking Conference, 2010 IEEE, pp. 49-56.
- Xylomenos, George, et al. “A survey of information-centric networking research.” Communications Surveys & Tutorials, IEEE 16.2 (2014): 1024-1049.
- Yi, Cheng, et al. ‘A case for stateful forwarding plane.’ Computer Communications 36.7 (2013): 779-791.
- Yi, Cheng, et al. ‘Adaptive forwarding in named data networking.’ ACM SIGCOMM computer communication review 42.3 (2012): 62-67.
- Zahariadis, Theodore, et al. “Trust management in wireless sensor networks.” European Transactions on Telecommunications 21.4 (2010): 386-395.
- Zhang, et al., “Named Data Networking (NDN) Project”, http://www.parc.com/publication/2709/named-data-networking-ndn-project.html, Oct. 2010, NDN-0001, PARC Tech Report.
- Zhang, Lixia, et al. ‘Named data networking.’ ACM SIGCOMM Computer Communication Review 44.3 {2014): 66-73.
- Soh et al., “Efficient Prefix Updates for IP Router Using Lexicographic Ordering and Updateable Address Set”, Jan. 2008, IEEE Transactions on Computers, vol. 57, No. 1.
- Beben et al., “Content Aware Network based on Virtual Infrastructure”, 2012 13th ACIS International Conference on Software Engineering.
- D. Trossen and G. Parisis, “Designing and realizing and information-centric internet,” IEEE Communications Magazing, vol. 50, No. 7, pp. 60-67, Jul. 2012.
- Garcia-Luna-Aceves et al., “Automatic Routing Using Multiple Prefix Labels”, 2012, IEEE, Ad Hoc and Sensor Networking Symposium.
- Gasti, Paolo et al., ‘DoS & DDoS in Named Data Networking’, 2013 22nd International Conference on Computer Communications and Networks (ICCCN), Aug. 2013, pp. 1-7.
- Ishiyama, “On the Effectiveness of Diffusive Content Caching in Content-Centric Networking”, Nov. 5, 2012, IEEE, Information and Telecommunication Technologies (APSITT), 2012 9th Asia-Pacific Symposium.
- J. Hur and D.K. Noh, “Attribute-based access control with efficient revocation in data outsourcing systers,” IEEE Trans. Parallel Distrib. Syst, vol. 22, No. 7, pp. 1214-1221, Jul. 2011.
- J. Lotspiech, S. Nusser, and F. Pestoni. Anonymous Trust: Digital Rights Management using Broadcast Encryption. Proceedings of the IEEE 92.6 (2004).
- Kaya et al., “A Low Power Lookup Technique for Multi-Hashing Network Applications”, 2006 IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures, Mar. 2006.
- S. Kamara and K. Lauter. Cryptographic Cloud Storage. Financial Cryptography and Data Security. Springer Berlin Heidelberg (2010).
- RTMP (2009). Available online at http://wwwimages.adobe.com/www.adobe.com/content/dam/Adobe/en/devnet/rtmp/ pdf/rtmp specification 1.0.pdf.
- Hogue et al., “NLSR: Named-data Link State Routing Protocol”, Aug. 12, 2013, ICN'13.
- Nadeem Javaid, “Analysis and design of quality link metrics for routing protocols in Wireless Networks”, PhD Thesis Defense, Dec. 15, 2010, Universete Paris-Est.
- Wetherall, David, “Active Network vision and reality: Lessons form a capsule-based system”, ACM Symposium on Operating Systems Principles, Dec. 1, 1999. pp. 64-79.
- Kulkarni A.B. et al., “Implementation of a prototype active network”, IEEE, Open Architectures and Network Programming, Apr. 3, 1998, pp. 130-142.
- Lui et al. (A TLV-Structured Data Naming Scheme for Content-Oriented Networking, pp. 5822-5827, International Workshop on the Network of the Future, Communications (ICC), 2012 IEEE International Conference on Jun. 10-15, 2012).
- Peter Dely et al. “OpenFlow for Wireless Mesh Networks” Computer Communications and Networks, 2011 Proceedings of 20th International Conference on, IEEE, Jul. 31, 2011 (Jul. 31, 2011), pp. 1-6.
- Garnepudi Parimala et al “Proactive, reactive and hybrid multicast routing protocols for Wireless Mesh Networks”, 2013 IEEE International Conference on Computational Intelligence and Computing Research, IEEE, Dec. 26, 2013, pp. 1-7.
- Tiancheng Zhuang et al. “Managing Ad Hoc Networks of Smartphones”, International Journal of Information and Education Technology, Oct. 1, 2013.
- Amadeo et al. “Design and Analysis of a Transport-Level Solution for Content-Centric VANETs”, University “Mediterranea” of Reggio Calabria, Jun. 15, 2013.
- 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.
- Ravio 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.
- Xie et al. “Collaborative Forwarding and Caching in Content Centric Networks”, Networking 2012.
- Extended European Search Report and Written Opinion in counterpart European Application No. 16180664.1, dated Nov. 14, 2016, 11 pages.
Type: Grant
Filed: Jul 27, 2015
Date of Patent: Jun 30, 2020
Patent Publication Number: 20170034240
Assignee: Cisco Technology, Inc. (San Jose, CA)
Inventors: Glenn C. Scott (Los Altos, CA), Christopher A. Wood (Newport Beach, CA), Ignacio Solis (Scotts Valey, CA)
Primary Examiner: Luu T Pham
Assistant Examiner: James J Wilcox
Application Number: 14/810,159
International Classification: H04L 29/06 (20060101); H04L 29/08 (20060101); H04L 12/773 (20130101); H04N 21/2343 (20110101);
