@techreport{morton-tsvwg-cheap-nasty-queueing-01,
    number =    {draft-morton-tsvwg-cheap-nasty-queueing-01},
    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-cheap-nasty-queueing/01/},
    author =    {Jonathan Morton and Peter G. Heist},
    title =     {{Cheap Nasty Queueing}},
    pagetotal = 9,
    year =      2019,
    month =     nov,
    day =       4,
    abstract =  {This note presents Cheap Nasty Queueing (CNQ), a queueing algorithm intended as a bare-minimum functionality standard for hardware implementations. It provides stateless or single-instance AQM and basic sparse-flow prioritisation.},
}