Research On The Key Techniques Of Deterministic Networking Based On Segment Routing

The rapid development of the Industrial Internet of Things has brought great changes to the way of production and lifestyle of human beings,and at the same time,it has put forward more stringent requirements on the service quality of the network.Deterministic Networking(Det Net)is a kind of network technology that provides commitment quality of service for the time-sensitive traffic in the packet network.It enables the network through the comprehensive application of Explicit Routes,Resource Allocation,Service Protection and other mechanisms to ensure low jitter and low packet loss and predictable end-to-end delay bound of time-sensitive traffic in the transmission process.Segment Routing(SR)is a source routing protocol,which has the characteristics of source routing and programmable header instruction.Segment Routing provides a new idea for enabling Deterministic Networking because of its programmability of Segments,natural support of Explicit Routes function,and powerful functional programming ability.In this thesis,the Explicit Routes,Service Protection and Resource Allocation problems of Deterministic Networking are implemented by combining Segment Routing technology.Specific research contents are as follows:In order to solve the problem of Explicit Routes and Service Protection of Deterministic Networking,a Service Protection mechanism for Deterministic Networking,which is called the improved Packet Replication Elimination and Ordering Functions mechanism based on Segment Routing(SR-PREOF)is proposed in this thesis.SR-PREOF mechanism improves at the path calculation part and the Segment Routing policy programming part,and the feasibility of the proposed mechanism is verified by a Segment Routing example.The simulation results show that compared with the traditional mechanism,the proposed SR-PREOF mechanism can achieve ultra-high path reliability performance,and effectively improve the packet reception rate and reduce the end-to-end worst-case latency bound.To solve the problem of Explicit Routes and Resource Allocation of Deterministic Networking,a joint routing and scheduling mechanism for Deterministic Networking based on Segment Routing(SR-DTRS)is proposed in this thesis.SR-DTRS mechanism consists of three parts: the delay budget part,the Deadline-based probabilistic dropping processing and the three-queue cyclic queuing model.And the feasibility of this mechanism is verified by an example of Segment Routing scheduling with deterministic paths.The simulation results show that compared with the traditional mechanism,the SR-DTRS reduces the end-to-end worst-case latency bound and improves the packet reception rate within the delay budget time.In summary,in this thesis,we realize the network programming of three key techniques for Deterministic Networking through Segment Routing technology from the point of ensuring the quality of service of Deterministic Networking.SR-PREOF and SR-DTRS mechanisms are proposed to guarantee high reliability and bounded low latency service performance for Deterministic Networking.The research results provide support for the realization of the key techniques for Deterministic Networking and have certain application value.