Research Article
Gradient Scheduling Algorithm for Fair Delay Guarantee in Logarithmic Pricing Scenario
@INPROCEEDINGS{10.4108/ICST.SIMUTOOLS2008.3046, author={Pete R\aa{}s\aa{}nen and Simo Lintunen and Riku Kuismanen and Jyrki Joutsensalo and Timo H\aa{}m\aa{}l\aa{}inen}, title={Gradient Scheduling Algorithm for Fair Delay Guarantee in Logarithmic Pricing Scenario}, proceedings={1st International ICST Workshop on the Evaluation of Quality of Service through Simulation in the Future Internet}, publisher={ACM}, proceedings_a={QOSIM}, year={2010}, month={5}, keywords={Pricing revenue optimization delay bandwidth Quality of Service (QoS)}, doi={10.4108/ICST.SIMUTOOLS2008.3046} }- Pete Räsänen
Simo Lintunen
Riku Kuismanen
Jyrki Joutsensalo
Timo Hämäläinen
Year: 2010
Gradient Scheduling Algorithm for Fair Delay Guarantee in Logarithmic Pricing Scenario
QOSIM
ICST
DOI: 10.4108/ICST.SIMUTOOLS2008.3046
Abstract
In this paper we propose a packet scheduling scheme for ensuring delay as a Quality of Service (QoS) requirement. For customers, fair service is given while optimizing revenue of the network service provider. Gradient type algorithm for updating the weights of a packet scheduler is derived from a revenue-based optimization problem in the logarithmic pricing scenario. Algorithm is simple to implement. We compared algorithm with optimal brute-force method. The weight updating procedure is independent on the assumption of the connection’s statistical behavior, and therefore it is robust against erroneous estimates of statistics.
Copyright © 2008–2024 ICST
