Methods, apparatus, and electronic devices for transmitting data in a system.

Abstract

The present disclosure provides a method, an apparatus, and an electronic device for transmitting data in a system, the method being applicable to a data transmission system, the data transmission system including a plurality of nodes, the plurality of nodes forming a ring communication link, the method including, for a target node among the plurality of nodes, the target node obtaining pending data, the pending data including a pending message and a destination node identifier corresponding to the pending message, if the destination node identifier corresponding to the pending message is the same as the identifier of the target node, the target node processes the pending message, and if the destination node identifier corresponding to the pending message is different from the identifier of the target node, the target node transmitting the pending data to a neighboring node of the target node, the embodiment improves data transmission efficiency and reduces error rate and packet loss rate.

Description

Technical Field

[0001] (Reference to Related Applications) This application claims the priority of a Chinese invention patent application titled "Method, Apparatus, and Electronic Device for Transmitting Data in a System" with application number 202310264788.6, filed on March 17, 2023, and all the contents of the said application are incorporated herein by reference.

[0002] (Technical Field) The present invention relates to the field of Internet communication technology, and particularly to a method, apparatus, and electronic device for transmitting data in a system.

Background Art

[0003] With the rapid development of Internet technology, network communication technology has become increasingly important. Currently, it is necessary to communicate between nodes in a data transmission system to realize data transmission between nodes. However, since the data transmission stream between nodes is complex, it is difficult to manage data transmission between nodes. Currently, there is a need for a method to efficiently transmit data between nodes in a data transmission system.

Summary of the Invention

Means for Solving the Problems

[0004] <000002​​​​​​If the destination node identifier corresponding to a pending message is the same as the target node identifier, the target node will process the pending message. If the destination node identifier corresponding to a pending message differs from the target node identifier, the target node includes sending the pending data to an adjacent node of the target node.

[0005] According to a second aspect, a device for transmitting data in a system is provided. The device is applied to a data transmission system, the data transmission system includes a plurality of nodes, the plurality of nodes constitute a circular communication link, and for any target node among the plurality of nodes, the device An acquisition module for a target node to acquire pending data, wherein the pending data includes a pending message and a destination node identifier corresponding to the pending message. If the destination node identifier corresponding to the pending message is the same as the target node identifier, a processing module for processing the pending message is provided. The system includes a transmission module for sending pending data to an adjacent node of the target node if the destination node identifier corresponding to the pending message differs from the identifier of the target node.

[0006] According to a third aspect, a computer-readable storage medium is provided in which a computer program is stored, and when the computer program is executed by a processor, the method described in any one of the first aspects is realized.

[0007] According to a fourth aspect, an electronic device is provided which includes memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the method described in any one of the first aspects is realized.

[0008] The above general and detailed descriptions are illustrative only and do not limit this disclosure. [Brief explanation of the drawing]

[0009] To more clearly illustrate the technical solutions of the embodiments described herein, the following brief introduction of the drawings required in the description of the embodiments is provided. Clearly, the drawings in the following description are merely some of the embodiments described herein, and those skilled in the art can obtain other drawings based on these without any creative effort.

[0010] [Figure 1] This is a schematic diagram of a data transmission scenario in a system according to one exemplary embodiment of the present disclosure. [Figure 2] This is a flowchart of a data transmission method in a system according to one exemplary embodiment of the present disclosure. [Figure 3A] This is a schematic diagram illustrating a data transmission scenario in another system relating to one exemplary embodiment of the present disclosure. [Figure 3B] This is a schematic diagram illustrating a data transmission scenario in another system relating to one exemplary embodiment of the present disclosure. [Figure 4] This is a block diagram of a data transmission device in a system according to one exemplary embodiment of the present disclosure. [Figure 5] This is a schematic block diagram of an electronic device according to some embodiments of the present disclosure. [Figure 6] This is a schematic block diagram of another electronic device relating to some embodiments of the present disclosure. [Figure 7] This is a schematic diagram of a storage medium according to some embodiments of the present disclosure. [Modes for carrying out the invention]

[0011] For those skilled in the art to better understand the technical solutions herein, the technical solutions herein will be described clearly and completely below with reference to the drawings of the embodiments herein, and it will be obvious that the embodiments described are only some of the embodiments herein, and not all of them. Based on the embodiments herein, those skilled in the art will know that all other embodiments obtained without creative work are also within the scope of protection of this specification.

[0012] In the following description, unless otherwise specified, the same reference numerals in different drawings indicate the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. They are merely examples of apparatus and methods consistent with some aspects of the present disclosure as described in the claims.

[0013] The terms used in this disclosure are for illustrative purposes only and are not intended to limit the disclosure. The singular forms “one,” “the said,” and “the said” as used in this disclosure are also intended to include many forms unless the context clearly indicates otherwise. The term “and / or” as used herein means including any or all possible combinations of one or more related enumerated items.

[0014] In this disclosure, various types of information can be described using the first, second, and third terms, but it should be understood that this information is not limited to these terms. These terms are used solely to distinguish information of the same kind from one another. For example, without departing from the scope of this disclosure, first information may be called second information, and similarly, second information may be called first information. Depending on the context, the word "if" as used herein may be interpreted as "when" or "at the time" or "specific response."

[0015] With the rapid development of internet technology, network communication technology is becoming increasingly important. Currently, data transmission between machine rooms is typically achieved by arranging routing for machine rooms in each region and communicating between them through routing. However, because data transmission between machine rooms is complex, it is difficult to manage. Furthermore, when a machine room transmits data, it first searches for and obtains the address of the target machine room for the data to be transmitted, then determines the transmission path for the data to be transmitted, and finally transmits the data according to that transmission path. Consequently, each time data with the same path is transmitted, the data transmission efficiency is low, and the error rate and packet loss rate are high.

[0016] The method for transmitting data in the system described herein involves making at least one machine room in the data transmission system a single node, forming a circular communication link consisting of multiple nodes. For any given node, pending data, including a pending message and its destination node identifier, is acquired. If the destination node of the pending message is that node, the message is processed directly. If the destination node of the pending message is not that node, the pending data is sent to an adjacent node connected to that node, thereby transmitting each pending message to the destination node corresponding to that message via the communication link. Because the data transmission stream between nodes is simple, data transmission between nodes is easy to manage. Furthermore, when a node transmits data, it does not need to determine the transmission path of the pending data; it only needs to transmit the data via the ring link. Different destination nodes can transmit data simultaneously, improving data transmission efficiency and reducing the error rate and packet loss rate.

[0017] Figure 1 is a schematic diagram of a data transmission scenario in a system according to one exemplary embodiment. As shown in FIG. 1, the system can include, for example, a total of eight nodes, namely Node 1 to Node 8. Each node may correspond to at least one machine room, and each machine room may include one or more devices, servers, or device clusters having computing and processing capabilities. Although FIG. 1 shows that the system includes eight nodes, the embodiments of this specification are not limited thereto, and the system may include other numbers of nodes. The eight nodes form a ring-shaped communication link, and each node is connected to two other nodes via the communication link. The communication link may be unidirectional or bidirectional.

[0018] If this communication link is unidirectional, the following will exemplify the specific data transmission process using Node 1 as an example. Specifically, Node 1 performs data transmission once every period T. For example, at time T0 when one period ends, Node 1 checks whether there is a message waiting to be transmitted from the pre-stored data. If there is no message waiting to be transmitted, it waits for time T1 when the next period ends. If there is a message to be transmitted, at least one message to be transmitted is obtained from the pre-stored data. After packaging the message to be transmitted into packet a, it can be transmitted to Node 2.

[0019] From time point T0 to time point T1 when the next cycle ends, on the one hand, Node 1 can receive the data packet b sent from Node 8 and obtain a plurality of messages included in the data packet b and information on the destination nodes corresponding to each message (for example, the identifiers of the destination nodes). For example, the plurality of messages may include Message b1 and Message b2, etc. The destination node corresponding to Message b1 is Node 1, and the destination node corresponding to Message b2 is Node 3. After Node 1 determines the destination nodes corresponding to Message b1 and Message b2, it processes Message b1 and stores Message b2 as a message waiting to be sent. On the other hand, if Node 1 generates Message c1 and the destination node corresponding to Message c1 is Node 4, after generating Message c1, Node 1 can directly store Message c1 as a message waiting to be sent.

[0020] At time point T1 when the cycle ends, Node 1 obtains the message b2 waiting to be sent and Message c1 from the pre-stored data, packages Message b2 and Message c1 into Packet c. Packet c can obtain Message b2 and Message c1, as well as information on destination node 3 corresponding to Message b2 and information on destination node 4 corresponding to Message c1, etc. Then, Node 1 sends Packet c to Node 2. Thereafter, every cycle, if there is data waiting to be sent at Node 1, it sends the data to Node 2. Similarly, other nodes also perform data transmission periodically in this manner. Therefore, Message b2 is sent to Node 3 via Node 2, and Message c1 is sent to Node 4 via Node 2 and Node 3. Note that the cycles for each node to send data may be the same or different.

[0021] If the communication link is bidirectional, taking node 1 as an example, node 1 transmits data every period T. Node 1 stores two sets of pending messages for transmission directions. Messages sent towards node 2 are stored in pending message group 1, and messages sent towards node 8 are stored in pending message group 2. At time T0, when the period is completed, node 1 checks whether there are any pending messages to be sent towards node 2 from the pre-stored pending message group 1, and whether there are any pending messages to be sent towards node 8 from the pending message group 2. If neither exists, it waits until time T1, when the next period is completed.

[0022] Between time T0 and time T1, when the next cycle ends, Node 1 receives a data packet b sent from Node 8 and obtains information about messages b1 and b2 contained in data packet b, as well as information about Node 1 (the destination node corresponding to message b1) and Node 3 (the destination node corresponding to message b2). After determining the destination nodes corresponding to messages b1 and b2, Node 1 processes message b1 and stores message b2 in the message group 1 awaiting transmission. Meanwhile, Node 1 receives a data packet d sent from Node 2 and obtains information about message d1 contained in data packet d and information about Node 6 (the destination node corresponding to message d1). After determining the destination node corresponding to message d1, Node 1 stores message d1 in the message group 2. In yet another embodiment, Node 1 generates message c1, the destination node corresponding to message c1 is Node 4, and after generating message c1, Node 1 can store message c1 in the message group 1 and the message group 2.

[0023] At time T1, when the cycle has expired, node 1 can retrieve messages b2 and c1 from the pre-stored group of messages awaiting transmission 1, and package messages b2 and c1 into packet c. Then, node 1 sends packet c to node 2. Simultaneously, node 1 may retrieve messages d1 and c1 from the pre-stored group of messages awaiting transmission 2, and package messages d1 and c1 into packet e. Then, node 1 sends packet e to node 8. Similarly, the other nodes periodically transmit data using this method. Therefore, message b2 is sent to node 3 via node 2, and message d1 is sent to node 6 via nodes 8 and 7. Note that if message c1 is first sent to node 4 via nodes 2 and 3, and messages c1 in other transmission directions are sent to node 4 via nodes 8 to 5, node 4 may directly ignore message c1. If the link between node 2 and node 3 fails and the connection is broken, message c1 will not be sent to node 4 via nodes 2 and 3, but may be sent to node 4 via nodes 8 to 5 through an alternative transmission direction. Therefore, according to this embodiment, the data loss rate can be further reduced.

[0024] The present disclosure will be described in detail below with reference to specific examples. Figure 2 is a flowchart of a data transmission method in a system according to one exemplary embodiment. The method is applied to a data transmission system, which may include a plurality of nodes constituting a circular communication link, which may be a unidirectional or bidirectional communication link. The target node may be any node among the plurality of nodes, and the method may include the following steps.

[0025] As shown in Figure 2, in step 201, the target node acquires data awaiting processing, and in step 202, if the destination node identifier corresponding to the message awaiting processing is the same as the identifier of the target node, the target node processes the message awaiting processing.

[0026] In this embodiment, the target node may be adjacent to two nodes, and the two nodes adjacent to the target node include a first adjacent node and a second adjacent node. In one implementation, the communication link is a unidirectional communication link, and data is transmitted between multiple nodes via the communication link in a first transmission direction. In the first transmission direction, the first adjacent node may be the node before the target node, and the second adjacent node may be the node after the target node. That is, the first adjacent node transmits data in one direction to the target node, and the target node transmits data in one direction to the second adjacent node. For example, as shown in Figure 3A, direction x is the first transmission direction, and data is transmitted between nodes along direction x. The first adjacent node of the target node is node m before transmitting data to the target node, and the second adjacent node of the target node is the next node n that receives the data transmitted to the target node.

[0027] In another implementation, the communication link is a bidirectional communication link, and data can be transmitted between multiple nodes via the communication link in a first transmission direction and a second transmission direction, respectively, with the first and second transmission directions being opposite. In the first transmission direction, the first neighbor node may be the node before the target node, and the second neighbor node may be the node after the target node. That is, the first neighbor node transmits data to the target node, and the target node transmits data to the second neighbor node. In the second transmission direction, the second neighbor node may be the node before the target node, and the first neighbor node may be the node after the target node. That is, the second neighbor node transmits data to the target node, and the target node transmits data to the first neighbor node. For example, as shown in Figure 3B, direction x is the first transmission direction, and direction y is the second transmission direction, and nodes transmit data in directions x and y, respectively. In direction x, the first neighbor node of the target node is node m before transmitting data to the target node, and the second neighbor node of the target node is node n after receiving the data transmitted to the target node. In direction y, the second neighbor node of the target node is node n before it sends data to the target node, and the first neighbor node of the target node is the next node m that receives the data sent to the target node.

[0028] In this embodiment, the pending data may include a pending message and a destination node identifier corresponding to the pending message. Specifically, in one implementation, if the communication link is a unidirectional communication link, the target node can receive the first pending data from the first neighboring node. Next, the target node can determine the destination node identifier corresponding to the first pending message included in the first pending data. If the destination node identifier corresponding to the first pending message is the same as the identifier of the target node, the target node processes the first pending message.

[0029] In another implementation, if the communication link is a bidirectional communication link, the target node may receive first pending data transmitted from the first neighbor node in the first transmission direction and determine the destination node identifier corresponding to the first pending message contained in the first pending data. If the destination node identifier corresponding to the first pending message is the same as the identifier of the target node, the target node processes the first pending message. Alternatively, the target node may receive second pending data transmitted from the second neighbor node in the second transmission direction and determine the destination node identifier corresponding to the second pending message contained in the second pending data. If the destination node identifier corresponding to the second pending message is the same as the identifier of the target node, the target node processes the second pending message.

[0030] In step 203, if the destination node identifier corresponding to the pending message is different from the target node identifier, the target node sends the pending data to its neighboring nodes.

[0031] In one implementation, if the communication link is a unidirectional communication link, the target node receives first pending data from the first neighbor node and determines the destination node identifier corresponding to the first pending message contained in the first pending data. If the destination node identifier corresponding to the first pending message is different from the target node identifier, the target node may store the received first pending data in first pre-stored data, which is used to store data to be transmitted in the first transmission direction. If a first time condition is met (for example, when a preset period has expired), some or all of the data stored within a preset period can be retrieved from the first pre-stored data as target data for the transmission target, and the target data includes the first pending data. Next, the target node may generate a first data packet carrying the first pending data based on the target data and transmit the first data packet to the second neighbor node.

[0032] In another implementation, if the communication link is a bidirectional communication link, the target node receives the first pending data transmitted from the first neighbor node in the first transmission direction and determines the destination node identifier corresponding to the first pending message contained in the first pending data. If the destination node identifier corresponding to the first pending message is different from the target node's identifier, the target node stores the received first pending data in the first pre-stored data. If the first time condition is met, the target node can retrieve the target data from the first pre-stored data, generate a first data packet carrying the first pending data based on the target data, and transmit the first data packet to the second neighbor node. On the other hand, the target node receives the second pending data transmitted from the second neighbor node in the second transmission direction and determines the destination node identifier corresponding to the second pending message contained in the second pending data. If the destination node identifier corresponding to the second pending message is different from the target node's identifier, the target node stores the received second pending data in the second pre-stored data, and the second pre-stored data is configured to store data transmitted in the second transmission direction. If the second time condition is met, target data can be retrieved from the second pre-stored data, a second data packet can be generated to carry the second data awaiting processing based on the target data, and the second data packet can be sent to the first neighboring node.

[0033] The target data may include at least one pending message, each pending message corresponding to a source node and a destination node. Any pending message must be generated by its corresponding source node and sent to its corresponding destination node for processing. If there are multiple pending messages, the source and destination nodes corresponding to different pending messages may be the same or different. The data packet generated based on the target data may include a key information header and a message body. The message body may include each pending message, and the key information header may include information about the source and destination nodes corresponding to each pending message, as well as the generation time for each pending message.

[0034] The target node may generate a message as a third pending message, and the target node may store the generated third pending message and the target node identifier corresponding to the third pending message as third pending data, and store the third pending data in the first pre-stored data and the second pre-stored data.

[0035] The method for transmitting data in the system described herein involves making at least one machine room in the data transmission system a single node, forming a circular communication link consisting of multiple nodes. For any given node, pending data, including a pending message and its destination node identifier, is acquired. If the destination node of the pending message is that node, the message is processed directly. If the destination node of the pending message is not that node, the pending data is sent to an adjacent node connected to that node, thereby transmitting each pending message to the corresponding destination node via the communication link. Because the data transmission stream between nodes is simple, data transmission between nodes is easy to manage. Furthermore, when a node transmits data, it does not need to determine the transmission path of the pending data; it only needs to transmit the data over the ring link. This improves data transmission efficiency and reduces the error rate and packet loss rate.

[0036] In the embodiments described above, the operations of the method according to the embodiments of this disclosure are described in a specific order. However, this does not necessarily require or imply that these operations must be performed in that specific order; all operations must be performed to achieve the desired result. In contrast, the steps shown in the flowchart may be performed in a different order. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one, and / or one step may be broken down into multiple steps.

[0037] The data transmission method and apparatus in the embodiment of the present disclosure form a ring-shaped communication link consisting of multiple nodes, with at least one machine room in the data transmission system acting as one node. For any node, pending data including a pending message and its destination node identifier is acquired. If the destination node of the pending message is that node, the message is processed directly. If the destination node of the pending message is not that node, the pending data is sent to an adjacent node connected to that node, thereby transmitting each pending message to the corresponding destination node via the communication link. Because the data transmission stream between nodes is simple, data transmission between nodes is easy to manage. Furthermore, when a node transmits data, it does not need to determine the transmission path of the pending data; it only needs to transmit the data over the ring link. This improves data transmission efficiency and reduces the error rate and packet loss rate.

[0038] Corresponding to embodiments of the data transmission method in the aforementioned system, this disclosure further provides embodiments of a data transmission apparatus in the system.

[0039] As shown in Figure 4, Figure 4 is a block diagram of a data transmission device in a system according to an exemplary embodiment of the present disclosure, the device being applied to a data transmission system, the data transmission system comprising a plurality of nodes, the plurality of nodes forming a circular communication link, the device being located at one of the target nodes among the plurality of nodes, and the device may include an acquisition module 401, a processing module 402, and a transmission module 403.

[0040] The acquisition module 401 acquires pending data, which includes a pending message and a destination node identifier corresponding to the pending message.

[0041] The processing module 402 processes a pending message if the destination node identifier corresponding to the pending message is the same as the target node identifier.

[0042] If the destination node identifier corresponding to the pending message differs from the target node identifier, the transmission module 403 sends the pending data to the neighboring node of the target node.

[0043] In some embodiments, data is transmitted between multiple nodes via a communication link in a first transmission direction, and the pending data includes first pending data. The acquisition module 401 receives the first pending data from a first neighbor node corresponding to the target node, the first neighbor node is connected to the target node via a communication link, and in the first transmission direction, the first neighbor node is configured to be the node before the target node.

[0044] In some other embodiments, the transmitting module 403 is configured to store received first pending data in first pre-stored data, which is used to store data to be transmitted in the first transmission direction, and to retrieve the first pending data from the first pre-stored data and transmit the first pending data to the second neighbor node if a first time condition is met. The second neighbor node is connected to the target node via a communication link, and in the first transmission direction, the second neighbor node is the node following the target node.

[0045] In some other embodiments, the communication link is a bidirectional communication link that transmits data between multiple nodes along a second transmission direction, the second transmission direction being opposite to the first transmission direction. The first neighboring node is the node following the target node in the second transmission direction.

[0046] In some other embodiments, the pending data further includes second pending data. The acquisition module 401 further receives the second pending data from a second neighbor node, the second neighbor node being connected to the target node via the communication link, and configured such that in the first transmission direction, the second neighbor node is the node following the target node, and in the second transmission direction, the second neighbor node is the node preceding the target node.

[0047] In some other embodiments, the transmitting module 403 is configured to store the received second pending data in second pre-stored data for storing data to be transmitted in the second transmission direction, and to retrieve the second pending data from the second pre-stored data and transmit the second pending data to the first neighboring node if the second time condition is met.

[0048] In some other embodiments, the pending data further includes third pending data, and the acquisition module 401 is further configured to generate the third pending data by the target node.

[0049] Since the embodiments of the apparatus basically correspond to the embodiments of the method, relevant sections should be referred to in the description of the embodiments of the method. The embodiments of the apparatus described above are merely schematic, and the means described as separation means may or may not be physically separated, and the means indicated as means do not have to be physical means, that is, they may be located in one place or distributed across multiple network units. Depending on the actual needs, some or all of these modules can be selected to achieve the objectives of the technical proposals of the embodiments of this disclosure. It can be understood and implemented by those skilled in the art without creative effort.

[0050] Figure 5 is a schematic block diagram of an electronic device according to some embodiments of the present disclosure. As shown in Figure 5, the electronic device 910 includes a processor 911 and a memory 912 and may be configured to implement a client or a server. The memory 912 non-temporarily stores computer executable instructions (e.g., one or more computer program modules). The processor 911 is configured to execute the computer executable instructions, and when the computer executable instructions are executed by the processor 911, it performs one or more steps of the data transmission method in the system described above to realize the data transmission method in the system described above. The memory 912 and the processor 911 may be connected to each other by a bus system and / or other forms of connection mechanisms (not shown).

[0051] For example, the processor 911 may be a central processing unit (CPU), a graphics processing unit (GPU), or another type of processing unit having data processing capability and / or program execution capability. For example, the central processing unit (CPU) may be an X86 or ARM architecture, etc. The processor 911 may be a general-purpose processor or a dedicated processor, and may control other components in the electronic device 910 to perform desired functions.

[0052] For example, memory 912 may include any combination of one or more computer program products, and computer program products may include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. Volatile memory may include, for example, random access memory (RAM) and / or cache memory (cache). Non-volatile memory may include, for example, read-only memory (ROM), hard disk, erasable programmable read-only memory (EPROM), portable compact disk read-only memory (CD-ROM), USB memory, flash memory, etc. One or more computer program modules may be stored in the computer-readable storage media, and the processor 911 may execute one or more computer program modules to realize various functions of the electronic device 910. Various application programs and various data, as well as various data generated by and / or used in the application programs, may be stored in the computer-readable storage media.

[0053] In the embodiments of this disclosure, the specific functions and technical effects of the electronic device 910 can be found in the description of the data transmission method in the system described above, and are therefore omitted here.

[0054] Figure 6 is a schematic block diagram of another electronic device relating to some embodiments of the present disclosure. The electronic device 920 is suitable, for example, for implementing a data transmission method in a system relating to an embodiment of the present disclosure. The electronic device 920 may be a terminal device or the like, and may be used to realize a client or a server. The electronic device 920 may include, but is not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and wearable electronic devices, as well as fixed terminals such as digital TVs, desktop computers, and smart home devices. Note that the electronic device 920 shown in Figure 6 is merely an example and does not impose any limitations on the functions and scope of use of the embodiments of the present disclosure.

[0055] As shown in Figure 6, the electronic device 920 may include a processing unit (e.g., a central processing unit, a graphics processor, etc.) 921 capable of performing various appropriate operations and processes based on a program stored in a read-only memory (ROM) 922 or a program loaded from a storage device 928 into a random access memory (RAM) 923. The RAM 923 also stores various programs and data necessary for the operation of the electronic device 920. The processing unit 921, ROM 922, and RAM 923 are interconnected by a bus 924. An input / output (I / O) interface 925 is also connected to the bus 924.

[0056] Typically, the following devices include an I / O interface 925: input devices 926, such as a touchscreen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 927, such as a liquid crystal display (LCD), speaker, vibrator, etc.; storage devices 928, such as magnetic tape, hard disk, etc.; and a communication device 929. The communication device 929 can allow the electronic device 920 to exchange data with other electronic devices via wireless or wired communication. Figure 6 shows an electronic device 920 with various devices, but it should be understood that it is not required to implement or include all the devices shown, and the electronic device 920 may have alternative, more, or fewer devices.

[0057] For example, according to embodiments of the present disclosure, the method for transmitting data in the system may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product that includes a computer program carried on a non-temporary computer-readable medium, which includes program code for performing the method for transmitting data in the system. In such embodiments, the computer program may be downloaded and installed from a network via a communication device 929, installed from a storage device 928, or installed from a ROM 922. When the computer program is executed by a processing unit 921, it can implement functions limited to the method for transmitting data in the system according to embodiments of the present disclosure.

[0058] Figure 7 is a schematic diagram of a storage medium according to some embodiments of the present disclosure. For example, as shown in Figure 7, the storage medium 930 may be a non-temporary computer-readable storage medium. When a non-temporary computer-executable command 931 is executed by a processor, a method of data transmission in the system described in the embodiments of the present disclosure is realized, and for example, when a non-temporary computer-executable command 931 is executed by a processor, one or more steps of the above-described method of data transmission in the system can be performed.

[0059] For example, the storage medium 930 may be applied to the electronic device described above, and for example, the storage medium 930 may include memory in the electronic device.

[0060] For example, the storage medium may include a smartphone memory card, a tablet computer memory component, a personal computer hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), portable compact disk read-only memory (CD-ROM), flash memory, or any combination of the above storage mediums, or other applicable storage mediums.

[0061] For example, the description of the storage medium 930 can be found in the description of memory in the embodiment of the electronic device, and redundant explanations will be omitted. The specific functions and technical effects of the storage medium 930 can be found in the description of the data transmission method in the system described above, and will be omitted here.

[0062] In the context of this disclosure, a computer-readable medium may be a tangible medium that contains or stores a program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium, or any combination thereof. A computer-readable storage medium may be, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of more than these. More specific examples of computer-readable storage media may include, but are not limited to, an electrical connection having one or more wires, a portable computer magnetic disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the above. In this disclosure, a computer-readable storage medium may be any tangible medium containing a program, which may be directed to be used by or in conjunction with a system, apparatus, or device. In this disclosure, a computer-readable signal medium may include data signals propagating in the baseband or as part of a carrier wave, which contain computer-readable program code. Such propagating data signals may include, but are not limited to, electromagnetic signals, optical signals, or any suitable combination thereof, and may take various forms. The computer-readable signal medium may be any computer-readable medium other than a computer-readable storage medium, which can transmit, propagate, or transmit instruction execution systems, apparatus, or devices or programs used in combination therewith. The program code contained in the computer-readable medium may be transmitted using any suitable medium, but is not limited to such medium.

[0063] A person skilled in the art will readily conceive of other embodiments of the Disclosure after practicing the Specification and the Inventions Disclosed herein. This Disclosure is intended to cover any variations, uses, or adaptive changes of the Disclosure, which will conform to the general principles of the Disclosure and include common or conventional art means not disclosed herein. The embodiments disclosed herein should be considered in all respects to be illustrative and not restrictive.

[0064] The present invention is not limited to the embodiments described above, and can be modified in various ways without departing from its spirit. The scope of this disclosure is limited only by the appended claims.

Claims

1. A method for transmitting data in a system, The method is applied to a data transmission system, the data transmission system includes a plurality of nodes, the plurality of nodes constitute a circular communication link, and the method is The acquisition of data includes, for any target node among the plurality of nodes, the target node acquiring data awaiting processing, wherein the data awaiting processing includes a message awaiting processing and a destination node identifier corresponding to the message awaiting processing. If the destination node identifier corresponding to the pending message is the same as the target node identifier, the target node will process the pending message. If the destination node identifier corresponding to the pending message differs from the identifier of the target node, the target node transmits the pending data to an adjacent node of the target node, Between the aforementioned plurality of nodes, data is transmitted along the first transmission direction via the communication link, the pending data includes the first pending data, and the pending data is acquired. Receiving the first processing await data from a first adjacent node corresponding to the target node, wherein the first adjacent node is connected to the target node via the communication link, and in the first transmission direction, the first adjacent node is the node before the target node. Sending the processing await data to the neighboring node of the target node is: The received first processing await data is stored in first pre-stored data for storing data to be transmitted in the first transmission direction, If the first time condition is met, the first processing waiting data is obtained from the first pre-stored data, and the multiple processing waiting messages included in the first processing waiting data are packaged into a data packet. Transmitting the data packet to a second neighbor node, wherein the second neighbor node is connected to the target node via the communication link, and in the first transmission direction, the second neighbor node is the node following the target node. method.

2. The pending data further includes third pending data, and acquiring the pending data further includes generating the third pending data by the target node. The method according to claim 1.

3. A method for transmitting data in a system, The method is applied to a data transmission system, the data transmission system includes a plurality of nodes, the plurality of nodes constitute a circular communication link, and the method is The acquisition of data includes, for any target node among the plurality of nodes, the target node acquiring data awaiting processing, wherein the data awaiting processing includes a message awaiting processing and a destination node identifier corresponding to the message awaiting processing. If the destination node identifier corresponding to the pending message is the same as the target node identifier, the target node will process the pending message. If the destination node identifier corresponding to the pending message differs from the identifier of the target node, the target node transmits the pending data to an adjacent node of the target node, Between the aforementioned plurality of nodes, data is transmitted along the first transmission direction via the communication link, the pending data includes the first pending data, and the pending data is acquired. Receiving the first processing await data from a first adjacent node corresponding to the target node, wherein the first adjacent node is connected to the target node via the communication link, and in the first transmission direction, the first adjacent node is the node before the target node. The communication link is a bidirectional communication link, and data is transmitted between the plurality of nodes via the communication link along a second transmission direction, the second transmission direction being opposite to the first transmission direction, and the first adjacent node being the node following the target node in the second transmission direction. method.

4. The processing await data further includes second processing await data, and acquiring the processing await data further includes receiving the second processing await data from a second neighboring node, the second neighboring node being connected to the target node via the communication link, the second neighboring node being the node following the target node in the first transmission direction, and the second neighboring node being the node preceding the target node in the second transmission direction. The method according to claim 3.

5. Sending the processing await data to the neighboring node of the target node is: The received second processing await data is stored in second pre-stored data for storing data to be transmitted in the second transmission direction, If the second time condition is met, the second processing await data is obtained from the second pre-stored data, This includes transmitting the second processing await data to the first adjacent node. The method according to claim 4.

6. The aforementioned pending data further includes third pending data, and acquiring the pending data further includes generating the third pending data by the target node. The method according to claim 3.

7. A device that transmits data in a system, The device is applied to a data transmission system, the data transmission system includes a plurality of nodes, the plurality of nodes constitute a circular communication link, and the device, with respect to any target node among the plurality of nodes, The acquisition module for the target node to acquire pending data, wherein the pending data includes a pending message and a destination node identifier corresponding to the pending message. If the destination node identifier corresponding to the pending message is the same as the target node identifier, a processing module for processing the pending message is provided. The system includes a transmission module for sending the pending data to an adjacent node of the target node if the destination node identifier corresponding to the pending message is different from the identifier of the target node. Between the plurality of nodes, data is transmitted along the first transmission direction via the communication link, and the data awaiting processing includes the first data awaiting processing. The acquisition module is configured to receive the first processing waiting data from a first adjacent node corresponding to the target node, the first adjacent node is connected to the target node via the communication link, and in the first transmission direction, the first adjacent node is the node before the target node. The aforementioned transmission module is The received first processing await data is stored in first pre-stored data for storing data to be transmitted in the first transmission direction. If the first time condition is met, the first processing waiting data is obtained from the first pre-stored data, and the multiple processing waiting messages included in the first processing waiting data are packaged into a data packet. The system is configured to transmit the data packets to a second neighbor node, the second neighbor node being connected to the target node via the communication link, and in the first transmission direction, the second neighbor node being the node following the target node. Device.

8. A device for transmitting data in a system, The device is applied to a data transmission system, the data transmission system includes a plurality of nodes, the plurality of nodes constitute a circular communication link, and the device, with respect to any target node among the plurality of nodes, The acquisition module for the target node to acquire pending data, wherein the pending data includes a pending message and a destination node identifier corresponding to the pending message. If the destination node identifier corresponding to the pending message is the same as the target node identifier, a processing module for processing the pending message is provided. The system includes a transmission module for sending the pending data to an adjacent node of the target node if the destination node identifier corresponding to the pending message is different from the identifier of the target node. Between the plurality of nodes, data is transmitted along the first transmission direction via the communication link, and the data awaiting processing includes the first data awaiting processing. The acquisition module is configured to receive the first processing waiting data from a first adjacent node corresponding to the target node, the first adjacent node is connected to the target node via the communication link, and in the first transmission direction, the first adjacent node is the node before the target node. The communication link is a bidirectional communication link, and data is transmitted between the plurality of nodes via the communication link along a second transmission direction, the second transmission direction being opposite to the first transmission direction, and the first adjacent node being the node following the target node in the second transmission direction. Device.

9. A computer-readable storage medium that stores a computer program, when executed on a computer, causing the computer to perform the method described in any one of claims 1 to 6.

10. An electronic device comprising memory and a processor, wherein executable code is stored in the memory and the processor executes the executable code, thereby realizing the method according to any one of claims 1 to 6.

Images