System for implementing a small computer systems interface protocol over a content centric network

Information

  • Patent Grant
  • 10547589
  • Patent Number
    10,547,589
  • Date Filed
    Monday, May 9, 2016
    10 years ago
  • Date Issued
    Tuesday, January 28, 2020
    6 years ago
Abstract
One embodiment provides a system that facilitates schematized access control in a content centric network. During operation, the system generates, by a content producing device, a secret key for a user based on a schema, wherein the schema is a regular expression which corresponds to one or more names and allows a user access to content associated with the names, wherein a name is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level. The system receives an interest with a name that corresponds to the schema. The system encrypts a payload of a responsive content object based on the interest name. The system transmits the responsive content object with the encrypted payload to the user, which allows the user to decrypt the encrypted payload with the secret key.
Description
RELATED APPLICATIONS

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”);
    • U.S. patent application Ser. No. 12/338, 175, 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”); and
    • U.S. patent application Ser. No. 14/927,034, entitled “SYSTEM FOR KEY EXCHANGE IN A CONTENT CENTRIC NETWORK,” by inventors Christopher A. Wood, Marc E. Mosko, and Ersin Uzun, filed 29 Oct. 2015 (hereinafter “U.S. patent application Ser. No. 14/927,034”); and


      the disclosures of which are herein incorporated by reference in their entirety.


BACKGROUND

Field


This disclosure is generally related to distribution of digital content. More specifically, this disclosure is related to a system for implementing a Small Computer Systems Interface (SCSI) protocol over a content centric network.


Related Art


The proliferation of the Internet and e-commerce continues to create a vast amount of digital content. Content centric network (CCN) architectures have been designed to facilitate accessing and processing such digital content. A CCN includes entities, or nodes, such as network clients, forwarders (e.g., routers), and content producers, which communicate with each other by sending interest packets for various content items and receiving content object packets in return. CCN interests and content objects are identified by their unique names, which are typically hierarchically structured variable length identifiers (HSVLI). An HSVLI can include contiguous name components ordered from a most general level to a most specific level.


In computer networking, Internet Small Computer Systems Interface (iSCSI) is an Internet Protocol (IP)-based storage networking standard for linking data storage facilities. iSCSI enables two hosts to interface using the SCSI protocol with IP as the transport medium. An end user or application (an “initiator”) can send a request, and the operating system can generate the appropriate SCSI command and data request, which go through encapsulation and, if necessary, encryption. A packet header is added before the resulting IP packets are transmitted over an Ethernet connection. The packet is received by another end host or server (a “target”). The target decrypts the packet (if encrypted), and decapsulates or disassembles the packet, extracting the SCSI command and the data request. The target sends the SCSI command to the SCSI controller and/or to the SCSI storage device. Because iSCSI is bi-directional, the protocol can also be used to return data in response to the original request.


While a CCN brings many desired features to a network, some issues remain unsolved for implementing the SCSI protocol over a content centric network.


SUMMARY

One embodiment provides a system that facilitates implementation of the SCSI protocol over a content centric network. During operation, the system receives, by a target device, a first interest which indicates a first nonce and information associated with a first encapsulated protocol data unit, wherein the first unit indicates a first command to be executed by the target device, wherein a name for an interest is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level. The system extracts the information associated with the first unit to obtain the first command. The system generates a first content object with a payload that includes data received in response to executing the first command, thereby facilitating the use of a SCSI protocol over a content centric network.


In some embodiments, the first command is a SCSI command and is transmitted to a storage device attached to the target device based on the SCSI protocol.


In some embodiments, the first command indicates a request for the target device to pull data from an initiating device based on a first name, and the information associated with the first unit further indicates the first name. The system generates a second interest with the first name. The system indicates in the second interest information associated with a second encapsulated protocol data unit, wherein the second unit indicates a request for data from the initiating device. In response to the second interest, the system receives a second content object that satisfies the second interest and includes a payload with responsive data.


In some embodiments, the first interest indicates the information associated with the first protocol data unit based on: the first protocol data unit being encapsulated and inserted into a payload of the first interest; or the information associated with the first protocol data unit being encoded in the name of the first interest.


In some embodiments, a routable name prefix of the target device is obtained based on one or more of: a catalog of routable name prefixes of target devices maintained by the initiating device; a manifest published by the target device which lists routable name prefixes for the target device and other target devices under the domain of the target device; and a directory of routable name prefixes for the target device and other target devices, wherein the target device and the other target devices publish their respective routable name prefixes to the directory, which is subsequently obtained and read by an initiating device.


In some embodiments, the system authenticates an initiating device. In response to receiving a third interest with a name that indicates an authentication challenge, an identifier of the initiating device, and a second nonce, the system verifies that the initiating device is permitted to access a storage device operated by and attached to the target device. The system generates a third content object which includes a first random challenge variable in a payload of the third content object. The system receives a fourth interest that indicates a first verification value computed by the initiating device. The system computes a first comparison value based on the identifier of the initiating device, the first random challenge variable, and a secret key of the initiating device. In response to determining that the computed first comparison value matches the first verification value, the system generates a fourth content object that indicates an acknowledgment of the fourth interest, thereby authenticating the initiating device.


In some embodiments, the first verification value is computed by the initiating device based on the identifier of the initiating device, the first random challenge variable, and the secret key of the initiating device. The secret key of the initiating device is previously exchanged with the target device based on a key exchange protocol.


In some embodiments, in response to determining that the computed first comparison value does not match the first verification value, the system generates a negative acknowledgment of the fourth interest.


In some embodiments, the payload of the third content object further includes an identifier of the target device, and a payload of the fourth interest includes a second random challenge variable generated by the initiating device. The system authenticates the target device. The system computes a second verification value based on the identifier of the target device, the second random challenge variable, and a secret key of the target device. The system includes the second verification value in a payload of the fourth content object. In response to the initiating device successfully verifying the second verification value, the system receives an acknowledgment of the fourth content object. In response to the initiating device unsuccessfully verifying the second verification value, the system receives a negative acknowledgment of the fourth content object.


In some embodiments, the target device and the initiating device establish a security association based on one or more of: a key exchange protocol; a key exchange protocol based on a content centric network; and a Diffie-Hellman key exchange protocol, wherein information needed for a key exchange protocol is included in a payload of an interest or a content object sent or received by the target device.


Another embodiment provides a system that facilitates implementation of the SCSI protocol over a content centric network. During operation, the system generates, by an initiating device, a first interest which indicates a first nonce and information associated with a first encapsulated protocol data unit, wherein the first unit indicates a first command to be executed by a target device, wherein a name for an interest is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level. In response to the first interest, the system receives first content object with a payload that includes data received in response to the target device executing the first command, thereby facilitating the use of a SCSI protocol over a content centric network.


In some embodiments, the first command indicates a request for the target device to pull data from the initiating device based on a first name, and the information associated with the first unit further indicates the first name. The system receives a second interest with the first name, wherein the second interest indicates information associated with a second encapsulated protocol data unit, wherein the second unit indicates a request for data from the initiating device. The system generates a second content object that satisfies the second interest and includes a payload with responsive data.


In some embodiments, the first interest indicates the information associated with the first protocol data unit based on: encapsulating and inserting the first protocol data unit into a payload of the first interest; or encoding the information associated with the first protocol data unit in the name of the first interest.


In some embodiments, the system obtains a routable name prefix of the target device based on one or more of: maintaining a catalog of routable name prefixes of target devices; a manifest published by the target device which lists routable name prefixes for the target device and other target devices under the domain of the target device; and a directory of routable name prefixes for the target device and other target devices, wherein the target device and the other target devices publish their respective routable name prefixes to the directory, wherein the initiating device obtains the routable name prefix from the directory.


In some embodiments, the system authenticates the initiating device to the target device. The system generates a third interest with a name that indicates an authentication challenge, an identifier of the initiating device, and a second nonce. In response to the target device verifying that the initiating device is permitted to access a storage device operated by and attached to the target device, the system receives a third content object which includes a first random challenge variable in a payload of the third content object. The system computes a first verification value based on the identifier of the initiating device, the first random challenge variable, and a secret key of the initiating device. The system generates a fourth interest that indicates the first verification value. In response to the target device successfully verifying the first verification value, the system receives a fourth content object that indicates an acknowledgment of the fourth interest, thereby authenticating the initiating device.


In some embodiments, in response to the target device unsuccessfully verifying the first verification value, the system receives a negative acknowledgment of the fourth interest.


In some embodiments, the payload of the third content object further includes an identifier of the target device, and a payload of the fourth interest includes a second random challenge variable generated by the initiating device. The system authenticates the target device. The system computes, by the target device, a second verification value based on the identifier of the target device, the second random challenge variable, and a secret key of the target device, wherein the second value is included in a payload of the fourth content object. The system computes, by the initiating device, a second comparison value based on the identifier of the target device, the second random challenge variable, and the secret key of the target device. In response to determining that the computed second comparison value matches the second verification value, the system generates an acknowledgment of the fourth content object. In response to determining that the computed second comparison value does not match the second verification value, the system generates a negative acknowledgment of the fourth content object.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1A illustrates an exemplary environment which facilitates the implementation of the SCSI protocol over a content centric network, in accordance with an embodiment of the present invention.



FIG. 1B illustrates an exemplary environment which facilitates the implementation of the SCSI protocol over a content centric network, in accordance with an embodiment of the present invention.



FIG. 2A illustrates an exemplary communication which facilitates the implementation of the SCSI protocol over a content centric network, including authentication of an initiator, in accordance with an embodiment of the present invention.



FIG. 2B illustrates an exemplary communication which facilitates the implementation of the SCSI protocol over a content centric network, including authentication of a target, in accordance with an embodiment of the present invention.



FIG. 3 illustrates an exemplary communication which facilitates the implementation of the SCSI protocol over a content centric network, including a SCSI command that provides an ACK response, in accordance with an embodiment of the present invention.



FIG. 4 illustrates an exemplary communication which facilitates the implementation of the SCSI protocol over a content centric network, including a SCSI command that is a request from the target to pull data from the initiator, in accordance with an embodiment of the present invention.



FIG. 5A presents a flow chart illustrating a method by an initiator or a client computing device for facilitating the implementation of the SCSI protocol over a content centric network, in accordance with an embodiment of the present invention.



FIG. 5B presents a flow chart illustrating a method by an initiator or a client computing device for authenticating a target device, in accordance with an embodiment of the present invention.



FIG. 6A presents a flow chart illustrating a method by a target or a content producing device for facilitating the implementation of the SCSI protocol over a content centric network, in accordance with an embodiment of the present invention.



FIG. 6B presents a flow chart illustrating a method by a target or a content producing device for facilitating the implementation of the SCSI protocol over a content centric network, in accordance with an embodiment of the present invention.



FIG. 6C presents a flow chart illustrating a method by a target or a content producing device for authenticating the target device to an initiating device, in accordance with an embodiment of the present invention.



FIG. 7 illustrates an exemplary computer system that facilitates the implementation of the SCSI protocol over a content centric network, in accordance with an embodiment of the present invention.





In the figures, like reference numerals refer to the same figure elements.


DETAILED DESCRIPTION

The following description is presented to enable any person skilled in the art to make and use the embodiments, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present disclosure. Thus, the present invention is not limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.


Overview


Embodiments of the present invention provide a system that facilitates the implementation of the SCSI protocol over a content centric network, by encapsulating PDUs in interest payloads or by encoding interest names with PDU data. In a current implementation of the SCSI protocol over the Internet (i.e., iSCSI), an iSCSI “initiator” requests data to be read or written to a storage attached to or operated by an iSCSI “target.” The iSCSI initiator converts the SCSI commands to iSCSI commands (e.g., encapsulates the SCSI commands in an IP packet), which are then sent to an IP Storage Area Network. Upon receiving the IP packet with the encapsulated SCSI commands, the target disassembles (e.g., decapsulates) the packet, and issues the SCSI commands to the storage.


In embodiments of the present invention, the system facilitates the implementation of the SCSI protocol over a CCN. In CCN, a device can be identified by its routable name prefix, and all interest-based communication relies on the routable name prefix to ensure that an interest will reach the intended target device (or “target”). Thus, an initiating device (or “initiator) must discover the routable name prefix of the target. The initiator can obtain the routable name prefix of the device by maintaining a catalog of routable name prefixes of target devices. In addition, the target device may publish a manifest which lists routable name prefixes for the target device and other target devices under the domain of the target device. Furthermore, the target device (and other target devices) can publish its routable name prefix to a directory, and the initiator may obtain the routable name prefixes for a respective target from the directory.


After determining the routable name prefix for the target, the initiator and the target can establish a session based on an authentication process and negotiation of a security association. The initiator can authenticate itself to the target (as described below in relation to FIG. 2A), and the target can authenticate itself to the initiator (as described below in relation to FIG. 2B), by exchanging authentication messages. In addition, during the authentication process, the initiator and the target can establish a security association similar to IPSec so that future data or commands sent between the initiator and the target may be encrypted and authenticated. The negotiation of the security association may be mixed with the authentication protocol using, e.g., a standard Diffie-Hellman (DH) key exchange. Specifically, the initiator and the target can exchange DH pairs derived from an agreed-upon set of DH group parameters during the exchange of the authentication messages. Each DH pair is authenticated using information specific to the initiator or the target. For example, the DH pair of the initiator can be authenticated using a symmetric key message authentication code (MAC), where the target is the only party with the corresponding verification key, or with a public-key digital signature. This information may be included in the payload of an interest or content object, e.g., during the exchange of the authentication messages. After each host is authenticated (using shared secrets or a PKI-based technique), the shared DH secret can be used to derive a symmetric key, which can be used to encrypt subsequent interests and content objects. An example of a key exchange protocol for CCN is described in U.S. patent application Ser. No. 14/927,034.


After the session and the security association are established, the initiator and the target may begin exchanging SCSI commands. SCSI commands and responses (i.e., protocol data units or PDUs) may be transferred in interests by encapsulating a PDU and inserting the encapsulated PDU into an interest payload, or by encoding the PDU data in the name of an interest. Furthermore, all PDU data, including the command information (i.e., the Command Descriptor Block) and response (e.g., the data) can be encrypted based on an authenticated encryption protocol, such as AES-GCM, using the symmetric key previously agreed upon during the negotiation of the security association.


In embodiments of the present invention, the participating devices can encapsulate the full range of SCSI commands, including: SCSI and task management function requests and responses (encoded in interests and content objects, respectively); SCSI data in and out commands (encoded in chunked interests and content objects, respectively); SCSI request to transfer (R2T) (encoded in an interest and a content object, but initiated from the target, where the R2T name prefix is established or agreed upon during the session negotiation stage of the protocol); and SCSI text, login, logout, and no-op (heartbeat) request and response (encoded in interests and content objects, respectively).


Thus, embodiments of the present invention allow an initiating device to discover a target device, establish a session via an authentication process, negotiate security parameters, and exchange SCSI commands over a content centric network. Hence, embodiments of the present invention result in increased efficiency in a network, specifically, in the communications or exchange of SCSI commands and data between an initiating device and a target device.


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 (or “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. The HSVLI can also include contiguous name components ordered from a most general level to a most specific level.


In some embodiments, the name can include an 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, which is herein incorporated by reference. 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 (or “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/NDN routers can propagate toward a storage device (e.g., a cache server) or a data producer that can provide the requested data to satisfy the request or Interest.


The methods disclosed herein are not limited to CCN networks and are applicable to other architectures as well. A description of a CCN architecture is described in U.S. patent application Ser. No. 12/338,175, which is herein incorporated by reference.


Exemplary Network and Communication



FIG. 1 illustrates an exemplary environment 100 which facilitates the implementation of the SCSI protocol over a content centric network, in accordance with an embodiment of the present invention. Environment 100 can include a consumer, client, or content requesting device 116 (e.g., an initiating device or initiator), a network 101 which can be a content centric network, and a producer or content producing device 118 (e.g., a target device or target). Network 101 can include a router or other forwarding device at nodes 102, 104, 106, 108, 110, 112, and 114. A node can be a computer system, an end-point representing users, and/or a device that can generate interests or originate content. A node can also be an edge router (e.g., CCN nodes 102, 104, 112, and 114) or a core router (e.g., intermediate CCN routers 106, 108, and 110). Initiator 116 and target 118 can communicate with network 101 based on Ethernet protocols 122 and 124, respectively. Target 118 can be attached to or have access to a SCSI attached storage device 120. Target 118 can communicate with device 120 based on a SCSI protocol 126.


Initiator 116 can authenticate itself to target 116, as described below in relation to FIG. 2A, via two data exchanges between initiator 116 and target 118. For example, in the first data exchange, initiator 116 can send an interest 130 and receive a responsive content object 132. The second data exchange can include data packets that travel on the same path as interest 130 and content object 132. Note that target 118 can also authenticate itself to initiator 116. This can occur in the same two data exchanges described above, with one additional data packet sent to target 118, as described below in relation to FIG. 2B.



FIG. 1B illustrates exemplary environment 100 which facilitates the implementation of the SCSI protocol over a content centric network, in accordance with an embodiment of the present invention. After initiator 116 and target 118 have authenticated each other, as described in relation to FIGS. 2A and 2B, they may begin exchanging SCSI commands and data. During operation, initiator 116 can generate an interest which indicates information associated with a first encapsulated protocol data unit (PDU). For example, initiator 116 can indicate the information by generating an interest 150 with a name 150.1 of “/target/prefix” and an encapsulated PDU 150.2 of “<PDU data>.” Alternatively, initiator 116 can indicate the information by encoding the PDU data in the interest name. For example, initiator 116 can generate an interest 151 with a name 151.1 of “/target/prefix/<PDU data>.” Interest 150 (or 151) can travel through network 101 via nodes 102, 110 and 112, before reaching target 118. Upon receiving interest 150 (or 151), target 118 can obtain or extract the PDU data by, e.g., decapsulating encapsulated PDU 150.2 of interest 150 (or decoding the PDU data in name 151.1 of interest 151). The PDU data can include a SCSI command 140. Target 118 can transmit SCSI command 140 via SCSI protocol 126 to storage device 120. In response to receiving data from device 120, target 118 can generate a content object 152 with a name 152.1 of “/target/prefix” (or, in response to interest 151, with a name 151.1 of “/target/prefix/<PDU data>”), and an encapsulated PDU 152.2 or a payload 152.3 of “<Payload or PDU data>.” Target 118 can send content object 152 to initiator 116 on a reverse path (e.g., via nodes 112, 110, and 102). Upon receiving content object 152, initiator 116 can obtain or extract the PDU data by, e.g., decapsulating encapsulated PDU 152.2 (or reading payload data 152.3). Exemplary communications between an initiator and a target are described below in relation to FIGS. 3 and 4.


Thus, embodiments of the present invention provide a system that implements the SCSI protocol over a content centric network. This results in a more efficient network for access to and distribution of data over a network.


Exemplary Authentication Between a Client Device and a Producer



FIG. 2A illustrates an exemplary communication 200 which facilitates the implementation of the SCSI protocol over a content centric network, including authentication of an initiator, in accordance with an embodiment of the present invention. An initiator 202 can have an identifier of “A-ID,” and a target 204 can have a routable name prefix of “/B_prefix.” Target 204 can operate a storage device or medium (not shown) via the SCSI protocol. Initiator 202 can generate an interest 210 with a name that includes the routable prefix of target 204, a command which indicates an authentication challenge, the identifier of initiator 202, and a random nonce used to ensure that the interest does not hit a cache, such as: “/B_prefix/cmd=challenge/user=A-ID/<nonce1>.” Upon receiving interest 210, target 204 can verify that initiator 202 is allowed or permitted to access the storage device or medium operated by target 204 (function 212). Target 204 can compute a first random challenge variable, “r1”, and return a content object 214 with the first challenge variable r1 in the payload of content object 214.


Upon receiving content object 214, initiator 202 can verify content object 214 (function 216), and compute a first verification value based on the identifier of initiator 202, the first challenge variable, and a secret key of initiator 202 (“SKA”) (function 218), yielding “y.” Initiator 202 can generate an interest 218 with a name that includes the first verification value y, such as: “/B_prefix/cmd=response/user=A-ID/val=y.” In some embodiments, initiator 202 can append a random nonce (e.g., “<nonce2>”).


Upon receiving interest 218, target 204 can compute a first comparison value based on the identifier of initiator 202, the first challenge variable r1, and the secret key SKA of initiator 202 (function 220), yielding “y′.” Note that the secret key SKA of the initiator is previously exchanged with the target device based on a key exchange protocol. Target 204 can verify the computed first comparison value y′ by determining whether the first comparison value y′ matches the first verification value y (function 222). If it does, target 204 can generate a content object 224 that indicates an acknowledgment (“ACK”) of interest 218, thus successfully authenticating initiator 202 to target 204. If y′ does not match y, target 204 can generate a content object 226 that indicates a negative ACK (“NACK”) of interest 218 (shown by the dashed line), which indicates an unsuccessful authentication of initiator 202 to target 204.


Communication 200 can be extended to authenticate target 204 to initiator 202. FIG. 2B illustrates an exemplary communication 250 which facilitates the implementation of the SCSI protocol over a content centric network, including authentication of a target, in accordance with an embodiment of the present invention. Communication 250 corresponds to communication 200, with the differences shown in bold. In addition to including the first challenge variable r1 in the payload of content object 214, target 204 can also include in the payload of content object 214 the identifier of target 204 (e.g., “B-ID”). Initiator 202 can also compute and include a second random challenge variable “r2” in the payload of interest 218. If target 204 successfully verifies initiator 202 (i.e., y′ matches y, and target 204 sends an ACK in content object 224), target 204 can include a similarly computed second verification value based on the identifier of target 204, the second challenge variable r2, and a secret key of target 204 (“SKB”) (function 223), which yields “y2.” Target 204 can include y2 in the payload of content object 224.


Subsequently, upon receiving content object 224, initiator 202 can compute a second comparison value based on the identifier of target 204, the second challenge variable r2, and the secret key SKB of target 202 (function 228), yielding “y2′.” Note that the secret key SKB of the target is previously exchanged with the initiator based on a key exchange protocol. Initiator 202 can then verify the computed second comparison value y2 ′ by determining whether the second comparison value y 2′ matches the second verification value y2 (function 230). If it does, initiator 202 can generate an interest 232 that indicates an ACK of content object 224, thus successfully authenticating target 204 to initiator 202. If y2′ does not match y2, initiator 202 can generate an interest 234 that indicates a NACK of content object 224 (shown by the dashed line), which indicates an unsuccessful authentication of target 204 to initiator 202.


Exemplary Communication Via SCSI Between an Initiator and a Target


After the session and the security association are established, the initiator and the target may begin exchanging SCSI commands. Some SCSI commands are simple queries which provide a form of an ACK response, while other SCSI commands send or push data from the initiator to the target. The data may be inserted in the payload of an interest message, as described below in relation to FIG. 3. An initiator may also request for a target to pull data from the initiator, by issuing a command (such as a “write” command) and providing the name of a subsequent interest that the target can use to request the data for the command, as described below in relation to FIG. 4



FIG. 3 illustrates an exemplary communication 300 which facilitates the implementation of the SCSI protocol over a content centric network, including a SCSI command that provides an ACK response, in accordance with an embodiment of the present invention. During operation, initiator 202 can generate an interest 310 with a name of “B_prefix” and an encapsulated PDU which indicates a command to, e.g., write data (“cmd=data”), and the data to be written (“data=<data>”). Target 204 can extract or obtain the SCSI command and the corresponding data from the encapsulated PDU, and execute the SCSI command by sending the data to the appropriate storage device (function 312), as described in relation to SCSI command 140 of FIG. 1B. Subsequently, target 204 can generate a content object 314 with a name of “/B_prefix” and a payload of “xyz,” which can indicate an ACK or additional information. In some embodiments, target 204 can extract or obtain the SCSI command and the corresponding data from the encoded name of a received interest, as described in relation to interest 151 of FIG. 1B.



FIG. 4 illustrates an exemplary communication 400 which facilitates the implementation of the SCSI protocol over a content centric network, including a SCSI command that is a request from the target to pull data from the initiator, in accordance with an embodiment of the present invention. During operation, initiator 202 can generate an interest 410 with a name of “/B_Prefix” and an encapsulated PDU which indicates a command to, e.g., write data (“cmd=data”), and the interest name that the target can use to request the data for the command (“data=/A_prefix/pull/name”). Upon receiving interest 410 and verifying initiator 202, target 204 can extract or decapsulate the PDU of interest 410 (e.g., by obtaining and executing the command) (function 412)). Target 204 can return a content object 414 with a name of “/B_prefix” and a payload that indicates an ACK. Target 204 can also generate an interest 416 with a name that is the interest name provided in the decapsulated or extracted PDU of interest 410: “/A_prefix/pull/name.” Interest 416 can include an encapsulated PDU which indicates a command to, e.g., read data (“cmd=data”), and a data field with a no value (“data=nil”). Upon receiving interest 416, initiator 202 can obtain and execute the SCSI command (function 418). Initiator 202 can return a content object 420 with a name of “/A_prefix/pull/name” and a payload with the data (e.g., “xyz”) that target 204 can write to the appropriate SCSI storage device operated by target 204. Note that content object 414, which indicates the ACK of interest 410, may be transmitted to initiator 202 any time after interest 410 is received and verified by target 204. For example, target 204 may transmit content object 414 to initiator 202 after transmitting interest 416 or after receiving content object 420.


Initiating Device Facilitates SCSI Over CCN



FIG. 5A presents a flow chart illustrating a method 500 by an initiator or a client computing device for facilitating the implementation of the SCSI protocol over a content centric network, in accordance with an embodiment of the present invention. During operation, the system obtains, by an initiating device or an initiator, a routable name prefix of a target device, wherein the target device transmits commands to an attached storage device based on the SCSI protocol (operation 502). The system authenticates the initiating device to the target device (operation 504, as described in relation to FIG. 2A). The system also authenticates the target device (operation 506, as described in relation to FIGS. 2B and 5B). The system establishes a security association between the initiating device and the target device, which allows encryption and decryption of payloads in subsequent interests and content objects (operation 508). The system generates a first interest which indicates information associated with a first encapsulated protocol data unit (PDU) (operation 510). The first encapsulated PDU indicates a first command to be executed by the target device, and the first interest further indicates a first nonce. The first command can be a SCSI command and can be transmitted to a storage device attached to the target device based on the SCSI protocol.


The first command can be a push of data or a SCSI command that provides some form of an ACK response, as described in relation to FIG. 3. In response to the first interest, the system receives a content object with a payload that includes data received in response to the target device executing the command (or a content object that indicates a NACK) (operation 512). Alternatively, the first command can be a request to pull data, as described in relation to FIG. 4. The system receives a second interest with the first name, wherein the second interest indicates information associated with a second encapsulated protocol data unit (PDU) (operation 514). The second encapsulated PDU indicates a request for data from the initiating device, and the first name is the name of a subsequent interest that the target is to use to request the data from the initiating device. The system generates a first content object that satisfies the second interest and includes a payload with responsive data (operation 516).



FIG. 5B presents a flow chart 520 illustrating a method by an initiator or a client computing device for authenticating a target device, in accordance with an embodiment of the present invention. During operation, the system generates, by the initiating device, a third interest with a name that indicates an authorization challenge, an identifier of the initiating device, and a second nonce (operation 522). The system determines whether the initiating device is verified by the target device (decision 524). If it is not, the initiating device receives a negative ACK of the third interest (operation 526), and the operation returns.


If the initiating device is verified by the target device, the initiating device receives a third content object which includes a first random challenge variable in a payload of the third content object (operation 528). The initiating device computes a first verification value based on the identifier of the initiating device, the first random challenge variable, and a secret key of the initiating device (operation 530). The system generates a fourth interest with a name that indicates the first verification value (operation 532). The system determines whether the first verification value is verified by the target device (decision 534). If it is not, the initiating device receives a NACK of the fourth interest (operation 536), and the operation returns.


If the first verification value is verified by the target device, the initiating device receives a fourth content object that indicates an ACK of the fourth interest, thereby authenticating the initiating device to the target (operation 538).


Target Device Facilitates SCSI Over CCN



FIG. 6A presents a flow chart 600 illustrating a method by a target or a content producing device for facilitating the implementation of the SCSI protocol over a content centric network, in accordance with an embodiment of the present invention. During operation, the system provides, by a target device or a target, a routable name prefix of the target device, wherein the target device transmits commands to an attached storage device based on the SCSI protocol, and wherein an initiating device can obtain the routable name prefix (operation 502). The system authenticates the initiating device (operation 604, as described herein in relation to FIGS. 2A and 6C). The system also authenticates the target device to the initiating device (operation 606, as described herein in relation to FIG. 2B). The system establishes a security association between the initiating device and the target device, which allows encryption and decryption of payloads in subsequent interests and content objects (operation 608). The system receives, from the initiating device, a first interest which indicates information associated with a first encapsulated protocol data unit (PDU) (operation 610). The first encapsulated PDU indicates a first command to be executed by the target device, and the first interest further indicates a first nonce. The first command can be a SCSI command and can be transmitted to a storage device attached to the target device based on the SCSI protocol. The target device extracts the information associated with the first unit to obtain the first command (operation 612). The operation continues as described at Label A of FIG. 6B.



FIG. 6B presents a flow chart 620 illustrating a method by a target or a content producing device for facilitating the implementation of the SCSI protocol over a content centric network, in accordance with an embodiment of the present invention. The target device executes the first command (operation 622). The first command can be a push of data or a SCSI command that provides some form of an ACK response, as described in relation to FIG. 3. The system transmits the first command to the attached storage device based on the SCSI protocol (operation 624). The system generates a content object with a payload that includes data received in response to the target device executing the command (or a content object that indicates a NACK) (operation 626). Alternatively, the first command can be a request to pull data, as described in relation to FIG. 4. The target device generates a second interest with a first name, wherein the first name is indicated in the first encapsulated PDU and is the name of a subsequent interest that the target is to use to request data from the initiating device (operation 628). The target device indicates in the second interest information associated with a second encapsulated PDU (operation 630). The second encapsulated PDU indicates a request for data from the initiating device. In response to the second interest, the system receives a second content object that satisfies the second interest and includes a payload with responsive data (operation 632).



FIG. 6C presents a flow chart 640 illustrating a method by a target or a content producing device for authenticating the target device to an initiating device, in accordance with an embodiment of the present invention. During operation, the system receives, by the target device, a third interest with a name that indicates an authorization challenge, an identifier of the initiating device, and a second nonce (operation 642). The system determines whether the initiating device is verified by the target device (decision 644). If it is not, the target device generates a NACK of the third interest (operation 646), and the operation returns.


If the initiating device is verified by the target device, the target device generates a third content object which includes a first random challenge variable in a payload of the third content object (operation 648). The target device receives a fourth interest with a name that indicates a first verification value computed by the initiating device (operation 650). The first verification value is computed by the initiating device based on the identifier of the initiating device, the first random challenge variable, and a secret key of the initiating device. The target device computes a first comparison value based on the identifier of the initiating device, the first random challenge variable, and the secret key of the initiating device (operation 652).


The system determines whether the first comparison value is verified by the target device (decision 654). If it is not, the target device generates a NACK of the fourth interest (operation 656), and the operation returns. If the first comparison value is verified by the target device, the target device generates a fourth content object that indicates an ACK of the fourth interest, thereby authenticating the initiating device to the target device (operation 658).


Exemplary Computer System



FIG. 7 illustrates an exemplary computer system 700 that facilitates routable prefix queries in a content centric network, in accordance with an embodiment of the present invention. Computer system 702 includes a processor 704, a memory 706, and a storage device 708. Memory 706 can include a volatile memory (e.g., RAM) that serves as a managed memory, and can be used to store one or more memory pools. Furthermore, computer system 702 can be coupled to a display device 710, a keyboard 712, and a pointing device 714. Storage device 708 can store an operating system 716, a content-processing system 718, and data 732.


Content-processing system 718 can include instructions, which when executed by computer system 702, can cause computer system 702 to perform methods and/or processes described in this disclosure. Specifically, content-processing system 718 may include instructions for sending and/or receiving data packets to/from other network nodes across a computer network, such as a content centric network (communication module 720). A data packet can include an interest packet or a content object packet with a name which is an HSVLI that includes contiguous name components ordered from a most general level to a most specific level. A data packet can also include a command, a SCSI command, SCSI data, a PDU, or an encapsulated PDU.


Furthermore, content-processing system 718 can include instructions for receiving, by a target device, a first interest which indicates a first nonce and information associated with a first encapsulated protocol data unit, wherein the first unit indicates a first command to be executed by the target device (communication module 720). Content-processing system 718 can include instructions for extracting the information associated with the first unit to obtain the first command (decapsulating module 722). Content-processing system 718 can also include instructions for generating a first content object with a payload that includes data received in response to executing the first command (packet-generating module 724).


Content-processing system 718 can additionally include instructions for generating a second interest with the first name, and indicating in the second interest information associated with a second encapsulated protocol data unit, wherein the second unit indicates a request for data from the initiating device (packet-generating module 724). Content-processing system 718 can include instructions for, in response to the second interest, receiving a second content object that satisfies the second interest and includes a payload with responsive data (communication module 720). Content-processing system 718 can also include instructions for authenticating an initiating device to a target device, and authenticating the target device to the initiating device (security module 726).


Content-processing system 718 can further include instructions for generating, by an initiating device, a first interest which indicates a first nonce and information associated with a first encapsulated protocol data unit, wherein the first unit indicates a first command to be executed by a target device (packet-generating module 724). Content-processing system 718 can include instructions for, in response to the first interest, receiving a first content object with a payload that includes data received in response to the target device executing the first command (communication module 720).


Content-processing system 718 can also include instructions for receiving a second interest with the first name, wherein the second interest indicates information associated with a second encapsulated protocol data unit, wherein the second unit indicates a request for data from the initiating device (communication module 720). Content-processing system 718 can include instructions for generating a second content object that satisfies the second interest and includes a payload with responsive data (packet-generating module 724).


Furthermore, content-processing system 718 can include instructions for encapsulating and inserting the first protocol data unit into a payload of the first interest, or encoding the information associated with the first protocol data unit in the name of the first interest (encapsulating module 728). Content-processing system 718 can include instructions for obtaining a routable name prefix of the target device based on one or more of: maintaining a catalog of routable name prefixes of target devices; a manifest published by the target device which lists routable name prefixes for the target device and other target devices under the domain of the target device; and a directory of routable name prefixes for the target device and other target devices, wherein the target device and the other target devices publish their respective routable name prefixes to the directory, wherein the initiating device obtains the routable name prefix from the directory (prefix-discovering module 730).


Data 732 can include any data that is required as input or that is generated as output by the methods and/or processes described in this disclosure. Specifically, data 732 can store at least: an interest; a content object; a nonce; a PDU; an encapsulated PDU; a command; a SCSI command; information associated with a PDU or an encapsulated PDU; a name for an interest or a content object; a name that is an HSVLI; a key; information to implement a SCSI protocol over a CCN; an ACK; a NACK; a request for a target device to pull data from an initiating device based on a name; a payload; an encapsulated PDU in an interest payload; a name with PDU data encoded in the name; a routable name prefix; a catalog, manifest, or directory of routable name prefixes; an authentication challenge; an identifier of an initiating device or a target device; a random challenge variable; a verification value; a comparison value; and information needed for or obtained as a result of a key exchange protocol.


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. For example, the hardware modules can include, but are not limited to, application-specific integrated circuit (ASIC) chips, field-programmable gate arrays (FPGAs), and other programmable-logic devices now known or later developed. When the hardware modules are activated, the hardware modules perform the methods and processes included within the hardware modules.


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, comprising: a processor; anda storage device storing instructions that when executed by the processor cause the processor to perform a method, the method comprising:receiving, by a target device from an initiating device, a first interest which includes a name and information associated with a first protocol data unit that indicates a first command, of a small computer system interface protocol, to be executed by the target device to pull data from storage attached to the target device based on a first name, wherein the name includes a name prefix of the target device;extracting the information to obtain the first command;generating a first content object with a payload that includes data received in response to executing the first command, thereby facilitating use of the small computer system interface protocol over a content centric network;generating a second interest with the first name and that indicates a request for the data and, in response to the second interest, receiving a second content object with the data; andin response to receiving a third interest that includes an identifier of the initiating device and indicates an authentication challenge, authenticating the initiating device to the target device based on the identifier, wherein the authenticating includes generating an acknowledgement indicating results of the authenticating.
  • 2. The computer system of claim 1, wherein the first command is transmitted to the storage based on the small computer system interface protocol.
  • 3. The computer system of claim 1, wherein the first interest indicates the information associated with the first protocol data unit based on: the first protocol data unit being encapsulated and inserted into a payload of the first interest; orthe information associated with the first protocol data unit being encoded in the name of the first interest.
  • 4. The computer system of claim 1, wherein a routable name prefix of the target device is obtained based on one or more of: a catalog of routable name prefixes of target devices maintained by the initiating device;a manifest published by the target device which lists routable name prefixes for the target device and other target devices under a domain of the target device; anda directory of routable name prefixes for the target device and other target devices, wherein the target device and the other target devices publish their respective routable name prefixes to the directory, which is subsequently obtained and read by the initiating device.
  • 5. The computer system of claim 1, wherein the authenticating further includes: verifying that the initiating device is permitted to access the storage;generating a third content object which includes a first random challenge variable in a payload of the third content object;receiving a fourth interest that indicates a first verification value computed by the initiating device;computing a first comparison value based on the identifier of the initiating device, the first random challenge variable, and a secret key of the initiating device; andin response to determining that the computed first comparison value matches the first verification value, generating, as the acknowledgement indicating the results of the authenticating, a fourth content object that indicates an acknowledgment of the fourth interest, thereby authenticating the initiating device.
  • 6. The computer system of claim 5, wherein the first verification value is computed by the initiating device based on the identifier of the initiating device, the first random challenge variable, and the secret key of the initiating device, wherein the secret key of the initiating device is previously exchanged with the target device based on a key exchange protocol.
  • 7. The computer system of claim 5, wherein the authenticating further comprises: in response to determining that the computed first comparison value does not match the first verification value, generating, as the acknowledgement indicating the results of the authenticating, a negative acknowledgment of the fourth interest.
  • 8. The computer system of claim 5, wherein the payload of the third content object further includes an identifier of the target device, wherein a payload of the fourth interest includes a second random challenge variable generated by the initiating device, wherein the method further comprises authenticating the target device, which involves: computing a second verification value based on the identifier of the target device, the second random challenge variable, and a secret key of the target device;including the second verification value in a payload of the fourth content objectin response to the initiating device successfully verifying the second verification value, receiving an acknowledgment of the fourth content object; andin response to the initiating device unsuccessfully verifying the second verification value, receiving a negative acknowledgment of the fourth content object.
  • 9. The computer system of claim 5, wherein the target device and the initiating device establish a security association based on one or more of: a key exchange protocol;a key exchange protocol based on the content centric network; anda Diffie-Hellman key exchange protocol,wherein information needed for a key exchange protocol is included in a payload of an interest or a content object sent or received by the target device.
  • 10. A computer system, comprising: a processor; anda storage device storing instructions that when executed by the processor cause the processor to perform a method, the method comprising: generating, by an initiating device, a first interest which includes a name and information associated with a first protocol data unit that indicates a first command, of a small computer system interface protocol, to be executed by a target device to pull data from storage attached to the target device based on a first name, wherein the name includes a name prefix of the target device;in response to the first interest, receiving a first content object with a payload that includes data received in response to the target device executing the first command, thereby facilitating use of the small computer system interface protocol over a content centric network;receiving a second interest with the first name and that indicates a request for the data and, in response to the second interest, generating a second content object with the data; andin response to generating a third interest that includes an identifier of the initiating device and indicates an authentication challenge, authenticating the initiating device to the target device based on the identifier, wherein the authenticating includes receiving an acknowledgement indicating results of the authenticating.
  • 11. The computer system of claim 10, wherein the first command is transmitted to the storage based on the small computer system interface protocol.
  • 12. The computer system of claim 10, wherein the first interest indicates the information associated with the first protocol data unit based on: encapsulating and inserting the first protocol data unit into a payload of the first interest; orencoding the information associated with the first protocol data unit in the name of the first interest.
  • 13. The computer system of claim 10, where the method further comprises obtaining a routable name prefix of the target device based on one or more of: maintaining a catalog of routable name prefixes of target devices;a manifest published by the target device which lists routable name prefixes for the target device and other target devices under a domain of the target device; anda directory of routable name prefixes for the target device and other target devices, wherein the target device and the other target devices publish their respective routable name prefixes to the directory, wherein the initiating device obtains the routable name prefix from the directory.
  • 14. The computer system of claim 10, wherein the authenticating further includes: in response to the target device verifying that the initiating device is permitted to access the, receiving a third content object which includes a first random challenge variable in a payload of the third content object;computing a first verification value based on the identifier of the initiating device, the first random challenge variable, and a secret key of the initiating device;generating a fourth interest that indicates the first verification value; andin response to the target device successfully verifying the first verification value, receiving, as the acknowledgement indicating the results of the authenticating, a fourth content object that indicates an acknowledgment of the fourth interest, thereby authenticating the initiating device.
  • 15. The computer system of claim 14, wherein the target device successfully verifying the first verification value involves: computing, by the target device, a first comparison value based on the identifier of the initiating device, the first random challenge variable, and the secret key of the initiating device; anddetermining that the computed first comparison value matches the first verification value,wherein the secret key of the initiating device is previously exchanged with the target device based on a key exchange protocol.
  • 16. The computer system of claim 14, wherein the authenticating further comprises: in response to the target device unsuccessfully verifying the first verification value, receiving, as the acknowledgement indicating the results of the authenticating, a negative acknowledgment of the fourth interest.
  • 17. The computer system of claim 14, wherein the payload of the third content object further includes an identifier of the target device, wherein a payload of the fourth interest includes a second random challenge variable generated by the initiating device, wherein the method further comprises authenticating the target device, which involves: computing, by the target device, a second verification value based on the identifier of the target device, the second random challenge variable, and a secret key of the target device, wherein the second verification value is included in a payload of the fourth content object;computing, by the initiating device, a second comparison value based on the identifier of the target device, the second random challenge variable, and the secret key of the target device;in response to determining that the computed second comparison value matches the second verification value, generating an acknowledgment of the fourth content object; andin response to determining that the computed second comparison value does not match the second verification value, generating a negative acknowledgment of the fourth content object.
  • 18. The computer system of claim 14, wherein the target device and the initiating device establish a security association based on one or more of: a key exchange protocol;a key exchange protocol based on the content centric network; anda Diffie-Hellman key exchange protocol,wherein information needed for a key exchange protocol is included in a payload of an interest or a content object sent or received by the target device.
  • 19. A method, comprising: at a target device including a processor and a storage device, performing:receiving from an initiating device a first interest which includes a name and information associated with a first protocol data unit that indicates a first command, of a small computer system interface protocol, to be executed by the target device to pull data from storage attached to the target device based on a first name, wherein the name includes a name prefix of the target device;extracting the information to obtain the first command;generating a first content object with a payload that includes data received in response to executing the first command, thereby facilitating use of the small computer system interface protocol over a content centric network;generating a second interest with the first name and that indicates a request for the data and, in response to the second interest, receiving a second content object with the data; andin response to receiving a third interest that includes an identifier of the initiating device and indicates an authentication challenge, authenticating the initiating device to the target device based on the identifier, wherein the authenticating includes generating an acknowledgement indicating results of the authenticating.
  • 20. The method of claim 19, wherein the first command is transmitted to the storage based on the small computer system interface protocol.
US Referenced Citations (542)
Number Name Date Kind
817441 Niesz Apr 1906 A
4309569 Merkle Jan 1982 A
4921898 Lenney May 1990 A
5070134 Oyamada Dec 1991 A
5110856 Oyamada May 1992 A
5214702 Fischer May 1993 A
5377354 Scannell Dec 1994 A
5506844 Rao Apr 1996 A
5629370 Freidzon May 1997 A
5845207 Amin Dec 1998 A
5870605 Bracho Feb 1999 A
6052683 Irwin Apr 2000 A
6085320 Kaliski, Jr. Jul 2000 A
6091724 Chandra Jul 2000 A
6173364 Zenchelsky Jan 2001 B1
6226618 Downs May 2001 B1
6233617 Rothwein May 2001 B1
6233646 Hahm May 2001 B1
6332158 Risley Dec 2001 B1
6366988 Skiba Apr 2002 B1
6574377 Cahill Jun 2003 B1
6654792 Verma Nov 2003 B1
6667957 Corson Dec 2003 B1
6681220 Kaplan Jan 2004 B1
6681326 Son Jan 2004 B2
6732273 Byers May 2004 B1
6769066 Botros Jul 2004 B1
6772333 Brendel Aug 2004 B1
6775258 vanValkenburg Aug 2004 B1
6862280 Bertagna Mar 2005 B1
6901452 Bertagna May 2005 B1
6917985 Madruga Jul 2005 B2
6957228 Graser Oct 2005 B1
6968393 Chen Nov 2005 B1
6981029 Menditto Dec 2005 B1
7013389 Srivastava Mar 2006 B1
7031308 Garcia-Luna-Aceves Apr 2006 B2
7043637 Bolosky May 2006 B2
7061877 Gummalla Jun 2006 B1
7080073 Jiang Jul 2006 B1
7152094 Jannu Dec 2006 B1
7177646 ONeill Feb 2007 B2
7206860 Murakami Apr 2007 B2
7206861 Callon Apr 2007 B1
7210326 Kawamoto May 2007 B2
7246159 Aggarwal Jul 2007 B2
7257837 Xu Aug 2007 B2
7287275 Moskowitz Oct 2007 B2
7315541 Housel Jan 2008 B1
7339929 Zelig Mar 2008 B2
7350229 Lander Mar 2008 B1
7362727 ONeill Apr 2008 B1
7382787 Barnes Jun 2008 B1
7395507 Robarts Jul 2008 B2
7430755 Hughes Sep 2008 B1
7444251 Nikovski Oct 2008 B2
7466703 Arunachalam Dec 2008 B1
7472422 Agbabian Dec 2008 B1
7496668 Hawkinson Feb 2009 B2
7509425 Rosenberg Mar 2009 B1
7523016 Surdulescu Apr 2009 B1
7542471 Samuels Jun 2009 B2
7543064 Juncker Jun 2009 B2
7552233 Raju Jun 2009 B2
7555482 Korkus Jun 2009 B2
7555563 Ott Jun 2009 B2
7564812 Elliott Jul 2009 B1
7567547 Mosko Jul 2009 B2
7567946 Andreoli Jul 2009 B2
7580971 Gollapudi Aug 2009 B1
7623535 Guichard Nov 2009 B2
7636767 Lev-Ran Dec 2009 B2
7647507 Feng Jan 2010 B1
7660324 Oguchi Feb 2010 B2
7685290 Satapati Mar 2010 B2
7698463 Ogier Apr 2010 B2
7698559 Chaudhury Apr 2010 B1
7769887 Bhattacharyya Aug 2010 B1
7779467 Choi Aug 2010 B2
7801069 Cheung Sep 2010 B2
7801177 Luss Sep 2010 B2
7816441 Elizalde Oct 2010 B2
7831733 Sultan Nov 2010 B2
7908337 Garcia-Luna-Aceves Mar 2011 B2
7924837 Shabtay Apr 2011 B1
7953014 Toda May 2011 B2
7953885 Devireddy May 2011 B1
8000267 Solis Aug 2011 B2
8010691 Kollmansberger Aug 2011 B2
8074289 Carpentier Dec 2011 B1
8117441 Kurien Feb 2012 B2
8160069 Jacobson Apr 2012 B2
8204060 Jacobson Jun 2012 B2
8214364 Bigus Jul 2012 B2
8224985 Takeda Jul 2012 B2
8225057 Zheng Jul 2012 B1
8271578 Sheffi Sep 2012 B2
8271687 Turner Sep 2012 B2
8312064 Gauvin Nov 2012 B1
8332357 Chung Dec 2012 B1
8386622 Jacobson Feb 2013 B2
8447851 Anderson May 2013 B1
8462781 McGhee Jun 2013 B2
8467297 Liu Jun 2013 B2
8473633 Eardley Jun 2013 B2
8553562 Allan Oct 2013 B2
8572214 Garcia-Luna-Aceves Oct 2013 B2
8654649 Vasseur Feb 2014 B2
8665757 Kling Mar 2014 B2
8667172 Ravindran Mar 2014 B2
8677451 Bhimaraju Mar 2014 B1
8688619 Ezick Apr 2014 B1
8699350 Kumar Apr 2014 B1
8718055 Vasseur May 2014 B2
8750820 Allan Jun 2014 B2
8761022 Chiabaut Jun 2014 B2
8762477 Xie Jun 2014 B2
8762570 Qian Jun 2014 B2
8762707 Killian Jun 2014 B2
8767627 Ezure Jul 2014 B2
8817594 Gero Aug 2014 B2
8826381 Kim Sep 2014 B2
8832302 Bradford Sep 2014 B1
8836536 Marwah Sep 2014 B2
8861356 Kozat Oct 2014 B2
8862774 Vasseur Oct 2014 B2
8868779 ONeill Oct 2014 B2
8874842 Kimmel Oct 2014 B1
8880682 Bishop Nov 2014 B2
8903756 Zhao Dec 2014 B2
8923293 Jacobson Dec 2014 B2
8934496 Vasseur Jan 2015 B2
8937865 Kumar Jan 2015 B1
8972969 Gaither Mar 2015 B2
8977596 Montulli Mar 2015 B2
9002921 Westphal Apr 2015 B2
9071498 Beser Jun 2015 B2
9112895 Lin Aug 2015 B1
9253087 Zhang Feb 2016 B2
9280610 Gruber Mar 2016 B2
20020002680 Carbajal Jan 2002 A1
20020010795 Brown Jan 2002 A1
20020038296 Margolus Mar 2002 A1
20020048269 Hong Apr 2002 A1
20020054593 Morohashi May 2002 A1
20020077988 Sasaki Jun 2002 A1
20020078066 Robinson Jun 2002 A1
20020138551 Erickson Sep 2002 A1
20020152305 Jackson Oct 2002 A1
20020176404 Girard Nov 2002 A1
20020188605 Adya Dec 2002 A1
20020199014 Yang Dec 2002 A1
20030004621 Bousquet Jan 2003 A1
20030009365 Tynan Jan 2003 A1
20030033394 Stine Feb 2003 A1
20030046396 Richter Mar 2003 A1
20030046421 Horvitz et al. Mar 2003 A1
20030046437 Eytchison Mar 2003 A1
20030048793 Pochon Mar 2003 A1
20030051100 Patel Mar 2003 A1
20030061384 Nakatani Mar 2003 A1
20030074472 Lucco Apr 2003 A1
20030088696 McCanne May 2003 A1
20030097447 Johnston May 2003 A1
20030099237 Mitra May 2003 A1
20030140257 Peterka Jul 2003 A1
20030221103 Hirota Nov 2003 A1
20030229892 Sardera Dec 2003 A1
20040024879 Dingman Feb 2004 A1
20040030602 Rosenquist Feb 2004 A1
20040064737 Milliken Apr 2004 A1
20040071140 Jason Apr 2004 A1
20040073617 Milliken Apr 2004 A1
20040073715 Folkes Apr 2004 A1
20040139230 Kim Jul 2004 A1
20040196783 Shinomiya Oct 2004 A1
20040221047 Grover Nov 2004 A1
20040225627 Botros Nov 2004 A1
20040246902 Weinstein Dec 2004 A1
20040252683 Kennedy Dec 2004 A1
20050003832 Osafune Jan 2005 A1
20050028156 Hammond Feb 2005 A1
20050043060 Brandenberg Feb 2005 A1
20050050211 Kaul Mar 2005 A1
20050074001 Mattes Apr 2005 A1
20050132207 Mourad Jun 2005 A1
20050149508 Deshpande Jul 2005 A1
20050159823 Hayes Jul 2005 A1
20050198351 Nog Sep 2005 A1
20050249196 Ansari Nov 2005 A1
20050257274 Shiga Nov 2005 A1
20050259637 Chu Nov 2005 A1
20050262217 Nonaka Nov 2005 A1
20050281288 Banerjee Dec 2005 A1
20050286535 Shrum Dec 2005 A1
20050289222 Sahim Dec 2005 A1
20060010249 Sabesan Jan 2006 A1
20060029102 Abe Feb 2006 A1
20060039379 Abe Feb 2006 A1
20060051055 Ohkawa Mar 2006 A1
20060072523 Richardson Apr 2006 A1
20060099973 Nair May 2006 A1
20060129514 Watanabe Jun 2006 A1
20060133343 Huang Jun 2006 A1
20060146686 Kim Jul 2006 A1
20060173831 Basso Aug 2006 A1
20060193295 White Aug 2006 A1
20060203804 Whitmore Sep 2006 A1
20060206445 Andreoli Sep 2006 A1
20060215684 Capone Sep 2006 A1
20060223504 Ishak Oct 2006 A1
20060235977 Wunderlich Oct 2006 A1
20060256767 Suzuki Nov 2006 A1
20060268792 Belcea Nov 2006 A1
20070019619 Foster Jan 2007 A1
20070073888 Madhok Mar 2007 A1
20070094265 Korkus Apr 2007 A1
20070112880 Yang May 2007 A1
20070124412 Narayanaswami May 2007 A1
20070127457 Mirtorabi Jun 2007 A1
20070160062 Morishita Jul 2007 A1
20070162394 Zager Jul 2007 A1
20070171828 Dalal Jul 2007 A1
20070189284 Kecskemeti Aug 2007 A1
20070195765 Heissenbuttel Aug 2007 A1
20070204011 Shaver Aug 2007 A1
20070209067 Fogel Sep 2007 A1
20070239892 Ott Oct 2007 A1
20070240207 Belakhdar Oct 2007 A1
20070245034 Retana Oct 2007 A1
20070253418 Shiri Nov 2007 A1
20070255677 Alexander Nov 2007 A1
20070255699 Sreenivas Nov 2007 A1
20070255781 Li Nov 2007 A1
20070274504 Maes Nov 2007 A1
20070275701 Jonker Nov 2007 A1
20070276907 Maes Nov 2007 A1
20070283158 Danseglio Dec 2007 A1
20070294187 Scherrer Dec 2007 A1
20080005056 Stelzig Jan 2008 A1
20080010366 Duggan Jan 2008 A1
20080037420 Tang Feb 2008 A1
20080043989 Furutono Feb 2008 A1
20080046340 Brown Feb 2008 A1
20080059631 Bergstrom Mar 2008 A1
20080080440 Yarvis Apr 2008 A1
20080101357 Iovanna May 2008 A1
20080107034 Jetcheva May 2008 A1
20080107259 Satou May 2008 A1
20080123862 Rowley May 2008 A1
20080133583 Artan Jun 2008 A1
20080133755 Pollack Jun 2008 A1
20080151755 Nishioka Jun 2008 A1
20080159271 Kutt Jul 2008 A1
20080165775 Das Jul 2008 A1
20080186901 Itagaki Aug 2008 A1
20080200153 Fitzpatrick Aug 2008 A1
20080215669 Gaddy Sep 2008 A1
20080216086 Tanaka Sep 2008 A1
20080243992 Jardetzky Oct 2008 A1
20080250006 Dettinger Oct 2008 A1
20080256138 Sim-Tang Oct 2008 A1
20080256359 Kahn Oct 2008 A1
20080270618 Rosenberg Oct 2008 A1
20080271143 Stephens Oct 2008 A1
20080287142 Keighran Nov 2008 A1
20080288580 Wang Nov 2008 A1
20080298376 Takeda Dec 2008 A1
20080320148 Capuozzo Dec 2008 A1
20090006659 Collins Jan 2009 A1
20090013324 Gobara Jan 2009 A1
20090022154 Kiribe Jan 2009 A1
20090024641 Quigley Jan 2009 A1
20090030978 Johnson Jan 2009 A1
20090037763 Adhya Feb 2009 A1
20090052660 Chen Feb 2009 A1
20090067429 Nagai Mar 2009 A1
20090077184 Brewer Mar 2009 A1
20090092043 Lapuh Apr 2009 A1
20090097631 Gisby Apr 2009 A1
20090103515 Pointer Apr 2009 A1
20090113068 Fujihira Apr 2009 A1
20090116393 Hughes May 2009 A1
20090117922 Bell May 2009 A1
20090132662 Sheridan May 2009 A1
20090135728 Shen May 2009 A1
20090144300 Chatley Jun 2009 A1
20090157887 Froment Jun 2009 A1
20090185745 Momosaki Jul 2009 A1
20090193101 Munetsugu Jul 2009 A1
20090198832 Shah Aug 2009 A1
20090222344 Greene Sep 2009 A1
20090228593 Takeda Sep 2009 A1
20090254572 Redlich Oct 2009 A1
20090268905 Matsushima Oct 2009 A1
20090274158 Sharp Nov 2009 A1
20090276396 Gorman Nov 2009 A1
20090285209 Stewart Nov 2009 A1
20090287835 Jacobson Nov 2009 A1
20090287853 Carson Nov 2009 A1
20090288076 Johnson Nov 2009 A1
20090288143 Stebila Nov 2009 A1
20090288163 Jacobson Nov 2009 A1
20090292743 Bigus Nov 2009 A1
20090293121 Bigus Nov 2009 A1
20090300079 Shitomi Dec 2009 A1
20090300407 Kamath Dec 2009 A1
20090300512 Ahn Dec 2009 A1
20090307333 Welingkar Dec 2009 A1
20090323632 Nix Dec 2009 A1
20100005061 Basco Jan 2010 A1
20100027539 Beverly Feb 2010 A1
20100046546 Ram Feb 2010 A1
20100057929 Merat Mar 2010 A1
20100058346 Narang Mar 2010 A1
20100088370 Wu Apr 2010 A1
20100094767 Miltonberger Apr 2010 A1
20100094876 Huang Apr 2010 A1
20100098093 Ejzak Apr 2010 A1
20100100465 Cooke Apr 2010 A1
20100103870 Garcia-Luna-Aceves Apr 2010 A1
20100124191 Vos May 2010 A1
20100125911 Bhaskaran May 2010 A1
20100131660 Dec May 2010 A1
20100150155 Napierala Jun 2010 A1
20100165976 Khan Jul 2010 A1
20100169478 Saha Jul 2010 A1
20100169503 Kollmansberger Jul 2010 A1
20100180332 Ben-Yochanan Jul 2010 A1
20100182995 Hwang Jul 2010 A1
20100185753 Liu Jul 2010 A1
20100195653 Jacobson Aug 2010 A1
20100195654 Jacobson Aug 2010 A1
20100195655 Jacobson Aug 2010 A1
20100217874 Anantharaman Aug 2010 A1
20100217985 Fahrny Aug 2010 A1
20100232402 Przybysz Sep 2010 A1
20100232439 Dham Sep 2010 A1
20100235516 Nakamura Sep 2010 A1
20100246549 Zhang Sep 2010 A1
20100250497 Redlich Sep 2010 A1
20100250939 Adams Sep 2010 A1
20100257149 Cognigni Oct 2010 A1
20100268782 Zombek Oct 2010 A1
20100272107 Papp Oct 2010 A1
20100281263 Ugawa Nov 2010 A1
20100284309 Allan Nov 2010 A1
20100284404 Gopinath Nov 2010 A1
20100293293 Beser Nov 2010 A1
20100322249 Thathapudi Dec 2010 A1
20110013637 Xue Jan 2011 A1
20110019674 Iovanna Jan 2011 A1
20110022812 vanderLinden Jan 2011 A1
20110029952 Harrington Feb 2011 A1
20110055392 Shen Mar 2011 A1
20110055921 Narayanaswamy Mar 2011 A1
20110060716 Forman Mar 2011 A1
20110060717 Forman Mar 2011 A1
20110090908 Jacobson Apr 2011 A1
20110106755 Hao May 2011 A1
20110137919 Ryu Jun 2011 A1
20110145597 Yamaguchi Jun 2011 A1
20110145858 Philpott Jun 2011 A1
20110149858 Hwang Jun 2011 A1
20110153840 Narayana Jun 2011 A1
20110158122 Murphy Jun 2011 A1
20110161408 Kim Jun 2011 A1
20110202609 Chaturvedi Aug 2011 A1
20110219093 Ragunathan Sep 2011 A1
20110219427 Hito Sep 2011 A1
20110225293 Rathod Sep 2011 A1
20110231578 Nagappan Sep 2011 A1
20110239256 Gholmieh Sep 2011 A1
20110258049 Ramer Oct 2011 A1
20110264824 Venkata Subramanian Oct 2011 A1
20110265159 Ronda Oct 2011 A1
20110265174 Thornton Oct 2011 A1
20110271007 Wang Nov 2011 A1
20110286457 Ee Nov 2011 A1
20110286459 Rembarz Nov 2011 A1
20110295783 Zhao Dec 2011 A1
20110299454 Krishnaswamy Dec 2011 A1
20120011170 Elad Jan 2012 A1
20120011551 Levy Jan 2012 A1
20120023113 Ferren Jan 2012 A1
20120036180 Thornton Feb 2012 A1
20120047361 Erdmann Feb 2012 A1
20120066727 Nozoe Mar 2012 A1
20120106339 Mishra May 2012 A1
20120114313 Phillips May 2012 A1
20120120803 Farkas May 2012 A1
20120127994 Ko May 2012 A1
20120136676 Goodall May 2012 A1
20120136936 Quintuna May 2012 A1
20120136945 Lee May 2012 A1
20120137367 Dupont May 2012 A1
20120141093 Yamaguchi Jun 2012 A1
20120155464 Kim Jun 2012 A1
20120158973 Jacobson Jun 2012 A1
20120163373 Lo Jun 2012 A1
20120166433 Tseng Jun 2012 A1
20120170913 Isozaki Jul 2012 A1
20120179653 Araki Jul 2012 A1
20120197690 Agulnek Aug 2012 A1
20120198048 Ioffe Aug 2012 A1
20120221150 Arensmeier Aug 2012 A1
20120224487 Hui Sep 2012 A1
20120226902 Kim Sep 2012 A1
20120257500 Lynch Oct 2012 A1
20120284791 Miller Nov 2012 A1
20120290669 Parks Nov 2012 A1
20120290919 Melnyk Nov 2012 A1
20120291102 Cohen Nov 2012 A1
20120307629 Vasseur Dec 2012 A1
20120314580 Hong Dec 2012 A1
20120317307 Ravindran Dec 2012 A1
20120322422 Frecks Dec 2012 A1
20120323933 He Dec 2012 A1
20120331112 Chatani Dec 2012 A1
20130024560 Vasseur Jan 2013 A1
20130041982 Shi Feb 2013 A1
20130051392 Filsfils Feb 2013 A1
20130054971 Yamaguchi Feb 2013 A1
20130060962 Wang Mar 2013 A1
20130061084 Barton Mar 2013 A1
20130066823 Sweeney Mar 2013 A1
20130073552 Rangwala Mar 2013 A1
20130074155 Huh Mar 2013 A1
20130080559 Rao et al. Mar 2013 A1
20130090942 Robinson Apr 2013 A1
20130091539 Khurana Apr 2013 A1
20130110987 Kim May 2013 A1
20130111063 Lee May 2013 A1
20130132719 Kobayashi May 2013 A1
20130151584 Westphal Jun 2013 A1
20130151646 Chidambaram Jun 2013 A1
20130152070 Bhullar Jun 2013 A1
20130163426 Beliveau Jun 2013 A1
20130166668 Byun Jun 2013 A1
20130173822 Hong Jul 2013 A1
20130182568 Lee Jul 2013 A1
20130182931 Fan Jul 2013 A1
20130185406 Choi Jul 2013 A1
20130191412 Kitamura Jul 2013 A1
20130197698 Shah Aug 2013 A1
20130198119 Eberhardt, III Aug 2013 A1
20130212185 Pasquero Aug 2013 A1
20130219038 Lee Aug 2013 A1
20130219081 Qian Aug 2013 A1
20130219478 Mahamuni Aug 2013 A1
20130223237 Hui Aug 2013 A1
20130227114 Vasseur Aug 2013 A1
20130227166 Ravindran Aug 2013 A1
20130242996 Varvello Sep 2013 A1
20130250809 Hui Sep 2013 A1
20130262365 Dolbear Oct 2013 A1
20130282854 Jang Oct 2013 A1
20130282860 Zhang Oct 2013 A1
20130282920 Zhang Oct 2013 A1
20130304758 Gruber Nov 2013 A1
20130304937 Lee Nov 2013 A1
20130325888 Oneppo Dec 2013 A1
20130329696 Xu Dec 2013 A1
20130336103 Vasseur Dec 2013 A1
20130336323 Srinivasan Dec 2013 A1
20130339481 Hong Dec 2013 A1
20130343408 Cook Dec 2013 A1
20140003232 Guichard Jan 2014 A1
20140003424 Matsuhira Jan 2014 A1
20140006354 Parkison Jan 2014 A1
20140006565 Muscariello Jan 2014 A1
20140029445 Hui Jan 2014 A1
20140032714 Liu Jan 2014 A1
20140033193 Palaniappan Jan 2014 A1
20140040505 Barton Feb 2014 A1
20140040628 Fort Feb 2014 A1
20140047513 vantNoordende Feb 2014 A1
20140074730 Arensmeier Mar 2014 A1
20140075567 Raleigh Mar 2014 A1
20140082135 Jung Mar 2014 A1
20140082661 Krahnstoever Mar 2014 A1
20140089454 Jeon Mar 2014 A1
20140096249 Dupont Apr 2014 A1
20140108313 Heidasch Apr 2014 A1
20140108474 David Apr 2014 A1
20140115037 Liu Apr 2014 A1
20140122587 Petker et al. May 2014 A1
20140129736 Yu May 2014 A1
20140136814 Stark May 2014 A1
20140140348 Perlman May 2014 A1
20140143370 Vilenski May 2014 A1
20140146819 Bae May 2014 A1
20140149733 Kim May 2014 A1
20140156396 deKozan Jun 2014 A1
20140165207 Engel Jun 2014 A1
20140172783 Suzuki Jun 2014 A1
20140172981 Kim Jun 2014 A1
20140173034 Liu Jun 2014 A1
20140173076 Ravindran Jun 2014 A1
20140173283 Hanatani Jun 2014 A1
20140192717 Liu Jul 2014 A1
20140195328 Ferens Jul 2014 A1
20140195641 Wang Jul 2014 A1
20140195666 Dumitriu Jul 2014 A1
20140214942 Ozonat Jul 2014 A1
20140233575 Xie Aug 2014 A1
20140237085 Park Aug 2014 A1
20140237095 Bevilacqua-Linn Aug 2014 A1
20140245359 DeFoy Aug 2014 A1
20140254595 Luo Sep 2014 A1
20140280823 Varvello Sep 2014 A1
20140281489 Peterka Sep 2014 A1
20140281505 Zhang Sep 2014 A1
20140282816 Xie Sep 2014 A1
20140289325 Solis Sep 2014 A1
20140289790 Wilson Sep 2014 A1
20140298248 Kang Oct 2014 A1
20140314093 You Oct 2014 A1
20140337276 Iordanov Nov 2014 A1
20140365550 Jang Dec 2014 A1
20150006896 Franck Jan 2015 A1
20150018770 Baran Jan 2015 A1
20150032892 Narayanan Jan 2015 A1
20150039890 Khosravi Feb 2015 A1
20150063802 Bahadur Mar 2015 A1
20150089081 Thubert Mar 2015 A1
20150095481 Ohnishi Apr 2015 A1
20150095514 Yu Apr 2015 A1
20150117253 Scott Apr 2015 A1
20150120663 LeScouarnec Apr 2015 A1
20150169758 Assom Jun 2015 A1
20150188770 Naiksatam Jul 2015 A1
20150195149 Vasseur Jul 2015 A1
20150207633 Ravindran Jul 2015 A1
20150207864 Wilson Jul 2015 A1
20150222603 Uzun Aug 2015 A1
20150254347 Mosko Sep 2015 A1
20150279348 Cao Oct 2015 A1
20150312300 Mosko Oct 2015 A1
20150372903 Hui Dec 2015 A1
20150381546 Mahadevan Dec 2015 A1
20160021172 Mahadevan Jan 2016 A1
Foreign Referenced Citations (19)
Number Date Country
2005200529 Mar 2005 AU
1720277 Jun 1967 DE
19620817 Nov 1997 DE
0295727 Dec 1988 EP
0757065 Jul 1996 EP
1077422 Feb 2001 EP
1384729 Jan 2004 EP
2120402 Nov 2009 EP
2120419 Nov 2009 EP
2124415 Nov 2009 EP
2214357 Aug 2010 EP
03005288 Jan 2003 WO
03042254 May 2003 WO
03049369 Jun 2003 WO
03091297 Nov 2003 WO
2007113180 Oct 2007 WO
2007144388 Dec 2007 WO
2011049890 Apr 2011 WO
2013123410 Aug 2013 WO
Non-Patent Literature Citations (152)
Entry
International Search Report and Written Opinion in counterpart International Application No. PCT/US2017/031121, dated Aug. 11, 2017, 11 pages.
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.
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).
“PBC Library—Pairing-Based Cryptography—About,” http://crypto.stanford.edu/pbc. downloaded Apr. 27, 2015.
C. Gentry and A. Silverberg. Hierarchical ID-Based Cryptography. Advances in Cryptology—ASIACRYPT 2002. Springer Berlin Heidelberg (2002).
Boneh et al., “Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys”, 2005.
D. Boneh and M. Franklin. Identity-Based Encryption from the Weil Pairing. Advances in Cryptology—CRYPTO 2001, vol. 2139, Springer Berlin Heidelberg (2001).
Anteniese et al., “Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage”, 2006.
Xiong et al., “CloudSeal: End-to-End Content Protection in Cloud-based Storage and Delivery Services”, 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. Shao and Z. Cao. CCA-Secure Proxy Re-Encryption without Pairings. Public Key Cryptography. Springer Lecture Notes in Computer Science vol. 5443 (2009).
Gopal et al. “Integrating content-based Mechanisms with hierarchical File systems”, Feb. 1999, University of Arizona, 15 pages.
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).
RTMP (2009). Available online at http://wwwimages.adobe.com/www.adobe.com/content/dam/Adobe/en/devnet/rtmp/ pdf/rtmp specification 1.0.pdf.
S. Chow, J. Weng, Y. Yang, and R. Deng. Efficient Unidirectional Proxy Re-Encryption. Progress in Cryptology—AFRICACRYPT 2010. Springer Berlin Heidelberg (2010).
S. Kamara and K. Lauter. Cryptographic Cloud Storage. Financial Cryptography and Data Security. Springer Berlin Heidelberg (2010).
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.
The Despotify Project (2012). Available online at http://despotify.sourceforge.net/.
V. K. Adhikari, S. Jain, Y. Chen, and Z.-L. Zhang. Vivisecting Youtube:An Active Measurement Study. In INFOCOM12 Mini-conference (2012).
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).
Jacobson, Van et al. ‘VoCCN: Voice Over Content-Centric Networks.’ Dec. 1, 2009. ACM ReArch'09.
Rosenberg, J. “Interactive Connectivity Establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal for Offer/Answer Protocols”, Apr. 2010, pp. 1-117.
Shih, Eugene et al., ‘Wake on Wireless: An Event Driven Energy Saving Strategy for Battery Operated Devices’, Sep. 23, 2002, pp. 160-171.
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.
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.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.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, 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. Hur, “Improving security and efficiency in attribute-based data sharing,” IEEE Trans. Knowledge Data Eng., vol. 25, No. 10, pp. 2271-2282, Oct. 2013.
V. Jacobson et al., ‘Networking Named Content,’ Proc. IEEE CoNEXT '09, Dec. 2009.
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.
Lopez, Javier, et al. “Trust management systems for wireless sensor networks: Best practices.” Computer Communications 33.9 (2010): 1086-1093.
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.
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.
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.
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.
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.
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.
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.
Biradar et al., “Review of multicast routing mechanisms in mobile ad hoc networks”, Aug. 16, Journal of Network and Computer Applications 35 (2012) 221-229.
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.
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.
Hoque 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.
Xie et al. “Collaborative Forwarding and Caching in Content Centric Networks”, Networking 2012.
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.
Related Publications (1)
Number Date Country
20170324704 A1 Nov 2017 US