Skip to Main Content
This paper presents an dynamic scheduling algorithm. The purpose of the algorithm is to maximize revenue of the network service provider and share network resources at the fair way. The presented algorithm is derived from the linear type of revenue target function, and a closed form globally optimal formula is presented. The method is computationally inexpensive, while still producing maximal revenue. Due to the simplicity of the algorithm, it can operate in the highly non-stationary environments. In addition, it is non-parametric and deterministic in the sense that it uses only the information about the number of users and their traffic classes, not about call density functions or duration distributions.
Communications, 2003. APCC 2003. The 9th Asia-Pacific Conference on (Volume:3 )
Date of Conference: 21-24 Sept. 2003