CN115314444B - SDN-based time-sensitive network gating decision method and device - Google Patents

SDN-based time-sensitive network gating decision method and device Download PDF

Info

Publication number
CN115314444B
CN115314444B CN202211237243.8A CN202211237243A CN115314444B CN 115314444 B CN115314444 B CN 115314444B CN 202211237243 A CN202211237243 A CN 202211237243A CN 115314444 B CN115314444 B CN 115314444B
Authority
CN
China
Prior art keywords
gating
service
network
tsn
switch
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202211237243.8A
Other languages
Chinese (zh)
Other versions
CN115314444A (en
Inventor
孙雷
胡文学
王健全
朱渊
孙志权
毕紫航
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Science and Technology Beijing USTB
Original Assignee
University of Science and Technology Beijing USTB
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by University of Science and Technology Beijing USTB filed Critical University of Science and Technology Beijing USTB
Priority to CN202211237243.8A priority Critical patent/CN115314444B/en
Publication of CN115314444A publication Critical patent/CN115314444A/en
Application granted granted Critical
Publication of CN115314444B publication Critical patent/CN115314444B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/28Flow control; Congestion control in relation to timing considerations
    • H04L47/283Flow control; Congestion control in relation to timing considerations in response to processing delays, e.g. caused by jitter or round trip time [RTT]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design
    • H04L41/142Network analysis or design using statistical or mathematical methods
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/56Queue scheduling implementing delay-aware scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/6215Individual queue per QOS, rate or priority

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Algebra (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Physics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Pure & Applied Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides a time-sensitive network gating decision method and device based on an SDN (software defined network), and relates to the technical field of industrial communication. The method comprises the following steps: establishing a TSN control architecture based on a software definition concept; a device for managing and controlling the TSN network switching equipment is constructed based on a software definition concept by adopting a fully centralized control architecture model; and uniformly scheduling and arranging a TSN end-to-end gating list based on the gating decision mechanism of the SDN to finish the time-sensitive network gating decision based on the SDN. The method comprises the steps that an end-to-end delay upper bound of a service under the scene of multiple groups of network nodes is quantitatively analyzed aiming at a TAS mechanism widely adopted by a TSN in an industrial scene; and (3) a TSN centralized control architecture based on an SDN is set up, and GCL configuration control decision is carried out on the switch through cooperative cooperation among the functional modules. Under the condition of guaranteeing the time delay performance QoS requirement of the service based on a centralized network controller architecture and simplifying the gating setting complexity, a feasible solution is provided for the service scheduling based on the queue.

Description

SDN-based time-sensitive network gating decision method and device
Technical Field
The invention relates to the technical field of industrial communication, in particular to a time-sensitive network gating decision method and device based on an SDN.
Background
A time-sensitive network (TSN) has a deterministic delay guarantee and a multi-service carrying capability, solves the problem of data transmission in the same network in the industrial internet, and becomes a research hotspot of the existing industrial field network. However, the standard protocol of the TSN only defines a method for forwarding and processing data, and does not specify the networking of the TSN in an industrial environment. Therefore, in a complex industrial network environment, an end-to-end delay analysis mode in a time sensitive network multi-node networking environment is established for the quality-of-service (QoS) requirement index constraints such as delay, jitter, packet loss rate and rate, and the delay performance of the network under extreme conditions is quantitatively analyzed, which is a difficult problem for the current time sensitive network application.
The TSN is a new type of network with deterministic latency data transmission capability built on the basis of the conventional ethernet. The main reason for the lack of certainty in conventional ethernet is that it is essentially a shared transmission medium, congestion occurs when the traffic in the network is too large, the queuing time cannot be predicted, and certainty is difficult to guarantee. For the TSN, the main task is to guarantee the end-to-end delay and jitter requirements of the time sensitive traffic flow, and therefore, the boundedness of the end-to-end delay is a leading feature of the transmission determinacy of the TSN. Network calculation is a deterministic queuing theory based on minimum additive numbers, and in recent years, the network performance boundary is widely drawn, including the boundary of an individual network node or the end-to-end time delay of a network. The document 1[ Axer P, thiele D, ernst R, et al, application relating to application context to implementation requirements of ethernet AVB networks [ C ]// IEEE Design Automation Conference (DAC) ] San Francisco: IEEE, 2014: 1-6] utilizes the inherent characteristics of the Ethernet AVB service to analyze the worst end-to-end time delay of the service under the non-frame preemption strategy; document 2 [ Mohammadpour E, stai E, mohimuddin M, et al, latex and backlog bases in time-sensitive network with credit based shapers and asynchronous traffic shapers (ITC 30) ] IEEE, 2018: 1-6 analyzes the formation factors of network congestion under credit-based shapers (CBS) and Asynchronous Traffic Shapers (ATS) and evaluates the delay performance of network nodes at different rates; document 3 [ Zhao L, paul P, cracinuas S. Work-case latency analysis for IEEE802.1Qbv time sensitive networks using network clock [ j ]. IEEE Access, 2018, 6: 41803-41815.] for the influence of gate-control list (GCL) time distribution in IEEE802.1Qbv on end-to-end delay, a GCL scheduling model based on flexible windows is proposed by using network calculus, and the upper bound of end-to-end delay of the model under different configurations is analyzed.
In the existing time delay upper bound analysis based on network calculation in the TSN, on one hand, the arriving model of the service is characterized by very simple drawing, and most of the time delay upper bound analysis adopts the quantity of burst length to describe; on the other hand, the existing research is mainly based on the CBS mechanism defined in IEEE802.1 Qav to perform end-to-end delay analysis of services. How to model the service through network calculation and guide the design of the traffic shaper are currently challenging and of research value.
The TAS is defined by IEEE802.1Qbv standard, and specifies whether or not message transmission is possible for a priority service at every moment by using the GCL, and in the case of full network clock synchronization, the GCL in the TAS periodically controls the opening and closing of each queue exit gate and performs transmission in accordance with a strict priority scheme. Under the multi-node networking scene, to ensure the end-to-end delay certainty of time-sensitive services, the gating lists of multiple switching nodes need to be cooperatively set, which is a difficult problem faced by IEEE802.1Qbv in real networking. In addition, when a multi-node cooperative networking is performed, in order to prevent interference of low-priority traffic on high-priority traffic, the gating setting of the high-priority traffic is generally not "overlapped" with the gating setting of the low-priority traffic, which not only increases the difficulty of queue gating cooperative arrangement, but also sacrifices the network bandwidth in exchange for the "certainty" of transmission of the high-priority traffic.
Disclosure of Invention
The invention provides a time-sensitive network gating decision method and device based on an SDN (software defined network), aiming at the problems that in the prior art, queue gating cooperative arrangement is difficult, and network bandwidth is sacrificed to replace certainty of high-priority service transmission.
In order to solve the technical problems, the invention provides the following technical scheme:
in one aspect, a time-sensitive network gating decision method based on an SDN is provided, and the method is applied to an electronic device and includes the following steps:
s1: a fully centralized control architecture model is adopted, and a device framework for managing and controlling the time sensitive network TSN switching equipment is constructed based on a software definition concept;
s2: based on the device framework for managing and controlling the TSN switching device, a Software Defined Network (SDN) technology is adopted, a TSN gating decision mechanism based on the SDN is established, and a centralized network controller is obtained;
s3: and based on the centralized network controller, performing TSN end-to-end gating unified scheduling and arrangement to complete SDN-based time-sensitive network gating decision.
Optionally, in S2, a Software Defined Network (SDN) technology is adopted to establish a TSN gating decision mechanism based on SDN, including:
and acquiring a global network topology view of the TSN by adopting a Software Defined Network (SDN) technology, performing centralized control on network switching equipment, and establishing a TSN gating decision mechanism based on the SDN.
Optionally, in step S3, based on the centralized network controller, performing unified scheduling and scheduling of TSN end-to-end gating, including:
s31: presetting time nodes, and acquiring the time delay performance QoS requirement of a terminal service through centralized user configuration on the basis of time synchronization of each node;
s32: and converting the acquired time delay performance QoS requirement to a centralized network controller, and performing TSN end-to-end gating unified scheduling and arranging through the centralized network controller.
Optionally, in step S31, collecting the delay performance QoS requirement of the terminal service through centralized user configuration includes:
through centralized user configuration, collecting service information, the capability of a TSN switch and queue gating state parameters, wherein the service information comprises: the length of the data frame, the generation time of the service information at the sending end and the service period.
Optionally, in step S32, performing end-to-end unified scheduling and scheduling of TSNs by the centralized network controller includes:
analyzing the upper bound of the end-to-end time delay of the TSN through the centralized network controller, evaluating whether the gating setting of each switch on the end-to-end path meets the QoS requirement of the terminal service according to the upper bound of the time delay, outputting gating meeting the QoS requirement of the time delay performance of the user, and configuring the gating result to the corresponding switch.
Optionally, step S32 further includes:
and for the service which does not meet the QoS requirement, adjusting switch gating on the transmission path, returning to the switch database, and re-analyzing the time delay upper bound of the service after the gating information is updated until the QoS requirement of the terminal service is met.
Optionally, analyzing, by the centralized network controller, an upper bound of the end-to-end delay of the TSN includes:
the network calculation-based time delay upper bound analysis model is used for carrying out quantitative analysis on an end-to-end time delay upper bound under the scene of multiple groups of network nodes, wherein the network calculation-based time delay upper bound analysis model comprises the following steps: a traffic arrival model and a switch service model.
Optionally, the traffic arrival model comprises:
for periodic traffic, according to a GCRA model of the generic cell rate algorithm
Figure 819037DEST_PATH_IMAGE001
For a target flow, the arrival model is expressed as
Figure 281242DEST_PATH_IMAGE002
For a network topology, if traffic is present
Figure 769993DEST_PATH_IMAGE001
From the source side, a cycle of
Figure 975846DEST_PATH_IMAGE003
Then the arrival model is as shown in equation (1),
Figure 968073DEST_PATH_IMAGE004
wherein,
Figure 866759DEST_PATH_IMAGE005
Which represents the length of one data frame,
Figure 577226DEST_PATH_IMAGE006
is as follows
Figure 321191DEST_PATH_IMAGE006
And a switching node.
In one aspect, a time-sensitive network gating decision making apparatus based on SDN is provided, where the apparatus is applied to an electronic device, and the apparatus includes:
the centralized network control module is used for constructing a device framework for managing and controlling the TSN switching equipment based on a software definition concept by adopting a fully centralized control architecture model;
a decision mechanism establishing module, configured to establish a TSN gating decision mechanism based on an SDN by using a Software Defined Network (SDN) technology based on the device framework for management and control of the TSN switching device, and obtain a centralized network controller;
and the gating decision module is used for performing end-to-end gating unified scheduling and arrangement on the basis of the centralized network controller to finish the time sensitive network gating decision based on the SDN.
Optionally, the decision mechanism establishing module is configured to adopt a software defined network SDN, obtain a global view of the network through the SDN, perform centralized management and control on the network, and establish a gating decision mechanism based on the SDN.
In one aspect, a computer-readable storage medium is provided, where at least one instruction is stored, and the at least one instruction is loaded and executed by a processor to implement the SDN-based time-sensitive network gating decision method.
The technical scheme of the embodiment of the invention at least has the following beneficial effects:
in the above scheme, 1) the delay upper bound quantization analysis model based on network calculation: aiming at a multi-node networking application scene, transmission interference of low-priority service to high-priority service is introduced based on an overlapping mechanism among different queue gating windows, the model solves the upper bound of end-to-end time delay of a TSN (time delay network) under a TAS (time delay simulator) mechanism aiming at the worst condition of gating, and the upper bound of the time delay is expressed by the maximum horizontal deviation between two curves in a service arrival-exchange service model calculated by a network at an exchanger. Based on the establishment of a network calculus time delay quantitative analysis and evaluation mechanism, an important judgment basis is provided for the evaluation of the feasibility of gating setting.
2) TSN centralized control architecture and decision function module based on SDN: the method comprises the steps of building a TSN control architecture based on an SDN to conduct centralized control on a network, deploying a delay upper bound analysis model, and judging whether gating configuration of a TSN switch meets requirements or not according to collected service characteristics and user delay performance QoS requirements, so that the method is used for decision making of multi-switch gating list configuration in the TSN.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of a time-sensitive network gating decision method based on SDN according to an embodiment of the present invention;
fig. 2 is a flowchart of a time-sensitive network gating decision method based on SDN according to an embodiment of the present invention;
fig. 3 is a diagram of a centralized controller and a functional module of an SDN-based TSN of a SDN-based time-sensitive network gating decision method according to an embodiment of the present invention;
fig. 4 is a time delay upper bound analysis model diagram of a time-sensitive network gating decision method based on SDN according to an embodiment of the present invention;
fig. 5 is a service arrival model diagram of a time-sensitive network gating decision method based on SDN according to an embodiment of the present invention;
fig. 6 is a model diagram of "service arrival-switch service" of a SDN-based time-sensitive network gating decision method according to an embodiment of the present invention;
fig. 7 is a network topology structure diagram of a time-sensitive network gating decision method based on SDN according to an embodiment of the present invention;
fig. 8 is a schematic diagram of an arrival process of a same queue service in a SDN-based time-sensitive network gating decision method according to an embodiment of the present invention;
fig. 9 is a graph of arrival of switch 1 high priority traffic for a SDN-based time-sensitive network gating decision method according to an embodiment of the present invention;
fig. 10 is a block diagram of a time-sensitive network gating decision device based on SDN according to an embodiment of the present invention;
fig. 11 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the technical problems, technical solutions and advantages of the present invention more apparent, the following detailed description is given with reference to the accompanying drawings and specific embodiments.
The embodiment of the invention provides a time-sensitive network gating decision method based on an SDN (software defined network). As shown in fig. 1, a flowchart of a time-sensitive network gating decision method based on SDN, a processing flow of the method may include the following steps:
s101: a device for managing and controlling the TSN network switching equipment is constructed based on a software definition concept by adopting a fully centralized control architecture model;
s102: establishing a TSN gating decision mechanism based on SDN by adopting a Software Defined Network (SDN) technology;
s103: and performing TSN end-to-end gating unified scheduling and arrangement based on the gating decision mechanism of the SDN to finish the time sensitive network gating decision based on the SDN.
Optionally, in step S102, a software defined network SDN is adopted, and a gating decision mechanism based on the SDN is established, including:
and acquiring a global network topology view of the TSN by adopting a Software Defined Network (SDN) technology, performing centralized control on network switching equipment, and establishing a TSN gating decision mechanism based on the SDN.
Optionally, in step S103, performing end-to-end unified scheduling and orchestration of TSNs based on the gating decision mechanism of the SDN includes:
s131: presetting time nodes, and collecting the time delay performance QoS requirement of the terminal service through the centralized user configuration on the basis of time synchronization of each node;
s132: and converting the acquired delay performance QoS requirement to a centralized network controller, and performing end-to-end unified scheduling and arranging of TSN through the centralized network controller.
Optionally, in step S131, acquiring a delay performance QoS requirement of a terminal service through the centralized user configuration includes:
through the centralized user configuration, collecting service information, the capacity of a TSN switch and queue gating state parameters, wherein the service information comprises: the length of the data frame, the generation time and the generation period of the data frame at the transmitting end.
Optionally, in step S132, performing end-to-end unified scheduling and scheduling of TSNs by the centralized network controller includes:
analyzing the upper bound of the end-to-end time delay of the TSN through the centralized network controller, evaluating whether the gating setting of each switch on the end-to-end path meets the QoS requirement of the terminal service according to the upper bound of the time delay, outputting gating meeting the QoS requirement of the time delay performance of a user, and configuring the gating to the corresponding switch.
Optionally, step S132 further includes:
and for the service which does not meet the QoS requirement, adjusting switch gating on a transmission path of the service, returning to a switch database, and re-analyzing the time delay upper bound of the service after the gating information is updated until the QoS requirement of the terminal service is met.
Optionally, analyzing, by the centralized network controller, an upper bound of the end-to-end delay of the TSN includes:
the method comprises the steps of quantitatively analyzing an end-to-end delay upper bound under the scene of multiple groups of network nodes based on a network calculation-based delay upper bound analysis model, wherein the network calculation-based delay upper bound analysis model comprises the following steps: a traffic arrival model and a switch service model.
Optionally, the traffic arrival model comprises:
for periodic services, according to a GCRA model of the general cell rate algorithm
Figure 433503DEST_PATH_IMAGE001
For the target flow, the arrival model is expressed as
Figure 237511DEST_PATH_IMAGE002
For a network topology, if traffic is present
Figure 700854DEST_PATH_IMAGE001
From the source side, a cycle of
Figure 248510DEST_PATH_IMAGE003
Then the arrival model is as shown in equation (1),
Figure 215329DEST_PATH_IMAGE004
wherein, the first and the second end of the pipe are connected with each other,
Figure 721396DEST_PATH_IMAGE005
which represents the length of one data frame,
Figure 140876DEST_PATH_IMAGE006
is as follows
Figure 492223DEST_PATH_IMAGE006
And a switching node.
In the embodiment of the invention, aiming at a TAS mechanism widely adopted by TSN in an industrial scene, a time delay upper bound analysis and evaluation mechanism based on network calculation is provided, and the end-to-end time delay upper bound of a service under the scene of a plurality of groups of network nodes is quantitatively analyzed; and (3) a TSN centralized control architecture based on an SDN is set up, and GCL configuration control decision is carried out on the switch through cooperative cooperation among the functional modules. Under the condition of ensuring the time delay performance QoS requirement of the service and simplifying the complexity of gating setting based on the IEEE802.1Qbv and the centralized network controller architecture, a feasible solution is provided for the service scheduling based on the queue.
The embodiment of the invention provides a time-sensitive network gating decision method based on an SDN (software defined network). Fig. 2 is a flowchart of a time-sensitive network gating decision method based on SDN, and fig. 3 is a network topology diagram of energy efficiency optimization of a communication-sensitive integrated network. The processing flow of the method can comprise the following steps:
s201: a device framework for managing and controlling the time-sensitive network TSN switching equipment is constructed by adopting a fully centralized control architecture model and based on a software definition concept.
In the embodiment of the invention, a full-centralized control architecture model is adopted, a TSN (software defined network) control architecture is realized based on a software definition concept, and an SDN (software-defined network) performs centralized control on a network by acquiring a global view of the network, so that high-efficiency resource scheduling capability is provided.
S202: a TSN switching device management and control-based device framework adopts Software Defined Network (SDN) technology to establish a TSN gating decision mechanism based on SDN and obtain a centralized network controller.
In the embodiment of the invention, on the premise that the whole network is always synchronous, a fully centralized control architecture model transfers user requirements to centralized user configuration for centralized acquisition and unified conversion, so that the guarantee capability of QoS (quality of service) is increased, the QoS (quality of service) guarantee capability is transmitted to a centralized network controller through a northbound interface after conversion, and the centralized network controller has network functions of calculating a topological path and the like, and after optimal calculation of a global network view is realized, updated routing path, GCL and other configuration information are transmitted to a TSN (switched traffic network) switching network through a southbound interface.
S203: and presetting time nodes, and acquiring the time delay performance QoS requirement of the terminal service through centralized user configuration on the basis of time synchronization of each node.
In a possible embodiment, parameters such as traffic information, TSN switch capability, queue gating status, etc. are collected through the centralized user configuration, where the traffic information includes: the length of the data frame, the generation time and the generation period of the data frame at the transmitting end.
S204: and converting the acquired time delay performance QoS requirement to a centralized network controller, and performing TSN end-to-end gating unified scheduling and arrangement through the centralized network controller to complete the SDN-based time sensitive network gating decision.
In a feasible implementation manner, when TSN end-to-end unified scheduling and arrangement are performed in combination with a gating decision mechanism based on an SDN, firstly, a centralized user configures, on the basis of time synchronization of each node, the delay performance QoS requirements of terminal services to be acquired, and the acquired requirements are converted and sent to a centralized network controller, as shown in fig. 3, the centralized network controller serves as a controller constructed based on the SDN, firstly, parameters such as service information, the capacity of a TSN switch, a queue gating state and the like are collected so as to perform centralized decision and evaluation, and finally, gating meeting the user QoS requirements is output by evaluating an upper bound of end-to-end transmission delay of a data frame, and the gating is configured to a corresponding switch.
As shown in fig. 3, the SDN-based TSN centralized controller and function module includes:
a switch database: storing parameters (including bandwidth of a switch port, GCL and the like) of all switches in the current network;
a topology discovery module: counting service information (including data frame length, generation time and generation period of the data frame at a transmitting end, and the like) in the network, and forwarding the service information downwards;
the time delay upper bound analysis and evaluation module comprises: analyzing the upper bound of the end-to-end time delay of the TSN through the information, and evaluating whether the gating setting of each switch on the end-to-end path meets the requirement of the service QoS or not according to the upper bound of the time delay;
a GCL calculation module: for the service which does not meet the QoS requirement, the switch gating on the transmission path is adjusted, the switch gating is returned to the switch database, and the delay upper bound of the service after the gating information is updated is reanalyzed;
a network configuration module: and configuring the GCL value meeting the requirements of all service time delay performance QoS to the switch, and finally finishing the service scheduling decision based on the queue.
In a possible implementation manner, the centralized network controller analyzes an upper bound of end-to-end delay of the TSN, evaluates whether gating setting of each switch on an end-to-end path meets a QoS requirement of a terminal service according to the upper bound of the delay, outputs gating meeting the QoS requirement of the delay performance of a user, and configures the gating to a corresponding switch.
In a feasible implementation manner, for a service which does not meet the QoS requirement, the switch gating on the transmission path is adjusted, and the service returns to the switch database, and the delay upper bound of the service after the gating information is updated is reanalyzed until the QoS requirement of the terminal service is met.
In a possible implementation manner, the network-calculus-based upper delay bound analysis model performs quantitative analysis on an upper end-to-end delay bound under a plurality of groups of network node scenarios, where the network-calculus-based upper delay bound analysis model includes: a traffic arrival model and a switch service model.
In a feasible implementation manner, in the delay analysis and evaluation module, the analysis of the upper delay bound is based on a delay upper bound analysis model of network calculation, and the quantitative analysis is performed on the upper end-to-end delay bound under the scene of multiple groups of network nodes. The service arrival model and the switch service model are two basic tools of network calculus, and are important basis for evaluating the upper bound of the delay by the network calculus.
When the invention analyzes the end-to-end delay upper bound of the TSN under the TAS mechanism by utilizing network calculation, the switch service model is only related to the GCL of the TSN switch. The upper bound of the end-to-end delay is the maximum level difference formed by overlapping the two models under the worst condition. Fig. 4 shows a solution for the upper time delay bound.
In a possible embodiment, the GCRA model is based on the general cell rate algorithm for periodic services
Figure 313549DEST_PATH_IMAGE001
For the target flow, the arrival model is expressed as
Figure 990518DEST_PATH_IMAGE002
Because on the egress port side of the switch, the same priority traffic arriving at the switch will enter the same queue. For a network topology, if traffic
Figure 631715DEST_PATH_IMAGE001
From the source side, a cycle of
Figure 255594DEST_PATH_IMAGE003
Then the arrival model is as shown in equation (1),
Figure 400268DEST_PATH_IMAGE004
wherein the content of the first and second substances,
Figure 982559DEST_PATH_IMAGE005
which represents the length of one data frame,
Figure 111052DEST_PATH_IMAGE006
is as follows
Figure 804201DEST_PATH_IMAGE006
And a switching node.
The traffic arrival model is represented as a graph according to equation (1), as shown in fig. 5.
In addition, the same priority service data frame of the multiple input ports of the switch has self-queuing competition, and the priority is in the moment
Figure 328680DEST_PATH_IMAGE007
Arrival model for business
Figure 347452DEST_PATH_IMAGE008
The sum of the arrival model functions for the traffic of the same priority at each input port is expressed as the formula,
Figure 228820DEST_PATH_IMAGE009
wherein
Figure 725661DEST_PATH_IMAGE010
Indicating the kind of the same priority service;
Figure 641664DEST_PATH_IMAGE011
the number of the same kind of service on the same queue.
Traffic arrival model for path successor switching nodes
Figure 300178DEST_PATH_IMAGE012
With the current node
Figure 668843DEST_PATH_IMAGE008
The delay bound is determined by the maximum horizontal distance between two curves in the 'traffic arrival-switch service' model, so that the switch service model is required
Figure 703795DEST_PATH_IMAGE013
And (4) performing representation. Thus giving it again in the subsequent analysis
Figure 739884DEST_PATH_IMAGE014
In one possible implementation, the worst case switch service model:
switch service model
Figure 569300DEST_PATH_IMAGE013
The service capability of a switching node in a network is related to factors such as the opening and closing condition of an internal queue door structure of a switch, the opening time of a window and the like. For the service model, when the traffic arrives at the corresponding queue, because there is an overlap between the windows, its transmission on the queue will be interfered by other priority queues, and the patent claims an upper bound of delay, so the service model with the worst interference situation is considered.
Like the traffic arrival model, the switch service model is also a cumulative function. For a TSN switch, there are 8 different priority queues per egress port for traffic
Figure 690840DEST_PATH_IMAGE001
Is an object, in a queue
Figure 529483DEST_PATH_IMAGE015
Service it, wherein
Figure 623341DEST_PATH_IMAGE016
To do so
Figure 623658DEST_PATH_IMAGE017
Representing a set of queues whose service model is determined by the service model function of each gated window transmission slot, and is obtained by summing them. When traffic is subjected to non-frame-preemption transmission on the corresponding queues, the traffic is interfered by high-priority and low-priority queues and is influenced by guard bands. Under the influence of the three interference factors, the guaranteed service time slot is passed
Figure 170177DEST_PATH_IMAGE018
And offset between time slots
Figure 812510DEST_PATH_IMAGE019
Maximum waiting time
Figure 26454DEST_PATH_IMAGE020
Equation of isoparametric and willWhich is substituted into the service model function to represent the switch service model,
Figure DEST_PATH_IMAGE022A
wherein
Figure 479563DEST_PATH_IMAGE023
Figure 451062DEST_PATH_IMAGE024
The dequeue forwarding rate for the switch.
While the service model is intended to represent any one transmission slot
Figure 897086DEST_PATH_IMAGE025
Then it is required to
Figure 231116DEST_PATH_IMAGE026
As a starting point, for a supercycle
Figure 856393DEST_PATH_IMAGE027
Of all time slots in
Figure 908662DEST_PATH_IMAGE028
The summation is performed.
So that the target flow rate
Figure 627220DEST_PATH_IMAGE001
In the first place
Figure 815756DEST_PATH_IMAGE006
A queue of switching nodes
Figure 859935DEST_PATH_IMAGE029
Business arrival model over
Figure 399501DEST_PATH_IMAGE030
And switch service model
Figure 921749DEST_PATH_IMAGE031
Respectively, indicating completion. The two models are shown in the same figure, which is the "traffic arrival-switch service" model applied in this patent, as shown in fig. 6.
Maximum horizontal distance between two curves in fig. 6
Figure 230370DEST_PATH_IMAGE032
I.e. the upper bound of the delay sought,
Figure 445451DEST_PATH_IMAGE032
is obtained in the case where the traffic arrival model curve at the location is above the switch service model curve. Representing the upper delay bound of the current node
Figure 206734DEST_PATH_IMAGE032
Then, the arrival model described above is combined
Figure 532673DEST_PATH_IMAGE033
Then the arrival model of the service at the next node can be obtained
Figure 961380DEST_PATH_IMAGE034
Expressed as formula (4),
Figure 81783DEST_PATH_IMAGE035
in one possible embodiment, the gating decision mechanism:
by the technical scheme, the establishment of a time delay quantitative analysis model based on network calculation is completed aiming at a TAS mechanism and aiming at a multi-node networking application scene. And evaluating the upper bound of the end-to-end delay under the given gating condition by comparing the requirement with the QoS (quality of service) delay performance so as to judge the rationality of gating setting. If the delay bound is smaller than the QoS requirement during comparison, GCL configuration can be directly carried out on the exchanger; otherwise, the gating setting does not meet the requirement of time delay, a new GCL value needs to be calculated, time delay upper bound analysis is carried out for multiple times, and finally a feasible GCL value meeting the requirement of service QoS is configured to the switch. Therefore, the gating decision of multiple switches is completed, and the requirement of the centralized network controller on the dynamic configuration of the switches is realized, namely the implementation process of the mechanism in fig. 2.
In a feasible implementation manner, according to the above scheme, a delay upper bound analysis model based on network calculation is modularized to form a centralized network controller delay upper bound analysis and evaluation module, so as to realize calculation of an upper bound of network end-to-end delay under a given topology. In practical application, because the end-to-end delay of the high-priority service is preferentially guaranteed according to the order of the service priorities, the upper bound of the end-to-end delay of the high-priority service is considered in a centralized manner in the embodiment.
The network topology structure is shown in fig. 7, in which there are 5 service sending terminals, 1 service receiving terminal and two TSN switches.
The service arrival model adopted in this embodiment is a step function, that is, the service is periodically generated by the sending end and sent to the switch, so the time for the service to arrive at the switch is also periodic, and for a data stream
Figure 595941DEST_PATH_IMAGE036
Its arrival period is recorded as
Figure 725571DEST_PATH_IMAGE037
Figure 743205DEST_PATH_IMAGE037
The period is constant, because the propagation rate of the data frame on the link is the same, the period is the same as the generation period of the traffic data frame at the transmitting end.
The service priority is first defined. After being input to the switch, the services with different priorities enter different queues for buffering, the service with the high priority has strong sensitivity to time and needs to be transmitted within a certain time, otherwise, the service with the low priority has poor sensitivity to time. Artificially set flow
Figure 300089DEST_PATH_IMAGE036
Priority of (2)
Figure 301543DEST_PATH_IMAGE038
And arrival period
Figure 703705DEST_PATH_IMAGE037
In inverse proportion to each other, i.e.
Figure 575846DEST_PATH_IMAGE037
The smaller the size of the tube is,
Figure 303631DEST_PATH_IMAGE038
the higher. Therefore, if the generation cycles of the data streams are the same, the priorities of the data streams are also the same, and after the data streams arrive at the switch, the data streams with the same priority enter the same queue for buffering, and are transmitted after the gating window is opened. Due to the fact that the time of the traffic arriving at the switch is different, the arrival model of the data flow on the same queue is an aperiodic function, and the graph is represented to be an irregular graph. Two services with the same priority on one queue are taken as an example for explanation, as shown in fig. 8. In the figure, the position of the first and second end faces,
Figure 526802DEST_PATH_IMAGE039
representing a frame of data.
Four kinds of services are set and sent to a TSN switch from five service sending ends respectively, the four kinds of services are divided into three priorities according to an arrival period, and after the four kinds of services arrive at the switch, the four kinds of services are transmitted on three queues inside the switch, so that the queues are defined as high-priority queues, medium-priority queues and low-priority queues respectively. According to the foregoing, the present embodiment only discusses the high-priority service, and therefore, only the high-priority service information needs to be given and the arrival model function is shown, and other priority service information does not need to be defined. Of these four services, there are two high priority services, symbolized
Figure 732655DEST_PATH_IMAGE040
Indicating that they are generated by sender 1, sender 2 and sender 5, respectively, with an arrival period of
Figure 724882DEST_PATH_IMAGE041
. According to the topology structure diagram, relative to the time 0, in the initial period, the time of two services generated by the transmitting end 1 and the transmitting end 2 reaching the switch 1 is respectively
Figure 623568DEST_PATH_IMAGE042
And
Figure 334035DEST_PATH_IMAGE043
and the traffic generated by the sender 5 arrives at the exchange 2 at the time of
Figure 343579DEST_PATH_IMAGE044
. As with the solution objective, only the arrival model of the high priority traffic is fitted, taking switch 1 as an example, and the arrival model of the high priority traffic is shown in fig. 9.
Combining with a step function model, expressing the arrival model of the high-priority service of the two switches as a formula,
Figure 455892DEST_PATH_IMAGE045
arrival curve of exchange 1
Figure 259900DEST_PATH_IMAGE046
Figure 723242DEST_PATH_IMAGE047
Since the traffic received by switch 2 comes from two parts, its arrival model function is represented in the form of an addition,
Figure 270898DEST_PATH_IMAGE048
in the above two formulas, the first and second groups,
Figure 237717DEST_PATH_IMAGE049
represents the time offset of arrival of high priority traffic at the switch relative to time 0, where
Figure 478206DEST_PATH_IMAGE050
Figure 163265DEST_PATH_IMAGE051
Figure 780191DEST_PATH_IMAGE052
Representing the upper bound of the delay of traffic flowing through switch 1.
For a switch service model, its ability to express network service data, in relation to network state, involves the gating setup problem of the switch. According to the topology structure diagram, two TSN switches are shared in the network, and gating setting is needed. It is known that the queue gating window cycle is opened and closed, and thus the parameter settings include the opening and closing time of the gating window in the initial cycle, and the queue gating cycle. It is known that "1" represents the gating on state, and "0" represents the gating off state, and when the gating state is "1", data is transmitted, otherwise, data is not transmitted. Because the end-to-end delay of the high-priority service is guaranteed first, queue gating is set according to the sequence of the queue priority from high to low, and a high-priority queue gating window needs to be guaranteed to have a certain width. Defining gating periods of different queues as
Figure 798919DEST_PATH_IMAGE053
The opening time of each queue gating window in the initial period of the switch 1 is
Figure 210309DEST_PATH_IMAGE054
Corresponding off-time of
Figure 382665DEST_PATH_IMAGE055
Then the opening and closing time of other periodic gating windows can pass
Figure 272123DEST_PATH_IMAGE056
Figure 213534DEST_PATH_IMAGE057
And with
Figure 530246DEST_PATH_IMAGE053
In the form of a sum:
Figure 924318DEST_PATH_IMAGE058
Figure 883047DEST_PATH_IMAGE059
wherein
Figure 678965DEST_PATH_IMAGE060
And the sequence number of the gating window is represented, so that after the gating period is determined, only the opening and closing time of the gating window in the initial period needs to be defined. Firstly, setting equal gating periods of all queues
Figure 432157DEST_PATH_IMAGE061
Based on the queue gating period, the GCL hypercycle of the switch is also determined, also
Figure 579105DEST_PATH_IMAGE061
Therefore, each priority queue has a gating window in a super-cycle. Then according to the sequence of priority from high to low, combining the time of data frame arriving at the exchanger, setting the opening and closing time of every queue gate control window in the initial period in turn, setting the opening and closing time of high priority queue gate control window as
Figure 810366DEST_PATH_IMAGE044
And
Figure 460790DEST_PATH_IMAGE062
when the gating windows of the other two priority queues are set, in order to explain the problem, the gating windows of the other two priority queues are overlapped with the gating window of the high priority queue to a certain degree, and the opening and closing time of the gating window of the medium priority queue is set as
Figure 650463DEST_PATH_IMAGE063
And
Figure 19127DEST_PATH_IMAGE043
low priority is
Figure 54080DEST_PATH_IMAGE064
And
Figure 824589DEST_PATH_IMAGE044
. At this point, a set of GCLs for switch 1 is set to completion.
Similarly, the same is true for the gating definition of switch 2, which has the same gating period as switch 1, but the opening and closing times of the queue gating window are different. After the gating parameter configuration is determined, the upper bound of the end-to-end delay of the high-priority service under the corresponding GCL is solved according to the formulas (5) and (6).
Figure 919584DEST_PATH_IMAGE065
In the formula (I), the compound is shown in the specification,
Figure 775545DEST_PATH_IMAGE066
as a priority queue
Figure 614188DEST_PATH_IMAGE067
At one is
Figure 239204DEST_PATH_IMAGE068
The number of inner door control windows is equal to
Figure 505101DEST_PATH_IMAGE069
Figure 582778DEST_PATH_IMAGE070
Is the upper bound on the latency inside both switches.
And quantitatively analyzing the upper bound of the end-to-end time delay of the TSN under the scene of multiple groups of network nodes through the established end-to-end time delay upper bound analysis model so as to judge whether the gating setting can meet the time delay performance QoS requirement of the service, thereby completing the construction of a gating decision model and deploying the gating decision model in a centralized network controller module to realize the GCL configuration of multiple switches.
In the embodiment of the invention, 1) a time delay upper bound quantitative analysis model based on network calculation: aiming at a multi-node networking application scene, transmission interference of low-priority service to high-priority service is introduced based on an overlapping mechanism among different queue gating windows, the model solves the upper bound of end-to-end time delay of a TSN (time delay network) under a TAS (time delay simulator) mechanism aiming at the worst condition of gating, and the upper bound of the time delay is expressed by the maximum horizontal deviation between two curves in a service arrival-exchange service model calculated by a network at an exchanger. Based on the establishment of a network calculus time delay quantitative analysis and evaluation mechanism, an important judgment basis is provided for the evaluation of the feasibility of gating setting.
2) TSN centralized control architecture and decision function module based on SDN: the method comprises the steps of building a TSN control architecture based on an SDN to conduct centralized control on a network, deploying a delay upper bound analysis model, and judging whether gating configuration of a TSN switch meets requirements or not according to collected service characteristics and user delay performance QoS requirements, so that the method is used for decision making of multi-switch gating list configuration in the TSN.
Figure 10 is a block diagram illustrating an SDN based time sensitive network gating decision device, according to an example embodiment. Referring to fig. 10, the apparatus 300 includes:
the centralized network controller module 310 is configured to construct a device framework for managing and controlling the TSN switch device in the time sensitive network based on a software definition concept by using a fully centralized control architecture model;
a decision mechanism establishing module 320, configured to establish a TSN gating decision mechanism based on an SDN by using a Software Defined Network (SDN) technology based on the device framework for managing and controlling the TSN switching device, so as to obtain a centralized network controller;
and the gating decision module 330 is configured to perform unified scheduling and scheduling of end-to-end gating of the TSN based on the centralized network controller, and complete a time-sensitive network gating decision based on the SDN.
Optionally, the decision mechanism establishing module is configured to obtain a global network topology view of the TSN by using a Software Defined Network (SDN) technology, perform centralized control on the network switching device, and establish a TSN gating decision mechanism based on the SDN.
Optionally, the gating decision module 330 is configured to preset time nodes, and collect the delay performance QoS requirement of the terminal service through the centralized user configuration on the basis of time synchronization of each node;
and converting the acquired time delay performance QoS requirement to a centralized network controller, and performing TSN end-to-end unified scheduling and arrangement through the centralized network controller to complete the SDN-based time-sensitive network gating decision.
Optionally, the gating decision module 330 is configured to collect, through the centralized user configuration, parameters such as traffic information, a capability of a TSN switch, a queue gating state, and the like, where the traffic information includes: the length of the data frame, the generation time and the generation period of the data frame at the transmitting end.
Optionally, the gating decision module 330 is configured to analyze an upper bound of end-to-end delay of the TSN through the centralized network controller, evaluate whether a gating setting of each switch on an end-to-end path meets a QoS requirement of a terminal service according to the upper bound of delay, output a gating meeting the QoS requirement of user delay performance, and configure the gating to a corresponding switch.
Optionally, the gating decision module 330 is further configured to:
and for the service which does not meet the QoS requirement, adjusting switch gating on the transmission path, returning to the switch database, and re-analyzing the time delay upper bound of the service after the gating information is updated until the QoS requirement of the terminal service is met.
Optionally, the gating decision module 330 is configured to perform quantitative analysis on an end-to-end delay upper bound under a plurality of sets of network nodes based on a network calculus delay upper bound analysis model, where the network calculus delay upper bound analysis model includes: a traffic arrival model and a switch service model.
Optionally, the traffic arrival model comprises:
for periodic traffic, according to a GCRA model of the generic cell rate algorithm
Figure 490691DEST_PATH_IMAGE001
For the target flow, the arrival model is expressed as
Figure 970214DEST_PATH_IMAGE002
For a network topology, if traffic is present
Figure 407012DEST_PATH_IMAGE001
From the source side, a cycle of
Figure 237564DEST_PATH_IMAGE003
Then the arrival model can be expressed as,
Figure 152431DEST_PATH_IMAGE004
wherein the content of the first and second substances,
Figure 752039DEST_PATH_IMAGE005
which represents the length of one data frame,
Figure 625317DEST_PATH_IMAGE006
is a first
Figure 677587DEST_PATH_IMAGE006
And a switching node.
Fig. 11 is a schematic structural diagram of an electronic device 400 according to an embodiment of the present invention, where the electronic device 400 may generate relatively large differences due to different configurations or performances, and may include one or more processors (CPUs) 401 and one or more memories 402, where the memory 402 stores at least one instruction, and the at least one instruction is loaded and executed by the processor 401 to implement the following steps of the SDN-based time-sensitive network gating decision method:
s1: a fully centralized control architecture model is adopted, and a device framework for managing and controlling the time-sensitive network TSN switching equipment is constructed based on a software definition concept;
s2: based on the device framework for managing and controlling the TSN switching device, a Software Defined Network (SDN) technology is adopted, a TSN gating decision mechanism based on the SDN is established, and a centralized network controller is obtained;
s3: and based on the centralized network controller, performing TSN end-to-end gating unified scheduling and arrangement to complete SDN-based time-sensitive network gating decision.
In an exemplary embodiment, a computer-readable storage medium, such as a memory, is also provided that includes instructions executable by a processor in a terminal to perform the SDN based time sensitive network gating decision method described above. For example, the computer readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, where the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and should not be taken as limiting the scope of the present invention, which is intended to cover any modifications, equivalents, improvements, etc. within the spirit and scope of the present invention.

Claims (2)

1. A time-sensitive network gating decision method based on an SDN is characterized by comprising the following steps:
s1: a fully centralized control architecture model is adopted, and a device framework for managing and controlling the time sensitive network TSN switching equipment is constructed based on a software definition concept;
s2: based on the device framework for managing and controlling the TSN switching equipment, a Software Defined Network (SDN) technology is adopted, a TSN gating decision mechanism based on the SDN is established, and a centralized network controller is obtained;
s3: based on the centralized network controller, performing TSN end-to-end gating unified scheduling and arrangement to complete SDN-based time-sensitive network gating decision;
in step S2, a Software Defined Network (SDN) technology is adopted to establish a TSN gating decision mechanism based on SDN, including:
adopting Software Defined Network (SDN) technology to obtain a global network topology view of the TSN, performing centralized control on network switching equipment, and establishing a TSN gating decision mechanism based on the SDN;
in step S3, based on the centralized network controller, performing TSN end-to-end gating unified scheduling and scheduling, including:
s31: presetting time nodes, and acquiring the time delay performance QoS requirement of the terminal service through centralized user configuration on the basis of time synchronization of each node;
s32: converting the acquired time delay performance QoS requirement to a centralized network controller, and performing TSN end-to-end gating unified scheduling and arrangement through the centralized network controller to complete the SDN-based time sensitive network gating decision;
in step S31, acquiring the delay performance QoS requirement of the terminal service through centralized user configuration includes:
through centralized user configuration, collecting service information, the capability of a TSN switch and queue gating state parameters, wherein the service information comprises: the length of a data frame, the generation time of service information at a sending end and a service period;
in step S32, performing end-to-end unified scheduling and scheduling of TSNs by the centralized network controller includes:
analyzing the upper bound of the end-to-end time delay of the TSN through the centralized network controller, evaluating whether the gating setting of each switch on the end-to-end path meets the QoS requirement of the terminal service according to the upper bound of the time delay, outputting gating meeting the QoS requirement of the time delay performance of a user, and configuring the gating result to the corresponding switch;
the step S32 further includes:
for the service which does not meet the QoS requirement, the switch gating on the transmission path is adjusted, the switch gating is returned to the switch database, and the delay upper bound of the service after the gating information is updated is re-analyzed until the QoS requirement of the terminal service is met;
analyzing, by the centralized network controller, an upper bound of a TSN end-to-end delay includes:
the network calculation-based time delay upper bound analysis model is used for carrying out quantitative analysis on an end-to-end time delay upper bound under the scene of multiple groups of network nodes, wherein the network calculation-based time delay upper bound analysis model comprises the following steps: a business arrival model and a switch service model;
the business arrival model comprises:
for periodic services, according to a GCRA model of the general cell rate algorithm
Figure 838897DEST_PATH_IMAGE001
For the target flow, the arrival model is expressed as
Figure 277968DEST_PATH_IMAGE002
For a network topology, if traffic is present
Figure 288650DEST_PATH_IMAGE001
From the source side, periodically to the input port of the first switch, and with a period of
Figure 522185DEST_PATH_IMAGE003
Then the arrival model is as shown in equation (1),
Figure 883896DEST_PATH_IMAGE004
(1)
wherein, the first and the second end of the pipe are connected with each other,
Figure 96965DEST_PATH_IMAGE005
which represents the length of one data frame,
Figure 493311DEST_PATH_IMAGE006
is a first
Figure 632169DEST_PATH_IMAGE006
A switching node;
the switch service model is an accumulation function, and guarantees service time slots when the server is influenced by interference factors
Figure 481176DEST_PATH_IMAGE007
Offset between time slots
Figure 996471DEST_PATH_IMAGE008
Maximum waiting time
Figure 247324DEST_PATH_IMAGE009
The parameters are formulated and substituted into the switch service model function, namely, the switch service model is represented:
Figure 822662DEST_PATH_IMAGE010
(3)
wherein
Figure 893386DEST_PATH_IMAGE011
Figure 212372DEST_PATH_IMAGE012
Dequeue forwarding rate for the switch;
the service model for representing any transmission time slot needs to be expressed by
Figure DEST_PATH_IMAGE013
As a starting point, for a supercycle
Figure 583310DEST_PATH_IMAGE014
Of all time slots in
Figure DEST_PATH_IMAGE015
The summation is carried out, and in the analysis of the upper bound of the time delay, the switches are taken as one after the summation
Figure 329549DEST_PATH_IMAGE014
Minimum of amount of service data, hence in queues
Figure 887569DEST_PATH_IMAGE016
Service model of a switch, for example
Figure DEST_PATH_IMAGE017
Can be represented as, for example,
Figure 275826DEST_PATH_IMAGE018
wherein, the first and the second end of the pipe are connected with each other,
Figure DEST_PATH_IMAGE019
as a priority queuemAt one is
Figure 501270DEST_PATH_IMAGE020
The number of the internal door control windows.
2. An SDN-based time-sensitive network gating decision-making apparatus, adapted to the method of claim 1, the apparatus comprising:
the centralized network control module is used for constructing a device framework for managing and controlling the TSN switching equipment based on a software definition concept by adopting a fully centralized control architecture model;
a decision mechanism establishing module, configured to establish a TSN gating decision mechanism based on an SDN by using a Software Defined Network (SDN) technology based on the TSN switch device management and control device framework, and obtain a centralized network controller;
the gate control decision module is used for performing TSN end-to-end gate control unified scheduling and arrangement based on the centralized network controller to complete the SDN-based time sensitive network gate control decision;
the decision mechanism establishing module is used for acquiring a global network topology view of the TSN by adopting a Software Defined Network (SDN) technology, performing centralized control on network switching equipment and establishing a TSN gating decision mechanism based on the SDN;
the gating decision module is used for presetting time nodes and acquiring the time delay performance QoS requirement of the terminal service through the centralized user configuration on the basis of time synchronization of all the nodes;
converting the acquired delay performance QoS requirement to a centralized network controller, and performing end-to-end unified scheduling and arranging on TSN through the centralized network controller to complete the time sensitive network gating decision based on SDN;
a gating decision module, configured to collect, through the centralized user configuration, service information, a capability of a TSN switch, and a queue gating state parameter, where the service information includes: the length of a data frame, the generation time and the generation period of the data frame at a transmitting end;
the gate control decision module is used for analyzing the upper bound of the end-to-end time delay of the TSN through the centralized network controller, evaluating whether the gate control setting of each switch on the end-to-end path meets the QoS requirement of the terminal service according to the upper bound of the time delay, outputting the gate control meeting the QoS requirement of the time delay performance of the user, and configuring the gate control to the corresponding switch;
a gating decision module further configured to:
for the service which does not meet the QoS requirement, the switch gating on the transmission path is adjusted, the switch gating is returned to the switch database, and the delay upper bound of the service after the gating information is updated is re-analyzed until the QoS requirement of the terminal service is met;
the gate control decision module is used for carrying out quantitative analysis on an end-to-end delay upper bound under the scene of a plurality of groups of network nodes based on a network calculation-based delay upper bound analysis model, wherein the network calculation-based delay upper bound analysis model comprises: a business arrival model and a switch service model;
the business arrival model includes:
for periodic traffic, according to a GCRA model of the generic cell rate algorithm
Figure 418411DEST_PATH_IMAGE001
For the target flow, the arrival model is expressed as
Figure 463727DEST_PATH_IMAGE002
For a network topology, if traffic is present
Figure 634770DEST_PATH_IMAGE001
From the source side, periodically to the input port of the first switch, and with a period of
Figure 449142DEST_PATH_IMAGE003
Then the arrival model can be expressed as,
Figure 802763DEST_PATH_IMAGE004
(1)
wherein, the first and the second end of the pipe are connected with each other,
Figure DEST_PATH_IMAGE021
which represents the length of one data frame,
Figure 600955DEST_PATH_IMAGE006
is as follows
Figure 534276DEST_PATH_IMAGE006
A switching node;
the switch service model is an accumulation function, and guarantees service time slots when the server is influenced by interference factors
Figure 468733DEST_PATH_IMAGE007
Offset between time slots
Figure 993256DEST_PATH_IMAGE008
Maximum waiting time
Figure 747585DEST_PATH_IMAGE009
The parameters are formulated and substituted into the switch service model function, namely, the switch service model is represented:
Figure 15755DEST_PATH_IMAGE022
(3)
wherein
Figure DEST_PATH_IMAGE023
C out Dequeue forwarding rate for the switch;
the service model for representing any transmission time slot needs to be expressed by
Figure 804720DEST_PATH_IMAGE024
As a starting point, for a supercycle
Figure DEST_PATH_IMAGE025
Of all time slots in
Figure 500143DEST_PATH_IMAGE015
The summation is carried out, and in the analysis of the upper bound of the time delay, the switches are taken as one after the summation
Figure 7348DEST_PATH_IMAGE026
Minimum value of amount of internal service data, thus in queuemFor example, a service model of a switch
Figure 813630DEST_PATH_IMAGE017
Can be expressed as a number of times,
Figure 191522DEST_PATH_IMAGE027
wherein, the first and the second end of the pipe are connected with each other,
Figure 57847DEST_PATH_IMAGE019
is a priority queue
Figure 786768DEST_PATH_IMAGE028
At one is
Figure 898206DEST_PATH_IMAGE020
The number of the internal door control windows.
CN202211237243.8A 2022-10-11 2022-10-11 SDN-based time-sensitive network gating decision method and device Active CN115314444B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211237243.8A CN115314444B (en) 2022-10-11 2022-10-11 SDN-based time-sensitive network gating decision method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211237243.8A CN115314444B (en) 2022-10-11 2022-10-11 SDN-based time-sensitive network gating decision method and device

Publications (2)

Publication Number Publication Date
CN115314444A CN115314444A (en) 2022-11-08
CN115314444B true CN115314444B (en) 2023-01-17

Family

ID=83868076

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211237243.8A Active CN115314444B (en) 2022-10-11 2022-10-11 SDN-based time-sensitive network gating decision method and device

Country Status (1)

Country Link
CN (1) CN115314444B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116233031B (en) * 2023-01-04 2024-03-22 北京科技大学 Implementation method of time-sensitive network switch model
CN116668306B (en) * 2023-06-08 2024-02-23 中国人民解放军国防科技大学 Three-view-angle-based network engineering planning method and system for mobile communication network

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10298503B2 (en) * 2016-06-30 2019-05-21 General Electric Company Communication system and method for integrating a data distribution service into a time sensitive network
CN112511462B (en) * 2020-12-17 2022-07-26 上海交通大学 Software-defined industrial heterogeneous time-sensitive network system and resource scheduling method
CN114500392B (en) * 2021-10-15 2023-07-25 鹏城实验室 Time sensitive network gating list item generation method
CN114389946B (en) * 2022-02-14 2023-09-12 重庆邮电大学 Network configuration management method for TSN switch
CN114666280B (en) * 2022-03-10 2023-09-01 山东大学 Industrial Internet time delay optimization method based on time-sensitive software defined network
CN115150274B (en) * 2022-09-06 2022-11-25 国网湖北省电力有限公司电力科学研究院 Unified configuration method, system and storage medium for time-sensitive network equipment

Also Published As

Publication number Publication date
CN115314444A (en) 2022-11-08

Similar Documents

Publication Publication Date Title
CN112073388B (en) Time-sensitive heterogeneous network system of industrial control system and management method
CN115314444B (en) SDN-based time-sensitive network gating decision method and device
Zhao et al. Timing analysis of AVB traffic in TSN networks using network calculus
Larrañaga et al. Analysis of 5G-TSN integration to support industry 4.0
Laursen et al. Routing optimization of AVB streams in TSN networks
Zhang et al. Analysis of TSN for industrial automation based on network calculus
CN113630893B (en) 5G and TSN joint scheduling method based on wireless channel information
Zhou et al. Analysis and modeling of asynchronous traffic shaping in time sensitive networks
US20220150159A1 (en) Control device, switch device and methods
Liu et al. Towards large-scale deterministic IP networks
Shang et al. Delay evaluation of openflow network based on queueing model
CN114666280A (en) Industrial internet time delay optimization method based on time sensitive software defined network
Prados-Garzon et al. Asynchronous time-sensitive networking for industrial networks
CN114172975B (en) Industrial heterogeneous network protocol deterministic conversion method and device
CN115225587A (en) Asynchronous terminal system scheduling optimization method based on constraint programming
Deng et al. A low-delay AVB flow scheduling method occupying the guard band in Time-Sensitive Networking
Zheng et al. Mix-flow scheduling for concurrent multipath transmission in time-sensitive networking
Luo et al. Hierarchical computing network collaboration architecture for industrial internet of things
Liu et al. Joint routing and scheduling for cqf
CN115811799A (en) DDPG (distributed data processing) -based 5G-TSN (time delay network) combined resource scheduling device and method
Liu et al. Network calculus-based modeling of time sensitive networking shapers for industrial automation networks
CN114257554A (en) Scheduling method for improving TSN (traffic service network) BE (BE) stream bandwidth utilization rate
Mahani et al. Heavy-tail and voice over internet protocol traffic: queueing analysis for performance evaluation
Benammar et al. Timing analysis of AVB Ethernet network using the forward end-to-end delay analysis
Nie et al. TAMCQF: Hybrid Traffic Scheduling Mechanism Integrating TAS and Multi-CQF in TSN

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant