Abstract: One embodiment provides a system that facilitates a flexible strategy for matching content objects and interests. During operation, the system receives, by a computing device, an interest which includes a set of attributes, wherein a respective attribute has one or more values. In response to not obtaining a matching entry for the interest in a pending interest table, the system adds to the pending interest table a first entry which indicates the interest based on the attributes and their values. The system determines whether a received content object satisfies the interest indicated in the first entry based on the attributes of the first entry and attributes of the content object. In response to determining that the content object satisfies the interest, the system forwards the content object, thereby facilitating a flexible strategy for matching content objects to interests.

Abstract: A network-configuring system creates stable virtual interfaces for groups of neighboring network nodes. During operation, the system can obtain network-neighborhood information from one or more network neighbors. This network-neighborhood information includes duplex-neighborhood information that indicates at least a set of neighboring devices to the network neighbor, and a set of remote network nodes which are accessible via a respective neighbor. The system can use the network-neighborhood information to determine one or more groups of network neighbors with common network characteristics, such that a respective group includes one or more mutually-connected network peers. The system can then define a virtual interface for a respective group of stable network neighbors, such that the virtual interface's member nodes include the local network node and the respective group's mutually-connected network peers.

Abstract: One embodiment provides a system that facilitates content negotiation in a content centric network. During operation, the system receives, by a content producing device, a packet that corresponds to a first interest, wherein an encoded name for the interest indicates a plurality of qualifiers for acceptable types of requested content, and wherein a name is a hierarchically structured variable length identifier which comprises contiguous name components. The system generates a first content object that satisfies one of the indicated plurality of qualifiers, wherein a name for the content object is the encoded name, and wherein a content object indicates data and a content type corresponding to the satisfied qualifier.

Abstract: One embodiment provides a system that facilitates querying of historical network information. During operation, the system generates a query for historical information associated with interest and content object packets, wherein a name for an interest is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level, wherein the query is based on a name prefix that includes one or more contiguous name components. The system transmits the query to a responding entity. In response to receiving the historical information from the responding entity, the system performs an operation that increases network efficiency based on the historical information, thereby facilitating a protocol for querying the historical information to increase network efficiency.

Abstract: A computer-implemented method includes: receiving an interest of an object in a network; obtaining a stack requirement for a protocol stack, wherein the stack requirement specifies at least a functionality for a stack component; selecting the stack component, based on the functionality and at least a name prefix of the interest or the object; and instantiating the stack component in the protocol stack.

Abstract: One embodiment of the present invention provides a system for assembling a single content stream that enables downloading of a content collection using the single content stream over a network. During operation, the system obtains the content collection that includes a plurality of content components, and generates a manifest for the content collection. A respective entry in the manifest corresponds to a content component. The system assembles the single content stream by including the manifest followed by the plurality of content components. The manifest and the content components are packaged into objects under a same namespace, thereby facilitating a requester requesting one or more content components within the content collection using interests under the same namespace.

Abstract: A computer system can compress or decompress a type-length-value (TLV) component in a message. During operation, the computer can select a compression table associated with a network interface used to send and/or to receive the message, and can search the compression table for an entry that includes a prefix of a value from type-length-value (TLV) component being compressed or decompressed. If compressing the message, the computer may generate a compressed block that corresponds to a compressed version of the TLV component, such that the compressed block includes the compression encoding in place of the prefix in the TLV component's value. The computer can also generate a compressed message that includes the compressed block in place of the TLV component, without a compression table.

Abstract: One embodiment provides a system that facilitates forwarding of packets with variable length names. During operation, the system receives a packet with a hierarchically structured variable length identifier (HSVLI) which comprises contiguous name components ordered from a most general level to a most specific level. The system performs a longest prefix match lookup by selecting an entry from a first data structure of entries. The entries indicate a name component, forwarding information for the name component, and a plurality of entry identifiers that chain an entry to another entry. If a size of the name component is less than or equal to a predetermined threshold, the system selects an entry based on the name component. If the size is greater, the system selects an entry based on a compressed key which can be a hash of the name component. The system also resolves collisions associated with the selected entry.

Abstract: An object-forwarding device can block a malicious Content Object from being inserted into an Interest's reverse path over a named data network. During operation, the device can receive a Content Object via a first interface, and can perform a lookup operation in a Pending Interest Table (PIT) to identify a PIT entry for an Interest associated with the Content Object. The device then determines, from the PIT entry, an egress interface used to forward the Interest. If the device determines that the egress interface of the PIT entry matches the first interface for the Content Object, the device forwards the Content Object via a return interface specified in the PIT entry. On the other hand, if the egress interface of the PIT entry does not match the first interface for the Content Object, the device can block the Content Object.

Abstract: A network-configuring system creates stable virtual interfaces for groups of neighboring network nodes. During operation, the system can obtain network-neighborhood information from one or more network neighbors. This network-neighborhood information includes duplex-neighborhood information that indicates at least a set of neighboring devices to the network neighbor, and a set of remote network nodes which are accessible via a respective neighbor. The system can use the network-neighborhood information to determine one or more groups of network neighbors with common network characteristics, such that a respective group includes one or more mutually-connected network peers. The system can then define a virtual interface for a respective group of stable network neighbors, such that the virtual interface's member nodes include the local network node and the respective group's mutually-connected network peers.

Abstract: One embodiment provides a system that facilitates querying of historical network information. During operation, the system generates a query for historical information associated with interest and content object packets, wherein a name for an interest is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level, wherein the query is based on a name prefix that includes one or more contiguous name components. The system transmits the query to a responding entity. In response to receiving the historical information from the responding entity, the system performs an operation that increases network efficiency based on the historical information, thereby facilitating a protocol for querying the historical information to increase network efficiency.

Abstract: One embodiment of the present invention provides a system for retrieving a content collection over a network. During operation, the system determines additional information associated with the piece of content that is needed for consumption of the content collection; generates a plurality of Interests, which includes at least one Interest for a catalog of the content collection and at least one Interest for the additional information; and forwards, concurrently, the plurality of Interests, thereby facilitating parallel retrieval of the content collection and the additional information.

Abstract: The disclosed embodiments provide a system for performing network routing using a publish-subscribe messaging system. During operation, a node in the system detects a first change in reachability within the network. Next, the node generates a first message comprising the first change for receipt by other nodes in the network through a publish-subscribe messaging system. The node then transmits the first message to the publish-subscribe messaging system. Another node receives the first message, updates a routing database at the other node to reflect the first change, and uses the updated routing database to process network traffic.

Abstract: One embodiment provides a system that facilitates efficient aggregation of multiple interest messages for the same content from multiple predecessors. During operation, an intermediate node receives a first interest message from a predecessor node. The first interest indicates a name for a content object and a lifetime associated with the first interest. The intermediate node identifies an entry in a pending interest table that corresponds to the first interest and determines that the entry has not expired. The intermediate node determines whether a second interest message which indicates a same content object name as the first interest message has been received from the predecessor node. If so, it forwards the first interest. If not, it adds information associated with the predecessor node to the entry. The intermediate node determines a predecessor lifetime associated with the entry and also determines a maximum lifetime associated with the entry.

Abstract: A network-configuring system creates stable virtual interfaces for groups of neighboring network nodes. During operation, the system can obtain network-neighborhood information from one or more network neighbors. This network-neighborhood information includes duplex-neighborhood information that indicates at least a set of neighboring devices to the network neighbor, and a set of remote network nodes which are accessible via a respective neighbor. The system can use the network-neighborhood information to determine one or more groups of network neighbors with common network characteristics, such that a respective group includes one or more mutually-connected network peers. The system can then define a virtual interface for a respective group of stable network neighbors, such that the virtual interface's member nodes include the local network node and the respective group's mutually-connected network peers.

Abstract: A storage system facilitates deduping repeating data segments when generating a Manifest hierarchy for a file. During operation, the system can select a partitioning function that identifies a pattern that is expected to occur a predetermined number of times within the file. The system can process a plurality of segments of the file, using the partitioning function, to identify a set of chunk boundaries. The system generates a chunk for each file portion between two consecutive chunk boundaries, and generates a Manifest that includes a Content Object Hash (COH) value for each partitioned chunk. The system can store the Manifest and the unique partitioned chunks in a storage repository, such that two partitioned chunks with a common COH value are stored once in the storage repository.

Abstract: One embodiment provides a system that facilitates collection of historical network information. During operation, the system monitors a plurality of packets which include outgoing interests and corresponding incoming content objects, wherein a name for an interest is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level. The system collects historical information associated with the packets based on name prefixes of the packets, wherein a name prefix includes one or more contiguous name components. In response to receiving a query from a requesting entity for the historical information, the system transmits the historical information, thereby facilitating the requesting entity to use the historical information to increase network efficiency.

Abstract: One embodiment provides a system that facilitates querying of historical network information. During operation, the system generates a query for historical information associated with interest and content object packets, wherein a name for an interest is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level, wherein the query is based on a name prefix that includes one or more contiguous name components. The system transmits the query to a responding entity. In response to receiving the historical information from the responding entity, the system performs an operation that increases network efficiency based on the historical information, thereby facilitating a protocol for querying the historical information to increase network efficiency.

Abstract: One embodiment provides a system that facilitates an efficient transport protocol. During operation, the system receives a first interest which indicates a query for optimal transport parameters, wherein a name for an interest is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level, wherein the query is based on a name prefix that includes one or more contiguous name components. The system computes the optimal parameters based on historical information associated with the name prefix. The system transmits a first response which includes the computed optimal parameters to a requesting entity, thereby facilitating a transport protocol which increases network efficiency.

Abstract: A computer system can compress or decompress a type-length-value (TLV) component in a message. During operation, the computer can select a compression table associated with a network interface used to send and/or to receive the message, and can search the compression table for an entry that includes a prefix of a value from type-length-value (TLV) component being compressed or decompressed. If compressing the message, the computer may generate a compressed block that corresponds to a compressed version of the TLV component, such that the compressed block includes the compression encoding in place of the prefix in the TLV component's value. The computer can also generate a compressed message that includes the compressed block in place of the TLV component, without a compression table.