Abstract: A bezel for a light fixture appears illuminated when a bezel light source is energized and the bezel appears opaque when the bezel lights source is not energized. The bezel has a metalized coating which reflects light transmitted from a location remote from and external to the bezel and which transmits light emitted by the bezel light source.

Abstract: A bezel for a light fixture appears illuminated when a bezel light source is energized and the bezel appears opaque when the bezel lights source is not energized. The bezel has a metalized coating which reflects light transmitted from a location remote from and external to the bezel and which transmits light emitted by the bezel light source.

Abstract: A junction box assembly for a light bar for splicing a light bar cable and a vehicle cable. A multipart housing forms a compartment and has at least two separable parts for accessing the compartment. The compartment is configured for receiving an end of the light bar cable and for receiving an end of the vehicle cable. The multipart housing is configured to mount externally and slidably to the underside of the light bar.

Abstract: At telecommunications switches and routers, RED (random early packet discard) uses the queue depth to determine whether to keep or discard each packet as it arrives at a queue. This is done by determining a discard probability (P), which is dependent on the average depth of the queue, and comparing the discard probability to a random number. One way of performing the invention uses the summed discard probabilities, instead of counting the number of packets (count) and multiplying that by the current discard probability, as in the prior art. The resulting sum is compared to the random number for discard operation. The disclosure further describes a more accurate way of calculating average depth of a queue, especially when the queue encounters periods of idleness.

Abstract: At telecommunications switches and routers, RED (random early packet discard) uses the queue depth to determine whether to keep or discard each packet as it arrives at a queue. This is done by determining a discard probability (P), which is dependent on the average depth of the queue, and comparing the discard probability to a random number. One way of performing the invention uses the summed discard probabilities, instead of counting the number of packets (count) and multiplying that by the current discard probability, as in the prior art. The resulting sum is compared to the random number for discard operation. The disclosure further describes a more accurate way of calculating average depth of a queue, especially when the queue encounters periods of idleness.

Abstract: At telecommunications switches and routers, RED (random early packet discard) uses the queue depth to determine whether to keep or discard each packet as it arrives at a queue. This is done by determining a discard probability P(colour), which is dependent on the average depth of the queue, and comparing the discard probability to a random number. The implementation of RED requires calculating the average depth of the queue to which RED is being applied. In calculating average queue depth, a weight is introduced. The value of the weight affects the amount of weighting that the previous average queue depth is given in relation to the current queue depth in calculating the new average queue depth. The invention uses a plurality of weights, depending on the status of the queue so that RED produces better discard operation. In a two-weight scheme, a smaller weight is used for an increasing queue depth and a larger one is used for a decreasing queue depth.