Utility-Based Online Bandwidth Allocation for Bonded Channels

Abstract

This paper focuses on the bonding group online bandwidth allocation problem in DOCSIS3.0 network. Taking network maximization utility as the goal, an optimal model, which is the Bonding Group based rival service flow Set Utility Maximization (BG-SUM), is built firstly, and then a Bonding Group Online Bandwidth Allocation algorithm (BG-OBA) is proposed to perform fast near-optimal solution. By discretizing the utility functions of requests, the BG-OBA fast allocate bandwidth for service flows and then verifies the feasibility of the bandwidth redistributed to each channel in bonding group. The simulation results show that the convergence speed of BG-OBA is faster than 0-1 integer programming, and the total utility is close to the theoretical optimum, hence it is practical for online bandwidth allocatio