Abstract: Various examples disclosed herein relate to determining switch load values for a switch according to a weighted score for categorized network traffic. In some examples, traffic volume information is determined for a switch in a network. The traffic volume information can include volume of network traffic for the switch for multiple time parameters. The network can include multiple switches. The switches can be associated with loss potential information based on a topology of the switches. The traffic volume information can be categorized into multiple categories. Multiple switch load values can be determined for the switch. Each switch load value can correspond to one of the multiple time parameters. Further, each switch load value can be determined according to a weighted score for each categorized network traffic and according to the loss potential information.

Abstract: Various examples disclosed herein relate to determining switch load values for a switch according to a weighted score for categorized network traffic. In some examples, traffic volume information is determined for a switch in a network. The traffic volume information can include volume of network traffic for the switch for multiple time parameters. The network can include multiple switches. The switches can be associated with loss potential information based on a topology of the switches. The traffic volume information can be categorized into multiple categories. Multiple switch load values can be determined for the switch. Each switch load value can correspond to one of the multiple time parameters. Further, each switch load value can be determined according to a weighted score for each categorized network traffic and according to the loss potential information.

Abstract: One example includes a network device. The network device includes a queue to receive frames from a source, a processor, and a memory coupled to the processor. The memory stores instructions causing the processor, after execution of the instructions by the processor, to deposit tokens into a first token bucket at a first rate, determine whether a frame length of a frame received by the queue is less than the tokens in the first token bucket, remove tokens from the first token bucket in response to the frame length being less than the tokens in the first token bucket, and generate a congestion notification message in response to the frame length not being less than the tokens in the first token bucket. Each token represents a unit of bytes of a predetermined size.

Abstract: One example provides a network device including a queue to receive in profile frames and out of profile frames, 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 determine whether a predetermined operating point of the queue has been exceeded, and in response to determining that the predetermined operating point of the queue has been exceeded, forward the in profile frames, sample the out of profile frames, and generate a congestion notification message for each sampled out of profile frame to be sent to a source of the out of profile frames to reduce the transmission rate of frames.