WO2014032348A1

WO2014032348A1 - Data transmission method and device based on time triggered mechanism

Info

Publication number: WO2014032348A1
Application number: PCT/CN2012/081972
Authority: WO
Inventors: 黄剑超; 薛百华
Original assignee: 北京东土科技股份有限公司
Priority date: 2012-08-31
Filing date: 2012-09-26
Publication date: 2014-03-06
Also published as: CN102833168A; CN102833168B

Abstract

A data transmission method and device based on a time triggered mechanism. In the method, request packets transmitted by nodes connected to a switching device is received by same, and the length of time corresponding to time slices is determined on the basis of the total bandwidth of communication links to a network node and of acquired information on the total number of bytes comprised by packets-to-be-transmitted by the nodes within one scheduling time cycle; a time cycle schedule table is determined on the basis of the determined length of time corresponding to the time slices and of the information on the total number of bytes comprised by the packets-to-be-transmitted by the nodes; and, the packets of the nodes are forwarded to the network node on the basis of the time cycle schedule table. In the present invention, the switching device employs, on the basis of data transmission requirements of the nodes, the time triggered mechanism to schedule the nodes by formulating the time cycle schedule table, and prevents the problem that some of the packets cannot be processed timely, thus effectively increases the degree of security of service processing.

Description

Data transmission method and device based on time trigger mechanism The application claims to be submitted to the Chinese Patent Office on August 31, 2012, the application number is 201210320810.6, and the invention name is

The priority of the Chinese Patent Application, which is incorporated herein by reference. The present invention relates to the field of node data communication technologies in industrial Ethernet, and in particular, to a data transmission method and apparatus based on a time trigger mechanism. BACKGROUND OF THE INVENTION Industrial Ethernet is an Ethernet technology applied in the field of industrial control. Industrial Ethernet has outstanding performance in terms of real-time performance, reliability, anti-interference, and operability. High communication speed is one of the prominent features of industrial Ethernet. Currently, 100 Mbps and Gigabit Ethernet have been widely used, and lGb/s Ethernet technology has gradually matured. Compared with the traditional highest communication rate, only 12Mb/s fieldbus is available. Industrial Ethernet is more suitable for industrial control networks with ever-increasing broadband requirements.

Industrial Ethernet technology is widely used in industries such as smart grid, rail transit and Yankuang transportation, mainly because these industries have high requirements on the real-time and reliability of the network in the networking process. In industrial Ethernet built in these industries, each node in the network usually uses an event trigger mechanism, that is, all data communication on the network is triggered by the appearance of external (or internal) events, such as alarm information. Wait. However, the occurrence of event triggering is highly random. Any node on the network can actively send messages to other nodes on the network at any time. As long as the bus is idle, each node has the right to use the network, thus causing network communication events. Has a strong non-determinism.

As shown in Figure 1, the structure of the existing data transmission system is as follows: Each switching device is connected to multiple nodes, and the switching device is connected to the network node. The node sends the packet to be sent to the network node to the switching device for exchange. The device forwards the 艮艮 text to the network node.

However, in the system architecture shown in Figure 1, the data transmission operation of the node is triggered by the occurrence of the event, and the node can send the message to the network node at any time according to the need, if a node is to the network within a certain period of time If the number of packets sent by the node increases suddenly, then a large number of packets arrive at the network node side. The network node has limited ability to receive and process packets. If the network node cannot receive and process all the packets, the network node will cause part. Packets cannot be processed in a timely manner. If some packets with higher priority (such as alarm packets) are not processed in time, the security of the service will be greatly reduced. Summary of the invention In view of this, the embodiment of the present invention provides a data transmission method and apparatus based on a time trigger mechanism, which is used to solve the problem that the data transmission operation of a node is triggered by the occurrence of an event in the existing industrial Ethernet. As a result, some of the packets sent by the node cannot be processed in time, which makes the security of the service lower.

The embodiment of the invention is implemented by the following technical solutions:

The invention provides a data transmission method based on a time triggering mechanism, and the transmission method comprises:

The switching device receives the request packet sent by each node connected thereto, and obtains the total byte information included in the to-be-sent packet of the node carried in the request packet in a scheduling time period;

Determining a length of time corresponding to the time slice according to the total bandwidth of the communication line with the network node and the total byte information of the received message to be sent by each node; a time period scheduling table;

And sending, according to the time period schedule, the to-be-sent packet of each node to the network node.

The present invention provides a data transmission apparatus based on a time-triggered mechanism, the transmission apparatus comprising: a receiving and acquiring module, configured to receive a request message sent by each node connected thereto, and obtain the The total byte information contained in the message to be sent by the node in a scheduling time period;

a calculation module, configured to determine a length of time corresponding to the time slice according to a total bandwidth of the communication line with the network node and the total byte information included in the obtained packet to be sent by each node; section information, determining a time period schedule ;

And a scheduling module, configured to forward, to the network node, a to-be-sent of each node according to the time period schedule.

The present invention provides a data transmission method and apparatus based on a time-triggered mechanism, in which a switching device receives a request message sent by each node connected thereto, and obtains the node carried in the request message in a scheduling time period. The total byte information included in the to-be-sent message; determining the length of time corresponding to the time slice according to the total bandwidth of the communication line with the network node and the total byte information included in the obtained packet to be sent by each node; Determining a time period scheduling table according to the length of time corresponding to the determined time slice and the total byte information included in the message to be sent by each node; and forwarding the to-be-sent message of each node to the station according to the time period scheduling table The network node. In the present invention, the switching device formulates a time period scheduling table according to the data transmission requirement of each node, and schedules each node, thereby avoiding the phenomenon that a large number of packets arrive at the network node at the same time, then the network node It is possible to receive and process each document in time, so as to avoid the problem that some of the documents cannot be processed in time, thereby effectively improving the security of business processing.

Other features and advantages of the invention will be set forth in the description which follows, and The objects and other advantages of the present invention are achieved by the written instructions, The claims and the structures specifically indicated in the drawings are realized and obtained.

The technical solutions of the present invention are further described in detail below through the accompanying drawings and specific embodiments. The drawings are intended to provide a further understanding of the invention, and are intended to be a In the drawing:

1 is a schematic structural diagram of a data transmission system in the prior art;

2 is a schematic diagram of a process of data transmission based on a time trigger mechanism according to the present invention;

FIG. 3 is a schematic diagram of a detailed process of data transmission based on a time trigger mechanism according to the present invention; FIG. 4 is a schematic diagram of a detailed process of data transmission based on a time trigger mechanism when a new node is connected to a switching device according to the present invention; ;

FIG. 5 is a schematic structural diagram of a network architecture based on a time trigger mechanism according to the present invention;

FIG. 5-2-1 is a schematic diagram showing a structure of a time period scheduling table based on a data transmission method of a time triggering machine;

FIG. 5-2-2 is a schematic diagram showing a structure of a time period scheduling table based on a data transmission method of a time triggering machine; FIG.

FIG. 6 is a schematic structural diagram of a data transmission apparatus based on a time trigger mechanism according to the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS In order to make the technical problems, technical solutions and beneficial effects of the present invention more clear and clear, the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It is understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

In order to solve the problem in the prior art, when there are multiple important nodes in the industrial Ethernet, in order to ensure the real-time transmission of important nodes, the point-to-point direct connection is adopted, resulting in high networking cost, serious waste of bandwidth resources, and network. A problem of poor reliability, a data transmission method and apparatus based on a time trigger mechanism is proposed.

The embodiments of the present invention are described in detail below with reference to the accompanying drawings.

FIG. 2 is a schematic diagram of a process for data transmission based on a time trigger mechanism, where the transmission process includes the following steps:

S201: The switching device receives the request message sent by each node connected thereto.

In this embodiment of the present invention, the switching device may be, but is not limited to, a switch device in an Ethernet.

The switching device is connected to the network node through a communication line, and the switching device is respectively connected to each node through a communication line. The transmission distance between the switching device and the network node is long, and the communication line between the two can be 100 Mbps optical fiber. Or Gigabit fiber, the switching distance between the switching device and each node is very close, so the switching device and each node can form a local area network. In the local area network, the communication line between the switching device and the node can be 100 Mbps optical fiber. Or Gigabit fiber, you can also use communication lines with smaller bandwidth. Since the switching device and each node perform data transmission in the formed local area network, the switching device only needs to communicate with the network node to realize real-time communication between the network node and the plurality of nodes, so The bandwidth resource is saved, the networking cost is reduced, the maintenance difficulty is reduced, and the reliability of the network is improved.

The physical location of the switching device is determined according to the specific distribution location of each node connected to the switching device and the physical location of the network node. In principle, the total number of communication lines between the nodes to the switching device and between the switching device and the network node is ensured as much as possible. The shortest length.

S202: Acquire the total byte information included in the to-be-sent message of the node carried in the request message in a scheduling time period.

The request message includes an identifier (Identity, ID) information of the node, total byte information, and timing information included in the to-be-sent message.

S203: Determine a length of time corresponding to the time slice according to the total bandwidth of the communication line with the network node and the total byte information included in the obtained packet to be sent by each node.

In the embodiment of the present invention, the network node may be, but not limited to, a control center.

Specifically, the switching device determines a time slice unit according to the total bandwidth of the communication line that is connected to the network node, and each node that is connected to itself, within a scheduling time period, and the total byte information included in the to-be-sent message. The length of time, wherein the time length corresponding to the time slice is determined, that is, each node may be allocated a time slice to satisfy the data transmission requirement of the node in a scheduling time period, or may be allocated for each node. At least one time slice can satisfy the data transmission requirement of the node in a scheduling time period. Determine the time period schedule.

The time period schedule includes the number of time slots and locations corresponding to each node connected to the switching device during data transmission in a time period. Wherein, a time period is determined by the total bandwidth of the communication line to which the switching device is connected to the network node.

S205: Forward, according to the time period schedule, the to-be-sent of each node to the network node. The switching device forwards the to-be-sent packet of each node to the network node according to the time-cycle scheduling table, and performs scheduling on each node according to the time-cycle scheduling table. At this time, the switching device sends the determined time period schedule to each node connected to itself. After receiving the time period schedule, each node sends a report to be sent to the network node according to the time period schedule. The file is forwarded to the switching device, and the switching device forwards the received message to the network node. Specifically, after receiving the time period schedule, each node determines, in the time period schedule, a time slice allocated by the switching device for the node, and then determines a time period corresponding to the time slice. The packet to be sent to the network node is forwarded to the switching device.

In the present invention, the switching device formulates a time period scheduling table according to the data transmission requirement of each node, and schedules each node, thereby avoiding the phenomenon that a large number of packets arrive at the network node at the same time, then the network node It can receive and process each document in time, avoiding the problem that some of the documents cannot be processed in time, thus effectively improving the security of business processing.

Preferably, in the present invention, in order to improve the allocation accuracy of the time slice, the bandwidth resource is further saved, and the utilization of the bandwidth resource is improved, and the total bandwidth of the communication line between the network node and the acquired node is in a scheduling. The total byte information contained in the packet to be sent during the time period, and the length of time corresponding to the time slice is determined, including:

The switching device determines the minimum common divisor of the total byte information of each node according to the total byte information contained in the obtained packet to be sent by each node;

The determined minimum common divisor is taken as the time length corresponding to the time slice.

Specifically, the switching device receives the request packet sent by each node connected thereto, and obtains the total byte information of the to-be-sent packet that the node carried in the request packet is in a scheduling time period, and obtains the Each node in the to-be-sent message contains the total byte information, and calculates the minimum common divisor of the total byte information contained in the message to be sent by all nodes, and determines the minimum common divisor as the time length of a time slice unit. That is, the number of time slices corresponding to each node is an integer, and each node makes full use of each time slice allocated to itself.

Preferably, in the present invention, in order to improve the scalability of the time period schedule, the time period schedule is determined according to the length of time corresponding to the determined time slice and the total byte information included in the message to be sent by each node. The method includes: calculating, according to total byte information included in a message to be sent by each node, and a length of time corresponding to the determined time slice, calculating a number of time slices corresponding to each node;

Each node is assigned a time slice in the time period table according to the number of time slices corresponding to each node.

Specifically, the switching device calculates the number of time slices corresponding to each node according to the total byte information of the to-be-sent message and the determined length of the time slice unit in each scheduling time period of each node connected to itself. And assigning a time slice to each node in the time period scheduling table, wherein each node corresponding time slice is uniformly distributed in the time period scheduling table, and if there is an idle time slice, each neighbor in the time period scheduling table An idle time slice is evenly distributed between the two nodes. Therefore, when a node increases the total byte information contained in the message to be sent within a scheduling time period, the idle time slice adjacent thereto can be directly Assigned to the node, thus avoiding the reallocation of time slices for each node, improving the scalability of the time period schedule.

Preferably, in the present invention, in order to meet the timing requirement of the node data transmission, the time slice is allocated to each node in the time period table according to the number of time slices corresponding to each node, including:

Determining whether the request message carries timing information according to the request packet sent by each node;

When it is determined that the request information of the node carries the time series information, the time series information and the number of time slices corresponding to the node are occupied, and the time slice is allocated to the node in the time period table; otherwise A time slice is allocated to the node in the time period table according to the number of time slices corresponding to the node.

Specifically, when the data transmission of some nodes in the network has a timing requirement, after calculating the number of time slices corresponding to each node, the switching device determines whether the request message is included according to the request packet sent by each node. When the timing information is carried in the request message of the node, the location corresponding to the node is determined in the time period table according to the data transmission sequence corresponding to the node, and the time slice is evenly allocated to the node.

In the embodiment of the present invention, each time slice corresponds to a start time point and an end time point, and after receiving the time period schedule, the node determines, in the time period schedule, a time slice allocated by the switching device for the node, and In each time slice allocated, the start time point of the first time slice and the end time point of the last time slice are determined, and then within the determined time period between the start time point and the end time point, The packet to be sent to the network node is forwarded to the switching device.

FIG. 3 is a schematic diagram of a detailed process of data transmission based on a time trigger mechanism according to the present invention, where the transmission process includes the following steps:

S301: The switching device receives the request message sent by each node connected thereto.

S302: Acquire the total byte information included in the to-be-sent packet of the node carried in the request packet in a scheduling time period.

S303: Determine a minimum common divisor of the total byte information of each node according to the obtained total byte information of the to-be-sent message of each node, and determine the minimum common divisor as the time length corresponding to the time slice.

S304: Calculate the number of time slices corresponding to each node according to the total byte information included in the message to be sent by each node and the time length corresponding to the determined time slice.

S305: Determine, according to the request message sent by each node, whether the request message carries timing information. If the determination result is yes, proceed to step S306; otherwise, proceed to step S307.

S306: Allocate a time slice for the node in the time period table according to the timing information and the number of time slices corresponding to the node.

S307: Allocate a time slice to the node uniformly in the time period table according to the number of time slices corresponding to the node. After receiving the time period schedule, the switching device sends the time period schedule to each node connected to itself. After receiving the time period schedule, each node sends the packet to be sent to the network node according to the time period schedule. Forwarding to the switching device, after receiving the message, the switching device directly forwards the packet to the network node through the communication line. At this time, the communication line between the switching device and the network node is only used to transmit the message. . In the embodiment of the present invention, each node occupies different time slices in the time period scheduling table, so each node sends a message to the switching device at different times, and the communication line between the switching device and the network node does not At the same time, packets of multiple nodes are transmitted, and only packets sent by one node are transmitted.

In the present invention, the switching device calculates the total byte information included in the to-be-sent packet of all nodes in a scheduling time period according to the total byte information of the to-be-sent packet sent by each node in a scheduled scheduling period. Minimum The common divisor, and the length of time as a time slice unit, combined with the timing requirements of the nodes, uniformly allocates time slices for each node in the time period table. Therefore, the allocation precision of the time slice and the scalability of the time schedule are improved, thereby further saving bandwidth resources and reducing networking cost.

Preferably, in the present invention, in order to further improve the scalability of the time period schedule, when the new node is connected to the switching device, the method further includes:

Determining whether the number of idle time slots included in the time period scheduling table satisfies the node according to the total byte information of the to-be-sent packet in the request packet sent by the received new node in a scheduled time period. The requirement of the total byte information contained in the message to be sent during a scheduling time period;

When it is determined that the requirement is met, the length of time corresponding to the time slice is determined according to the total byte information included in the message to be sent by each node in a scheduling time period;

Updating the time period schedule according to the length of time corresponding to the determined time slice and the total byte information included in the message to be sent by the node;

And forwarding the to-be-sent packet of the node to the network section according to the updated time-cycle scheduling table, otherwise discarding the request packet sent by the node.

FIG. 4 is a schematic diagram of a detailed process of data transmission based on a time trigger mechanism when a new node is connected to a switching device according to the present invention, and the transmission process includes the following steps:

S401: The switching device receives the request message sent by the new node.

S402: Obtain the total byte information included in the to-be-sent packet of the node carried in the request packet in a scheduling time period.

S403: Determine whether the number of idle time slices included in the time period scheduling table meets the requirement of the total byte information included in the message to be sent by the node, and if the determination result is yes, proceed to step S304; otherwise, discard the request report sent by the node. Text.

S404: Determine whether the total byte information included in the to-be-sent packet of the node that is carried in the request packet is an integer multiple of the length of time corresponding to the current time slice, and if the determination result is yes, proceed to step S406; otherwise, perform the step. S405.

S405: Calculate the total number of bytes included in the message to be sent by the new node and the minimum common divisor of the time length corresponding to the current time slice, and determine the minimum common divisor as the time length corresponding to the time slice.

S406: Calculate the number of time slices corresponding to the new node according to the total byte information included in the message to be sent by the new node and the time length corresponding to the determined time slice.

S407: Determine, according to the request packet sent by each node, whether the request message carries timing information, and if the determination result is yes, proceed to step S308; otherwise, proceed to step S309.

S408: Allocate a time slice to the node in the time period table according to the extracted timing information and the number of time slices corresponding to the node. When it is determined that the request information of the new node carries the timing information, determining the location of the new node according to the location of the node in the time period scheduling table with the new node data transmission sequence, determining that the determined location of the new node includes Whether the number of idle time slices is less than the number of time slices corresponding to the new node, and when the determination result is yes, the time period schedule is re-determined according to the method provided by the present invention; otherwise, the new node determined in the time period table is determined. The location is evenly assigned a time slice for the new node.

In addition, in the present invention, when a new node is connected to the switching device, and the new node has a request for message transmission time sequence, the time period schedule can be directly re-determined according to the method provided by the present invention.

S409: Allocate a time slice to the new node uniformly in the time period table according to the number of time slices corresponding to the new node. The switching device sends the updated time period schedule to the new node. After receiving the time period schedule, the new node forwards the packet to be sent to the network node to the switching device according to the time period scheduling table, and the switching device receives the packet. After the 4 艮 text, the 艮艮直接 is forwarded directly to the network node through the communication line, and the communication line between the switching device and the network node is only used to transmit the 艮艮。. In the embodiment of the present invention, each node occupies different time slices in the time period scheduling table, so each node sends a message to the switching device at different times, and the communication line between the switching device and the network node does not At the same time, packets of multiple nodes are transmitted, and only packets sent by one node are transmitted.

In the embodiment of the present invention, when a new node is connected to the switching device, if the total byte information included in the packet to be sent by the new node is not an integer multiple of the time length corresponding to the current time slice, the corresponding time slice is recalculated. The length of time, at this time, although the time length corresponding to the time slice changes, but the number of corresponding time slices of other nodes that have been connected to the switching device also changes, then the time slots of the nodes that have been connected to the switching device correspond to each time slice. The total length of time is kept constant, so the switching device does not need to send the time period schedule to the node that has been connected to the switching device. The node that has been connected to the switching device can schedule each time in the table according to the previously received time period. The time of the slice can be sent, so the transmission resources between the switching device and each node are effectively saved.

5-1 is a schematic structural diagram of a network architecture based on a time trigger mechanism, which is composed of a network node, a switching device, and nodes (A, B, C, D, E), and each node is exchanged. The devices are connected, and the switching device is connected to the network node through a communication network. Among them, node E is a newly added node, and nodes (B, E) have timing requirements. Node B is to occur after node D, and newly added node E needs to be sent after node A.

The specific switching device receives the request packet sent by each node (A, B, C, D), and obtains the total byte information of the to-be-sent packet sent by each node in a scheduling time period (where node A~) The total byte information contained in the D-to-send message is: 10M, 20M, 10M, 10M, and the total bandwidth of the communication network is 10M. The switching device determines that the minimum common divisor of the total byte information of each node is 10M. The length of time corresponding to the slice is the length of time required to transmit the data of 10 M. According to the length of time corresponding to the unit time slice, the number of time slices corresponding to the time schedule of the nodes A to D is calculated as: 1 slice, 2 Slice, 1 slice and 1 slice, because node B has timing requirements, it is determined that the order of sending all nodes in the time period schedule can be ACDB, according to the number of time slices corresponding to each node in the time period schedule table and The total bandwidth of the switching device connected to the network node communication network, which is evenly distributed in the time period table. Each node allocates a time slice, as shown in Figure 5-2-1.

When the new node E is connected to the point switching device, the switching device obtains the node carried in the request message of the node E in a scheduling time period, and the total byte information of the to-be-sent packet is 5M, and the time period scheduling table is determined. The number of idle time slices is sufficient to meet the requirements of the node E packet transmission. The total byte information contained in the to-be-sent packet of the node E is not an integer multiple of the length of the current time slice. Therefore, the time corresponding to the new time slice is determined. The length is 5M data, and the time period schedule is re-determined according to the timing requirements of node E, as shown in Figure 5-2-2.

In addition, in the present invention, if the switching device receives the packet sent by the node, before forwarding the packet to the network node, it can determine whether the total byte information included in the packet is greater than the communication line with the network node. If the total bandwidth is not greater than that, the switching device can directly forward the packet to the network node. If the judgment is greater than, the switching device can first cache the packet, then segment the packet, and then separately Transfer each segment of the message. The segmentation of the packet may be performed according to the total byte information included in the packet and the total bandwidth of the communication line between the switching device and the network node, for example, between the switching device and the network node. The total bandwidth of the communication line is 3M, and the total byte information contained in the message is 5M, the message can be divided into two segments, and the total byte information of the first segment of the message is 3M, the second segment· The total byte information of the 艮艮 text is 2M, and the switching device forwards the first segment to the network node, and then forwards the second segment to the network node. In addition, due to the total number of the second segment of the message The section information is smaller than the total bandwidth of the communication line between the switching device and the network node. In order to make full use of the bandwidth resource, the switching device can also send the second segment and the next message or segment to be sent to the network node. Forward to the network node together.

FIG. 6 is a schematic structural diagram of a data transmission apparatus based on a time trigger mechanism according to the present invention, where the transmission apparatus includes:

The receiving and receiving module 61 is configured to receive a request packet sent by each node connected thereto, and obtain the total byte information included in the to-be-sent packet of the node carried in the request packet in a scheduling time period;

The calculating module 62 is configured to determine, according to the total bandwidth of the communication line with the network node and the total byte information included in the obtained packet to be sent by each node, the time length corresponding to the time slice; ;

The scheduling module 64 is configured to forward, to the network node, the to-be-sent of each node according to the time period schedule.

The calculating module 62 is specifically configured to determine, according to the total byte information included in the to-be-sent message, the minimum common divisor of the total byte information of each node, and determine the determined The minimum common divisor is the length of time corresponding to the time slice.

The generating module 63 is specifically configured to calculate a time slice corresponding to each node according to the total byte information included in the to-be-sent message and the length of time corresponding to the determined time slice in each scheduling time period of each node. Quantity, according to the number of time slices corresponding to each node, allocate a time slice for each node in the time period table. The generating module 63 is configured to determine, according to the request packet sent by each node, whether the request message carries timing information, and when determining that the request message of the node carries timing information, according to the timing information and the The number of time slices corresponding to the node is allocated a time slice for the node in the time period table. Otherwise, the time slice is allocated to the node according to the number of time slices corresponding to the node.

The transmission device further includes:

The determining module 65 is configured to determine, according to the total byte information included in the to-be-sent message, the idle time included in the time-cycle scheduling table, in the request message sent by the received new node, the node Whether the number of slices satisfies the requirement of the total byte information contained in the message to be sent by the node in a scheduling time period;

The calculating module 62 is further configured to: when determining that the number of idle time slices included in the time period scheduling table meets the requirement of the total byte information included in the to-be-sent message of the node in a scheduling time period, according to each node in one The total byte information of the packet to be sent in the scheduling time period, and the length of time corresponding to the time slice is determined; otherwise, the request packet sent by the node is discarded;

The generating module 63 is further configured to: update the time period scheduling table according to the length of time corresponding to the determined time slice and the total byte information included in the to-be-sent message of the node in a scheduling time period;

The scheduling module 64 is further configured to: forward the to-be-sent packet of the node to the network node according to the updated time-cycle scheduling table.

The scheduling module 64 is configured to send the determined time period schedule to each node, receive the packets sequentially sent by the nodes according to the time period schedule, and forward the received packet to the node. The network node.

The embodiment of the present invention further provides a data transmission system based on a time trigger mechanism, and the structure thereof can be as shown in FIG. 1 , including a network node, a switching device, and each node, where:

The node is configured to send a request message to the switching device when the packet needs to be sent to the network node, and send, to the switching device, a packet to be sent to the network node according to the scheduling of the switching device. Switching equipment

The switching device is configured to receive a request packet sent by each node connected to the node, and obtain the total byte information included in the to-be-sent packet of the node carried in the request packet, according to the Determining a time slice corresponding to the total bandwidth of the communication line between the network node and the total byte information of the packet to be sent of each node, and determining a time period schedule, according to the time period schedule, The nodes to be sent are forwarded to the network node;

The network node is configured to receive, by the switching device, a packet sent by each node.

The present invention provides a data transmission method and apparatus based on a time-triggered mechanism, in which a switching device receives a request message sent by each node connected thereto, and obtains the node carried in the request message in a scheduling time period. The total byte information contained in the message to be sent; the total byte information of the to-be-sent message, determined according to the total bandwidth of the communication line with the network node and the acquired time of each node in a scheduling time period. Time corresponding to the time slice Length; determining a time period schedule according to the length of time corresponding to the determined time slice and the total byte information of the to-be-sent message in each of the scheduled time periods; and according to the time period schedule, each The to-be-sent message of the node is forwarded to the network node. In the present invention, the switching device formulates a time period scheduling table according to the data transmission requirement of each node, and schedules each node, thereby avoiding the phenomenon that a large number of 4 艮 messages arrive at the network node at the same time, then the network node It is possible to receive and process each document in time, so as to avoid the problem that some of the documents cannot be processed in time, thereby effectively improving the security of business processing.

Those skilled in the art will appreciate that embodiments of the present application can be provided as a method, apparatus (device), or computer program product. Thus, the application can be in the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the application can be in the form of a computer program product embodied on one or more computer-usable storage modules (including but not limited to disk storage, CD-ROM, optical storage, etc.) in which computer usable program code is embodied.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus, and computer program products according to embodiments of the present application. It will be understood that each flow and/or block of the flowchart illustrations and/or FIG. These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing device to produce a machine for the execution of instructions for execution by a processor of a computer or other programmable data processing device. Means for implementing the functions specified in one or more of the flow or in a block or blocks of the flow chart.

The computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device. The apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.

These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device. The instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Although the preferred embodiment of the present application has been described, those skilled in the art can make additional changes and modifications to the embodiments once they are aware of the basic inventive concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and the modifications and It will be apparent that those skilled in the art can make various modifications and variations to the present application without departing from the spirit and scope of the application. Accordingly, it is intended that the present invention cover the modifications and variations of the present invention.

Claims

Rights request

1. A data transmission method based on a time trigger mechanism, characterized in that the method includes:

The switching device receives the request message sent by each node connected to it, and obtains the total byte information contained in the message to be sent by the node within a scheduling time period carried in the request message;

Determine the time length corresponding to the time slice based on the total bandwidth of the communication line with the network node and the obtained total byte information contained in the message to be sent by each node; Inter-period scheduling table;

According to the time period schedule, the message to be sent by each node is forwarded to the network node.

2. The method according to claim 1, characterized in that, the time slice correspondence is determined based on the total bandwidth of the communication line with the network node and the obtained total byte information contained in the message to be sent by each node. The length of time, including: The switching device determines the minimum common denominator of the total byte information of each node based on the obtained total byte information contained in the packet to be sent by each node;

The determined least common divisor is used as the time length corresponding to the time slice.

3. The method of claim 1, wherein the time period schedule is determined based on the time length corresponding to the determined time slice and the total byte information contained in the message to be sent by each node, including:

Calculate the number of time slices corresponding to each node based on the total byte information contained in the message to be sent by each node and the time length corresponding to the determined time slice;

According to the number of time slices corresponding to each node, a time slice is allocated to each node in the time period table.

4. The method according to claim 3, characterized in that, according to the number of time slices corresponding to each node, a time slice is allocated to each node in the time periodic table, specifically including:

Based on the request message sent by each node, determine whether the request message carries timing information;

When it is determined that the node's request message carries timing information, the timing information and the number of time slices corresponding to the node will be included, and the time slice will be allocated to the node in the time period table; otherwise

According to the number of time slices corresponding to the node, the node is assigned a time slice in the time period table.

5. The method of claim 1, wherein when a new node is connected to a switching device, the method further includes:

Based on the total byte information contained in the message to be sent by the node in a scheduling time period carried in the received request message sent by the new node, it is judged whether the number of idle time slices contained in the time period schedule table satisfies the node. Within a scheduling time period, the requirement for the total byte information contained in the message to be sent;

When it is determined that the requirements are met, the time length corresponding to the time slice is determined based on the total byte information contained in the message to be sent by each node within a scheduling time period; Update the time period schedule according to the time length corresponding to the determined time slice and the total byte information contained in the message to be sent by the node;

According to the updated time period schedule, forward the message to be sent by the node to the network node; otherwise, discard the request message sent by the node.

6. A data transmission device based on a time trigger mechanism, characterized in that the device includes:

The receiving and obtaining module is used to receive the request message sent by each node connected to it, and obtain the total byte information contained in the message to be sent by the node within a scheduling time period carried in the request message;

The calculation module is used to determine the time length corresponding to the time slice based on the total bandwidth of the communication line with the network node and the obtained total byte information contained in the message to be sent by each node; the node information is used to determine the time period schedule ;

A scheduling module, configured to forward the text to be sent by each node to the network node according to the time period schedule.

7. The device according to claim 6, wherein the calculation module is specifically configured to determine the minimum convention of the total byte information of each node based on the acquired total byte information contained in the message to be sent by each node. number, and use the determined least common divisor as the time length corresponding to the time slice.

8. The device according to claim 6, wherein the generating module is specifically configured to calculate each node according to the total byte information contained in the message to be sent by each node and the time length corresponding to the determined time slice. According to the number of time slices corresponding to each node, a time slice is allocated to each node in the time period table.

9. The device according to claim 8, characterized in that the generating module is specifically used to

According to the request message sent by each node, it is judged whether the request message carries timing information. When it is determined that the request message of the node carries timing information, based on the timing information of the node and the number of time slices corresponding to the node, The node is assigned a time slice in the time periodic table. Otherwise, the node is assigned a time slice in the time periodic table according to the number of time slices corresponding to the node.

10. The device according to claim 6, characterized in that, the device further includes:

The judgment module is used to judge the idle time slice included in the time period schedule based on the total byte information contained in the message to be sent by the node in a scheduling time period carried in the received request message sent by the new node. Whether the quantity meets the node's requirement for the total byte information contained in the message to be sent within a scheduling time period;

The calculation module is also used to determine the time length corresponding to the time slice based on the total byte information contained in the message to be sent by each node within a scheduling time period when it is determined that the demand is met; otherwise, discard the request sent by the node message; the generation module is also used to update the time period schedule based on the time length corresponding to the determined time slice and the total byte information contained in the message to be sent by the node within a scheduling time period; The scheduling module is also configured to forward the message to be sent by the node to the network node according to the updated time period schedule.