QVISOR: Virtualizing Packet Scheduling Policies
Abstract
The concept of programmable packet scheduling has been recently introduced, enabling the programming of scheduling algorithms into existing data planes without requiring new hardware designs. Notably, several programmable schedulers have been proposed, which are capable of running directly on existing commodity switches. Unfortunately, though, their focus has been limited to single-tenant traffic scheduling: i.e., scheduling all incoming traffic following one single scheduling policy (e.g., pFabric to minimize flow completion times). In this paper, we emphasize the fact that today’s networks are heterogeneous: they are shared by multiple tenants, who run applications with different performance requirements. As such, we introduce a new research challenge: how can we extend scheduling programmability to multi-tenant policies? We envision QVISOR, a scheduling hypervisor that enables multi-tenant programmable scheduling on existing switches. With QVISOR, tenants program the scheduling policies for their traffic flows; operators define how tenants should share the available resources; and QVISOR does the rest: deploying the scheduling policies into the underlying hardware.
People
BibTex
@INPROCEEDINGS{alcoz2023qvisor,
isbn = {979-8-4007-0415-4},
copyright = {In Copyright - Non-Commercial Use Permitted},
doi = {10.3929/ethz-b-000630720},
year = {2023-11},
booktitle = {HotNets '23: Proceedings of the 22nd ACM Workshop on Hot Topics in Networks},
type = {Conference Paper},
author = {Gran Alcoz, Albert and Vanbever, Laurent},
size = {7 p. accepted version},
abstract = {The concept of programmable packet scheduling has been recently introduced, enabling the programming of scheduling algorithms into existing data planes without requiring new hardware designs. Notably, several programmable schedulers have been proposed, which are capable of running directly on existing commodity switches. Unfortunately, though, their focus has been limited to single-tenant traffic scheduling: i.e., scheduling all incoming traffic following one single scheduling policy (e.g., pFabric to minimize flow completion times). In this paper, we emphasize the fact that today’s networks are heterogeneous: they are shared by multiple tenants, who run applications with different performance requirements. As such, we introduce a new research challenge: how can we extend scheduling programmability to multi-tenant policies? We envision QVISOR, a scheduling hypervisor that enables multi-tenant programmable scheduling on existing switches. With QVISOR, tenants program the scheduling policies for their traffic flows; operators define how tenants should share the available resources; and QVISOR does the rest: deploying the scheduling policies into the underlying hardware.},
keywords = {Packet Scheduling; Networking},
language = {en},
address = {New York, NY},
publisher = {Association for Computing Machinery},
title = {QVISOR: Virtualizing Packet Scheduling Policies},
PAGES = {238 - 244},
Note = {22nd ACM Workshop on Hot Topics in Networks (HotNets 2023); Conference Location: Cambridge, MA, USA; Conference Date: November 28-29, 2023}
}Research Collection: 20.500.11850/630720
Slide Sources: https://gitlab.ethz.ch/projects/44863