Abstract: This disclosure describes methods to process timing information of flows in a network. One or more processors determine a latency associated with each of one or more packets of a flow passing through a device. The one or more processors determine that the latency is greater than a baseline latency, and the one or more processors provide a message indicating at least the flow and that the latency is greater than the baseline latency.

Abstract: In one embodiment, a method includes receiving a request to establish a path for a data stream from the first network apparatus to a second network apparatus, where the request is associated with a requested bandwidth for the data stream, and where the first network apparatus and the second network apparatus are connected by a link aggregation group including a number of physical Ethernet links, accessing bandwidth information representing a number of remaining bandwidths of the respective multiple of physical Ethernet links, determining that the requested bandwidth is not satisfied by any of the number of remaining bandwidths of the number of physical Ethernet links, and sending a response rejecting the request to establish the path.

Abstract: In one embodiment, a method includes receiving a request to establish a path for a data stream from the first network apparatus to a second network apparatus, where the request is associated with a requested bandwidth for the data stream, and where the first network apparatus and the second network apparatus are connected by a link aggregation group including a number of physical links, accessing bandwidth information representing a number of remaining bandwidths of the respective multiple of physical links, determining that the requested bandwidth is not satisfied by any of the number of remaining bandwidths of the number of physical links, and sending a response rejecting the request to establish the path.

Abstract: This disclosure describes methods to process timing information of flows in a network. One or more processors determine a latency associated with each of one or more packets of a flow passing through a device. The one or more processors determine that the latency is greater than a baseline latency, and the one or more processors provide a message indicating at least the flow and that the latency is greater than the baseline latency.

Abstract: In one embodiment, a method includes receiving a request to establish a path for a data stream from the first network apparatus to a second network apparatus, where the request is associated with a requested bandwidth for the data stream, and where the first network apparatus and the second network apparatus are connected by a link aggregation group including a number of physical links, accessing bandwidth information representing a number of remaining bandwidths of the respective multiple of physical links, determining that the requested bandwidth is not satisfied by any of the number of remaining bandwidths of the number of physical links, and sending a response rejecting the request to establish the path.

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: 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.