Data transmission method based on traffic classification and related equipment

Abstract

The invention provides a data transmission method based on traffic classification and related equipment. The method comprises the following steps: determining dynamic traffic; analyzing the dynamic traffic, and determining a priority flag value of any data packet in the dynamic traffic; and classifying the data packets according to the priority mark values to determine the priority sequence of the data packets, and allocating a transmission queue to the data packets according to the priority sequence to complete data transmission.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a data transmission method based on traffic classification and related equipment. Background Art

[0002] In data transmission, in order to achieve traffic scheduling, each traffic flow must be classified and directed to a specific queue.

[0003] However, in traditional communication networks, traffic classification is performed through the 12-bit VLAN ID in the data link layer or the 6-bit DSCP value in the network layer. Taking the DSCP value as an example, the queue range is divided according to the DSCP value obtained in the data packet. Different values ​​correspond to different fixed transmission queues, and the data traffic is classified into fixed transmission queues for transmission. Therefore, in addition to classifying the data packets, it is also necessary to enforce the mapping function between the classification identifier and the hardware queue. Even if two different traffic flows may have different classification values, they may eventually appear in the same hardware queue and cause congestion, which directly increases the transmission delay and affects the transmission effect. Summary of the invention

[0004] In view of this, the purpose of the present application is to propose a data transmission method based on traffic classification and related equipment.

[0005] Based on the above objectives, the present application provides a data transmission method based on traffic classification, including:

[0006] Determine dynamic flow;

[0007] Parsing the dynamic traffic to determine the priority tag value of any data packet in the dynamic traffic;

[0008] According to the priority tag value, the data packets are classified to determine the priority ranking of the data packets, and a transmission queue is allocated to the data packets according to the priority ranking to complete data transmission.

[0009] Optionally, parsing the dynamic traffic to determine the priority tag value of any data packet in the dynamic traffic includes:

[0010] Parsing the header of the IP data packet in the dynamic traffic through the FPGA unit to determine the service type byte and / or the differential service field;

[0011] The priority tag value of any data packet in the dynamic traffic is determined according to the service type byte and / or the differentiated service field.

[0012] Optionally, the priority tag value is a differentiated services code point sample value.

[0013] Optionally, classifying the data packets according to the priority tag value to determine the priority ranking of the data packets, and allocating a transmission queue to the data packets according to the priority ranking includes:

[0014] Determine the priority of any of the data packets according to the priority tag value to determine a low priority data packet, a medium priority data packet and a high priority data packet;

[0015] Allocating the low priority data packets and the medium priority data packets to a fixed queue for data transmission;

[0016] The high priority data packet is allocated to any idle queue for data transmission.

[0017] Optionally, the method further includes:

[0018] Determine data transmission information, and determine end-to-end delay based on the data transmission information; wherein the end-to-end delay is used to optimize data transmission.

[0019] Optionally, the data transmission information includes: a communication cycle, a time slot, a time slot interval, a data packet transmission time and a number of hops for transmitting a data packet of any communication queue;

[0020] The end-to-end delay comprises: a first end-to-end delay and a second end-to-end delay;

[0021] The determining the end-to-end delay according to the data transmission information includes:

[0022] The first end-to-end delay and the second end-to-end delay are determined according to the communication cycle, the time slot, the time slot interval, the data packet transmission time, and the number of hops of the transmitted data packet; wherein the first end-to-end delay is the end-to-end delay without using dynamic classification, and the second end-to-end delay is the end-to-end delay using dynamic classification.

[0023] Based on the same inventive concept, the embodiment of the present application further provides a data transmission device based on traffic classification, including:

[0024] a determination module configured to determine dynamic traffic;

[0025] A parsing module, configured to parse the dynamic traffic and determine a priority tag value of any data packet in the dynamic traffic;

[0026] The transmission module is configured to classify the data packets according to the priority tag value to determine the priority ranking of the data packets, and allocate a transmission queue to the data packets according to the priority ranking to complete data transmission.

[0027] Based on the same inventive concept, an embodiment of the present application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, a data transmission method based on traffic classification as described in any one of the above is implemented.

[0028] Based on the same inventive concept, an embodiment of the present application also provides a non-transitory computer-readable storage medium, which stores computer instructions, and the computer instructions are used to enable a computer to execute any of the above-mentioned traffic classification-based data transmission methods.

[0029] Based on the same inventive concept, an embodiment of the present application further provides a computer program product, including computer program instructions. When the computer program instructions are executed on a computer, the computer executes any of the above-mentioned data transmission methods based on traffic classification.

[0030] From the above, it can be seen that the data transmission method, device, electronic device, storage medium and program product based on traffic classification provided by the present application include: determining dynamic traffic; parsing the dynamic traffic to determine the priority tag value of any data packet in the dynamic traffic; classifying the data packet according to the priority tag value to determine the priority ranking of the data packet, and assigning the data packet to a transmission queue according to the priority ranking to complete data transmission. The present application classifies the priority of the data packet by DSCP value, and the high-priority data packet can be immediately transmitted in the idle queue channel time slot at the driver software layer, which changes the traffic classification method of fixed queue mapping according to the DSCP value in the data packet in the traditional communication network, and effectively reduces the end-to-end delay between nodes. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] In order to more clearly illustrate the technical solutions in the present application or related technologies, the drawings required for use in the embodiments or related technical descriptions are briefly introduced below. Obviously, the drawings described below are only embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0032] Figure 1 A flow chart of a data transmission method based on traffic classification according to an embodiment of the present application;

[0033] Figure 2 A schematic diagram of a gating mechanism according to an embodiment of the present application;

[0034] Figure 3 This is a schematic diagram of end-to-end delay in an embodiment of the present application;

[0035] Figure 4 A schematic diagram of a data packet transmission time slot according to an embodiment of the present application;

[0036] Figure 5 A schematic diagram of a data transmission device based on traffic classification according to an embodiment of the present application;

[0037] Figure 6 A schematic diagram of the structure of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0038] In order to make the objectives, technical solutions and advantages of the present application more clearly understood, the present application is further described in detail below in combination with specific embodiments and with reference to the accompanying drawings.

[0039] It should be noted that, unless otherwise defined, the technical terms or scientific terms used in the embodiments of the present application should be the usual meanings understood by people with ordinary skills in the field to which the present application belongs. The "first", "second" and similar words used in the embodiments of the present application do not represent any order, quantity or importance, but are only used to distinguish different components. "Including" or "comprising" and similar words mean that the elements or objects appearing in front of the word cover the elements or objects listed after the word and their equivalents, without excluding other elements or objects. "Connect" or "connected" and similar words are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. "Up", "down", "left", "right" and the like are only used to indicate relative positional relationships. When the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0040] In order to facilitate understanding of the technical solutions of the present disclosure, some technical terms involved in the present disclosure are introduced below.

[0041] FPGA, Field Programmable Gate Array, is a programmable logic array hardware circuit.

[0042] DiffServ system: A network quality of service system that provides different levels of services through simple classification and priority mechanisms.

[0043] DSCP value: Differentiated Services Code Point, that is, the value of the differentiated services code point.

[0044] In order to make the technical solution of the present disclosure clearer and easier to understand, the data transmission method provided by the embodiment of the present disclosure is described in detail below with reference to the accompanying drawings.

[0045] As described in the background technology section, in data transmission, in order to achieve traffic scheduling, each traffic flow must be classified and directed to a specific queue. However, in traditional communication networks, traffic is classified through the 12-bit VLAN ID in the data link layer or the 6-bit DSCP value in the network layer. Taking the DSCP value as an example, the queue range is divided according to the DSCP value obtained in the data packet. Different values ​​correspond to different fixed transmission queues, and the data traffic is classified into fixed transmission queues for transmission. Therefore, in addition to classifying the data packets, it is also necessary to enforce the mapping function between the classification identifier and the hardware queue. Even if two different traffic flows may have different classification values, they may eventually appear in the same hardware queue and cause congestion, which directly causes an increase in transmission delay, thereby affecting the transmission effect.

[0046] The applicant found that in traditional communication networks, traffic classification is performed through the 12-bit VLAN ID in the data link layer or the 6-bit DSCP value in the network layer. Taking the DSCP value as an example, the queue range is divided according to the DSCP value obtained in the data packet. Different values ​​correspond to different fixed transmission queues, and the data traffic is classified into fixed transmission queues for transmission. Therefore, in addition to classifying the data packets, it is also necessary to enforce the mapping function between the classification identifier and the hardware queue. Even if two different traffic flows may have different classification values, they may eventually appear in the same hardware queue and cause congestion, which directly causes an increase in transmission delay.

[0047] In view of this, the embodiments of the present application provide a data transmission method, device, electronic device, storage medium and program product based on traffic classification, including: determining dynamic traffic; parsing the dynamic traffic to determine the priority tag value of any data packet in the dynamic traffic; classifying the data packets according to the priority tag value to determine the priority ranking of the data packets, and assigning transmission queues to the data packets according to the priority ranking to complete data transmission. The present application classifies the priority of data packets by DSCP value, and high-priority data packets can be immediately transmitted in idle queue channel time slots at the driver software layer, which changes the traffic classification method of fixed queue mapping according to the DSCP value in the data packet in the traditional communication network, and effectively reduces the end-to-end delay between nodes.

[0048] like Figure 1 As shown, the data transmission method based on traffic classification includes:

[0049] Step S102, determining dynamic flow;

[0050] Step S104, parsing the dynamic traffic to determine the priority tag value of any data packet in the dynamic traffic;

[0051] Step S106: classify the data packets according to the priority tag value to determine the priority ranking of the data packets, and allocate a transmission queue to the data packets according to the priority ranking to complete data transmission.

[0052] In step S102, dynamic traffic is network traffic generated by content that is generated in real time or changes frequently. That is, in a specific time period, the traffic changes with time. This type of traffic is usually used to describe the traffic situation in networks, transportation systems or other systems that require real-time adjustment and management. Dynamic traffic has multiple characteristics such as real-time, interactivity and diversity.

[0053] In some implementations, dynamic traffic may be determined through search engines, social media, advertising promotion, and user sharing.

[0054] It should be noted that in contrast to dynamic traffic, there is also static traffic. Static traffic refers to network traffic generated by content that does not change frequently, such as pictures, documents, pre-recorded videos, etc. Once this type of content is generated, it will remain unchanged for a long time. The difference between dynamic traffic and static traffic is that (1) static traffic is relatively stable, while dynamic traffic changes in real time; (2) static traffic mainly reflects the attractiveness of the content itself, while dynamic traffic more reflects the degree of interaction between users and content; (3) there are also significant differences in processing methods and application scenarios. For example, for static traffic, the user experience can be improved by optimizing content quality and increasing loading speed; while for dynamic traffic, more attention needs to be paid to changes in factors such as user behavior and market trends, and corresponding response strategies need to be formulated.

[0055] In step S104, the dynamic traffic is parsed to determine the priority tag value of any data packet in the dynamic traffic, including:

[0056] Parsing the header of the IP data packet in the dynamic traffic through the FPGA unit to determine the service type byte and / or the differential service field;

[0057] The priority tag value of any data packet in the dynamic traffic is determined according to the service type byte and / or the differentiated service field.

[0058] In some implementations, the priority tag value is mainly used to identify the different priorities and service quality requirements of data packets. These tag values ​​are usually embedded in the header of the data packet, and the most common marking method is through the DSCP (Differentiated Services Code Point) field in the IP packet header or the EXP (Experimental) field in the MPLS (Multiprotocol Label Switching) label. Among them, when the DSCP value is used as the priority tag value, the larger the DSCP value, the higher the priority of the data packet, and the smaller the value, the lower the priority of the data packet.

[0059] In some implementations, in the DiffServ (Differentiated Services) system, priority marking of dynamic traffic is one of the key steps to ensure network quality of service (QoS). This process involves detailed parsing of each IP packet header in the dynamic traffic, and prioritization of the packets based on the parsing results. Specifically, when dynamic traffic flows in the network, it is efficiently parsed by the hardware processing unit FPGA (Field-Programmable Gate Array).

[0060] Furthermore, the FPGA unit has become the first choice for parsing dynamic traffic with its powerful parallel processing capabilities and high flexibility. During the parsing process, the FPGA will focus on the header information of the IP data packet, especially the Type of Service (TOS) and the Differentiated Services Code Point (DSCP). The Type of Service byte is a historical legacy field in the IP header. Although some of its functions have been replaced by the DSCP field in modern networks, it still plays a role in some old devices or specific scenarios. The DSCP field is a more advanced and flexible priority marking mechanism that allows network administrators to set different priorities and service quality for different data streams based on actual needs.

[0061] Furthermore, after parsing the service type byte and / or DSCP field, the FPGA will assign a corresponding priority tag value to each data packet in the dynamic traffic according to the value of these fields. This tag value is crucial for subsequent network traffic management and scheduling, because it determines the transmission order of data packets in the network and the quality of service enjoyed. By setting the priority, the network can ensure that high-priority data packets (such as real-time video streaming, voice calls, etc.) can obtain network resources first, thereby effectively reducing the delay and jitter of data transmission and improving the user's network experience.

[0062] It should be noted that in a network that follows the DiffServ system (a differential system is a network service quality system that provides different levels of service through a simple classification and priority mechanism), each switch and router adopts the same transmission service strategy for messages containing the same classification information, and adopts different transmission service strategies for messages containing different classification information. The classification information of the message can be assigned by the host, switch, router or other network equipment on the network. The category information can be assigned to the message based on different application strategies or based on the different content of the message. The DiffServ system stipulates that each transmitted message will be classified into different categories in the network, and the classification information is included in the IP message header. The DiffServ system uses the first 6 bits of TOS (Type Of Service) in the IP message header, that is, the Differentiated Services Code Point DSCP to carry the classification information of the message.

[0063] In some embodiments, Figure 2 As shown in Figure 1, the channel time slots in the network communication process are divided into communication cycles consisting of multiple gate openings of different lengths. The "window" or "time period" that allows data packets to pass through is the gate opening, which determines which queue is selected to transmit the data packet. If multiple gates are opened at the same time, there are data packets in multiple queues ready to be transmitted, and the data packets will be transmitted according to the queue priority.

[0064] Therefore, in step S106, the priority of any of the data packets is determined according to the priority tag value to determine low priority data packets, medium priority data packets and high priority data packets; the low priority data packets and the medium priority data packets are assigned to a fixed queue for data transmission; and the high priority data packets are assigned to any idle queue for data transmission.

[0065] In some implementations, low priority packets, medium priority packets, and high priority packets may be determined based on the priority tag value and the quality of service classification. The quality of service classification may be EF (Expedited Forwarding) in Table 1 below, a QoS category designed specifically for real-time applications that ensures that these applications obtain the best transmission performance in the network by providing the highest priority packet processing; AF (Assured Forwarding), a mechanism that ensures that specific types of traffic obtain better quality of service in the network through multi-level classification and priority processing; CS (Class Selector), a service category based on the Differentiated Services (DiffServ, DS) architecture; and DF (Default Forwarding, a basic, non-priority data transmission method).

[0066] In some implementations, in addition to low priority packets, medium priority packets, and high priority packets, there are also highest priority packets, wherein the highest priority packets include packets with a DSCP value of 48, an application scenario of network control traffic, and packets with a DSCP value of 56, as shown in Table 1 below, and an application scenario of control traffic with the highest priority.

[0067] Furthermore, low-priority data packets include: as shown in Table 1 below, a DSCP value of 10 is used for low-priority data flows and a DSCP value of 0 is used for default traffic data; medium-priority data packets include a DSCP value of 16 is used for backup or management traffic, a DSCP value of 18 is used for regular data flows, a DSCP value of 24 is used for important management traffic, and a DSCP value of 26 is used for important data transmission; high-priority data packets include: a DSCP value of 32 is used for control traffic data, a DSCP value of 34 is used for video conferencing, real-time application data, a DSCP value of 40 is used for high-priority management traffic data, and a DSCP value of 46 is used for voice traffic data.

[0068] Table 1 DSCP value classification table

[0069]

[0070] In some embodiments, Figure 3 As shown, during the data traffic transmission process of the communication network, if the data packet is generated before the time slot of the first hop, then the end-to-end delay will only include the time difference between the start of the time slot in the first network hop and the time slot of the last hop, and the sum of the transmission time on each network hop. When the data packet is generated after the time slot of the first hop, it must wait for the next cycle to be transmitted. It can be seen that the maximum communication delay is limited based on the cycle length.

[0071] In some embodiments, in order to verify the effectiveness of this solution, the present application also provides a method for calculating end-to-end delay. Figure 4 The figure shows a calculation of the fixed communication scenario with and without dynamic classification. Consider a wireless node with 4 queues, each with a time slot T. i , 1≤i≤4, such as Figure 4 As shown. Let d0 be the distance from the start of time slot T1 to the start of the communication cycle, and d4 be the distance from the end of time slot T4 to the end of the communication cycle. The communication cycle C is calculated by the following formula:

[0072]

[0073] Among them, T i is the time slot, 1≤i≤4, d i is the distance between time slots, 1≤i≤4.

[0074] Further, according to the above, if dynamic classification is not used, the worst end-to-end delay will occur when generating packets, e.g. Figure 4 As shown in Figure 2. In this case, the packet must wait for a full communication cycle to start transmission at the scheduled time slot, as well as the transmission time on each hop. Therefore, for a packet classified in the i-th queue served in time slot i, the worst-case end-to-end delay will be:

[0075] E2E 不使用动态分类latency =(CT i )+h*T o A

[0076] Where C is the communication cycle, T i is the time slot, h is the number of times the network hop packet is transmitted, T o A is the transmission time of the packet.

[0077] When dynamic traffic classification is used, every packet can be transmitted in every time slot. Therefore, the worst-case end-to-end delay depends only on the maximum distance between consecutive time slots. In this case, the end-to-end delay for any dynamically classified packet will be:

[0078] E2E 使用动态分类latency =max(d i ,d0+d4)+h*T o A

[0079] Where C is the communication cycle, T i is the time slot, h is the number of times the network hop packet is transmitted, T o A is the transmission time of the packet, d i is the distance between time slots.

[0080] As can be seen from the above, the data transmission method based on traffic classification includes: determining dynamic traffic; parsing the dynamic traffic to determine the priority tag value of any data packet in the dynamic traffic; classifying the data packets according to the priority tag value to determine the priority ranking of the data packets, and assigning the data packets to transmission queues according to the priority ranking to complete data transmission. The present application classifies the priority of data packets by DSCP value, and high-priority data packets can be immediately transmitted in idle queue channel time slots at the driver software layer, which changes the traffic classification method of fixed queue mapping according to the DSCP value in the data packet in the traditional communication network, and effectively reduces the end-to-end delay between nodes.

[0081] It should be noted that the method of the embodiment of the present application can be performed by a single device, such as a computer or server. The method of this embodiment can also be applied to a distributed scenario and completed by multiple devices cooperating with each other. In the case of such a distributed scenario, one of the multiple devices can only perform one or more steps in the method of the embodiment of the present application, and the multiple devices will interact with each other to complete the described method.

[0082] It should be noted that the above describes some embodiments of the present application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in an order different from that in the above embodiments and still achieve the desired results. In addition, the processes depicted in the accompanying drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0083] Based on the same inventive concept, corresponding to any of the above-mentioned embodiment methods, the present application also provides a data transmission device based on traffic classification.

[0084] refer to Figure 5 , the data transmission device based on traffic classification comprises:

[0085] A determination module 502, configured to determine dynamic traffic;

[0086] The parsing module 504 is configured to parse the dynamic traffic and determine the priority tag value of any data packet in the dynamic traffic;

[0087] The transmission module 506 is configured to classify the data packets according to the priority tag value to determine the priority ranking of the data packets, and allocate a transmission queue to the data packets according to the priority ranking to complete data transmission.

[0088] In some embodiments, the parsing module 504 is further configured to:

[0089] Parsing the header of the IP data packet in the dynamic traffic through the FPGA unit to determine the service type byte and / or the differential service field;

[0090] The priority tag value of any data packet in the dynamic traffic is determined according to the service type byte and / or the differentiated service field.

[0091] In some embodiments, the parsing module 504 is further configured to: the priority tag value is a differentiated services code point sample value.

[0092] In some embodiments, the transmission module 506 is further configured to:

[0093] Determine the priority of any of the data packets according to the priority tag value to determine low priority data packets, medium priority data packets and high priority data packets; voice data packets, video data packets,

[0094] Allocating the low priority data packets and the medium priority data packets to a fixed queue for data transmission;

[0095] The high priority data packet is allocated to any idle queue for data transmission.

[0096] In some embodiments, the data transmission device further includes a delay calculation device 508 configured to:

[0097] Determine data transmission information, and determine end-to-end delay based on the data transmission information; wherein the end-to-end delay is used to optimize data transmission.

[0098] In some embodiments, the data transmission information includes: the communication cycle, time slot, time slot interval, data packet transmission time and number of hops for transmitting data packets of any communication queue;

[0099] The end-to-end delay comprises: a first end-to-end delay and a second end-to-end delay;

[0100] The delay calculation device 508 is further configured to:

[0101] The first end-to-end delay and the second end-to-end delay are determined according to the communication cycle, the time slot, the time slot interval, the data packet transmission time, and the number of hops of the transmitted data packet; wherein the first end-to-end delay is the end-to-end delay without using dynamic classification, and the second end-to-end delay is the end-to-end delay using dynamic classification.

[0102] For the convenience of description, the above device is described in terms of functions divided into various modules. Of course, when implementing the present application, the functions of each module can be implemented in the same or multiple software and / or hardware.

[0103] The device of the above embodiment is used to implement the corresponding data transmission method based on traffic classification in any of the above embodiments, and has the beneficial effects of the corresponding method embodiment, which will not be repeated here.

[0104] Based on the same inventive concept, corresponding to any of the above-mentioned embodiments and methods, the present application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the data transmission method based on traffic classification described in any of the above embodiments is implemented.

[0105] Figure 6 A more specific schematic diagram of the hardware structure of an electronic device provided in this embodiment is shown, and the device may include: a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040 are connected to each other through the bus 1050 in the device.

[0106] The processor 1010 can be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0107] The memory 1020 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 may store an operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program codes are stored in the memory 1020 and are called and executed by the processor 1010.

[0108] The input / output interface 1030 is used to connect the input / output module to realize information input and output. The input / output module can be configured in the device as a component (not shown in the figure), or it can be externally connected to the device to provide corresponding functions. The input device may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output device may include a display, a speaker, a vibrator, an indicator light, etc.

[0109] The communication interface 1040 is used to connect a communication module (not shown) to realize communication interaction between the device and other devices. The communication module can realize communication through a wired mode (such as USB, network cable, etc.) or a wireless mode (such as mobile network, WIFI, Bluetooth, etc.).

[0110] The bus 1050 includes a path that transmits information between the various components of the device (eg, the processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040).

[0111] It should be noted that, although the above device only shows the processor 1010, the memory 1020, the input / output interface 1030, the communication interface 1040 and the bus 1050, in the specific implementation process, the device may also include other components necessary for normal operation. In addition, it can be understood by those skilled in the art that the above device may also only include the components necessary for implementing the embodiments of the present specification, and does not necessarily include all the components shown in the figure.

[0112] The electronic device of the above-mentioned embodiment is used to implement the corresponding data transmission method based on traffic classification in any of the above-mentioned embodiments, and has the beneficial effects of the corresponding method embodiment, which will not be repeated here.

[0113] Based on the same inventive concept, corresponding to any of the above-mentioned embodiment methods, the present application also provides a non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium stores computer instructions, and the computer instructions are used to enable the computer to execute the traffic classification-based data transmission method as described in any of the above embodiments.

[0114] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, read-only compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device.

[0115] The computer instructions stored in the storage medium of the above embodiment are used to enable the computer to execute the data transmission method based on traffic classification as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0116] Based on the same inventive concept, corresponding to the data transmission method based on traffic classification described in any of the above embodiments, the present disclosure also provides a computer program product, which includes computer program instructions. In some embodiments, the computer program instructions can be executed by one or more processors of a computer so that the computer and / or the processor execute the data transmission method based on traffic classification. Corresponding to the execution subject corresponding to each step in each embodiment of the data transmission method based on traffic classification, the processor that executes the corresponding step may belong to the corresponding execution subject.

[0117] The computer program product of the above embodiment is used to enable the computer and / or the processor to execute the data transmission method based on traffic classification as described in any of the above embodiments, and has the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0118] Those skilled in the art should understand that the discussion of any of the above embodiments is merely illustrative and is not intended to imply that the scope of the present application (including the claims) is limited to these examples. In line with the concept of the present application, the technical features in the above embodiments or different embodiments may be combined, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present application as described above, which are not provided in detail for the sake of simplicity.

[0119] In addition, to simplify the description and discussion, and in order not to make the embodiments of the present application difficult to understand, the known power supply / ground connection with the integrated circuit (IC) chip and other components may or may not be shown in the provided drawings. In addition, the device can be shown in the form of a block diagram to avoid making the embodiments of the present application difficult to understand, and this also takes into account the fact that the details of the implementation of these block diagram devices are highly dependent on the platform to be implemented in the embodiments of the present application (that is, these details should be fully within the scope of understanding of those skilled in the art). In the case of elaborating specific details (e.g., circuits) to describe exemplary embodiments of the present application, it is obvious to those skilled in the art that the embodiments of the present application can be implemented without these specific details or when these specific details are changed. Therefore, these descriptions should be considered to be illustrative rather than restrictive.

[0120] Although the present application has been described in conjunction with specific embodiments of the present application, many replacements, modifications and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may use the embodiments discussed.

[0121] The embodiments of the present application are intended to cover all such substitutions, modifications and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the embodiments of the present application should be included in the scope of protection of the present application.

Claims

1. A data transmission method based on traffic classification, characterized in that: include: Determine dynamic flow; Parsing the dynamic traffic to determine the priority tag value of any data packet in the dynamic traffic; According to the priority tag value, the data packets are classified to determine the priority ranking of the data packets, and a transmission queue is allocated to the data packets according to the priority ranking to complete data transmission.

2. The method according to claim 1, characterized in that The step of parsing the dynamic traffic to determine the priority tag value of any data packet in the dynamic traffic includes: Parsing the header of the IP data packet in the dynamic traffic through the FPGA unit to determine the service type byte and / or the differential service field; The priority tag value of any data packet in the dynamic traffic is determined according to the service type byte and / or the differentiated service field.

3. The method according to claim 2, characterized in that The priority tag value is a differentiated services code point sample value.

4. The method according to claim 1, characterized in that: The step of classifying the data packets according to the priority tag value to determine the priority ranking of the data packets, and allocating a transmission queue to the data packets according to the priority ranking includes: Determine the priority of any of the data packets according to the priority tag value to determine low priority data packets, medium priority data packets and high priority data packets; voice data packets, video data packets, Allocating the low priority data packets and the medium priority data packets to a fixed queue for data transmission; The high priority data packet is allocated to any idle queue for data transmission.

5. The method according to claim 1, characterized in that The method further comprises: Determine data transmission information, and determine end-to-end delay based on the data transmission information; wherein the end-to-end delay is used to optimize data transmission.

6. The method according to claim 1, characterized in that The data transmission information includes: the communication cycle, time slot, time slot interval, data packet transmission time and the number of hops for transmitting data packets of any communication queue; The end-to-end delay comprises: a first end-to-end delay and a second end-to-end delay; The determining the end-to-end delay according to the data transmission information includes: The first end-to-end delay and the second end-to-end delay are determined according to the communication cycle, the time slot, the time slot interval, the data packet transmission time, and the number of hops of the transmitted data packet; wherein the first end-to-end delay is the end-to-end delay without using dynamic classification, and the second end-to-end delay is the end-to-end delay using dynamic classification.

7. A data transmission device based on traffic classification, characterized in that: include: a determination module configured to determine dynamic traffic; A parsing module, configured to parse the dynamic traffic and determine a priority tag value of any data packet in the dynamic traffic; The transmission module is configured to classify the data packets according to the priority tag value to determine the priority ranking of the data packets, and allocate a transmission queue to the data packets according to the priority ranking to complete data transmission.

8. An electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable by the processor, wherein the processor implements the method according to any one of claims 1 to 6 when executing the computer program.

9. A non-transitory computer-readable storage medium storing computer instructions for causing a computer to execute the method according to any one of claims 1 to 6.

10. A computer program product, comprising computer program instructions, which, when executed on a computer, cause the computer to execute the method according to any one of claims 1 to 6.

Images