Gradient scheduling algorithm for fair delay guarantee in logarithmic pricing scenario

Authors:
Pete Räsänen;Simo Lintunen;Riku Kuismanen;Jyrki Joutsensalo;Timo Hämäläinen
Affiliations:
University of Jyväskylä, Finland;University of Jyväskylä, Finland;University of Jyväskylä, Finland;University of Jyväskylä, Finland;University of Jyväskylä, Finland
Venue:
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Year:
2008

Citing 8
Cited 0

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Link-sharing and resource management models for packet networks

IEEE/ACM Transactions on Networking (TON)
Achieving network optima using Stackelberg routing strategies

IEEE/ACM Transactions on Networking (TON)
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Providing guaranteed services without per flow management

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Equilibrium bandwidth and buffer allocations for elastic traffics

IEEE/ACM Transactions on Networking (TON)
Utility-based rate control in the Internet for elastic traffic

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

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.