@techreport{morton-tsvwg-lightweight-fair-queueing-00,
    number =    {draft-morton-tsvwg-lightweight-fair-queueing-00},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-morton-tsvwg-lightweight-fair-queueing/00/},
    author =    {Jonathan Morton and Peter G. Heist},
    title =     {{Lightweight Fair Queueing}},
    pagetotal = 10,
    year =      2019,
    month =     jul,
    day =       2,
    abstract =  {This note presents Lightweight Fair Queueing (LFQ), a fair queueing algorithm with a small code footprint, low memory requirements, no multiply operations, only two physical queues, and only one set of AQM state. LFQ provides throughput fairness, sparse flow prioritization and ordering guarantees, making it suitable for a mixture of traffic flow types.},
}