A first network device obtains a first route, where the first route includes a first route prefix. The first network device advertises a second route, where the second route includes a subnet prefix and a path identifier, and a range of the subnet prefix includes a range of the first route prefix.

Approaches, techniques, and mechanisms are disclosed for maintaining efficient representations of prefix tables for utilization by network switches and other devices. In an embodiment, the performance of a network device is greatly enhanced using a working representation of a prefix table that includes multiple stages of prefix entries. Higher-stage prefixes are stored in slotted pools. Mapping logic, such as a hash function, determines the slots in which a given higher-stage prefix may be stored. When trying to find a longest-matching higher-stage prefix for an input key, only the slots that map to that input key need be read. Higher-stage prefixes may further point to arrays of lower-stage prefixes. Hence, once a longest-matching higher-stage prefix is found for an input key, the longest prefix match in the table may be found simply by comparing the input key to lower-stage prefixes in the array that the longest-matching higher-stage prefix points to.

Approaches, techniques, and mechanisms are disclosed for maintaining efficient representations of prefix tables for utilization by network switches and other devices. In an embodiment, the performance of a network device is greatly enhanced using a working representation of a prefix table that includes multiple stages of prefix entries. Higher-stage prefixes are stored in slotted pools. Mapping logic, such as a hash function, determines the slots in which a given higher-stage prefix may be stored. When trying to find a longest-matching higher-stage prefix for an input key, only the slots that map to that input key need be read. Higher-stage prefixes may further point to arrays of lower-stage prefixes. Hence, once a longest-matching higher-stage prefix is found for an input key, the longest prefix match in the table may be found simply by comparing the input key to lower-stage prefixes in the array that the longest-matching higher-stage prefix points to.

One embodiment provides a system for facilitating efficient communication of an interest group packet indicating a collection of interests. During operation, the system receives, by an intermediate node, a first packet which has a name and indicates a set of member interests, wherein a member interest has a 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. In response to obtaining a content object which satisfies a member interest, the system removes the indicated member interest from the first packet. The system adds an entry in a pending interest table for the first packet, wherein the entry indicates the name for the first packet, the name for each member interest, and an indicator of whether each member interest is satisfied. The system transmits the first packet to another node.

An entry generation method, a packet sending method, a device, and a system resolve a problem that a high requirement on a processing capability of a network device is imposed in a conventional technology, which brings high pressure to an operator. The packet sending method includes: A first network device receives a first packet, where a destination address of the first packet includes a first identifier, the first network device and a destination device of the first packet belong to a same AS, and the first identifier includes one or more of the following: an area identifier corresponding to the destination device or an access device identifier corresponding to the destination device. The first network device determines a first egress based on the first identifier, and sends the first packet via the first egress.

An entry generation method, a packet sending method, a device, and a system resolve a problem that a high requirement on a processing capability of a network device is imposed in a conventional technology, which brings high pressure to an operator. The packet sending method includes: A first network device receives a first packet, where a destination address of the first packet includes a first identifier, the first network device and a destination device of the first packet belong to a same AS, and the first identifier includes one or more of the following: an area identifier corresponding to the destination device or an access device identifier corresponding to the destination device. The first network device determines a first egress based on the first identifier, and sends the first packet via the first egress.

Aspects of the disclosure are directed to systems, network nodes, and methods performed in a network node. A network node can host a TCP/ICN proxy for routing TCP packets through an ICN network. The network node can serve as a forward proxy or a reverse proxy. As a forward proxy, the network node can receive a first packet at the network node, the first packet compliant with a Transmission Control Protocol (TCP) protocol; encapsulate one or more TCP headers from the first packet into a payload field of a second packet, the second packet compliant with an Information Centric Networking (ICN) protocol; and transmit the second packet to a destination through an ICN network. As a reverse proxy, the network node can receive an ICN packet from an ICN network, decapsulate the ICN packet to its TCP components, and transmit the TCP packet through a TCP network.

A routing table is represented as a binary search tree ordered by prefix lengths. Markers are placed to guide accessing nodes in designated subtrees to search for a longest prefix match with destination addresses of data packet. Destination descendant nodes in remote hierarchical levels of the tree are associated with the markers. The traversal of the binary search tree is conducted by accessing the respective destination descendant nodes while avoiding accessing nodes in intermediate hierarchical levels. The packet is processed using the longest prefix match.

Techniques for dynamically adapting a router capacity to system needs in a network. The border router may receive a list of summarized prefixes for endpoint devices associated with the router from control-plane nodes. The router may store the list of summarized prefixes in memory of the border router. Once the router receives traffic that is destined for endpoint devices associated with the border router, it may determine that the destination address is included in the summarized prefixes. In some examples, the router may download complete prefixes from the control-plane nodes, and forward the traffic to the destination address indicated by the complete prefixes.

Techniques for dynamically adapting a router capacity to system needs in a network. The border router may receive a list of summarized prefixes for endpoint devices associated with the router from control-plane nodes. The router may store the list of summarized prefixes in memory of the border router. Once the router receives traffic that is destined for endpoint devices associated with the border router, it may determine that the destination address is included in the summarized prefixes. In some examples, the router may download complete prefixes from the control-plane nodes, and forward the traffic to the destination address indicated by the complete prefixes.