On Fairness-Efficiency Tradeoffs for Multi-Resource Packet Processing
Middleboxes are widely deployed in today's datacenter networks. They perform a variety of network functions, each requiring multiple hardware resources, such as CPU cycles and link bandwidth. Depending on the functions they go through, packet processing of different traffic flows may consume a vastly different amount of hardware resources. An effective algorithm is therefore highly desired to schedule packets in a way such that multiple resources are shared in a fair and efficient manner. However, the authors show in this paper that there exists a fairness efficiency tradeoff when multiple resources are scheduled.