Weighted Fair Queuing as a Scheduling Algorithm for Deferrable Loads in Smart Grids

Haslak T (2020)


Publication Type: Book chapter / Article in edited volumes

Publication year: 2020

Publisher: Springer

Edited Volumes: Advances in Energy System Optimization

Series: Trends in Mathematics

Pages Range: 123-141

DOI: 10.1007/978-3-030-32157-4_8

Abstract

Weighted Fair Queuing (WFQ) is implemented for the problem of load scheduling in demand side management. Power demand, wait time and group-to-group fairness are the basis for three variants of the algorithm’s implementation. The results are compared to a Greedy strategy with regard to the residual of renewable power supply and the suggested measures of fairness. WFQ proves comparable to Greedy in terms of the primary objective and in addition is capable of equally distributing resources and distress caused by deferral.

Authors with CRIS profile

How to cite

APA:

Haslak, T. (2020). Weighted Fair Queuing as a Scheduling Algorithm for Deferrable Loads in Smart Grids. In Valentin Bertsch, Armin Ardone, Michael Suriyah, Wolf Fichtner, Thomas Leibfried, Vincent Heuveline (Eds.), Advances in Energy System Optimization. (pp. 123-141). Springer.

MLA:

Haslak, Tuncer. "Weighted Fair Queuing as a Scheduling Algorithm for Deferrable Loads in Smart Grids." Advances in Energy System Optimization. Ed. Valentin Bertsch, Armin Ardone, Michael Suriyah, Wolf Fichtner, Thomas Leibfried, Vincent Heuveline, Springer, 2020. 123-141.

BibTeX: Download