Comparative study of link bandwidth scheduling algorithms suitable for UV optical communication networks

Ultraviolet optical communication and its networking applications are limited by its technical performance parameters. To address the resulting bandwidth constraints therein, this paper proposes a new credit-based scheduling algorithm and conducts a comparative study between the traditional scheduling algorithm and the credit-based scheduling algorithm for the scenarios of multi-service transmission, relatively large number of service packet transmission, etc., and discusses the characteristics and performance of the different algorithms, under the conditions of bandwidth constraints. The simulation experiment results show that compared with the traditional algorithm, the credit-based scheduling algorithm proposed in this paper is more suitable for the bandwidth-constrained scenarios of UV optical communication, and has more advantages in bandwidth allocation, dynamic adjustment, and reliable service.