Home
last modified time | relevance | path

Searched hist:"13 d2a1d2b032de08d7dcab6a1edcd47802681f96" (Results 1 – 3 of 3) sorted by relevance

/openbmc/linux/net/sched/
H A DMakefile13d2a1d2b032de08d7dcab6a1edcd47802681f96 Thu Nov 20 06:10:00 CST 2008 Patrick McHardy <kaber@trash.net> pkt_sched: add DRR scheduler

Add classful DRR scheduler as a more flexible replacement for SFQ.

The main difference to the algorithm described in "Efficient Fair Queueing
using Deficit Round Robin" is that this implementation doesn't drop packets
from the longest queue on overrun because its classful and limits are
handled by each individual child qdisc.

Signed-off-by: Patrick McHardy <kaber@trash.net>
Signed-off-by: David S. Miller <davem@davemloft.net>
H A Dsch_drr.c13d2a1d2b032de08d7dcab6a1edcd47802681f96 Thu Nov 20 06:10:00 CST 2008 Patrick McHardy <kaber@trash.net> pkt_sched: add DRR scheduler

Add classful DRR scheduler as a more flexible replacement for SFQ.

The main difference to the algorithm described in "Efficient Fair Queueing
using Deficit Round Robin" is that this implementation doesn't drop packets
from the longest queue on overrun because its classful and limits are
handled by each individual child qdisc.

Signed-off-by: Patrick McHardy <kaber@trash.net>
Signed-off-by: David S. Miller <davem@davemloft.net>
H A DKconfig13d2a1d2b032de08d7dcab6a1edcd47802681f96 Thu Nov 20 06:10:00 CST 2008 Patrick McHardy <kaber@trash.net> pkt_sched: add DRR scheduler

Add classful DRR scheduler as a more flexible replacement for SFQ.

The main difference to the algorithm described in "Efficient Fair Queueing
using Deficit Round Robin" is that this implementation doesn't drop packets
from the longest queue on overrun because its classful and limits are
handled by each individual child qdisc.

Signed-off-by: Patrick McHardy <kaber@trash.net>
Signed-off-by: David S. Miller <davem@davemloft.net>