A network device includes a forwarding information base (FIB). The FIB includes a first number of entries and a default entry. The network device includes a routing information base that includes a second number of entries. The network device includes a FIB entry optimizer that ranks a first portion of the second number of entries based on access information of the first number of entries; ranks a second portion of the second number of entries based on access information of the default entry; and updates at least one entry of the FIB based on the ranks of the first portion of the second number of entries and the ranks of the second portion of the second number of entries. The first number of entries is less than the second number of entries.

Systems, methods, and non-transitory computer-readable storage media for performing hierarchical routing are disclosed. The method includes identifying routes in a computer network and arranging those routes in two separate routing tables. The first routing table is stored on a first module and the second routing table is stored on a second module.

In general, the invention relates to a method for programming a network element. The method includes detecting an addition of a first route in a routing information base (RIB) on the network element, adding, in response to detecting the addition, a first route network prefix associated with the first route to a network prefix trie (NPT), identifying, based on the adding, a first parent network prefix for the first route network prefix using the NPT, making a first determination that the first route network prefix and the first parent network prefix are reachable via a first common next hop connected to the network element, and waiving, based on the first determination, a creation of a forwarding information base (FIB) entry associated with the first route network prefix in a FIB on the network element.

In one example, a method includes receiving, by a first network device via a routing protocol peering session with a peer router in a first autonomous system, a plurality of routing protocol routes to destination addresses, each routing protocol route specifying a network address prefix and an identifier of the autonomous system that originated the routing protocol route; receiving network address prefix ownership information from a distributed ledger storing a plurality of associations between respective network address prefixes and respective autonomous system identifiers of autonomous systems confirmed to own the respective network address prefixes; determining, based at least on the prefix ownership information, whether any of the plurality of routing protocol routes specifies an autonomous system identifier different than specified by the associations; and in response to determining that one of the routes specifies an autonomous system identifier different than specified by the plurality of associations, performing an action.

A routing protocol, the routing protocol includes the steps of: receiving a packet at an ingress node of a distributed router, the ingress node having an ingress node address, and the packet having a packet header containing a global destination address; converting the global destination address into a local destination address, the local destination address identifying a location on the distributed router; and routing the packet to the local destination address. A distributed router includes a plurality of internal network nodes, the plurality of internal network nodes including an ingress node configured to receive a packet, the ingress node having an ingress node address, and the packet having a packet header containing a global destination address for that packet; means for converting the global destination address into a local destination address, the local destination address identifying a location on the distributed router; and a routing engine configured to route the packet to the local destination address.

Methods and apparatus for routing data packets in a communications network, such as a packet-switched network (e.g. an IP network). Instead of, or in addition to, conventional routing techniques such as longest prefix matching, the disclosure provides a method by which a network node can determine whether to defer transmission of a particular data packet based on geographical location and velocity data. Particularly for data that can tolerate high latency, this will serve to reduce consumption of network resources without adversely impacting user experience.

A method is disclosed. The method includes: obtaining, by an authoritative directory router in an information centric network (ICN), a publish message associated with a publisher node and including: an identifier associated with a content item; and a first anchor prefix for a first anchor directory router for the publisher node; determining that a bidirectional code for the identifier falls within an authoritative code range assigned to the authoritative directory router; and updating, in response to the bidirectional code falling within the authoritative code range, a local code repository associated with the authoritative directory router with the first anchor prefix and the identifier.

A method and apparatus of a device that determines a match for a destination address using an exact match table and a longest prefix match table of a network element is described. In an exemplary embodiment, the network element receives a data packet that includes a destination address. The network element generates a key for the destination address, wherein the key represents more addresses than the destination address. The network element further performs an address lookup using the key in an exact match table. Furthermore, a match in the address lookup indicates a first transmitting interface of the network element. The network element additionally performs an address lookup using the destination address with a longest prefix match table, wherein a match in the address lookup indicates a second transmitting interface of the network element. In addition, the network element determines a resulting transmitting interface based on results from the exact match table address lookup and the longest prefix match address lookup. The network element forwards the data packet using the transmitting interface.

In an example, a method of routing management is provided, wherein the method applied in a device for forwarding packet, which includes a main control board, fabric boards and line cards. The main control board may transmit routing entries to one or multiple fabric boards in the device according to a preset entry distribution strategy, transmit routing distribution information for indicating correspondence between each fabric board and a packet character of the routing entries stored in the fabric board to each of the line cards, so that the line card transmits a packet matching the packet character to a corresponding fabric board to be forwarded, according to the routing distribution information.

An address resolution system a host device, a first networking device, and a second networking device that is coupled to the host device and the first networking device. The second networking device is configured to send a first address resolution communication to the first networking device. The second networking device may then receive a second address resolution communication from the first networking device in response to the first address resolution communication. The second address resolution communication includes networking device identification data that identifies the first networking device as having a networking type. The second networking device may then allocate, in an address resolution database in response to the networking device identification data identifying the first networking device as having the networking type, a first address resolution entry for the first networking device that includes an egress object.