Abstract: Systems and methods are provided for in-service software upgrades using centralize database versioning and migrations. The systems and methods described herein can intercept protocol messages between a client and a network device and run a first control plane comprising an origin state database and a plurality of un-migrated services. The system can generate a target state data model, wherein an origin state data model associated with the origin state database migrates to the target state data model, and copy the origin state database. The system can migrate second control plane software to the target state database and operate un-migrated services in accordance with the first control plane software and the copied origin state database while operating migrated services in accordance with the second control plane software and the target state database.

Abstract: Systems, methods, and devices are described which implement an internal Precision Time Protocol (PTP) instance on a stacked network device within a larger external PTP instance in the network to which the stacked network device. The internal instance of PTP is local to the stacked network device synchronizes the N devices (“members”) in the stack. Each of the members of the stacked network device may act as a BC in this local virtual instance of PTP. One member, which may be referred to as the commander node or primary member node, may synchronize its clock based on an external GSC or external BC, and then that member may act as a BC for a downstream member, and so on in an iterative manner until all of the members within the stacked network device have synchronized clocks. The individual members may also act as BCs to the external endpoints coupled thereto, providing PTP timestamp messages to those endpoints.

Abstract: A high-availability network device database synchronization technique for devices configured with multiple network controllers is disclosed. An HA database that contains information regarding a network state may not properly synchronize upon failure of a network component. For example, an HA switch typically has only two controllers, an active and a standby. If there is a loss of the active controller that causes a failover, changes in the network state may occur rapidly while the system is trying to recover (e.g., process the failover action). In part, because of the impact of the failover (e.g., failed communication paths) and rapidity of changes to network state while processing the failover, database changes may not be properly synchronized across all available database instances. Disclosed techniques provide reconciliation of database values using a mark and sweep technique on the “upside” of the failover and alter the “source of truth” for data value discrepancies.

Abstract: A high-availability network device database synchronization technique for devices configured with multiple network controllers is disclosed. An HA database that contains information regarding a network state may not properly synchronize upon failure of a network component. For example, an HA switch typically has only two controllers, an active and a standby. If there is a loss of the active controller that causes a failover, changes in the network state may occur rapidly while the system is trying to recover (e.g., process the failover action). In part, because of the impact of the failover (e.g., failed communication paths) and rapidity of changes to network state while processing the failover, database changes may not be properly synchronized across all available database instances. Disclosed techniques provide reconciliation of database values using a mark and sweep technique on the “upside” of the failover and alter the “source of truth” for data value discrepancies.

Abstract: A first switch includes a processor and a memory communicatively coupled to the processor. The memory stores instructions causing the processor, after execution of the instructions by the processor, to establish a first stacking link between a first stacking port of the first switch and a first stacking port of a second switch, establish a second stacking link between a second stacking port of the first switch and a first stacking port of a third switch, and dedicate the first stacking link to a first class of traffic between the first switch and the second switch.

Abstract: A method of managing broadcasts and multicasts in a network. A packet having a packet number is received and compared to a last received packet number stored in memory. If the packet number is smaller than or equal to the last received packet number, then the packet is dropped. If the packet number is greater than the last received packet number then the packet is processed.

Abstract: A system and method for managing a hardware routing table comprising monitoring usage of entries in said routing table and deleting entries based on usage criteria so as to generally keep the number of entries within a size limit, thereby conserving power.

Abstract: A first switch includes a processor and a memory communicatively coupled to the processor. The memory stores instructions causing the processor, after execution of the instructions by the processor, to establish a first stacking link between a first stacking port of the first switch and a first stacking port of a second switch, establish a second stacking link between a second stacking port of the first switch and a first stacking port of a third switch, and dedicate the first stacking link to a first class of traffic between the first switch and the second switch.

Abstract: A method of managing broadcasts and multicasts in a network. A packet having a packet number is received and compared to a last received packet number stored in memory. If the packet number is smaller than or equal to the last received packet number, then the packet is dropped. If the packet number is greater than the last received packet number then the packet is processed.

Abstract: A system and method for managing a hardware routing table comprising monitoring usage of entries in said routing table and deleting entries based on usage criteria so as to generally keep the number of entries within a size limit, thereby conserving power.

Abstract: In the method, a logical unity is queried with a first command requesting first identifier data, to determine whether a unique identifier (UID) for the logical unit can be constructed based on the first identifier data. If a UID cannot be constructed from the first identifier data, the logical unit is queried with a second command requesting second identifier data, to determined if a UID can be constructed based on the second identifier data. If a UID cannot be constructed based on the second identifier data, the logical unit is queried with a third command requesting third identifier data. Information is extracted from the first identifier data and from the third identifier data and a UID is generated based on the extracted information.