Design And Implementation Of Priority Queue Scheduling Mechanism Of Smart Integration Identifier Networking

The rapid development of the Internet has facilitated people’s daily life.However,the continuous emergence of new network services puts forward diversified service requirements for network transmission in terms of delay,jitter,packet loss rate and so on.For example,industrial Internet requires highly reliable transmission,telemedicine and driverless require low delay transmission,augmented reality requires high bandwidth.The traditional network "best effort" data transmission mode has disadvantages in traffic fine-grained management and dynamic queue scheduling,which is difficult to meet the needs of deterministic delay of new services.It is urgent to carry out research on new network architecture technology.As a new type of network architecture,Smart Integration Identifier Networking(SINET)provides differentiated services on demand for different users through the intelligent integration of multi-space and multi-dimensional resources across the entire network.Therefore,based on SINET and its key mechanism,this paper starts with the packet queuing mechanism,focuses on the deterministic delay requirements of traffic,and studies the delay guarantee during the parallel transmission of multiple streams with different delay requirements.The main work of this paper includes the following three parts:(1)This paper designs the priority queue scheduling mechanism of SINET.The scheduling mechanism includes two schemes.For the scenario with low delay jitter,a scheduling scheme based on dynamic queue weight(P4-DWRR)is designed.On the basis of weighted rotation scheduling,P4-DWRR dynamically adjusts the queue weight according to the link status to ensure the delay demand of packets.For the scenario with large delay jitter,resilient-priority queue scheduling(RPQ)based on dynamic packet level is designed.RPQ encapsulates the accumulated delay of the packet into itself,uses the prediction algorithm to predict the end-to-end delay of packets,and dynamically adjusts the packet level according to the relationship between the accumulated delay,the predicted delay and the demand delay,so as to ensure the delay demand of the packet.(2)This paper implements the priority queue scheduling mechanism of SINET based on programmable data plane.Specifically,this paper monitors the link status and obtains the delay information in the control plane,realizes the information interaction between the control plane and the data plane with the data plane register,realizes the content analysis of the packet based on the "parser" processing of the programmable plane,and realizes the dynamic adjustment of the queue weight and packet level by using "match-action" processing flow combined with the corresponding algorithm.(3)In order to analyze and verify the feasibility and effectiveness of the priority scheduling mechanism in SINET,this paper carries out experimental function test and performance analysis of the mechanism.The experimental results show that in a variety of network scenarios,compared with SP-PIFO and WRR,the priority queue scheduling mechanism proposed in this paper reduces the round trip time by more than 10% and 40% respectively,and reduces the delay jitter by more than 40% and 60%.