Abstract: In an embodiment, a transaction dataset is analyzed to identify a set of transaction events, each transaction event from the set of transaction events associated with a transaction event type. The set of transaction events is analyzed to identify a plurality of sets of grouped transaction events, each set of grouped transaction events from the plurality of sets of grouped transaction events associated with a subset of transaction events from the set of transaction events. To identify a plurality of sets of variants, each set of grouped transaction events from the plurality of sets of grouped transaction events including an identifier of a variant for that set of grouped transaction events and from the plurality of sets of variants is analyzed, each set of variants from the plurality of sets of variants differing from each remaining set of variants from the plurality of sets of variants.

Abstract: Embodiments provide a method, network device, and computer program product for optimizing traffic in a link-state network distributed across a plurality of sites. The method, network device, and computer program product include receiving a multi-destination message at a first node within the link-state network. Additionally, the method, network device, and computer program product include identifying a plurality of multi-destination trees within the network, each tree having a respective root node. The method, network device, and computer program product determine a plurality of cost values corresponding to each of the plurality of multi-destination trees, based on one or more links along a shortest path from the first node to the respective root node of each tree. Based on the determined cost values, the method, network device, and computer program product select one or more of the multi-destination trees and transmit the multi-destination message using the selected tree.

Abstract: An example method for convergence of multi-destination traffic in a network environment is provided and includes receiving a first type-length-value (TLV) message from a true broadcast root in a Transparent Interconnection of Lots of Links (TRILL) network, where the first TLV message indicates a first subset of multi-destination trees in the TRILL network, receiving a second TLV message from the true broadcast root indicating a second subset of multi-destination trees in the TRILL network, such that a union of the first subset and the second subset indicates at least one inactive multi-destination tree in the TRILL network, and deleting the inactive tree from a hash table of active trees.

Abstract: Systems and methods may be provided embodying an optimized Trill LAN network hello mode. The optimized hello mode may allow the number of LAN hellos exchanged to be reduced significantly in a steady state mode of operation. No modifications to the current Trill specification are needed and in a converged state (when designated RBridge election and appointed forwarder appointments are complete), only 1 hello PDU per RBridge is originated in every hello interval.

Abstract: An example method for convergence of multi-destination traffic in a network environment is provided and includes receiving a first type-length-value (TLV) message from a true broadcast root in a Transparent Interconnection of Lots of Links (TRILL) network, where the first TLV message indicates a first subset of multi-destination trees in the TRILL network, receiving a second TLV message from the true broadcast root indicating a second subset of multi-destination trees in the TRILL network, such that a union of the first subset and the second subset indicates at least one inactive multi-destination tree in the TRILL network, and deleting the inactive tree from a hash table of active trees.

Abstract: Embodiments provide a method, network device, and computer program product for optimizing traffic in a link-state network distributed across a plurality of sites. The method, network device, and computer program product include receiving a multi-destination message at a first node within the link-state network. Additionally, the method, network device, and computer program product include identifying a plurality of multi-destination trees within the network, each tree having a respective root node. The method, network device, and computer program product determine a plurality of cost values corresponding to each of the plurality of multi-destination trees, based on one or more links along a shortest path from the first node to the respective root node of each tree. Based on the determined cost values, the method, network device, and computer program product select one or more of the multi-destination trees and transmit the multi-destination message using the selected tree.

Abstract: Systems and methods may be provided embodying an optimized Trill LAN network hello mode. The optimized hello mode may allow the number of LAN hellos exchanged to be reduced significantly in a steady state mode of operation. No modifications to the current Trill specification are needed and in a converged state (when designated RBridge election and appointed forwarder appointments are complete), only 1 hello PDU per RBridge is originated in every hello interval.