System and method for piggybacking routing information in interests in a content centric network

Information

  • Patent Grant
  • 9992097
  • Patent Number
    9,992,097
  • Date Filed
    Monday, July 11, 2016
    7 years ago
  • Date Issued
    Tuesday, June 5, 2018
    5 years ago
Abstract
One embodiment provides a system that facilitates routing updates outside of a routing protocol. During operation, the system receives, by an intermediate node, a first interest that indicates an originator name which is a routable name prefix for a sender of the first interest and is used by a content producing device in a subsequent interest. In response to not obtaining a matching entry in a forwarding information base (FIB) based on the originator name, the system adds a first entry to the FIB, wherein the first entry includes the originator name as a name for the first entry and further includes an arrival interface of the first interest as an outgoing interface for the first entry. In response to receiving the subsequent interest which has a name that includes the originator name, the system forwards the subsequent interest to the outgoing interface for the first entry.
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/579,925, entitled “SYSTEM AND METHOD FOR EFFICIENT NAME-BASED CONTENT ROUTING USING LINK-STATE INFORMATION IN INFORMATION-CENTRIC NETWORKS,” by inventor Jose J. Garcia-Luna-Aceves, filed 22 Dec. 2014 (hereinafter “U.S. patent application Ser. No. 14/579,925”);


      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 and method for facilitating proactive routing updates by piggybacking routing information in interests.


Related Art

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


A CCN data packet (such as an interest or content object) is routed based on its name. A name can include a name prefix, which is one or more of the contiguous name components starting from the most general level. In some CCN routing protocols, a producer advertises a name prefix to receive interests under a particular domain. The routing protocol propagates the name prefix, where the corresponding routing information traverses the network from the origin (e.g., the producer) to the destination (e.g., the consumer) following the shortest possible path. The overall time for the routing information propagation is based on the number of hops along the path from the producer to the consumer, as well as the frequency at which the routing updates are propagated. Thus, long routes or infrequent route updates may result in routes taking a long time to be set in the network. However, in the case where consumers and producers engage in bilateral communication using two-way interests, or in the case where consumers are mobile and use rapidly changing or random prefixes for receiving interests, the long time necessary for successful routing information propagation may result in errors (e.g., dropped packets) or inefficient or additional communication (e.g., re-expressed interests).


SUMMARY

One embodiment provides a system that facilitates proactive routing updates outside of a routing protocol. During operation, the system receives, by an intermediate node, a first interest that indicates an originator name, 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, wherein the originator name is a routable name prefix for a sender of the first interest and is used by a content producing device in a subsequent interest. In response to not obtaining a matching entry in a forwarding information base based on the originator name, the system adds a first entry to the forwarding information base, wherein the first entry includes the originator name as a name for the first entry and further includes an arrival interface of the first interest as an outgoing interface for the first entry. In response to receiving the subsequent interest which has a name that includes the originator name, the system forwards the subsequent interest to the outgoing interface for the first entry, thereby facilitating the intermediate node to proactively update routing information outside of the routing protocol and based on routing information included in the first interest.


In some embodiments, in response to receiving the subsequent interest, the system performs a lookup in the forwarding information base based on the originator name to obtain the first entry.


In some embodiments, the first interest includes a hop count, and the first entry further includes a distance to the sender as a value based on the hop count.


In some embodiments, the first interest includes a reverse route update which indicates routing information from a neighbor node of the intermediate node, wherein the reverse route update is for one or more name prefixes. The system inserts the indicated routing information into a control process for a local routing algorithm, wherein the control process handles route updates from neighbor nodes.


In some embodiments, in response to obtaining the matching entry in the forwarding information base based on the originator name, the system adds to the matching entry the arrival interface of the first interest as an outgoing interface for the matching entry.


In some embodiments, the first interest has a name. In response to determining that the originator name indicated in the first interest is null, the system forwards the first interest to one or more outgoing interfaces indicated in the forwarding information base and corresponding to the name for the first interest. The system can also forward the first interest to the one or more outgoing interfaces indicated in the forwarding information base and corresponding to the name for the first interest.


In some embodiments, receiving the first interest is in response to an advertisement of the content producing device for content under a domain of the content producing device. The advertisement is an interest which does not require a responsive content object and does not leave state information in a pending interest table.


Another embodiment provides a system that facilitates proactive routing updates outside of a routing protocol. During operation, the system receives, by a content producing device, a first interest that indicates an originator name, 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, wherein the originator name is a routable name prefix for a sender of the first interest and is used by the content producing device in a subsequent interest. In response to not obtaining a matching entry in a forwarding information base based on the originator name, the system adds a first entry to the forwarding information base, wherein the first entry includes the originator name as a name for the first entry and further includes an arrival interface of the first interest as an outgoing interface for the first entry. The system generates the subsequent interest which has a name that includes the originator name. The system forwards the subsequent interest to the outgoing interface for the first entry, thereby facilitating the content producing device to proactively update routing information outside of the routing protocol and based on routing information included in the first interest.


In some embodiments, in response to determining that the originator name indicated in the first interest is null, the system processes the first interest. The system can also perform a lookup in the forwarding information base based on the originator name to obtain the first entry.


In some embodiments, the system generates an advertisement for content under a domain of the content producing device, wherein the advertisement is an interest which does not require a responsive content object and does not leave state information in a pending interest table, and wherein receiving the first interest is in response to generating the advertisement.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1A illustrates an exemplary network which facilitates proactive routing updates, in accordance with an embodiment of the present invention.



FIG. 1B illustrates an exemplary network which facilitates proactive routing updates, in accordance with an embodiment of the present invention.



FIG. 2A illustrates an exemplary interest or advertisement, in accordance with an embodiment of the present invention.



FIG. 2B illustrates an exemplary forwarding information base populated by a routing protocol, in accordance with an embodiment of the present invention.



FIG. 2C illustrates an exemplary interest which facilitates proactive routing updates, in accordance with an embodiment of the present invention.



FIG. 2D illustrates an exemplary forwarding information base after receiving and processing the interest of FIG. 2C, in accordance with an embodiment of the present invention.



FIG. 2E illustrates an exemplary interest or advertisement, generated in response to receiving the interest of FIG. 2C and proactively updating the forwarding information base as in FIG. 2D, in accordance with an embodiment of the present invention.



FIG. 3A presents a flow chart illustrating a method by an intermediate router for processing an interest which includes proactive routing information, in accordance with an embodiment of the present invention.



FIG. 3B presents a flow chart illustrating a method by an intermediate router for processing an interest subsequent to the method depicted in FIG. 3A, in accordance with an embodiment of the present invention.



FIG. 4 presents a flow chart illustrating a method by a content producing device for processing an interest which includes proactive routing information, in accordance with an embodiment of the present invention.



FIG. 5 presents a flow chart illustrating a method by a content requesting device for facilitating proactive routing updates, in accordance with an embodiment of the present invention.



FIG. 6 illustrates an exemplary computer system that facilitates proactive routing updates, 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 solve the problem of lengthy routing information propagation (e.g., distance or frequency based routing protocols) for rapidly changing consumer prefixes by proactively piggybacking routing information in interests. A CCN data packet (such as an interest or content object) is routed based on its name. In some CCN routing protocols (such as Distance-based Content Routing, or DCR), a producer advertises a name prefix to receive interests under a particular domain. The routing protocol propagates the name prefix, where the corresponding routing information traverses the network from the origin (e.g., the producer) to the destination (e.g., the consumer) following the shortest possible path. The overall time for the routing information propagation is based on the number of hops along the path from the producer to the consumer, as well as on the frequency at which the routing updates are propagated. Thus, long routes or infrequent route updates may result in routes taking a long time to be set in the network. DCR and content routing based on link-state information is described in U.S. patent application Ser. No. 14/579,925.


However, in the case where consumers and producers engage in bilateral communication using two-way interests, or in the case where consumers are mobile and use rapidly changing or random prefixes for receiving interests, the long time necessary for successful routing information propagation may result in errors or inefficient communication, such as dropped packets or re-expressed interests, respectively. For example, at a time T1, a consumer can issue a first interest to a producer, where it is assumed that intermediate routers along the path from the consumer to the producer contain the appropriate FIB entries to route the first interest. At a time T2, the producer may follow the first interest by sending a second interest to the consumer. However, the consumer may change its prefix at time T2, where the routing update propagates to in-path routers only at a time T3, which is after the time T2 that the producer sent its second interest. This results in the second interest being dropped at an intermediate router, because the intermediate router does not have an available FIB entry indicating where to forward the second interest. Alternatively, the producer can transmit to the consumer an interest which contains an advertisement for content under the producer's domain. Such an “advertisement” interest reaches the consumer based on information in the intermediate routers' FIBs. However, if the consumer changes its prefix and the routing information propagation takes a long time, subsequent advertisement interests from the producer may not reach the consumer.


Embodiments of the present invention solve these problems by allowing a consumer to include in an interest either the consumer's prefix or a new route update from the consumer's local forwarder. For example, an interest can carry the prefix of the consumer (e.g., the originator or the originating entity) as a separate CCNxName field, “OriginatorName.” A forwarder or router that receives an interest with an OriginatorName can create (if necessary) a new FIB entry with the OriginatorName that points to the arrival interface of the interest. The new FIB entry can also contain the distance to the originator as the value “256−hc,” where hc is the hop count in the interest. Alternatively, an interest can carry the DCR update of a local forwarder or router in a separate field, “ReverseRouteUpdate.” The DCR update can include more than a single prefix. A forwarder or router that receives an interest with a ReverseRouteUpdate can insert this information into the control process for the local routing algorithm (i.e., the process that is responsible for handling route updates from neighbors).


Embodiments of the present invention allow the consumer to proactively include routing information in an interest, which allows upstream routers that receive the interest to update their FIBs outside of the routing protocol and based on the routing information included in the interest. Thus, the present system provides improvements to the distribution of digital content, where the improvements are fundamentally technological. Embodiments of the present invention provide a technological solution (e.g., piggybacking routing information in interests to allow upstream routers to proactively update FIB entries) to the technological problem of the efficient, secure, and effective distribution of digital content.


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.


Face or Interface (or “face” or “interface”): In CCN, the term “face” is a generalization of the concept of an interface. A face may be a connection to a network or directly to an application party. A face may be configured to send and receive broadcast or multicast packets on a particular network interface, or to send and receive packets using point-to-point addressing in the underlying transport, or using a tunnel (for example a TCP tunnel). A face may also be the connection to a single application process running on the same machine, via an encapsulation like UDP or an OS-specific inter-process communication path. All messages arrive through a face and are sent out through a face. In this disclosure, the term “neighbor” is interchangeable with the terms “face” and “interface,” referring to an incoming or outgoing interface of an Interest.


“Prefix”: In this disclosure, the term “prefix” can be used to refer to either a name of a specific content object or a name prefix for the content object. A routable name prefix can determine the routing of 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. 1A illustrates an exemplary network which facilitates proactive routing updates, in accordance with an embodiment of the present invention. Network 100 can include a consumer or content requesting device 116, a producer or content producing device 118, and 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). Network 100 can be a content centric network.


Consumer or device 116 can have a current prefix 120 of “/c/oldprefix.” Current prefix 120 can be a routable name prefix which, via a propagation of routing information based on a routing protocol, is included in the appropriate FIBs of routers in network 100, as described below in relation to FIG. 2B. Consumer 116 can be a mobile device or a consumer that uses a random name prefix for receiving interests. Consumer 116 can determine to change its name prefix (or detect an updated name prefix) from a current prefix 120 of “/c/oldprefix” to an updated prefix 122 of “/c/newprefix.” Consumer 116 can generate an interest 140 with a name 142 of “/p/name/data/a/b,” an originator name 144 of “/c/newprefix,” and a hop count 146 with a value of “4.” Interest 140 can be in response to an advertisement sent by a producer (not shown). Interest 140 can travel through network 100 via intermediate nodes 102, 110, and 112 before reaching producer or device 118. Each of these intermediate nodes can update their FIBs based on the proactive routing information included in interest 140. For example, node 110 can receive interest 140, and (if no matching entry exists), create a new entry 130.1 in its FIB that includes originator name 144 as a name prefix 132, and further includes an arrival interface corresponding to interest 140 (e.g., “IF_102”) as one of outgoing interfaces 134. Note that an entry 130.2 for the old prefix (e.g., current prefix 120) of consumer 116 already exists in FIB 130 because a routing protocol has already propagated the information in entry 130.2 through the network. Consumer 116 can forward interest 140 onwards based on information in its FIB corresponding to interest name 142 of interest 140. Similarly, producer 118 can receive interest 140 and add (if no matching exists) a new entry to its FIB (not shown) similar to entry 130.1 of FIB 130 of node 110.


Note that consumer 116 can send interest 140 immediately after consumer 116 updates it routable name or changes locations. For example, consumer 116 may have been previously connected to node 104, with a path to producer 118 via nodes 104, 108, and 112 already determined based on a propagation of routing information via the routing protocol (e.g., as shown by outgoing interface 134 of entry 130.2 in FIB 130, where “IF_108” is listed as an outgoing interface corresponding to the name prefix of “/c/oldprefix”). In the absence of the present system, a subsequent interest sent from producer 118 to consumer 116 using the old name of “/c/oldprefix” may not reach consumer 118. This may occur if the routing protocol has not had sufficient time to propagate the routing updates through the network (e.g., when producer 118 sends an interest to the old prefix before all intermediate routers have updated their FIBs accordingly).


Producer 118 may subsequently generate an interest with a name that includes originator name 144 of interest 140. FIG. 1B illustrates exemplary network 100 which facilitates proactive routing updates, in accordance with an embodiment of the present invention. Producer 118 can generate an interest 150 with a name 152 of “/c/newprefix/adv/a/b,” where name 152 includes originator name 144 (i.e., “/c/newprefix”) previously received and included in interest 140. Interest 150 can be a regular CCN interest or an advertisement that does not require a responsive content object. Interest 150 is routed through network 100 based on the updated routing information in the FIBs of the intermediate routers (e.g., nodes 112, 110, and 102). For example, node 110 can receive interest 150, perform a lookup in its FIB for name 152, determine (based on a longest prefix match) a matching FIB entry 130.1 for a name prefix 132 with a value of “/c/newprefix,” and transmit interest 150 via the corresponding outgoing interfaces 134 (e.g., “IF_102”) for FIB entry 130.1.


Thus, the system updates the FIBs with routing information included in or determined from an interest which includes the updated name prefix for the consumer. The updated FIBs ensure that a subsequent interest from the producer (or any entity), where the subsequent interest includes the updated and “piggybacked” name prefix, reaches the consumer even after the consumer has updated or changed its routable name prefix. The system thus facilitates routing updates outside of the routing protocol, which can be beneficial in the circumstances described above.


Exemplary Interests and Forwarding Information Bases



FIG. 2A illustrates an exemplary interest or advertisement 200, in accordance with an embodiment of the present invention. Interest or advertisement 200 can include a name 202 of “/c/oldprefix/adv/data/a/b,” an originator name 204 with a “null” value, a hop count 206 with a value of “x,” and a reverse route update 208 with a “null” value. Interest or advertisement 200 can be transmitted by a producer based on name 202. Interest or advertisement 200 can be routed through a network based on routing information in the FIBs of intermediate routers in the network.



FIG. 2B illustrates an exemplary forwarding information base 220 populated by a routing protocol, in accordance with an embodiment of the present invention. FIB 220 can include entries with a name prefix 222, outgoing interfaces 224, and a distance to originator 226. For example, an entry 220.1 in FIB 220 can include a name prefix of “/c/oldprefix,” outgoing interfaces which include “IF_108” (e.g., the interface corresponding to node 108), and a distance to originator with a “null” value. FIB 220, including entry 220.1, illustrates the state of a FIB which has been populated by the routing protocol.



FIG. 2C illustrates an exemplary interest 240 which facilitates proactive routing updates, in accordance with an embodiment of the present invention. Interest 240 can include a name 242 of “/p/nameprefix/data/a/b,” an originator name 244 with a value of “/c/newprefix,” a hop count 246 with a value of “4,” and a reverse route update 248 with value of “data.” Interest 240 can be transmitted by a consumer who determines to change its name prefix and wishes to piggyback routing information in an interest to a producer (e.g., in FIG. 1A, device 116 changes its name prefix from current prefix 120 to updated prefix 122, and generates interest 140 which includes originator name 144).



FIG. 2D illustrates an exemplary forwarding information base 260 after receiving and processing the interest of FIG. 2C, in accordance with an embodiment of the present invention. Similar to FIB 220 of FIG. 2B, FIB 260 can include entries with a name prefix 222, outgoing interfaces 224, and a distance to originator 226. FIB 260 illustrates the state of a FIB after receiving and processing an interest which includes an originator name (e.g., interest 240 of FIG. 2C). Thus, FIB 260 can include entry 220.1 (as previously described in relation to FIB 220 of FIG. 2B), and can further include an entry 260.1, which is created upon processing interest 240. Entry 260.1 can include a name prefix of “/c/newprefix,” outgoing interfaces that include “IF_102” (e.g., the arrival interface corresponding to the node from which interest 140 is received), and a distance to originator with a value equal to “256−hc,” where hc is the hop count included in the interest being processed (e.g., hop count 246 of interest 240).



FIG. 2E illustrates an exemplary interest or advertisement 280, generated in response to receiving the interest of FIG. 2C and proactively updating the forwarding information base as in FIG. 2D, in accordance with an embodiment of the present invention. Interest or advertisement 280 can include a name 282 of “c/newprefix/request/info/a/b,” an originator name 284 with a “null” value, a hop count 286 with a value of “y,” and a reverse route update 288 with a “null” value. Interest or advertisement 280 can be transmitted by a producer based on name 282, which includes the originator name included in a previously received interest (e.g., interest 240). Interest or advertisement 280 can be successfully routed through a network based on routing information in the FIBs of intermediate routers in the network.


Intermediate Router Processes Interest with Routing Information



FIG. 3A presents a flow chart 300 illustrating a method by an intermediate router for processing an interest which includes proactive routing information, in accordance with an embodiment of the present invention. During operation, the system receives, by an intermediate router, a first interest that indicates an originator name which is a routable name prefix for a sender of the first interest and is used by a content producing device in a subsequent interest (operation 302). A name can be a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level, and the first interest can include a name. If the originator name is null (decision 304), the system forwards the first interest based on information in the FIB of the intermediate router, which information is based on the name for the first interest (operation 314). If the originator name is not null (decision 304), the system performs a lookup in the FIB based on the originator name (operation 306). If a matching entry is found in the FIB (decision 308), the system adds the arrival interface of the first interest to the FIB (operation 310), and then forwards the first interest based on information in the FIB (based on the name for the first interest) (operation 314).


If a matching entry is not obtained or found in the FIB (decision 308), the system creates or adds a new FIB entry, wherein the new entry includes the originator name as a name for new entry, and further includes the arrival interface of the first interest as an outgoing interface for the new entry (operation 312). The system then forwards the first interest based on information in the FIB (based on the name for the first interest) (operation 314).



FIG. 3B presents a flow chart 350 illustrating a method by an intermediate router for processing an interest subsequent to the method depicted in FIG. 3A, in accordance with an embodiment of the present invention. During operation, the system receives, by an intermediate node, a second interest which has a name (operation 352). The name for the second interest can include the originator name as a routable name prefix. The second interest can be an advertisement that does not leave any state information in a pending interest table. The system performs a lookup in the FIB based on the name for the second interest (operation 354). If a matching entry is not found in the FIB (decision 356), the system discards the packet (operation 358). If a matching entry is found in the FIB (decision 356), the system forwards the second interest based on information in its FIB (based on the name for the second interest, which name may include the originator name) (operation 360).


Note that the operations described in FIG. 350 include standard processing of interests, including looking up routing information in the FIB. The main difference is that in decision 356 and operation 360, the FIB includes an entry for the originator name, which was inserted by the router into the FIB while processing a previously received interest (e.g., the first interest of FIG. 3A). This insertion occurs outside of the routing protocol, and thus allows the system to facilitate proactive routing updates.


Content Producing Device Processes Interest with Routing Information



FIG. 4 presents a flow chart 400 illustrating a method by a content producing device for processing an interest which includes proactive routing information, in accordance with an embodiment of the present invention. During operation, the system receives, by a content producing device, a first interest that indicates an originator name which is a routable name prefix for a sender of the first interest, wherein the originator name is used by the content producing device in a subsequent interest (operation 402). A name can be a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level, and the first interest can include a name. If the originator name is null (decision 404), the system processes the first interest under standard CCN rules (operation 405). For example, the producer can perform a lookup in its content store (CS) for a matching content object, and if it does not find the matching content in the CS, performing a lookup in a pending interest table (PIT) for an interest by the same name and updating the PIT as necessary. Subsequently, the producer can perform a lookup in its FIB to forward a responsive content object (or an ACK or NACK, if appropriate).


If the originator name is not null (decision 404), the system performs a lookup in the FIB based on the originator name (operation 406). If a matching entry is not obtained or found in the FIB (decision 408), the system creates or adds a new FIB entry, wherein the new entry includes the originator name as a name for new entry, and further includes the arrival interface of the first interest as an outgoing interface for the new entry (operation 412). The system generates a second interest which has a name that includes the originator name indicated in the first interest (operation 413). The originator name is an updated routable prefix for the sender of the “piggybacking” interest (e.g., the first interest). The system then forwards the second interest based on information for the name of the second interest in the FIB (e.g., based on the originator name included in the second interest) (operation 414). If a matching entry is found in the FIB (decision 408), the system adds the arrival interface of the first interest to the FIB (operation 410). The system can insert the arrival interface into the list of outgoing interfaces for the matching entry. The operation continues at operation 413 as described above.


Content Requesting Facilitates Proactive Routing Updates



FIG. 5 presents a flow chart 500 illustrating a method by a content requesting device for facilitating proactive routing updates, in accordance with an embodiment of the present invention. During operation, the system receives, by a content requesting device, an initial interest based on a first routable prefix for the content requesting device (operation 502). The system determines a second routable prefix for the content requesting device, wherein the second routable prefix indicates an updated routable prefix for the content requesting device (operation 504). The system generates a first interest that includes a name and indicates an originator name which is the second routable prefix, wherein an upstream router can update its FIB based on the second routable prefix, and wherein an upstream producer can use the second routable prefix in the name for a subsequent interest (operation 506). The system can subsequently receive a second interest based on the second routable prefix for the content requesting device (operation 508).


Exemplary Computer System



FIG. 6 illustrates an exemplary computer system 602 that facilitates proactive routing updates, in accordance with an embodiment of the present invention. Computer system 602 includes a processor 604, a memory 606, and a storage device 608. Memory 606 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 602 can be coupled to a display device 610, a keyboard 612, and a pointing device 614. Storage device 608 can store an operating system 616, a content-processing system 618, and data 632.


Content-processing system 618 can include instructions, which when executed by computer system 602, can cause computer system 602 to perform methods and/or processes described in this disclosure. Specifically, content-processing system 618 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 620). A data packet can include an advertisement, 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.


Further, content-processing system 618 can include instructions for receiving a first interest that indicates an originator name, wherein the originator is a routable name prefix for a sender of the first interest and is used by a content producing device in a subsequent interest (communication module 620). Content-processing system 618 can also include instructions for, in response to not obtaining a matching entry in a FIB based on the originator name (FIB-lookup module 622), adding a first entry to the FIB, wherein the first entry includes the originator name as a name for the first entry and further includes an arrival interface of the first interest as an outgoing interface for the first entry (FIB-updating module 624). Content-processing system 618 can include instructions for, in response to receiving the subsequent interest which has a name that includes the originator name (communication module 620), forwarding the subsequent interest to the outgoing interface for the first entry (communication module 620).


Content-processing system 618 can additionally include instructions for performing a lookup in the FIB based on the originator name to obtain the first entry (FIB-lookup module 622). Content-processing system 618 can include instructions for inserting routing information into a control process for a local routing algorithm, wherein the control process handles route updates from neighbor nodes, wherein the routing information is indicated in a reverse route update included in the first interest (operation DCR-processing module 626).


Content-processing system 618 can further include instructions for, in response to obtaining the matching entry in the FIB based on the originator name (FIB-lookup module 622), adding to the matching entry the arrival interface of the first interest as an outgoing interface for the matching entry (FIB-updating module 624). Content-processing system 618 can include instructions for, in response to determining that the originator name indicated in the first interest is null (interest-processing module 628), forwarding the first interest to one or more outgoing interfaces indicated in the FIB and corresponding to the name for the first interest (communication module 620). Content-processing system 618 can also include instructions for receiving the first interest in response to an advertisement of the content producing device for content under a domain of the content producing device (communication module 620).


Moreover, content-processing system 618 can include instructions for generating the subsequent interest which has a name that includes the originator name (packet-generating module 630). Content-processing system 618 can include instructions for forwarding the subsequent interest to the outgoing interface for a matching entry in the FIB (communication module 620). Content-processing system 618 can also include instructions for, in response to determining that the originator name indicated in the first interest is null, processing the first interest (interest-processing module 628). Content-processing system 618 can further include instructions for generating an advertisement for content under a domain of the content producing device (packet-generating module 630).


Data 632 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 632 can store at least: an interest; an advertisement; a content object; a name; a name that is an HSVLI that includes contiguous name components ordered from a most general level to a most specific level; a routable prefix or a name prefix that indicates one or more contiguous name components beginning from the most general level; an originator name which is a routable name prefix; an interest with a name that includes the originator name; a forwarding information base (FIB); a FIB entry; an arrival interface corresponding to a packet; a hop count; a reverse route update which indicates routing information from a neighbor node; a reverse route update for one or more name prefixes; a FIB entry with a name, a list of outgoing interfaces, a hop count, and a reverse route update; a distance to an originator or content requesting device; a pending interest table (PIT); a content store or local cache; a control process for a local routing algorithm; a route update from a neighbor node; an advertisement for content under a domain of a content producing device; an interest which does not require a responsive content object; and an interest which does not leave state in a PIT.


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 for facilitating routing updates outside of a routing protocol, the 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 an intermediate node, a first interest that indicates an originator name, 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, wherein the originator name is a routable name prefix for a sender of the first interest and is used by a content producing device in a subsequent interest;in response to not obtaining a matching entry in a forwarding information base based on the originator name, adding a first entry to the forwarding information base, wherein the first entry includes the originator name as a name for the first entry and further includes an arrival interface of the first interest as an outgoing interface for the first entry; andin response to receiving the subsequent interest which has a name that includes the originator name, forwarding the subsequent interest to the outgoing interface for the first entry,thereby facilitating the intermediate node to proactively update routing information outside of the routing protocol and based on routing information included in the first interest.
  • 2. The computer system of claim 1, wherein in response to receiving the subsequent interest, the method further comprises: performing a lookup in the forwarding information base based on the originator name to obtain the first entry.
  • 3. The computer system of claim 1, wherein the first interest includes a hop count, wherein the first entry further includes a distance to the sender as a value based on the hop count.
  • 4. The computer system of claim 1, wherein the first interest includes a reverse route update which indicates routing information from a neighbor node of the intermediate node, wherein the reverse route update is for one or more name prefixes, and wherein the method further comprises: inserting the indicated routing information into a control process for a local routing algorithm, wherein the control process handles route updates from neighbor nodes.
  • 5. The computer system of claim 1, wherein the method further comprises: in response to obtaining the matching entry in the forwarding information base based on the originator name, adding to the matching entry the arrival interface of the first interest as an outgoing interface for the matching entry.
  • 6. The computer system of claim 1, wherein the first interest has a name, and wherein the method further comprises one or more of: in response to determining that the originator name indicated in the first interest is null, forwarding the first interest to one or more outgoing interfaces indicated in the forwarding information base and corresponding to the name for the first interest; andforwarding the first interest to the one or more outgoing interfaces indicated in the forwarding information base and corresponding to the name for the first interest.
  • 7. The computer system of claim 1, wherein receiving the first interest is in response to an advertisement of the content producing device for content under a domain of the content producing device, and wherein the advertisement is an interest which does not require a responsive content object and does not leave state information in a pending interest table.
  • 8. A computer system for facilitating routing updates outside of the routing protocol, the 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 content producing device, a first interest that indicates an originator name, 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, wherein the originator name is a routable name prefix for a sender of the first interest and is used by the content producing device in a subsequent interest;in response to not obtaining a matching entry in a forwarding information base based on the originator name, adding a first entry to the forwarding information base, wherein the first entry includes the originator name as a name for the first entry and further includes an arrival interface of the first interest as an outgoing interface for the first entry;generating the subsequent interest which has a name that includes the originator name; andforwarding the subsequent interest to the outgoing interface for the first entry,thereby facilitating the content producing device to proactively update routing information outside of the routing protocol and based on routing information included in the first interest.
  • 9. The computer system of claim 8, wherein the method further comprises one or more of: in response to determining that the originator name indicated in the first interest is null, processing the first interest; andperforming a lookup in the forwarding information base based on the originator name to obtain the first entry.
  • 10. The computer system of claim 8, wherein the first interest includes a hop count, wherein the first entry further includes a distance to the sender as a value based on the hop count.
  • 11. The computer system of claim 8, wherein the first interest includes a reverse route update which indicates routing information from a neighbor node of the content producing device, wherein the reverse route update is for one or more name prefixes, and wherein the method further comprises: inserting the indicated routing information into a control process for a local routing algorithm, wherein the control process handles route updates from neighbor nodes.
  • 12. The computer system of claim 8, wherein the method further comprises: in response to obtaining the matching entry in the forwarding information base based on the originator name, adding to the matching entry the arrival interface of the first interest as an outgoing interface for the matching entry.
  • 13. The computer system of claim 8, wherein the method further comprises: generating an advertisement for content under a domain of the content producing device, wherein the advertisement is an interest which does not require a responsive content object and does not leave state information in a pending interest table, and wherein receiving the first interest is in response to generating the advertisement.
  • 14. A computer-implemented method for facilitating routing updates outside of a routing protocol, the method comprising: receiving, by an intermediate node, a first interest that indicates an originator name, 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, wherein the originator name is a routable name prefix for a sender of the first interest and is used by a content producing device in a subsequent interest;in response to not obtaining a matching entry in a forwarding information base based on the originator name, adding a first entry to the forwarding information base, wherein the first entry includes the originator name as a name for the first entry and further includes an arrival interface of the first interest as an outgoing interface for the first entry; andin response to receiving the subsequent interest which has a name that includes the originator name, forwarding the subsequent interest to the outgoing interface for the first entry,thereby facilitating the intermediate node to proactively update routing information outside of the routing protocol and based on routing information included in the first interest.
  • 15. The method of claim 14, wherein in response to receiving the subsequent interest, the method further comprises: performing a lookup in the forwarding information base based on the originator name to obtain the first entry.
  • 16. The method of claim 14, wherein the first interest includes a hop count, wherein the first entry further includes a distance to the sender as a value based on the hop count.
  • 17. The method of claim 14, wherein the first interest includes a reverse route update which indicates routing information from a neighbor node of the intermediate node, wherein the reverse route update is for one or more name prefixes, and wherein the method further comprises: inserting the indicated routing information into a control process for a local routing algorithm, wherein the control process handles route updates from neighbor nodes.
  • 18. The method of claim 14, further comprising: in response to obtaining the matching entry in the forwarding information base based on the originator name, adding to the matching entry the arrival interface of the first interest as an outgoing interface for the matching entry.
  • 19. The method of claim 14, wherein the first interest has a name, and wherein the method further comprises one or more of: in response to determining that the originator name indicated in the first interest is null, forwarding the first interest to one or more outgoing interfaces indicated in the forwarding information base and corresponding to the name for the first interest; andforwarding the first interest to the one or more outgoing interfaces indicated in the forwarding information base and corresponding to the name for the first interest.
  • 20. The method of claim 14, wherein receiving the first interest is in response to an advertisement of the content producing device for content under a domain of the content producing device, and wherein the advertisement is an interest which does not require a responsive content object and does not leave state information in a pending interest table.
US Referenced Citations (586)
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 Jul 2000 A
6091724 Chandra Jul 2000 A
6128623 Mattis Oct 2000 A
6128627 Mattis Oct 2000 A
6173364 Zenchelsky Jan 2001 B1
6209003 Mattis Mar 2001 B1
6226618 Downs May 2001 B1
6233617 Rothwein May 2001 B1
6233646 Hahm May 2001 B1
6289358 Mattis Sep 2001 B1
6292880 Mattis Sep 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
6915307 Mattis Jul 2005 B1
6917985 Madruga Jul 2005 B2
6957228 Graser Oct 2005 B1
6968393 Chen Nov 2005 B1
6981029 Menditto Dec 2005 B1
7007024 Zelenka Feb 2006 B2
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
RE39360 Aziz Oct 2006 E
7149750 Chadwick Dec 2006 B2
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
7873619 Faibish Jan 2011 B1
7908337 Garcia-Luna-Aceves Mar 2011 B2
7924837 Shabtay Apr 2011 B1
7953014 Toda May 2011 B2
7953885 Devireddy May 2011 B1
7979912 Roka Jul 2011 B1
8000267 Solis Aug 2011 B2
8010691 Kollmansberger Aug 2011 B2
8069023 Frailong Nov 2011 B1
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
9032095 Traina May 2015 B1
9071498 Beser Jun 2015 B2
9112895 Lin Aug 2015 B1
9253087 Zhang Feb 2016 B2
9280610 Gruber Mar 2016 B2
9621457 Veillette Apr 2017 B2
9729427 Fenner Aug 2017 B2
9769034 Ravindran Sep 2017 B2
9769072 Ravindran Sep 2017 B2
9769202 Smith Sep 2017 B2
9774524 D'Souza Sep 2017 B2
9781028 Ohnishi Oct 2017 B2
9819637 Roitshtein Nov 2017 B2
9819643 Rangarajan Nov 2017 B2
9838327 Ghosh Dec 2017 B1
9871691 Anand Jan 2018 B2
9871727 Cheng Jan 2018 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
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
20040233916 Takeuchi 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
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
20060242155 Moore 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
20080005223 Flake 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
20080082662 Dandliker Apr 2008 A1
20080101357 Lovanna 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
20090296719 Maier Dec 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
20110219727 May 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
20120045064 Rembarz Feb 2012 A1
20120047361 Erdmann Feb 2012 A1
20120066727 Nozoe Mar 2012 A1
20120106339 Mishra May 2012 A1
20120110159 Richardson 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
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
20130139245 Thomas 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
20130227048 Xie 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
20130332971 Fisher 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
20140237095 Petker 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
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
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
20150033365 Mellor 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
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
20150279348 Cao Oct 2015 A1
20150288755 Mosko Oct 2015 A1
20150312300 Mosko Oct 2015 A1
20150349961 Mosko Dec 2015 A1
20150372903 Hui Dec 2015 A1
20150381546 Mahadevan Dec 2015 A1
20160019275 Mosko Jan 2016 A1
20160021172 Mahadevan Jan 2016 A1
20160062840 Scott Mar 2016 A1
20160110466 Uzun Apr 2016 A1
20160171184 Solis Jun 2016 A1
20170093691 Garcia-Luna-Aceves Mar 2017 A1
20170093713 Garcia-Luna-Aceves Mar 2017 A1
20170230282 Liu Aug 2017 A1
20170289013 Haas Oct 2017 A1
20170289296 Prieditis Oct 2017 A1
20170302578 Gattani Oct 2017 A1
20170324647 Anand Nov 2017 A1
20170346689 Miller Nov 2017 A1
20180013624 Miller Jan 2018 A1
Foreign Referenced Citations (20)
Number Date Country
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
2323346 May 2011 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
2015084327 Jun 2015 WO
Non-Patent Literature Citations (160)
Entry
Jacobson, Van et al., “Content-Centric Networking, Whitepaper Describing Future Assurable Global Networks”, Palo Alto Research Center, Inc., Jan. 30, 2007, pp. 1-9.
Koponen, Teemu et al., “A Data-Oriented (and Beyond) Network Architecture”, SIGCOMM '07, Aug. 27-31, 2007, Kyoto, Japan, XP-002579021, p. 181-192.
Fall, K. et al., “DTN: an architectural retrospective”, Selected areas in communications, IEEE Journal on, vol. 28, No. 5, Jun. 1, 2008, pp. 828-835.
Gritter, M. et al., ‘An Architecture for content routing support in the Internet’, Proceedings of 3rd Usenix Symposium on Internet Technologies and Systems, 2001, pp. 37-48.
“CCNx,” http://ccnx.org/. downloaded Mar. 11, 2015.
“Content Delivery Network”, Wikipedia, Dec. 10, 2011, http://en.wikipedia.org/w/index.php?title=Content_delivery_network&oldid=465077460.
“Digital Signature” archived on Aug. 31, 2009 at http://web.archive.org/web/20090831170721/http://en.wikipedia.org/wiki/Digital_signature.
“Introducing JSON,” http://www.json.org/. downloaded Mar. 11, 2015.
“Microsoft PlayReady,” http://www.microsoft.com/playready/.downloaded Mar. 11, 2015.
“Pursuing a pub/sub internet (Pursuit),” http://www.fp7-pursuit.ew/PursuitWeb/. downloaded Mar. 11, 2015.
“The FP7 4WARD project,” http://www.4ward-project.eu/. downloaded Mar. 11, 2015.
A. Broder and A. Karlin, “Multilevel Adaptive Hashing”, Jan. 1990, pp. 43-53.
Detti, Andrea, et al. “CONET: a content centric inter-networking architecture.” Proceedings of the ACM SIGCOMM workshop on Information-centric networking. ACM, 2011.
A. Wolman, M. Voelker, N. Sharma N. Cardwell, A. Karlin, and H.M. Levy, “On the scale and performance of cooperative web proxy caching,” ACM SIGHOPS Operating Systems Review, vol. 33, No. 5, pp. 16-31, Dec. 1999.
Afanasyev, Alexander, et al. “Interest flooding attack and countermeasures in Named Data Networking.” IFIP Networking Conference, 2013. IEEE, 2013.
Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante. Drafting Behind Akamai: Inferring Network Conditions Based on CDN Redirections. IEEE/ACM Transactions on Networking {Feb. 2009).
B. Ahlgren et al., ‘A Survey of Information-centric Networking’ IEEE Commun. Magazine, Jul. 2012, pp. 26-36.
“PBC Library-Pairing-Based Cryptography-About,” http://crypto.stanford.edu/pbc. downloaded Apr. 27, 2015.
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 heal pumps. Pacific Northwest National Laboratory, 2009.
C. Gentry and A. Silverberg. Hierarchical ID-Based Cryptography. Advances in Cryptology—ASIACRYPT 2002. Springer Berlin Heidelberg (2002).
C.A. Wood and E. Uzun, “Flexible end-to-end content security in CCN,” in Proc. IEEE CCNC 2014, Las Vegas, CA, USA, Jan. 2014.
Carzaniga, Antonio, Matthew J. Rutherford, and Alexander L. Wolf. ‘A routing scheme for content-based networking.’ INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies. vol. 2. IEEE, 2004.
Cho, Jin-Hee, Ananthram Swami, and Ray Chen. “A survey on trust management for mobile ad hoc networks.” Communications Surveys & Tutorials, IEEE 13.4 (2011): 562-583.
Compagno, Alberto, et al. “Poseidon: Mitigating interest flooding DDoS attacks in named data networking.” Local Computer Networks (LCN), 2013 IEEE 38th Conference on. IEEE, 2013.
Conner, William, et al. “A trust management framework for service-oriented environments.” Proceedings of the 18th international conference on World wide web. ACM, 2009.
Content Centric Networking Project (CCN) [online], http://ccnx.org/releases/latest/doc/technical/, Downloaded Mar. 9, 2015.
Content Mediator Architecture for Content-aware Networks (COMET) Project [online], http://www.comet-project.org/, Downloaded Mar. 9, 2015.
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).
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 AJ 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.
Anteniese et al., “Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage”, 2006.
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.
Xiong et al., “CloudSeal: End-to-End Content Protection in Cloud-based Storage and Delivery Services”, 2012.
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.
https://code.google.com/p/ccnx-trace/.
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. Bethencourt, A, Sahai, and B. Waters, ‘Ciphertext-policy attribute-based encryption,’ in Proc. IEEE Security & Privacy 2007, Berkeley, CA, USA, May 2007, pp. 321-334.
J. Hur, “Improving security and efficiency in attribute-based data sharing,” IEEE Trans. Knowledge Data Eng., vol. 25, No. 10, pp. 2271-2282, Oct. 2013.
J. Shao and Z. Cao. CCA-Secure Proxy Re-Encryption without Pairings. Public Key Cryptography. Springer Lecture Notes in Computer ScienceVolume 5443 (2009).
V. Jacobson et al., ‘Networking Named Content,’ Proc. IEEE CoNEXT '09, Dec. 2009.
Jacobson, Van et al. ‘VoCCN: Voice Over Content-Centric Networks.’ Dec. 1, 2009. ACM ReArch'09.
Jacobson et al., “Custodian-Based Information Sharing,” Jul. 2012, IEEE Communications Magazine: vol. 50 Issue 7 (p. 3843).
Ji, Kun, et al. “Prognostics enabled resilient control for model-based building automation systems.” Proceedings of the 12th Conference of International Building Performance Simulation Association. 2011.
K. Liang, L. Fang, W. Susilo, and D.S. Wong, “A Ciphertext-policy attribute-based proxy re-encryption with chosen-ciphertext security,” in Proc. INCoS 2013, Xian, China, Sep. 2013, pp. 552-559.
Katipamula, Srinivas, and Michael R. Brambley. “Review article: methods for fault detection, diagnostics, and prognostics for building systemsa review, Part I.” HVAC&R Research 11.1 (2005): 3-25.
Katipamula, Srinivas, and Michael R. Brambley. “Review article: methods for fault detection, diagnostics, and prognostics for building systemsa review, Part II.” HVAC&R Research 11.2 (2005): 169-187.
L. Wang et al., ‘OSPFN: An OSPF Based Routing Protocol for Named Data Networking,’ Technical Report NDN-0003, 2012.
L. Zhou, V. Varadharajan, and M. Hitchens, “Achieving secure role-based access control on encrypted data in cloud storage,” IEEE Trans. Inf. Forensics Security, vol. 8, No. 12, pp. 1947-1960, Dec. 2013.
Li, Wenjia, Anupam Joshi, and Tim Finin. “Coping with node misbehaviors in ad hoc networks: A multi-dimensional trust management approach.” Mobile Data Management (MDM), 2010 Eleventh International Conference on. IEEE, 2010.
Lopez, Javier, et al. “Trust management systems for wireless sensor networks: Best practices.” Computer Communications 33.9 (2010): 1086-1093.
Gopal et al. “Integrating content-based Mechanisms with hierarchical File systems”, Feb. 1999, University of Arizona, 15 pages.
M. Green and G. Ateniese, “Identity-based proxy re-encryption,” in Proc. ACNS 2007, Zhuhai, China, Jun. 2007, pp. 288-306.
M. Ion, J. Zhang, and E.M. Schooler, “Toward content-centric privacy in ICN: Attribute-based encryption and routing,” in Proc. ACM SIGCOMM ICN 2013, Hong Kong, China, Aug. 2013, pp. 39-40.
M. Naor and B. Pinkas “Efficient trace and revoke schemes,” in Proc. FC 2000, Anguilla, British West Indies, Feb. 2000, pp. 1-20.
M. Nystrom, S. Parkinson, A. Rusch, and M. Scott, “PKCS#12: Personal information exchange syntax v. 1.1,” IETF RFC 7292, K. Moriarty, Ed., Jul. 2014.
M. Parsa and J.J. Garcia-Luna-Aceves, “A Protocol for Scalable Loop-free Multicast Routing.” IEEE JSAC, Apr. 1997.
M. Walfish, H. Balakrishnan, and S. Shenker, “Untangling the web from DNS,” in Proc. USENIX NSDI 2004, Oct. 2010, pp. 735-737.
Mahadevan, Priya, et al. “Orbis: rescaling degree correlations to generate annotated internet topologies.” ACM SIGCOMM Computer Communication Review. vol. 37. No. 4. ACM, 2007.
Mahadevan, Priya, et al. “Systematic topology analysis and generation using degree correlations.” ACM SIGCOMM Computer Communication Review. vol. 36. No. 4. ACM, 2006.
Matocha, Jeff, and Tracy Camp. ‘A taxonomy of distributed termination detection algorithms.’ Journal of Systems and Software 43.3 (1998): 207-221.
Matteo Varvello et al., “Caesar: A Content Router for High Speed Forwarding”, ICN 2012, Second Edition on Information-Centric Networking, New York, Aug. 2012.
McWilliams, Jennifer A., and Iain S. Walker. “Home Energy Article: A Systems Approach to Retrofitting Residential HVAC Systems.” Lawrence Berkeley National Laboratory (2005).
Merindol et al., “An efficient algorithm to enable path diversity in link state routing networks”, Jan. 10, Computer Networks 55 (2011), pp. 1132-1140.
Mobility First Project [online], http://mobilityfirst.winlab.rutgers.edu/, Downloaded Mar. 9, 2015.
Narasimhan, Sriram, and Lee Brownston. “HyDE-A General Framework for Stochastic and Hybrid Modelbased Diagnosis.” Proc. DX 7 (2007): 162-169.
NDN Project [online], http://www.named-data.net/, Downloaded Mar. 9, 2015.
Omar, Mawloud, Yacine Challal, and Abdelmadjid Bouabdallah. “Certification-based trust models in mobile ad hoc networks: A survey and taxonomy.” Journal of Network and Computer Applications 35.1 (2012): 268-286.
P. Mahadevan, E.Uzun, S. Sevilla, and J. Garcia-Luna-Aceves, “CCN-krs: A key resolution service for CCN,” in Proceedings of the 1st International Conference on Information-centric Networking, Ser. INC 14 New York, NY, USA: ACM, 2014, pp. 97-106. [Online]. Available: http://doi.acm.org/10.1145/2660129.2660154.
R. H. Deng, J. Weng, S. Liu, and K. Chen. Chosen-Ciphertext Secure Proxy Re-Encryption without Pairings. CANS. Spring Lecture Notes in Computer Science vol. 5339 (2008).
Rosenberg, J. “Interactive Connectivity Establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal for Offer/Answer Protocols”, Apr. 2010, pp. 1-117.
S. Chow, J. Weng, Y. Yang, and R. Deng. Efficient Unidirectional Proxy Re-Encryption. Progress in Cryptology—AFRICACRYPT 2010. Springer Berlin Heidelberg (2010).
S. Deering, “Multicast Routing in Internetworks and Extended LANs,” Proc. ACM SIGCOMM '88, Aug. 1988.
S. Deering et al., “The PIM architecture for wide-area multicast routing,” IEEE/ACM Trans, on Networking, vol. 4, No. 2, Apr. 1996.
S. Jahid, P. Mittal, and N. Borisov, “EASiER: Encryption-based access control in social network with efficient revocation,” in Proc. ACM ASIACCS 2011, Hong Kong, China, Mar. 2011, pp. 411-415.
S. Kamara and K. Lauter, “Cryptographic cloud storage,” in Proc. FC 2010, Tenerife, Canary Islands, Spain, Jan. 2010, pp. 136-149.
S. Kumar et al. “Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking,” 2008, pp. 556-564.
S. Misra, R. Tourani, and N.E. Majd, “Secure content delivery in information-centric networks: Design, implementation, and analyses,” in Proc. ACM SIGCOMM ICN 2013, Hong Kong, China, Aug. 2013, pp. 73-78.
S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving secure, scalable, and fine-grained data access control in cloud computing,” in Proc. IEEE INFOCOM 2010, San Diego, CA, USA, Mar. 2010, pp. 1-9.
S.J. Lee, M. Gerla, and C. Chiang, “On-demand Multicast Routing Protocol in Multihop Wireless Mobile Networks,” Mobile Networks and Applications, vol. 7, No. 6, 2002.
Sandvine, Global Internet Phenomena Report—Spring 2012. Located online at http://www.sandvine.com/downloads/ documents/Phenomenal H 2012/Sandvine Global Internet Phenomena Report 1H 2012.pdf.
Scalable and Adaptive Internet Solutions (SAIL) Project [online], http://sail-project.eu/ Downloaded Mar. 9, 2015.
Schein, Jeffrey, and Steven T. Bushby. A Simulation Study of a Hierarchical, Rule-Based Method for System-Level Fault Detection and Diagnostics in HVAC Systems. US Department of Commerce,[Technology Administration], National Institute of Standards and Technology, 2005.
Shani, Guy, Joelle Pineau, and Robert Kaplow. “A survey of point-based POMDP solvers.” Autonomous Agents and Multi-Agent Systems 27.1 (2013): 1-51.
Sheppard, John W., and Stephyn GW Butcher. “A formal analysis of fault diagnosis with d-matrices.” Journal of Electronic Testing 23.4 (2007): 309-322.
Shih, Eugene et al., ‘Wake on Wireless: an Event Driven Energy Saving Strategy for Battery Operated Devices’, Sep. 23, 2002, pp. 160-171.
Shneyderman, Alex et al., ‘Mobile VPN: Delivering Advanced Services in Next Generation Wireless Systems’, Jan. 1, 2003, pp. 3-29.
Solis, Ignacio, and J. J. Garcia-Luna-Aceves. ‘Robust content dissemination in disrupted environments.’ proceedings of the third ACM workshop on Challenged networks. ACM, 2008.
Sun, Ying, and Daniel S. Weld. “A framework for model-based repair.” AAAI. 1993.
T. Ballardie, P. Francis, and J. Crowcroft, “Core Based Trees (CBT),” Proc. ACM SIGCOMM '88, Aug. 1988.
T. Dierts, “The transport layer security (TLS) protocol version 1.2,” IETF RFC 5246, 2008.
T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K.H. Kim, S. Shenker, and I. Stoica, ‘A data-oriented (and beyond) network architecture,’ ACM SIGCOMM Computer Communication Review, vol. 37, No. 4, pp. 181-192, Oct. 2007.
The Despotify Project (2012). Available online at http://despotify.sourceforge.net/.
V. Goyal, 0. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in Proc. ACM CCS 2006, Alexandria, VA, USA, Oct.-Nov. 2006, pp. 89-98.
V. Jacobson, D.K. Smetters, J.D. Thornton, M.F. Plass, N.H. Briggs, and R.L. Braynard, ‘Networking named content,’ in Proc. ACM CoNEXT 2009, Rome, Italy, Dec. 2009, pp. 1-12.
V. K. Adhikari, S. Jain, Y. Chen, and Z.-L. Zhang. Vivisecting Youtube:An Active Measurement Study. In INFOCOM12 Mini-conference (2012).
Verma, Vandi, Joquin Fernandez, and Reid Simmons. “Probabilistic models for monitoring and fault diagnosis.” The Second IARP and IEEE/RAS Joint Workshop on Technical Challenges for Dependable Robots in Human Environments. Ed. Raja Chatila. Oct. 2002.
Vijay Kumar Adhikari, Yang Guo, Fang Hao, Matteo Varvello, Volker Hilt, Moritz Steiner, and Zhi-Li Zhang. Unreeling Netflix: Understanding and Improving Multi-CDN Movie Delivery. In the Proceedings of IEEE INFOCOM 2012 (2012).
Vutukury, Srinivas, and J. J. Garcia-Luna-Aceves. A simple approximation to minimum-delay routing. vol. 29. No. 4. ACM, 1999.
W.-G. Tzeng and Z.-J. Tzeng, “A public-key traitor tracing scheme with revocation using dynamic shares,” in Proc. PKC 2001, Cheju Island, Korea, Feb. 2001, pp. 207-224.
Waldvogel, Marcel “Fast Longest Prefix Matching: Algorithms, Analysis, and Applications”, A dissertation submitted to the Swiss Federal Institute of Technology Zurich, 2002.
Walker, Iain S. Best practices guide for residential HVAC Retrofits. No. LBNL-53592. Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US), 2003.
Wang, Jiangzhe et al., “DMND: Collecting Data from Mobiles Using Named Data”, Vehicular Networking Conference, 2010 IEEE, pp. 49-56.
Xylomenos, George, et al. “A survey of information-centric networking research.” Communications Surveys & Tutorials, IEEE 16.2 (2014): 1024-1049.
Yi, Cheng, et al. ‘A case for stateful forwarding plane.’ Computer Communications 36.7 (2013): 779-791.
Yi, Cheng, et al. ‘Adaptive forwarding in named data networking.’ ACM SIGCOMM computer communication review 42.3 (2012): 62-67.
Zahariadis, Theodore, et al. “Trust management in wireless sensor networks.” European Transactions on Telecommunications 21.4 (2010): 386-395.
Zhang, et al., “Named Data Networking (NDN) Project”, http://www.parc.com/publication/2709/named-data-networking-ndn-project.html, Oct. 2010, NDN-0001, PARC Tech Report.
Zhang, Lixia, et al. ‘Named data networking.’ ACM SIGCOMM Computer Communication Review 44.3 {2014): 66-73.
J. Lotspiech, S. Nusser, and F. Pestoni. Anonymous Trust: Digit.
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. Kamara and K. Lauter. Cryptographic Cloud Storage. Financial Cryptography and Data Security. Springer Berlin Heidelberg (2010).
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. 3, 2011 (Jul. 3, 2011), pp. 1-6.
Garnepudi Parimala et al “Proactive, reactive and hybrid multicast routing protocols for Wireless Mesh Networks”, 2013 IEEE International Conference on Computational Intelligence and Computing Research, IEEE, Dec. 26, 2013, pp. 1-7.
Tiancheng Zhuang et al. “Managing Ad Hoc Networks of Smartphones”, International Journal of Information and Education Technology, Oct. 1, 2013.
Amadeo et al. “Design and Analysis of a Transport-Level Solution for Content-Centric VANETs”, University “Mediterranea” of Reggio Calabria, Jun. 15, 2013.
Marc Mosko: “CCNx 1.0 Protocol Introduction” Apr. 2, 2014 [Retrieved from the Internet Jun. 8, 2016] http://www.ccnx.org/pubs/hhg/1.1%20CCNx%201.0%20Protocor%20Introduction.pdf *paragraphs [01.3], [002], [02.1], [0003].
Akash Baid et al: “Comparing alternative approaches for networking of named objects in the future Internet”, Computer Communications Workshops (Infocom Wkshps), 2012 IEEE Conference on, IEEE, Mar. 25, 2012, pp. 298-303, *Paragraph [002]* *figure 1*.
Priya Mahadevan: “CCNx 1.0 Tutorial”, Mar. 16, 2014, pp. 1-11, Retrieved from the Internet: http://www.ccnx.org/pubs/hhg/1.2%20CCNx%201.0%20Tutorial.pdf [retrieved on Jun. 8, 2016] *paragraphs [003]—[006], [0011], [0013]* *figures 1,2*.
Marc Mosko et al “All-In-One Streams for Content Centric Networks”, May 24, 2015, retrieved from the Internet: http://www.ccnx.org/pubs/AllinOne.pdf [downloaded Jun. 9, 2016] *the whole document*.
Cesar Ghali et al. “Elements of Trust in Named-Data Networking”, Feb. 13, 2014 Retrieved from the internet Jun. 17, 2016 http://arxiv.org/pdf/1402.3332v5.pdf *p. 5, col. 1* *p. 2, col. 1-2* * Section 4.1; p. 4, col. 2* *Section 4.2; p. 4, col. 2*.
Priya Mahadevan et al. “CCN-KRS”, Proceedings of the 1st International Conference on Information-Centric Networking, Inc. '14, Sep. 24, 2014.
Flavio Roberto Santos Et al. “Funnel: Choking Polluters in BitTorrent File Sharing Communities”, IEEE Transactions on Network and Service Management, IEEE vol. 8, No. 4, Dec. 1, 2011.
Related Publications (1)
Number Date Country
20180013661 A1 Jan 2018 US