Weighted random early detection (WRED) is a queue management algorithm with congestion avoidance capabilities. It is an extension to random early detection (RED) where a single queue may have several different queue thresholds. Each queue threshold is associated to a particular traffic class.
For example, a queue may have lower thresholds for lower priority packet. A queue buildup will cause the lower priority packets to be dropped, hence protecting the higher priority packets in the same queue. In this way quality of service prioritization is made possible for important packets from a pool of packets using the same buffer.
It is more likely that standard traffic will be dropped instead of higher prioritized traffic.
Read more about Weighted Random Early Detection: Restrictions, Functional Description
Famous quotes containing the words random and/or early:
“poor Felix Randal;
How far from then forethought of, all thy more boisterous years,
When thou at the random grim forge, powerful amidst peers,
Didst fettle for the great gray drayhorse his bright and battering
sandal!”
—Gerard Manley Hopkins (1844–1889)
“An early dew woos the half-opened flowers”
—Unknown. The Thousand and One Nights.
AWP. Anthology of World Poetry, An. Mark Van Doren, ed. (Rev. and enl. Ed., 1936)