This paper deals with the comparison in terms of goodput and fairness of different scheduling options for fixed WiMAX networks. An analytical approach has been adopted to determine the average system capacity for different scheduling options, thus highlighting that scheduling schemes have an important impact in WiMAX network planning. We have then compared via simulations different uplink scheduling options for the best effort (contention-based) traffic class with FTP traffic flows, such as: RR, token bucket-based, and M-LWDF. We have shown that M-LWDF can achieve a good trade-off between aggregated goodput maximization and a fair service provision. © 2009 IEEE.
Bestetti, A., Giambene, G., Hadzic, S. (2009). Fair traffic scheduling for WiMAX systems. In 2009 6th International Symposium on Wireless Communication Systems (pp.254-258). New York : IEEE [10.1109/ISWCS.2009.5285334].
Fair traffic scheduling for WiMAX systems
Giambene G.;
2009-01-01
Abstract
This paper deals with the comparison in terms of goodput and fairness of different scheduling options for fixed WiMAX networks. An analytical approach has been adopted to determine the average system capacity for different scheduling options, thus highlighting that scheduling schemes have an important impact in WiMAX network planning. We have then compared via simulations different uplink scheduling options for the best effort (contention-based) traffic class with FTP traffic flows, such as: RR, token bucket-based, and M-LWDF. We have shown that M-LWDF can achieve a good trade-off between aggregated goodput maximization and a fair service provision. © 2009 IEEE.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/43365
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo