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:
“And catch the gleaming of a random light,
That tells me that the ship I seek is passing, passing.”
—Paul Laurence Dunbar (1872–1906)
“Although good early childhood programs can benefit all children, they are not a quick fix for all of society’s ills—from crime in the streets to adolescent pregnancy, from school failure to unemployment. We must emphasize that good quality early childhood programs can help change the social and educational outcomes for many children, but they are not a panacea; they cannot ameliorate the effects of all harmful social and psychological environments.”
—Barbara Bowman (20th century)