H04L12/745

COMMUNICATION BETWEEN DISTINCT NETWORK DOMAINS
20170279710 · 2017-09-28 · ·

A system may include a first border network device located between a first network domain and a third network domain, and a first edge network device in the first network domain, where the first edge network device may be configured to receive a packet. The packet may be directed to a second edge network device in a second network domain. The first edge network device may also be configured to add a second label to the packet that identifies a second border network device located at the border of a second network domain and the third network domain. The third network domain may be located between the first network domain and the second network domain. The first edge network device may additionally be configured to add a first label to the packet that identifies the first border network device, and route the packet to the first border network device.

Efficient longest prefix matching techniques for network devices

A network address associated with a packet is obtained at a search engine of a network device. The search engine includes a plurality of Bloom filters that represent prefixes of respective lengths in the routing table. Respective Bloom filters are applied to respective prefixes of the network address to determine a set of one or more prefixes for which a match potentially exists in the routing table. A number of accesses to the memory are performed using prefixes in set of prefixes, beginning with a longest prefix and continuing in decreasing order of prefix lengths until a matching entry is found in the routing table, and routing information for the packet is retrieved. If the number of performed memory accesses exceeds a threshold, the routing table is adapted to reduce a number of memory accesses to be performed for subsequent packets associated with the network address.

SYSTEM AND METHOD FOR ROUTING PACKETS IN A STATELESS CONTENT CENTRIC NETWORK
20170324662 · 2017-11-09 · ·

A gateway router can receive an Interest that includes a location-independent name for a data collection. If the Interest does not include an Anchor Identifier, the gateway router can perform a lookup operation in a name-prefix forwarding-information base (NP-FIB) to select an Anchor Identifier for a target anchor node, and to select an interface for forwarding the Interest toward the anchor. The router can update the Interest to include the Anchor Identifier prior to forwarding the Interest via the interface. An edge or core router that receives the Interest can perform a lookup in a routing table using the Interest's Anonymous Identifier (AID) to obtain an interface toward the anchor node and a second AID that is to be used by the next-hop neighbor to process the Interest. The router may then update the Interest to replace the Interest's AID with the second AID prior to forwarding the Interest.

NETWORK TRAFFIC FLOODING FOR UNKNOWN DATA-LINK TO TRANSPORT MAPPING SCENARIOS
20210409293 · 2021-12-30 ·

A method and network device for network traffic flooding. Specifically, the method and network device disclosed herein implement the mitigation of the lack of data-link layer (or L2) addressing resolutions, usually learned by or programmed manually into the network device, through the flooding of affected network traffic across identified network broadcast domains. Flooding of the network traffic in the aforementioned manner may ensure that at least the destination(s) of the network traffic receives the network traffic at least in scenarios where which it is unknown out of which particular physical network interface(s) should the network traffic be transmitted to reach the destination(s).

PACKET SENDING METHOD AND DEVICE

A packet sending method and device. The first node sets a next-hop of the routing information to a next-hop through which the first node reaches the first route source. The destination address of the routing information is the address prefix. When the second route source is superior to the first route source, the first node switches the next-hop of the routing information to a next-hop through which the first node reaches the second route source. Then, the first node adds, to a target packet, path information of a forwarding path from the first node to the second route source according to the switching operation, where a destination address of the target packet matches the address prefix. Finally, the first node forwards the target packet to the second route source through the forwarding path.

SCALABLE NETWORK PROCESSING SEGMENTATION
20210392167 · 2021-12-16 ·

A method for processing network communications, the method including receiving a network packet at a network device and performing at least one lookup for the packet in one or more first lookup tables in which the one or more first lookup tables are programmed to include at least one of an exact match or longest prefix match (LPM) table entry. The method includes obtaining a security source segment and a security destination segment based upon the result of the at least one lookup for the packet in the one or more first lookup tables. The method further includes performing a lookup in a second lookup table based upon the security source segment and security destination segment in which the second lookup table is programmed in a content addressable memory. Based upon the result of the lookup in the second lookup table, processing a forwarding decision for the packet according to the security source segment and security destination segment.

PATH COUNT MANAGEMENT
20210377174 · 2021-12-02 · ·

This disclosure describes techniques for managing path counts at a router. The techniques include monitoring available storage space at a router for storing per prefix routes. In an instance where the available storage space at the router may be inadequate to support continued, stable network operations, the techniques include reducing an amount of per prefix routes that are advertised to the router. The techniques may also include withdrawing previously advertised per prefix routes from the router. As such, path count management concepts may help prevent overload of storage space at a router.

Anchoring IP devices in ICN networks
11190446 · 2021-11-30 · ·

A network access point (NAP) of a second type of network is configured to receive a first type of packet from a device configured to operate in only a first type of network. The NAP is configured to determine an appropriate namespace for the first type of packet based on an address of an intended destination of the first type of packet. The NAP is configured to encapsulate the first type of packet into a second type of packet for use in the second type of network. The NAP is configured to route the second type of packet to a plurality of devices subscribed to the namespace in the second type of network.

Routing protocol and distributed router

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.

AVOIDING MARKERS FOR LONGEST PREFIX MATCH BASED ON BINARY SEARCH TREE ALGORITHM

In one embodiment, a packet processing apparatus includes interfaces, a memory to store a representation of a routing table as a binary search tree of address prefixes, and store a marker with an embedded prefix including k marker bits providing a marker for an address prefix of a node corresponding to a prefix length greater than k, and n additional bits, such that the k marker bits concatenated with the n additional bits provide another address prefix, packet processing circuitry configured upon receiving a data packet having a destination address, to traverse the binary search tree to find a longest prefix match, compare a key with the k marker bits, extract an additional n bits from the destination address, and compare the extracted n bits with the n additional bits, and process the data packet in accordance with a forwarding action indicated by the longest prefix match.