Linux под нагрузкой. Высокопроизводительный шейпер

     The following parameters can be configured for a scheduler:

     type {fifo | wf2qp | rr | qfq}
             specifies the scheduling algorithm to use.
             cm fifo
                     is just a FIFO scheduler (which means that all packets
                     are stored in the same queue as they arrive to the sched-
                     uler).  FIFO has O(1) per-packet time complexity, with
                     very low constants (estimate 60-80ns on a 2Ghz desktop
                     machine) but gives no service guarantees.
             wf2qp   implements the WF2Q+ algorithm, which is a Weighted Fair
                     Queueing algorithm which permits flows to share bandwidth
                     according to their weights. Note that weights are not
                     priorities; even a flow with a minuscule weight will
                     never starve.  WF2Q+ has O(log N) per-packet processing
                     cost, where N is the number of flows, and is the default
                     algorithm used by previous versions dummynet's queues.
             rr      implements the Deficit Round Robin algorithm, which has
                     O(1) processing costs (roughly, 100-150ns per packet) and
                     permits bandwidth allocation according to weights, but
                     with poor service guarantees.
             qfq     implements the QFQ algorithm, which is a very fast vari-
                     ant of WF2Q+, with similar service guarantees and O(1)
                     processing costs (roughly, 200-250ns per packet).