Method and device for scheduling burst traffic in time-sensitive network based on game theory
By applying game theory methods in time-sensitive networks, calculating the status score and game coefficients of the transmission link, selecting the optimal link to transmit burst traffic, solving the problem of burst traffic scheduling and improving the transmission efficiency and reliability of the network , avoid waste of resources and enhance stability.
Patent Information
- Application Number
- CN202410894660.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-04
- Publication Date
- 2024-11-15
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
Existing time-sensitive networks can only support the deterministic transmission of periodic traffic, and the lack of effective scheduling methods for burst traffic, making it difficult to ensure data transmission efficiency and reliability in complex networks.
Using a game theory-based method, by obtaining burst traffic and periodic traffic parameters of the transmission link, calculating the state scores and game coefficients of each link, selecting the optimal transmission link for burst traffic transmission, ensuring that data is time-sensitive Efficient and reliable transmission in the network.
It improves the scheduling efficiency and reliability of burst traffic in time-sensitive networks, avoids resource waste, reduces the impact on cyclical traffic scheduling, and enhances the stability and reliability of the network.
Smart Images

Figure CN118972341A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of industrial Internet technology, and in particular to a method and device for scheduling burst traffic in a time-sensitive network based on game theory. Background Art
[0002] With the rapid development of network and information technology, the industrial Internet is also booming, and information technology and operational technology are also deeply integrated. In industrial networks, a huge amount of data is generated every day, and the current industrial competition is also a competition for data. Therefore, the real-time and deterministic nature of data transmission in industrial networks is particularly important. The "Best Effort" strategy adopted by traditional Ethernet cannot guarantee the deterministic delay of data, and thus it is difficult to meet the needs of modern industry. Time sensitive network (TSN) is a new industrial communication technology. Time sensitive network allows periodic and non-periodic data to be transmitted in the same network, which makes standard Ethernet have the advantage of deterministic transmission. Through the independent standardization process of manufacturers, it has become a key technology that has attracted widespread attention. Time sensitive network mainly works at the data link layer. Because it has functions such as precise clock synchronization and flow control, the generation and transmission time of data in the network can be planned in advance to ensure data transmission, thereby building a highly reliable, low-latency, and low-jitter network, becoming the basic network technology for scenarios such as industrial Internet and automotive Ethernet.
[0003] However, under the existing paradigm, the existing time-sensitive network can only support the deterministic transmission of periodic traffic (which can be simply referred to as periodic traffic), but there is no suitable scheduling method for bursty traffic (which can be simply referred to as bursty traffic). Summary of the invention
[0004] In view of this, the embodiments of the present application provide a method and device for scheduling burst traffic in a time-sensitive network based on game theory to eliminate or improve one or more defects existing in the prior art.
[0005] One aspect of the present application provides a method for scheduling burst traffic in a time-sensitive network based on game theory, comprising:
[0006] Obtaining burst flow parameters and periodic flow parameters of all schedulable transmission links corresponding to the burst flow to be transmitted in the time-sensitive network;
[0007] Determine, according to the burst traffic parameters and periodic traffic parameters of each of the transmission links, the state scores of the periodic traffic currently in the time-sensitive network and the burst traffic in each of the transmission links;
[0008] Based on the status scores of the periodic traffic and the burst traffic in each of the transmission links, respectively, determining the game coefficient of each of the transmission links based on game theory;
[0009] According to the respective game coefficients of the transmission links, one of the transmission links is selected as the current target transmission link, and the burst traffic is transmitted in the time-sensitive network based on the target transmission link.
[0010] In some embodiments of the present application, the step of obtaining burst traffic parameters and periodic traffic parameters of all schedulable transmission links corresponding to the burst traffic to be transmitted in the time-sensitive network includes:
[0011] Obtain all schedulable transmission links corresponding to the burst traffic to be transmitted in the time-sensitive network;
[0012] Determine the link parameters of each transmission link, wherein the link parameters include: a statistical packet loss rate, an average data packet transmission time, and an average data packet processing time of the transmission link within a preset time period;
[0013] Based on the link parameters of each of the transmission links, the burst flow parameters and periodic flow parameters of each of the transmission links are respectively obtained, wherein the burst flow parameters include: the number of data packets and the maximum delay corresponding to the burst data flow; the periodic flow parameters include: the total number of periodic data flows and the number of data packets corresponding to each of the periodic data flows.
[0014] In some embodiments of the present application, determining the status scores of the periodic traffic currently in the time-sensitive network and the burst traffic in each of the transmission links according to the burst traffic parameters and the periodic traffic parameters of each of the transmission links respectively includes:
[0015] Based on the link parameters of each of the transmission links, the burst traffic parameters and the periodic traffic parameters, determine the stability score and efficiency score of the burst traffic in each of the transmission links; and according to the stability score and efficiency score of the burst traffic in each of the transmission links, determine the state score of the burst traffic in each of the transmission links;
[0016] Furthermore, based on the link parameters of each of the transmission links and the periodic traffic parameters, the stability score and efficiency score of the periodic traffic in each of the transmission links are determined; and based on the stability score and efficiency score of the periodic traffic in each of the transmission links, the state score of the periodic traffic in each of the transmission links is determined.
[0017] In some embodiments of the present application, the determining of the stability score and the efficiency score of the burst traffic in each of the transmission links based on the link parameters of each of the transmission links, the burst traffic parameters, and the periodic traffic parameters; and determining the state score of the burst traffic in each of the transmission links according to the stability score and the efficiency score of the burst traffic in each of the transmission links, includes:
[0018] According to the number of data packets corresponding to the burst data flow, the average data packet transmission time and the average data packet processing time of each transmission link in a preset time period, and the end-to-end transmission delay of the burst traffic in each transmission link are calculated;
[0019] According to the number of data packets corresponding to the burst data flow, the total number of the periodic data flows, the number of data packets corresponding to each of the periodic data flows, the statistical packet loss rate of each of the transmission links in a preset time period, and the average processing time of the data packets, the stability score of the burst traffic on each of the transmission links is calculated;
[0020] And, according to the total number of each of the transmission links, the end-to-end transmission delay of the burst traffic in each of the transmission links, and the maximum delay corresponding to the burst data flow, calculate the efficiency score of the burst traffic in each of the transmission links;
[0021] Based on the stability scores of the burst traffic on each of the transmission links and the efficiency scores of the burst traffic on each of the transmission links, the state scores of the burst traffic on each of the transmission links are calculated.
[0022] In some embodiments of the present application, the determining, based on the link parameters of each of the transmission links and the periodic flow parameters, the stability score and the efficiency score of the periodic flow in each of the transmission links; and determining, according to the stability score and the efficiency score of the periodic flow in each of the transmission links, the state score of the periodic flow in each of the transmission links, includes:
[0023] According to the total number of the periodic data flows, the number of data packets corresponding to each of the periodic data flows, the average data packet transmission time and the average data packet processing time of each of the transmission links in a preset time period, the end-to-end transmission delay of each of the periodic flows in each of the transmission links is calculated;
[0024] According to the statistical packet loss rate of each transmission link in a preset time period, the stability score of the periodic traffic on each transmission link;
[0025] According to the total number of each of the transmission links and the end-to-end transmission delay of each of the periodic flows in each of the transmission links, the efficiency score of the periodic flows in each of the transmission links is calculated; based on the stability score of the periodic flows in each of the transmission links and the efficiency score of the periodic flows in each of the transmission links, the status score of the periodic flows in each of the transmission links is calculated.
[0026] In some embodiments of the present application, the determining of the game coefficients of the transmission links based on game theory based on the status scores of the periodic traffic and the burst traffic in each transmission link respectively includes:
[0027] Based on a preset game index, the state scores of the burst traffic in each of the transmission links, and the state scores of the periodic traffic in each of the transmission links, the game coefficients corresponding to each of the transmission links are calculated.
[0028] In some embodiments of the present application, selecting one of the transmission links as the current target transmission link according to the respective game coefficients of the transmission links, and transmitting the burst traffic based on the target transmission link in the time-sensitive network includes:
[0029] A transmission link with the smallest game coefficient is selected from each of the transmission links as a current target transmission link, and the burst traffic is transmitted based on the target transmission link in the time-sensitive network.
[0030] Another aspect of the present application provides a burst traffic scheduling device in a time-sensitive network based on game theory, comprising:
[0031] A parameter acquisition module, used to acquire burst flow parameters and periodic flow parameters of all schedulable transmission links corresponding to the burst flow to be transmitted in the time-sensitive network;
[0032] A state score determination module, used to determine the state scores of the periodic flow and the burst flow in each of the transmission links according to the burst flow parameters and periodic flow parameters of each of the transmission links;
[0033] A game coefficient acquisition module, configured to determine the game coefficient of each transmission link based on the state scores of the periodic traffic and the burst traffic in each transmission link and based on game theory;
[0034] The transmission link selection and traffic scheduling module is used to select one of the transmission links as the current target transmission link according to the respective game coefficients of the transmission links, and transmit the burst traffic based on the target transmission link in the time-sensitive network.
[0035] The third aspect of the present application provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method for scheduling burst traffic in a time-sensitive network based on game theory when executing the computer program.
[0036] A fourth aspect of the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method for scheduling burst traffic in a time-sensitive network based on game theory.
[0037] A fifth aspect of the present application provides a computer program product, including a computer program, which, when executed by a processor, implements the method for scheduling burst traffic in a time-sensitive network based on game theory.
[0038] The present application provides a method for scheduling burst traffic in a time-sensitive network based on game theory, by obtaining the burst traffic parameters and periodic traffic parameters of all schedulable transmission links corresponding to the burst traffic to be transmitted in the time-sensitive network; determining the periodic traffic in the time-sensitive network and the state scores of the burst traffic in each transmission link according to the burst traffic parameters and periodic traffic parameters of each transmission link; determining the game coefficient of each transmission link based on game theory based on the state scores of the periodic traffic and the burst traffic in each transmission link; selecting one of the transmission links as the current target transmission link according to the game coefficient of each transmission link, and transmitting the burst traffic in the time-sensitive network based on the target transmission link, so as to realize the optimized scheduling of burst traffic in the time-sensitive network, effectively improve the efficiency and reliability of scheduling burst traffic, avoid waste of resources of the time-sensitive network, reduce the impact on the scheduling of periodic traffic in the time-sensitive network, and thus effectively improve the operation stability and reliability of the time-sensitive network.
[0039] Additional advantages, purposes, and features of the present application will be partially described in the following description, and will become partially apparent to those skilled in the art after studying the following, or may be learned from the practice of the present application. The purposes and other advantages of the present application can be achieved and obtained by the structures specifically pointed out in the specification and the drawings.
[0040] Those skilled in the art will understand that the purposes and advantages that can be achieved by the present application are not limited to the above specific description, and the above and other purposes that can be achieved by the present application will be more clearly understood based on the following detailed description. BRIEF DESCRIPTION OF THE DRAWINGS
[0041] The drawings described herein are used to provide a further understanding of the present application, constitute a part of the present application, and do not constitute a limitation of the present application. The components in the drawings are not drawn to scale, but are only for the purpose of illustrating the principles of the present application. In order to facilitate the illustration and description of some parts of the present application, the corresponding parts in the drawings may be enlarged, that is, they may become larger relative to other components in the exemplary device actually manufactured according to the present application. In the drawings:
[0042] Figure 1 This is a first flow chart of a method for scheduling burst traffic in a time-sensitive network based on game theory in one embodiment of the present application.
[0043] Figure 2 This is a second flow chart of a method for scheduling burst traffic in a time-sensitive network based on game theory in one embodiment of the present application.
[0044] Figure 3 This is a third flow chart of a method for scheduling burst traffic in a time-sensitive network based on game theory in one embodiment of the present application.
[0045] Figure 4 This is a schematic diagram of an example of a network transmission link in an application example of the present application.
[0046] Figure 5 It is a structural diagram of a burst traffic scheduling device in a time-sensitive network based on game theory in one embodiment of the present application. DETAILED DESCRIPTION
[0047] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the implementation modes and the accompanying drawings. Here, the illustrative implementation modes and descriptions of the present application are used to explain the present application, but are not intended to limit the present application.
[0048] It should also be noted here that in order to avoid obscuring the present application due to unnecessary details, only the structures and / or processing steps closely related to the scheme according to the present application are shown in the accompanying drawings, while other details that are not very relevant to the present application are omitted.
[0049] It should be emphasized that the term “include / comprises” when used herein refers to the presence of features, elements, steps or components, but does not exclude the presence or addition of one or more other features, elements, steps or components.
[0050] It should also be noted that, unless otherwise specified, the term “connection” herein may refer not only to a direct connection but also to an indirect connection involving an intermediate.
[0051] Hereinafter, embodiments of the present application will be described with reference to the accompanying drawings. In the accompanying drawings, the same reference numerals represent the same or similar components, or the same or similar steps.
[0052] In order to solve the problem that the existing time-sensitive network can only support deterministic transmission of periodic traffic (which can be simply referred to as periodic traffic), but there is no suitable scheduling method for burst traffic (which can be simply referred to as burst traffic), the embodiments of the present application respectively provide a burst traffic scheduling method in a time-sensitive network based on game theory, a burst traffic scheduling device in a time-sensitive network based on game theory for executing the burst traffic scheduling method in a time-sensitive network based on game theory, an electronic device, a computer-readable storage medium and a computer program product, which can ensure the optimized transmission of burst traffic in a complex network, avoid waste of network resources, and reduce the impact on the scheduling of periodic data traffic in a time-sensitive network.
[0053] The details are described in detail through the following examples.
[0054] Based on this, the embodiment of the present application provides a method for scheduling burst traffic in a time-sensitive network based on game theory, which can be implemented by a burst traffic scheduling device in a time-sensitive network based on game theory. Figure 1 The method for scheduling burst traffic in a time-sensitive network based on game theory specifically includes the following contents:
[0055] Step 100: Obtain burst flow parameters and periodic flow parameters of all schedulable transmission links corresponding to the burst flow to be transmitted in the time-sensitive network.
[0056] In step 100, a burst traffic scheduling device in a time-sensitive network based on game theory detects or receives burst traffic to be transmitted in the time-sensitive network. The burst traffic refers to traffic data that is not included in the periodically transmitted traffic. Correspondingly, the periodically transmitted traffic refers to periodic traffic, for example, it may refer to traffic data currently queued in a queue waiting for transmission.
[0057] In one or more embodiments of the present application, a transmission link refers to a link that can be used to transmit burst traffic sent from a data transmitter to a data receiver via an intermediate transmission device such as a switch in a time-sensitive network. Correspondingly, all schedulable transmission links corresponding to burst traffic refer to all links that are currently in the time-sensitive network that are likely to transmit the burst traffic.
[0058] It can be understood that the burst flow parameter of the transmission link refers to a parameter of the transmission link related to the transmission of the burst flow, and the periodic flow parameter of the transmission link refers to a parameter of the transmission link related to the transmission of the periodic flow.
[0059] Step 200: According to the burst traffic parameters and periodic traffic parameters of each of the transmission links, the status scores of the periodic traffic currently in the time-sensitive network and the burst traffic in each of the transmission links are determined respectively.
[0060] In one or more embodiments of the present application, the state score is used to represent the score of the performance or state corresponding to a certain type of traffic when transmitted in a certain transmission link, and can be used to represent the stability or efficiency of the transmission, etc.
[0061] Step 300: Based on the status scores of the periodic traffic and the burst traffic in each of the transmission links, the game coefficients of each of the transmission links are determined based on game theory.
[0062] Among them, game theory, also known as game theory, game theory, etc., is not only a new branch of modern mathematics, but also an important discipline of operations research. The goal of game theory is to study the optimal decision-making problem under conflict and confrontation conditions. When multiple objects specify strategies, there are two major types of behavior, namely collusion and competition. When they decide to choose collusion, they will consider each other's behavior and find the result that maximizes the interests of both. The purpose of game theory is to explain this mutually influencing behavior through models in order to find the optimal decision-making plan. The implementation principle of game theory mainly relies on mathematical models.
[0063] Step 400: According to the respective game coefficients of the transmission links, one of the transmission links is selected as the current target transmission link, and the burst traffic is transmitted in the time-sensitive network based on the target transmission link.
[0064] It can be understood that the game coefficient refers to the game coefficient indicator in game theory.
[0065] From the above description, it can be seen that the method for scheduling burst traffic in a time-sensitive network based on game theory provided in the embodiment of the present application can achieve optimized scheduling of burst traffic in a time-sensitive network, and can effectively improve the efficiency and reliability of scheduling burst traffic, avoid waste of resources in the time-sensitive network, and can reduce the impact on periodic traffic scheduling in the time-sensitive network, thereby effectively improving the operating stability and reliability of the time-sensitive network.
[0066] In order to further improve the effectiveness and accuracy of obtaining the burst flow parameters and periodic flow parameters of each transmission link, in a burst flow scheduling method in a time-sensitive network based on game theory provided in an embodiment of the present application, see Figure 2 , step 100 in the method for scheduling burst traffic in a time-sensitive network based on game theory specifically includes the following contents:
[0067] Step 110: Obtain all schedulable transmission links corresponding to the burst traffic to be transmitted in the time-sensitive network.
[0068] That is, in one or more embodiments of the present application, the transmission link can be represented as L i , all schedulable transmission links corresponding to burst traffic can be expressed as: L = [L1, L2, ... L N ], where L represents the set of all schedulable transmission links corresponding to burst traffic; N represents the total number of all schedulable transmission links corresponding to burst traffic, N is a positive integer greater than 2, L i represents L1, L2, ... L N Any one of , i.e., the i-th transmission link.
[0069] In a specific implementation of step 110, the burst traffic scheduling device in the time-sensitive network based on game theory can determine other transmission links (such as L2 to L3) that can be used for scheduling according to the current transmission link (such as L1) of the burst traffic to be transmitted in the time-sensitive network currently detected or received. N ), and then together constitute all the schedulable transmission links L1, L2, ... L corresponding to the burst traffic. N .
[0070] Step 120: Determine the link parameters of each of the transmission links, wherein the link parameters include: a statistical packet loss rate, an average data packet transmission time, and an average data packet processing time of the transmission link within a preset time period.
[0071] The link parameters may be obtained from preset statistical parameters within a preset time period, and the link parameters may also be referred to as transmission link parameters. The link parameters may at least include: the statistical packet loss rate P of the transmission link within a preset time period; i , average data packet transmission time t i and the average packet processing time τ i , that is, {P i ,t i ,τ i}.
[0072] Step 130: Based on the link parameters of each of the transmission links, respectively obtain the burst traffic parameters and periodic traffic parameters of each of the transmission links, wherein the burst traffic parameters include: the number of data packets and the maximum delay corresponding to the burst data flow; the periodic traffic parameters include: the total number of periodic data flows and the number of data packets corresponding to each of the periodic data flows.
[0073] The burst traffic parameters may at least include: the number of data packets corresponding to the burst data flow m c and the maximum delay t c The periodic flow parameters may include at least: the total number of periodic data flows currently in the queue J and the number of packets corresponding to each periodic data flow m j The burst data flow refers to the burst traffic data, and the periodic data flow refers to the periodic traffic data.
[0074] Specifically, for the transmission link L i , the set of each periodic data flow F1, F2, F3, ... F currently in the queue state can be expressed as: F = {F1, F2, F3, ... F J}, J is a positive integer greater than 3, for any periodic data flow F j , the corresponding number of data packets is m j .
[0075] In order to further improve the effectiveness and accuracy of obtaining the status scores of the periodic traffic and the burst traffic in each of the transmission links, in a burst traffic scheduling method in a time-sensitive network based on game theory provided in an embodiment of the present application, see Figure 2 Step 200 of the method for scheduling burst traffic in a time-sensitive network based on game theory specifically includes the following contents:
[0076] Step 210: Based on the link parameters of each of the transmission links, the burst traffic parameters and the periodic traffic parameters, determine the stability score and efficiency score of the burst traffic in each of the transmission links; and determine the state score of the burst traffic in each of the transmission links according to the stability score and efficiency score of the burst traffic in each of the transmission links.
[0077] In step 210, the burst traffic scheduling device in the time-sensitive network based on game theory determines the stability score f of the burst traffic in each of the transmission links based on the link parameters of each of the transmission links, the burst traffic parameters and the periodic traffic parameters. i (P i ) and efficiency score g i (Ei ); and according to the burst traffic, the stability score f of each transmission link is respectively i (P i ) and efficiency score g i (E i ), determine the state score C of the burst traffic in each of the transmission links respectively i .
[0078] And, step 220: based on the link parameters of each of the transmission links and the periodic traffic parameters, determine the stability score and efficiency score of the periodic traffic in each of the transmission links; and based on the stability score and efficiency score of the periodic traffic in each of the transmission links, determine the state score of the periodic traffic in each of the transmission links.
[0079] In step 220, the burst traffic scheduling device in the time-sensitive network based on game theory determines the stability score x of the periodic traffic in each of the transmission links based on the link parameters of each of the transmission links and the periodic traffic parameters. i (P i ) and efficiency score y i (T i ); and according to the periodic flow, the stability score x of each transmission link is respectively i (P i ) and efficiency score y i (T i ), determine the state score Z of the periodic flow in each of the transmission links respectively i .
[0080] That is to say, the burst traffic scheduling device in the time-sensitive network based on game theory can calculate the state score of the burst traffic and periodic traffic in the time-sensitive network on each transmission link for all schedulable transmission links based on the burst traffic parameters and periodic traffic parameters of each transmission link.
[0081] In order to further improve the effectiveness and accuracy of determining the state scores of the burst traffic in each of the transmission links, in a burst traffic scheduling method in a time-sensitive network based on game theory provided in an embodiment of the present application, see Figure 3 , step 210 in the method for scheduling burst traffic in a time-sensitive network based on game theory specifically includes the following contents:
[0082] Step 211: Calculate the end-to-end transmission delay of the burst traffic in each of the transmission links based on the number of data packets corresponding to the burst data flow, the average data packet transmission time and the average data packet processing time of each of the transmission links within a preset time period.
[0083] In step 211, the burst traffic scheduling device in the time-sensitive network based on game theory calculates the number of data packets m corresponding to the burst data flow. c , the average transmission time t of the data packets of each transmission link in a preset time period i and the average packet processing time τ i , calculate the end-to-end transmission delay E of the burst traffic in each transmission link i .
[0084] Specifically, the burst traffic can be set to have the highest priority so as to be transmitted first, and the end-to-end transmission delay E of the burst traffic in each transmission link is i The calculation formula is as follows:
[0085] E i =m c τ i +t i
[0086] Step 212: Calculate the stability score of the burst traffic on each of the transmission links based on the number of data packets corresponding to the burst data flow, the total number of the periodic data flows, the number of data packets corresponding to each of the periodic data flows, the statistical packet loss rate of each of the transmission links within a preset time period, and the average processing time of the data packets.
[0087] In step 212, the burst traffic scheduling device in the time-sensitive network based on game theory calculates the number of data packets m corresponding to the burst data flow. c , the total number of periodic data flows J, the number of data packets corresponding to each periodic data flow m j , the statistical packet loss rate P of each transmission link in a preset time period i and the average packet processing time τ i , calculate the stability score f of the burst traffic on each transmission link i (P i ).
[0088] Specifically, the burst traffic is respectively at the stability score f of each transmission link i (P i ) is calculated as follows:
[0089]
[0090] Among them, f i (P i ) represents the transmission link L i The stability score of the transmission link packet loss rate P i Related.
[0091] And, step 213: according to the total number of each transmission link, the end-to-end transmission delay of the burst traffic in each transmission link and the maximum delay corresponding to the burst data flow, calculate the efficiency score of the burst traffic in each transmission link.
[0092] In step 213, the burst traffic scheduling device in the time-sensitive network based on game theory calculates the burst traffic according to the total number N of each transmission link, the end-to-end transmission delay E of each burst traffic in each transmission link, and the burst traffic in each transmission link. i And the maximum delay t corresponding to the burst data flow c , calculate the efficiency score g of the burst traffic on each transmission link i (E i ).
[0093] Specifically, the burst traffic is respectively in the efficiency score g of each transmission link i (E i ) is calculated as follows:
[0094]
[0095] Step 214: Based on the stability scores of the burst traffic on each of the transmission links and the efficiency scores of the burst traffic on each of the transmission links, the status scores of the burst traffic on each of the transmission links are calculated.
[0096] In step 214, the burst traffic scheduling device in the time-sensitive network based on game theory calculates the stability score f of each transmission link based on the burst traffic. i (P i ) and the efficiency score g of the burst traffic in each of the transmission links i (E i ), calculate the state score C of the burst traffic in each transmission link i .
[0097] Specifically, the burst traffic is respectively in the state score C of each transmission link i The calculation formula is as follows:
[0098] Ci =αf i (P i )+βg i (E i )
[0099] Among them, α represents f i (P i ) weight coefficient, g i (E i ) represents the efficiency score of the transmission link, which is related to the traffic transmission time, and β represents g i (E i ) is the weight coefficient of .
[0100] In order to further improve the effectiveness and accuracy of determining the state scores of the burst traffic in each of the transmission links, in a burst traffic scheduling method in a time-sensitive network based on game theory provided in an embodiment of the present application, see Figure 3 , step 220 in the method for scheduling burst traffic in a time-sensitive network based on game theory specifically includes the following contents:
[0101] Step 221: Calculate the end-to-end transmission delay of each periodic flow in each transmission link based on the total number of periodic data flows, the number of data packets corresponding to each periodic data flow, the average data packet transmission time and the average data packet processing time of each transmission link within a preset time period.
[0102] In step 221, the burst traffic scheduling device in the time-sensitive network based on game theory calculates the number of packets corresponding to each periodic data flow according to the total number J of periodic data flows and the number m of packets corresponding to each periodic data flow. j , the average transmission time t of the data packets of each transmission link in a preset time period i and the average packet processing time τ i , calculate the end-to-end transmission delay T of each periodic flow in each transmission link i .
[0103] Specifically, the end-to-end transmission delay T of each of the periodic flows in each of the transmission links is i The calculation formula is as follows:
[0104]
[0105] Step 222: According to the statistical packet loss rate of each transmission link within a preset time period, the stability score of the periodic traffic on each transmission link is calculated.
[0106] In step 222, the burst traffic scheduling device in the time-sensitive network based on game theory calculates the packet loss rate P of each transmission link within a preset time period according to the statistical packet loss rate P of each transmission link within a preset time period. i , the stability score x of the periodic traffic on each transmission link i (P i ).
[0107] Specifically, the periodic traffic is respectively in the stability score x of each transmission link i (P i ) is calculated as follows:
[0108] x i (P i )=P i
[0109] Step 223: Calculate the efficiency score of each of the transmission links according to the total number of each of the transmission links and the end-to-end transmission delay of each of the periodic flows in each of the transmission links.
[0110] In step 223, the burst traffic scheduling device in the time-sensitive network based on game theory calculates the burst traffic according to the total number N of each transmission link and the end-to-end transmission delay T of each periodic traffic in each transmission link. i , calculate the efficiency score y of the periodic flow in each transmission link i (T i ).
[0111] Specifically, the periodic flow is respectively in the efficiency score y of each transmission link i (T i ) is calculated as follows:
[0112]
[0113] Step 224: Based on the stability scores of the periodic traffic on each of the transmission links and the efficiency scores of the periodic traffic on each of the transmission links, the status scores of the periodic traffic on each of the transmission links are calculated.
[0114] In step 224, the burst traffic scheduling device in the time-sensitive network based on game theory calculates the stability score x of each transmission link based on the periodic traffic. i (P i ) and the efficiency score y of the periodic flow in each of the transmission links i (T i ), calculate the state score Z of the periodic flow in each of the transmission linksi .
[0115] Specifically, the periodic traffic is respectively in the state score Z of each transmission link i The calculation formula is as follows:
[0116] Z i =σx i (p i )+μy i (T i )
[0117] Where Z i Indicates the transmission link L i The state score of the burst traffic, x i (P i ) and the transmission link packet loss rate P i Correlation, σ represents x i (P i ) weight coefficient, y i (T i ) represents the efficiency score of the transmission link, which is related to the traffic transmission time, and μ represents y i (T i ) is the weight coefficient of .
[0118] That is to say, the stability score and efficiency score of the burst traffic in the transmission link can be calculated based on the burst traffic parameters and link parameters, and the status score of the periodic data traffic in the transmission link can be calculated based on the stability score and efficiency score of the burst traffic in the transmission link; and, the stability score and efficiency score of the periodic traffic in the transmission link can be calculated based on the periodic traffic data parameters and the link parameters, and the status score of the periodic traffic in the transmission link can be calculated based on the stability score and efficiency score of the periodic traffic in the transmission link.
[0119] In order to further improve the effectiveness and accuracy of determining the game coefficients of each of the transmission links, in a burst traffic scheduling method in a time-sensitive network based on game theory provided in an embodiment of the present application, see Figure 3 Step 300 of the method for scheduling burst traffic in a time-sensitive network based on game theory specifically includes the following contents:
[0120] Step 310: Based on a preset game index, the state scores of the burst traffic in each of the transmission links, and the state scores of the periodic traffic in each of the transmission links, the game coefficients corresponding to the transmission links are calculated.
[0121] In step 310, the game coefficients corresponding to the transmission links are represented as B1, B2, ..., B N, the set of game coefficients corresponding to each of the transmission links is expressed as B = {B1, B2, ..., B N}; For transmission link L i , the game coefficient of the transmission link is calculated as:
[0122]
[0123] Among them, a represents the game index.
[0124] In order to further improve the effectiveness and accuracy of determining the game coefficients of each of the transmission links, in a burst traffic scheduling method in a time-sensitive network based on game theory provided in an embodiment of the present application, see Figure 3 Step 400 of the method for scheduling burst traffic in a time-sensitive network based on game theory specifically includes the following contents:
[0125] Step 410: Select the transmission link with the smallest game coefficient from among the transmission links as the current target transmission link, and transmit the burst traffic based on the target transmission link in the time-sensitive network.
[0126] Specifically, the game coefficients of all transmission links can be sorted from small to large, and the transmission link corresponding to the minimum game coefficient is selected for burst traffic scheduling.
[0127] In order to further illustrate the embodiment of the method for scheduling burst traffic in a time-sensitive network based on game theory, the present application also provides a specific application example of the method for scheduling burst traffic in a time-sensitive network based on game theory, see Figure 4 Taking the case where the second sending device sends burst traffic to the first receiving device as an example, the method for scheduling burst traffic in a time-sensitive network based on game theory provided by this application example specifically includes the following contents:
[0128] The burst traffic is transmitted from the second sending device to the first receiving device. There are two possible transmission links, L = [L1, L2], where:
[0129] L1=<Second sending device, first switch, first receiving device>
[0130] L2=<Second sending device, second switch, first receiving device>
[0131] Directly obtain the transmission link L1 from the first switch, the 24-hour statistical packet loss rate P1 = 0.05%, and the average data packet processing time τ1 = 1×10 -6 , in seconds, assuming that the average propagation time of the data packet on the transmission link is t1 = 500 × 10 -6, in seconds, the transmission link parameters of the transmission link L1 can be expressed as: L1 = {0.5%, 500 × 10 -6 ,1×10 -6};
[0132] Similarly, the transmission link parameters of the transmission link can be expressed as: L2 = {0.01%, 100 × 10 -6 , 2×10 -6}.
[0133] Then set the number of burst traffic packets to m c =10, the maximum delay is t c =600×10 -6 ,According to the processing speed of the switch and the number of packets in the queued flow, the time when the flow is sent out from the port can be obtained, and the burst flow priority can be set to the highest;
[0134] For the transmission link L1, the number of periodic data traffic queue flows J = 3, expressed as F = {F1, F2, F3}, for F1, the number of data packets m1 = 3; for F2, the number of data packets m2 = 5; for F3, the number of data packets m3 = 8;
[0135] For the transmission link L2, the number of periodic data traffic queue flows J = 2, expressed as F = {F1, F2}, for F1, the number of data packets m1 = 1; for F2, the number of data packets m2 = 6;
[0136] Calculate the end-to-end transmission delay of burst traffic on each transmission link as:
[0137] E1=m c τ1+t1=10×1×10 -6 +500×10 -6 =510×10 -6
[0138] E2=m c τ2+t2=120×10 -6
[0139] Among them, E1 is the end-to-end transmission delay of the burst traffic in the transmission link L1; τ1 is the average data packet processing time of the transmission link L1 within the preset time period, and t1 is the average data packet transmission time of the transmission link L1 within the preset time period; E2 is the end-to-end transmission delay of the burst traffic in the transmission link L2; τ2 is the average data packet processing time of the transmission link L2 within the preset time period, and t2 is the average data packet transmission time of the transmission link L2 within the preset time period.
[0140] The stability score is calculated as:
[0141]
[0142] Among them, f1(P1) is the stability score of the burst traffic in the transmission link L1; P1 is the statistical packet loss rate of the transmission link L1 within the preset time period; f2(P2) is the stability score of the burst traffic in the transmission link L2; P2 is the statistical packet loss rate of the transmission link L2 within the preset time period.
[0143] The efficiency score is calculated as:
[0144]
[0145] Among them, g1(E1) is the efficiency score of burst traffic in transmission link L1; E1 is the end-to-end transmission delay of burst traffic in transmission link L1; g2(E2) is the efficiency score of burst traffic in transmission link L2; E2 is the end-to-end transmission delay of burst traffic in transmission link L2.
[0146] If the stability score of burst traffic is f i (P i ) has a weight coefficient of α = 0.8, and an efficiency score of g i (E i ) has a weight coefficient of β = 0.2, then the burst traffic score is:
[0147] C1=αf1(P1)+βg1(E1)=0.8×3.125×10 -4 +0.2×8.360×10 -3 =1.9×10 -3
[0148] C2=αf2(P2)+βg2(E2)=0.8×1.429×10 -4 +0.2×1.967×10 -3 =5.1×10 -4
[0149] The end-to-end transmission delay of the periodic traffic on each transmission link is calculated as:
[0150]
[0151] Among them, T1 is the end-to-end transmission delay in the periodic traffic transmission link L1; T2 is the end-to-end transmission delay in the periodic traffic transmission link L2.
[0152] The stability score of the calculated periodic traffic on the transmission link is:
[0153] x1(P1)=5×10 -3
[0154] x2(P2)=1×10-4
[0155] Among them, x1(P1) is the stability score of periodic traffic on transmission link L1; x2(P2) is the stability score of periodic traffic on transmission link L2.
[0156] The efficiency score of the calculated periodic traffic in the transmission link is:
[0157]
[0158] Among them, y1(T1) is the efficiency score of the periodic traffic on the transmission link L1; y2(T2) is the efficiency score of the periodic traffic on the transmission link L2.
[0159] If the periodic data flow stability score f i (P i ) has a weight coefficient of σ = 0.8, and an efficiency score of g i (E i ) has a weight coefficient μ = 0.2, then:
[0160] Z1=σx1(p1)+μy1(T1)=0.8×5×10 -3 +0.2×8.254×10 -3 =5.651×10 -3
[0161] Z2=σx2(p2)+μy2(T2)=0.8×1×10 -4 +0.2×1.699×10 -3 =4.198×10 -4
[0162] Z1 is the status score of the periodic traffic on the transmission link L1; Z2 is the status score of the periodic traffic on the transmission link L2.
[0163] If the game index a = 0.5, then:
[0164]
[0165] Among them, B1 is the game coefficient corresponding to the transmission link L1; B2 is the game coefficient corresponding to the transmission link L2.
[0166] Based on this, the game coefficients of the two transmission links calculated are B1 = 0.931 and B2 = 0.484. Since B2 < B1, transmission link L2 is selected for burst traffic scheduling, that is:
[0167] L2=<Second sending device, second switch, first receiving device>
[0168] That is to say, the above-mentioned application example of the present application calculates the state score of the burst traffic based on the stability score and efficiency score of the burst traffic in the target transmission link, calculates the periodic data traffic score based on the stability score and efficiency score of the periodic data traffic in the target transmission link, calculates the game coefficient based on the burst traffic score and the periodic data traffic score, and ensures the optimized transmission of the burst traffic in the complex network based on the game coefficient; calculates the game coefficient based on the burst traffic score and the periodic data traffic score to select the transmission link, avoids waste of network resources, and reduces the impact on the scheduling of periodic data traffic in time-sensitive networks.
[0169] The present application also provides a device for scheduling burst traffic in a time-sensitive network based on game theory, which is used to execute all or part of the method for scheduling burst traffic in a time-sensitive network based on game theory. Figure 5 The burst traffic scheduling device in a time-sensitive network based on game theory specifically includes the following contents:
[0170] The parameter acquisition module 10 is used to acquire the burst flow parameters and periodic flow parameters of all schedulable transmission links corresponding to the burst flow to be transmitted in the time-sensitive network.
[0171] The state score determination module 20 is used to determine the state scores of the periodic traffic and the burst traffic in each of the transmission links according to the burst traffic parameters and periodic traffic parameters of each of the transmission links.
[0172] The game coefficient acquisition module 30 is used to determine the game coefficient of each transmission link based on the state scores of the periodic traffic and the burst traffic in each transmission link based on game theory.
[0173] The transmission link selection and traffic scheduling module 40 is used to select one of the transmission links as the current target transmission link according to the respective game coefficients of the transmission links, and transmit the burst traffic based on the target transmission link in the time sensitive network.
[0174] The embodiment of the burst traffic scheduling device in a time-sensitive network based on game theory provided in the present application can be specifically used to execute the processing flow of the embodiment of the burst traffic scheduling method in a time-sensitive network based on game theory in the above-mentioned embodiment. Its functions are not repeated here, and reference can be made to the detailed description of the embodiment of the burst traffic scheduling method in a time-sensitive network based on game theory.
[0175] The part of the burst traffic scheduling device in the time-sensitive network based on game theory that performs burst traffic scheduling in the time-sensitive network based on game theory can be executed in the server or completed in the client device. The selection can be made based on the processing capability of the client device and the limitations of the user's usage scenario. This application does not limit this. If all operations are completed in the client device, the client device may also include a processor for specific processing of burst traffic scheduling in the time-sensitive network based on game theory.
[0176] The client device may have a communication module (i.e., a communication unit) that can communicate with a remote server to achieve data transmission with the server. The server may include a server on the task scheduling center side, and other implementation scenarios may also include a server on an intermediate platform, such as a server on a third-party server platform that has a communication link with the task scheduling center server. The server may include a single computer device, or a server cluster consisting of multiple servers, or a server structure of a distributed device.
[0177] The server and the client device may communicate with each other using any suitable network protocol, including network protocols that have not yet been developed on the date of filing this application. The network protocols may include, for example, TCP / IP, UDP / IP, HTTP, HTTPS, etc. Of course, the network protocols may also include, for example, RPC (Remote Procedure Call Protocol) and REST (Representational State Transfer) protocols used on top of the above protocols.
[0178] From the above description, it can be seen that the burst traffic scheduling device in a time-sensitive network based on game theory provided in the embodiment of the present application can realize the optimized scheduling of burst traffic in the time-sensitive network, and can effectively improve the efficiency and reliability of scheduling burst traffic, avoid waste of resources in the time-sensitive network, and can reduce the impact on periodic traffic scheduling in the time-sensitive network, thereby effectively improving the operating stability and reliability of the time-sensitive network.
[0179] The embodiment of the present application also provides an electronic device, which may include a processor, a memory, a receiver and a transmitter, wherein the processor is used to execute the method for scheduling burst traffic in a time-sensitive network based on game theory mentioned in the above embodiment, wherein the processor and the memory may be connected via a bus or other means, such as by bus connection. The receiver may be connected to the processor and the memory via wired or wireless means.
[0180] The processor may be a central processing unit (CPU). The processor may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or a combination of the above chips.
[0181] As a non-transient computer-readable storage medium, the memory can be used to store non-transient software programs, non-transient computer executable programs and modules, such as the program instructions / modules corresponding to the method for scheduling burst traffic in a time-sensitive network based on game theory in the embodiment of the present application. The processor executes various functional applications and data processing of the processor by running the non-transient software programs, instructions and modules stored in the memory, that is, the method for scheduling burst traffic in a time-sensitive network based on game theory in the above method embodiment is implemented.
[0182] The memory may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created by the processor, etc. In addition, the memory may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some embodiments, the memory may optionally include a memory remotely arranged relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
[0183] The one or more modules are stored in the memory, and when executed by the processor, execute the burst traffic scheduling method in a time-sensitive network based on game theory in the embodiment.
[0184] In some embodiments of the present application, the user equipment may include a processor, a memory, and a transceiver unit, which may include a receiver and a transmitter. The processor, memory, receiver, and transmitter may be connected through a bus system. The memory is used to store computer instructions, and the processor is used to execute the computer instructions stored in the memory to control the transceiver unit to send and receive signals.
[0185] As an implementation method, the functions of the receiver and the transmitter in the present application can be considered to be implemented through a transceiver circuit or a dedicated chip for transceiver, and the processor can be considered to be implemented through a dedicated processing chip, a processing circuit or a general chip.
[0186] As another implementation method, it is possible to use a general-purpose computer to implement the server provided in the embodiment of the present application, that is, to store the program code for implementing the functions of the processor, receiver, and transmitter in a memory, and the general-purpose processor implements the functions of the processor, receiver, and transmitter by executing the code in the memory.
[0187] The embodiment of the present application also provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the burst traffic scheduling method in a time-sensitive network based on game theory are implemented. The computer-readable storage medium can be a tangible storage medium, such as a random access memory (RAM), a memory, a read-only memory (ROM), an electrically programmable ROM, an electrically erasable programmable ROM, a register, a floppy disk, a hard disk, a removable storage disk, a CD-ROM, or any other form of storage medium known in the technical field.
[0188] An embodiment of the present application also provides a computer program product, including a computer program, which, when executed by a processor, implements the method for scheduling burst traffic in a time-sensitive network based on game theory.
[0189] It should be understood by those skilled in the art that the exemplary components, systems and methods described in conjunction with the embodiments disclosed herein can be implemented in hardware, software or a combination of the two. Whether it is specifically performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application. When implemented in hardware, it can be, for example, an electronic circuit, an application specific integrated circuit (ASIC), appropriate firmware, a plug-in, a function card, etc. When implemented in software, the elements of this application are programs or code segments used to perform the required tasks. The program or code segment can be stored in a machine-readable medium, or transmitted on a transmission medium or a communication link via a data signal carried in a carrier.
[0190] It should be clear that the present application is not limited to the specific configuration and processing described above and shown in the figures. For the sake of simplicity, a detailed description of the known method is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of the present application is not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between the steps after understanding the spirit of the present application.
[0191] In the present application, features described and / or illustrated for one embodiment may be used in the same manner or in a similar manner in one or more other embodiments, and / or combined with features of other embodiments or replace features of other embodiments.
[0192] The above description is only the preferred embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the embodiments of the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims
1. A method for scheduling burst traffic in a time-sensitive network based on game theory, characterized in that: include: Obtaining burst flow parameters and periodic flow parameters of all schedulable transmission links corresponding to the burst flow to be transmitted in the time-sensitive network; Determine, according to the burst traffic parameters and periodic traffic parameters of each of the transmission links, the state scores of the periodic traffic currently in the time-sensitive network and the burst traffic in each of the transmission links; Based on the status scores of the periodic traffic and the burst traffic in each of the transmission links, respectively, determining the game coefficient of each of the transmission links based on game theory; According to the respective game coefficients of the transmission links, one of the transmission links is selected as the current target transmission link, and the burst traffic is transmitted in the time-sensitive network based on the target transmission link.
2. The method for scheduling burst traffic in a time-sensitive network based on game theory according to claim 1, characterized in that: The obtaining of the burst flow parameters and periodic flow parameters of all schedulable transmission links corresponding to the burst flow to be transmitted in the time-sensitive network includes: Obtain all schedulable transmission links corresponding to the burst traffic to be transmitted in the time-sensitive network; Determine the link parameters of each transmission link, wherein the link parameters include: a statistical packet loss rate, an average data packet transmission time, and an average data packet processing time of the transmission link within a preset time period; Based on the link parameters of each of the transmission links, the burst flow parameters and periodic flow parameters of each of the transmission links are respectively obtained, wherein the burst flow parameters include: the number of data packets and the maximum delay corresponding to the burst data flow; the periodic flow parameters include: the total number of periodic data flows and the number of data packets corresponding to each of the periodic data flows.
3. The method for scheduling burst traffic in a time-sensitive network based on game theory according to claim 2 is characterized in that: The step of determining the status scores of the periodic traffic in the time-sensitive network and the burst traffic in each of the transmission links according to the burst traffic parameters and the periodic traffic parameters of each of the transmission links comprises: Based on the link parameters of each of the transmission links, the burst traffic parameters and the periodic traffic parameters, determine the stability score and efficiency score of the burst traffic in each of the transmission links; and according to the stability score and efficiency score of the burst traffic in each of the transmission links, determine the state score of the burst traffic in each of the transmission links; Furthermore, based on the link parameters of each of the transmission links and the periodic traffic parameters, the stability score and efficiency score of the periodic traffic in each of the transmission links are determined; and based on the stability score and efficiency score of the periodic traffic in each of the transmission links, the state score of the periodic traffic in each of the transmission links is determined.
4. The method for scheduling burst traffic in a time-sensitive network based on game theory according to claim 3 is characterized in that: The step of determining the stability score and efficiency score of the burst traffic in each of the transmission links based on the link parameters of each of the transmission links, the burst traffic parameters, and the periodic traffic parameters; and determining the state score of the burst traffic in each of the transmission links according to the stability score and efficiency score of the burst traffic in each of the transmission links, comprises: According to the number of data packets corresponding to the burst data flow, the average data packet transmission time and the average data packet processing time of each transmission link in a preset time period, and the end-to-end transmission delay of the burst traffic in each transmission link are calculated; According to the number of data packets corresponding to the burst data flow, the total number of the periodic data flows, the number of data packets corresponding to each of the periodic data flows, the statistical packet loss rate of each of the transmission links in a preset time period, and the average processing time of the data packets, the stability score of the burst traffic on each of the transmission links is calculated; And, according to the total number of each of the transmission links, the end-to-end transmission delay of the burst traffic in each of the transmission links, and the maximum delay corresponding to the burst data flow, calculate the efficiency score of the burst traffic in each of the transmission links; Based on the stability scores of the burst traffic on each of the transmission links and the efficiency scores of the burst traffic on each of the transmission links, the state scores of the burst traffic on each of the transmission links are calculated.
5. The method for scheduling burst traffic in a time-sensitive network based on game theory according to claim 3 is characterized in that: The determining, based on the link parameters of each of the transmission links and the periodic flow parameters, the stability score and the efficiency score of the periodic flow in each of the transmission links; and determining, according to the stability score and the efficiency score of the periodic flow in each of the transmission links, the state score of the periodic flow in each of the transmission links, comprises: According to the total number of the periodic data flows, the number of data packets corresponding to each of the periodic data flows, the average data packet transmission time and the average data packet processing time of each of the transmission links in a preset time period, the end-to-end transmission delay of each of the periodic flows in each of the transmission links is calculated; According to the statistical packet loss rate of each transmission link in a preset time period, the stability score of the periodic traffic on each transmission link; Calculate the efficiency score of the periodic traffic in each of the transmission links according to the total number of the transmission links and the end-to-end transmission delay of each of the periodic traffic in each of the transmission links; Based on the stability scores of the periodic traffic on each of the transmission links and the efficiency scores of the periodic traffic on each of the transmission links, the status scores of the periodic traffic on each of the transmission links are calculated.
6. The method for scheduling burst traffic in a time-sensitive network based on game theory according to claim 1, characterized in that: The determining of the game coefficients of the transmission links based on the state scores of the periodic traffic and the burst traffic in the transmission links respectively and based on game theory includes: Based on a preset game index, the state scores of the burst traffic in each of the transmission links, and the state scores of the periodic traffic in each of the transmission links, the game coefficients corresponding to each of the transmission links are calculated.
7. The method for scheduling burst traffic in a time-sensitive network based on game theory according to claim 1, characterized in that: The selecting one of the transmission links as the current target transmission link according to the respective game coefficients of the transmission links, and transmitting the burst traffic based on the target transmission link in the time-sensitive network, includes: A transmission link with the smallest game coefficient is selected from each of the transmission links as a current target transmission link, and the burst traffic is transmitted based on the target transmission link in the time-sensitive network.
8. A burst traffic scheduling device in a time-sensitive network based on game theory, characterized in that: include: A parameter acquisition module, used to acquire burst flow parameters and periodic flow parameters of all schedulable transmission links corresponding to the burst flow to be transmitted in the time-sensitive network; A state score determination module, used to determine the state scores of the periodic flow and the burst flow in each of the transmission links according to the burst flow parameters and periodic flow parameters of each of the transmission links; A game coefficient acquisition module, configured to determine the game coefficient of each transmission link based on the state scores of the periodic traffic and the burst traffic in each transmission link and based on game theory; The transmission link selection and traffic scheduling module is used to select one of the transmission links as the current target transmission link according to the respective game coefficients of the transmission links, and transmit the burst traffic based on the target transmission link in the time-sensitive network.
9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the method for scheduling burst traffic in a time-sensitive network based on game theory is implemented as described in any one of claims 1 to 7.
10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method for scheduling burst traffic in a time-sensitive network based on game theory is implemented.
Citation Information
Patent Citations
Traffic scheduling method and device, equipment, storage medium and computer program product
CN115941606A
Time-sensitive network scheduling method based on priority queuing strategy
CN117857460A
Communication system and method for integrating a data distribution service into a time sensitive network
US20180006955A1
