Abstract:
Various embodiments are disclosed for increasing Layer-3 LPM (longest prefix match) routing database in a network platform. In some embodiments, chipsets in fabric modules (FMs) can be partitioned into multiple banks. Network traffic can be directed towards a corresponding bank in the FMs by using a LPM table on a line card (LC). Entries in the LPM table on the LC can be programmed either statically or dynamically based upon LPM routes that are dynamically learned.
Abstract:
A plurality of line cards with each line card having a respective network forwarding engine and a respective outgoing interface (OIF) list and at least one fabric module communicatively coupled with each line card with each fabric module can have a respective network forwarding engine. The local OIF list can be asymmetrically programmed. The network forwarding engine of a line card can be configured to receive a multicast packet, compare a multicast address associate with the received multicast packet with entries in the local OIF list of the line card and forward the received multicast packet to at least one interface associated with the multicast address in response to the comparison resulting in a match.
Abstract:
In one embodiment an approach is provided to efficiently program routes on line cards and fabric modules in a modular router to avoid hot spots and thus avoid undesirable packet loss. Each fabric module includes two separate processors or application specific integrated circuits (ASICs). In another embodiment, each fabric module processor is replaced by a pair of fabric module processors arranged in series with each other, and each processor is responsible for routing only, e.g., IPv4 or IPv6 traffic. The pair of fabric module processors communicates with one another via a trunk line and any packet received at either one of the pair is passed to the other of the pair before being passed back to a line card.
Abstract:
The proposed methodology enables finding the most efficient roots in the network to carry multicast traffic, while further providing a theoretical basis for such selection. It guarantees the minimum expected delivery cost for multicast frames in the absence of any knowledge about the source and receivers.
Abstract:
In one embodiment, a particular PE device of a plurality of multi-homing PE devices between a core network and a local network determines a subset of traffic for which the particular PE device is responsible. The particular PE also establishes, with itself as root, a multicast tree within the local network for underlay multicast groups. Traffic received at the particular PE from the core network is admitted into the local network only if the core traffic corresponds to the subset of traffic for which the particular PE device is responsible (and mapped into one of the underlay multicast groups for which the particular PE device is the root). Also, multicast traffic received at the particular PE from the local network is forwarded into the core network only if the multicast traffic corresponds to the subset of traffic for which the particular PE device is responsible.
Abstract:
The proposed methodology enables finding the most efficient roots in the network to carry multicast traffic, while further providing a theoretical basis for such selection. It guarantees the minimum expected delivery cost for multicast frames in the absence of any knowledge about the source and receivers.
Abstract:
A communication pathway between a plurality of network nodes within a network is established. A DIS election operation is executed to determine a first network node among the plurality of network nodes as the DIS for the network and creating a first pseudo node for the first network node, and with each network node of the plurality of network nodes, determining whether the connectivity between the first network node and the other network nodes of the plurality of network nodes within the network is in a synchronous state with the adjacencies with the other network nodes of the plurality of network nodes within the network.
Abstract:
In accordance with one example embodiment, a system configured for programming a network layer multicast address entry in a routing table of an ingress line card module is disclosed. The network layer multicast address entry includes a network layer address associated with at least one egress line card. The system is further configured for programming a data link layer multicast routing address entry in a routing table of a fabric card module in which the data link layer multicast routing address entry corresponds to the network layer multicast address entry.
Abstract:
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.
Abstract:
In one illustrative example, an IP network media data router includes a spine and leaf switch architecture operative to provide IP multicast delivery of media data from source devices to receiver devices. The architecture may include K spine switches, K sets of L leaf switches, M data links between each leaf switch and each spine switch where each data link has a maximum link bandwidth of BWL, and a plurality of bidirectional data ports connected to each leaf switch. Notably, the router is provided or specified with a number of bidirectional data ports N=(a/K)×(BWL/BWP) for a guaranteed non-blocking IP multicast delivery of data at a maximum port bandwidth of BWP, where “a” is a fixed constant greater than or equal to K. The architecture may be reconfigurable or expandable to include C additional spine switches and C additional sets of L leaf switches. The reconfiguration may provide for a redistribution or reconnection of the M data links, so that the new number of M data links between each leaf switch and each spine switch is Mnew=(Kold×Mold)/(Kold+C)=a/Knew. The reconfiguration provides a new maximum number of bidirectional data ports as Nnew=(a/Knew)×(BWL/BWP) for maintaining the non-blocking IP multicast delivery of data at a maximum port bandwidth of BWP.