Research On Multipath Bandwidth Scheduling Algorithms For Flexible Deadline Requests In High Performance Networks

With the vigorous development of new technologies such as artificial intelligence,blockchain and the Internet of Things,as well as the popularity of mobile Internet devices,the amount of data generated has grown explosively.The huge amount of data has given rise to the development of cloud computing technology,while the transmission of big data between data centers also faces huge challenges.The best-effort transmission mode in the traditional IP network can no longer meet the demand of big data transmission.As an effective solution for big data transmission,High Performance Networks(HPNs)has been widely recognized.With the development of Software Defined Networking(SDN)technology,the functions of HPNs can be easily realized by using SDN technology,such as providing dedicated channels for big data transmission through bandwidth reservation.In order to cater to more big data transmission scenarios and thus further improve bandwidth utilization,this paper studies the problem of scheduling a batch of bandwidth reservation requests with flexible deadline constraints through multiple links-disjoint paths in HPNs,so as to maximize the on-time Accomplish Rate(OAR)and on-time Data Volume Rate(ODVR).The content of this paper includes the following aspects:(1)For the bandwidth reservation request with flexible deadline,the multi-path periodic bandwidth scheduling problem is analyzed,and the problem is proved to be NP-complete.(2)The time-slot dynamic priority strategy is innovatively adopted,that is,the priority is updated according to the request of all requests for data transmission in each time slot,combined with the remaining time to the deadline of each request,and the remaining amount of data transmission.Different from the bandwidth scheduling algorithm commonly used in the field of HPNs,which calculates the reserved result for each request and then carries out the calculation of the next request.Converts the calculation of bandwidth reservation for a single request across multiple time slots to scheduling multiple requests uniformly in a single time slot.The flexibility of reservation is improved and then the network bandwidth utilization is improved.(3)Based on the time-slot dynamic priority strategy,two bandwidth scheduling algorithms were designed for periodic bandwidth scheduling problem with flexible cut-off time reservation(PBSP-FDBRR),combining the sequential occupied bandwidth allocation method and the linear programming bandwidth allocation method.(4)Based on SDN simulation platform,We conduct simulation experiments on the proposed bandwidth scheduling algorithm and the comparison algorithm with two kinds of request loads in a real HPN topology.The experimental results shows that the proposed bandwidth scheduling algorithm has better performance than existing algorithms.