Abstract: A switching fabric role assignment system includes a plurality of switch devices coupled together in a switching fabric. A first switch device included in the plurality of switch devices receives an endhost device identification communication from an endhost device when the endhost device is connected to the first switch device. The first switch device uses the endhost device identification communication to identify an endhost device type of the endhost device and determines, based on the endhost device type, a first switch device role for the first switch device. The first switch device then transmits a first switch device role communication that identifies the first switch device role to a second switch device included in the plurality of switch devices and connected to the first switch device. The second switch device may then determine, based on the first switch device role, a second switch device role for the second switch device.

Abstract: A switching fabric loop prevention system includes first slave switch devices in a switching fabric that each automatically determine a first slave switch device role for themselves based on first directly connected device identification information received from a first directly connected device, and second slave switch devices in the switching fabric that each automatically determine a second slave switch device role for themselves based on second directly connected device identification information received from a second directly connected device. A master switch device in the switching fabric then configures each of the first slave switch devices having the first slave switch device role to prevent first type communications that have been received from one of the second slave switch devices having the second slave switch device role from being forwarded to another of the second slave switch devices having the second slave switch device role.

Abstract: An information handling system may include a processor, a memory coupled to the processor, the memory having program instructions stored thereon that, upon execution by the processor, cause the processor to: (i) responsive to a physical connection being made between components of a system comprising multiple information handling system chassis, receive a message; (ii) process information present in the message indicative of a topology of connectivity among the components of the system; and (iii) update a data structure defining the topology of connectivity of the various components of the system based on the information present in the message.

Abstract: An information handling system may include a processor, a memory coupled to the processor, the memory having program instructions stored thereon that, upon execution by the processor, cause the processor to: (i) responsive to a physical connection being made between components of a system comprising multiple information handling system chassis, receive a message; (ii) process information present in the message indicative of a topology of connectivity among the components of the system; and (iii) update a data structure defining the topology of connectivity of the various components of the system based on the information present in the message.

Abstract: An information handling system may include a processor and a memory coupled to the processor, the memory having program instructions stored thereon that, upon execution by the processor, cause the processor to determine a topology of connectivity of various components of a system comprising multiple information handling system chassis and apply validation rules to the topology to validate the topology.

Abstract: Techniques are described for providing node protection in a Source Packet Routing in Networking (SPRING) network. In some examples, a first network device, responsive to detecting a configuration request to provide node protection to a second network device that is adjacent to the first network device: generate at least one context table; configure at least one forwarding entry that indicates: a primary path between the first network device and a third network device, and a backup path, based at least in part on the at least one context table, between the first network device and the third network device that bypasses the second network device; while the second network device has not failed, forward network packets to the third network device using the primary path; and responsive to determining that the second network device has failed, forward network packets to the third network device using the backup path.

Abstract: A high-performance, scalable data center switch fabric and infrastructure is described that provides a clean separation between of routing and forwarding information between a transport layer of the data center and a service layer of data center that includes the endpoint devices, such as virtual or physical machines deployed within the data center. For example, techniques are described that enable the automatic creation of a transport hierarchy of label switched paths (LSPs) across the transport layer of the data center. For example, the techniques may be applied with the Border Gateway Protocol (BGP) labeled unicast (LU) in a manner that constructs a hierarchy of LPSs in the transport layer of the data center.

Abstract: A system and method for link failure handling includes detecting a failure in a first network connection between a first network switching unit and a second network switching unit, where the first network connection is associated with a first communication port of the first network switching unit; suspending the first communication port from a link aggregation group (LAG), where the first communication port is associated with the LAG; and associating one or more first inter-chassis link (ICL) ports with the LAG. The first ICL ports are associated with a first ICL coupling the first network switching unit to a third network switching unit. The first network switching unit and the third network switching unit are peers.

Abstract: A network node or corresponding method of performing link aggregation reduces a number of Content Addressable Memory (CAM) entries required to make a forwarding decision for a given ingress flow, reducing cost, size, and power consumption of the CAM and accompanying static RAM. In one embodiment, an ingress flow is mapped to an egress flow identifier. Subsequently, the egress flow identifier is mapped to a member of an aggregated group associated with an egress interface based on information available in a given ingress flow. Finally, the given ingress flow is forwarded to the member of the aggregated group associated with the egress interface. A hashing technique or two lookups may be used alone or in combination in mapping the ingress flow to the egress flow identifier to reduce CAM memory usage.

Abstract: A system and method for link failure handling includes detecting a failure in a first network connection between a first network switching unit and a second network switching unit, where the first network connection is associated with a first communication port of the first network switching unit; suspending the first communication port from a link aggregation group (LAG), where the first communication port is associated with the LAG; and associating one or more first inter-chassis link (ICL) ports with the LAG. The first ICL ports are associated with a first ICL coupling the first network switching unit to a third network switching unit. The first network switching unit and the third network switching unit are peers.

Abstract: A network node or corresponding method of performing link aggregation reduces a number of Content Addressable Memory (CAM) entries required to make a forwarding decision for a given ingress flow, reducing cost, size, and power consumption of the CAM and accompanying static RAM. In one embodiment, an ingress flow is mapped to an egress flow identifier. Subsequently, the egress flow identifier is mapped to a member of an aggregated group associated with an egress interface based on information available in a given ingress flow. Finally, the given ingress flow is forwarded to the member of the aggregated group associated with the egress interface. A hashing technique or two lookups may be used alone or in combination in mapping the ingress flow to the egress flow identifier to reduce CAM memory usage.

Abstract: An apparatus and method of a network system between a host and a group of routers using virtual router redundancy protocol (“VRRP”) messages and bidirectional forwarding detection (“BFD”) sessions are disclosed. The network system is capable of facilitating a first communication between a host and a master router of multiple VRRP routers and establishing a BFD session between the host and the master router. When the BFD session fails, the priority of the master router is subsequently lowered and a backup router is activated. In one embodiment, the backup router capable of performing functions of the master router becomes a new master until the BFD session resumes.

Abstract: An apparatus and method of a network system between a host and a group of routers using virtual router redundancy protocol (“VRRP”) messages and bidirectional forwarding detection (“BFD”) sessions are disclosed. The network system is capable of facilitating a first communication between a host and a master router of multiple VRRP routers and establishing a BFD session between the host and the master router. When the BFD session fails, the priority of the master router is subsequently lowered and a backup router is activated. In one embodiment, the backup router capable of performing functions of the master router becomes a new master until the BFD session resumes.

Abstract: An apparatus and method for routing data packets between a routed network and a local bridged network using integrated routing and bridging (“IRB”) functions are disclosed. In one embodiment a bridge interface between a host in the local bridge network and a bridging engine is IRB enabled. An unnumbered Internet Protocol (“IP”) interface is then added between the host and a routing engine in accordance with the IRB enabled bridge interface. Subsequently packets received from the routed network are forwarded directly by the routing engine to the host in the local bridge network via the unnumbered IP interface, thereby bypassing the bridging engine. Through use of an embodiment of the present invention, packet processing delay in each network device is reduced (because of bypassing the bridging engine), thereby decreasing packet latency in an ever growing network.

Abstract: A method or corresponding apparatus in an exemplary embodiment of the present invention monitors an operational status of network links and retrieves or receives the operational status. The operational status is stored (e.g., within 50 msec) on an ongoing basis. The operational status corresponds to an operational LSP from among a primary LSP and secondary LSP(s) used to service traffic via the network links to maintain network connectivity via the LSPs. The secondary LSP(s) may be either a bypass LSP or a backup LSP, where each LSP is Fast Re-route (FRR) enabled. Further, correspondence between the primary LSP, secondary LSP(s), and the network links may be tracked. In order to deliver network traffic via the operational LSP known to service traffic between the source and destination, a link identifier may be used. The link identifier is determined from the source and destination information within the network traffic.

Abstract: A method or corresponding apparatus in an exemplary embodiment of the present invention determines how many copies of a multicast packet are to be sent, as copies, to multiple destinations based on information in the multicast packet and a group (e.g., bridge node) with which the packet is associated. The copies of the multicast packets are then generated. After generating the copies, an action to take for each copy is determined. This determination is made using the information in the multicast packet and based on the group with which the packet is associated. After the action is determined for each copy, the action is performed on each copy. Through use of an embodiment of the present invention, memory space is conserved, allowing for continued use of a device in a multicast environment of an ever growing network, such as the Internet.

Abstract: A network node or corresponding method of performing link aggregation reduces a number of Content Addressable Memory (CAM) entries required to make a forwarding decision for a given ingress flow, reducing cost, size, and power consumption of the CAM and accompanying static RAM. In one embodiment, an ingress flow is mapped to an egress flow identifier. Subsequently, the egress flow identifier is mapped to a member of an aggregated group associated with an egress interface based on information available in a given ingress flow. Finally, the given ingress flow is forwarded to the member of the aggregated group associated with the egress interface. A hashing technique or two lookups may be used alone or in combination in mapping the ingress flow to the egress flow identifier to reduce CAM memory usage.

Abstract: A method or corresponding apparatus in an exemplary embodiment of the present invention monitors an operational status of network links and retrieves or receives the operational status. The operational status is stored (e.g., within 50 msec) on an ongoing basis. The operational status corresponds to an operational LSP from among a primary LSP and secondary LSP(s) used to service traffic via the network links to maintain network connectivity via the LSPs. The secondary LSP(s) may be either a bypass LSP or a backup LSP, where each LSP is Fast Re-route (FRR) enabled. Further, correspondence between the primary LSP, secondary LSP(s), and the network links may be tracked. In order to deliver network traffic via the operational LSP known to service traffic between the source and destination, a link identifier may be used. The link identifier is determined from the source and destination information within the network traffic.

Abstract: A method or corresponding apparatus in an exemplary embodiment of the present invention determines how many copies of a multicast packet are to be sent, as copies, to multiple destinations based on information in the multicast packet and a group (e.g., bridge node) with which the packet is associated. The copies of the multicast packets are then generated. After generating the copies, an action to take for each copy is determined. This determination is made using the information in the multicast packet and based on the group with which the packet is associated. After the action is determined for each copy, the action is performed on each copy. Through use of an embodiment of the present invention, memory space is conserved, allowing for continued use of a device in a multicast environment of an ever growing network, such as the Internet.