Bandwidth allocation, bit rate and pricing
J. Joutsensalo, Ari Viinikainen, Timo Hämäläinen, Jarmo Siltanen · 2005
In this paper we present a packet scheduling method which guarantees bandwidth of the connection and optimizes revenue of the network service provider. A closed form formula for updating the adaptive weights of a packet scheduler is derived from a revenue-based optimization problem. The weight updating procedure is fast and independent on the assumption of the connections' statistical behavior. The features of the algorithm are simulated and analyzed with a call admission control (CAC) mechanism. We also show in context with the CAC procedure a mechanism for guaranteeing a specified mean bandwidth for different service classes.