Dancing-Q is a line-rate approximation of a priority queue that distributes packets across dynamically bounded FIFO queues to emulate fine-grained packet prioritization with analytical guarantees. It runs on current programmable switches and SmartNICs and achieves optimal rank inversion behavior.
