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

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Haslak, T. (2020). Weighted Fair Queuing as a Scheduling Algorithm for Deferrable Loads in Smart Grids. In Trends in Mathematics (pp. 123–141). Springer. https://doi.org/10.1007/978-3-030-32157-4_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free