Method, device and electronic device 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 Application) This application claims priority from a Chinese invention patent application entitled "Method, Apparatus and Electronic Device for Transmitting Data in a System" filed on March 17, 2023, with application number 202310264788.6, the entire contents of which are incorporated herein by reference.

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

[0003] With the rapid development of Internet technology, network communication technology is becoming increasingly important. Currently, communication between nodes in a data transmission system is required, and data transmission between nodes is realized. However, the data transmission stream between nodes is complex, making it 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 problem]

[0004] The present disclosure provides a method, apparatus and electronic device for data transmission in a system. According to a first aspect, there is provided a method for transmitting data in a system, the method being applied to a data transmission system, the data transmission system including a plurality of nodes, the plurality of nodes forming a ring-shaped communication link, the method comprising: For a target node among the plurality of nodes, the target node acquires 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; If the destination node identifier corresponding to the pending message is different from the identifier of the target node, the target node transmits the pending data to a neighboring node of the target node.

[0005] According to a second aspect, there is provided an apparatus for transmitting data in a system, the apparatus being applicable to a data transmission system including a plurality of nodes, the plurality of nodes forming a ring communication link, and the apparatus for transmitting data to a target node among the plurality of nodes is configured to: a capture module for the target node to capture pending data, the pending data including a pending message and a destination node identifier corresponding to the pending message; a processing module for processing the pending message if the destination node identifier corresponding to the pending message is the same as the identifier of the target node; and a sending module for sending the pending data to a neighboring node of the target node if the destination node identifier corresponding to the pending message is different from the identifier of the target node.

[0006] According to a third aspect, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, realises the method according to any one of the first aspects above.

[0007] According to a fourth aspect, there is provided an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, the computer program implementing the method of any one of the first aspect when the processor executes the program.

[0008] It should be noted that the above general and detailed descriptions are merely illustrative and are not intended to limit the present disclosure. [Brief explanation of the drawings]

[0009] In order to more clearly describe the technical solutions of the embodiments in this specification, the following briefly introduces the drawings required in the description of the embodiments. Obviously, the drawings in the following description are only some embodiments described in this specification, and those skilled in the art can also obtain other drawings based on these drawings without any creative labor.

[0010] [Figure 1] FIG. 2 is a schematic diagram of a data transmission scenario in a system according to an exemplary embodiment of the present disclosure. [Figure 2] 1 is a flowchart of a method for transmitting data in a system according to an exemplary embodiment of the present disclosure. [Figure 3A] FIG. 10 is a schematic diagram of a data transmission scenario in another system according to an exemplary embodiment of the present disclosure. [Figure 3B] FIG. 10 is a schematic diagram of a data transmission scenario in another system according to an exemplary embodiment of the present disclosure. [Figure 4] FIG. 2 is a block diagram of an apparatus for data transmission in a system according to an exemplary embodiment of the present disclosure. [Figure 5] FIG. 1 is a schematic block diagram of an electronic device according to some embodiments of the present disclosure. [Figure 6] FIG. 1 is a schematic block diagram of another electronic device according to some embodiments of the present disclosure. [Figure 7] FIG. 1 is a schematic diagram of a storage medium according to some embodiments of the present disclosure. DETAILED DESCRIPTION OF THE INVENTION

[0011] In order to better understand the technical solutions in the present specification, the technical solutions in the embodiments of the present specification will be described below clearly and completely with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only some embodiments of the present specification, and not all embodiments. Based on the examples in the present specification, all other examples obtained by those skilled in the art without creative efforts shall fall within the protection scope of the present specification.

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

[0013] The terms used in this disclosure are merely for the purpose of describing particular embodiments and are not intended to limit the disclosure. As used in this disclosure, the singular forms "a," "the," and "the" are also intended to include the plural forms unless the context clearly indicates otherwise. As used herein, the term "and / or" means to include any and all possible combinations of one or more of the associated listed items.

[0014] In this disclosure, the terms first, second, and third may be used to describe various pieces of information, but it should be understood that such information is not limited to these terms. These terms are used only to distinguish between the same types of information. For example, first information may be referred to as second information, and similarly, second information may be referred to as first information, without departing from the scope of this disclosure. Depending on the context, the word "if" as used herein may be interpreted as "when" or "when" 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 configuring routing for machine rooms in a data transmission system for each region and communicating between machine rooms through routing. However, data transmission between machine rooms is complex and difficult to manage. Furthermore, when a machine room sends data, it first searches for and obtains the address of the destination machine room for the target data, then determines the transmission path for the target data, and finally transmits the data according to the transmission path. Therefore, each time data is sent along the same path, data transmission efficiency is low and error rates and packet loss rates are high.

[0016] A data transmission method in a system according to the present disclosure involves forming a ring-shaped communication link consisting of multiple nodes, with at least one machine room in the data transmission system serving as a 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 the node, the node processes the message directly. If the destination node of the pending message is not the node, the node transmits the pending data to an adjacent node connected to the node. Each pending message is then transmitted to the corresponding destination node via the communication link. The simple data transmission stream between nodes makes data transmission between nodes easy to manage. Furthermore, when a node transmits data, it does not need to determine a transmission path for the pending data; it simply transmits the data via the ring link. Data from different destination nodes can be transmitted simultaneously, improving data transmission efficiency and reducing error and packet loss rates.

[0017] FIG. 1 is a schematic diagram of a data transmission scenario in a system according to an exemplary embodiment. As shown in FIG. 1, the system may include, for example, a total of eight nodes, Node 1 through 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 or processing capabilities. While FIG. 1 shows the system including eight nodes, embodiments herein are not limited thereto and 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, which may be unidirectional or bidirectional.

[0018] This communication link is unidirectional, and the specific data transmission process will be described below using node 1 as an example. Specifically, node 1 transmits data once per period T. For example, at time T0 when one period expires, node 1 checks whether there are any messages waiting to be transmitted from pre-stored data, and if there are no messages waiting to be transmitted, it waits for time T1 when the next period expires. If there are any messages to be transmitted, node 1 retrieves at least one message to be transmitted from pre-stored data, packages the message to be transmitted into packet a, and then transmits it to node 2.

[0019] Between time T0 and time T1 when the next period expires, node 1 receives data packet b transmitted from node 8 and obtains multiple messages contained in data packet b and information on the destination nodes corresponding to each message (e.g., the identifiers of the destination nodes). For example, the multiple messages may include message b1 and message b2, and the destination node corresponding to message b1 is node 1, and the destination node corresponding to message b2 is node 3. After determining the destination nodes corresponding to message b1 and message b2, node 1 processes message b1 and stores message b2 as a message waiting to be sent. Meanwhile, 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 T1 when the period expires, node 1 retrieves message b2 and message c1 waiting to be sent from pre-stored data, packages message b2 and message c1 into packet c, and data packet c contains 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. Node 1 then transmits packet c to node 2. After that, if node 1 has data waiting to be sent every period, it transmits the data to node 2. Similarly, other nodes also transmit data periodically in this manner. Therefore, message b2 is transmitted to node 3 via node 2, and message c1 is transmitted to node 4 via nodes 2 and 3. Note that the periods in which each node transmits 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 cycle T. Node 1 stores messages waiting to be sent for two transmission directions, and can store messages sent in the direction of node 2 in message waiting group 1, and messages sent in the direction of node 8 in message waiting group 2. At time T0 when the cycle expires, node 1 checks whether there are any messages waiting to be sent in the direction of node 2 from pre-stored message waiting group 1, and whether there are any messages waiting to be sent in the direction of node 8 from message waiting group 2. If neither exists, it waits for time T1 when the next cycle expires.

[0022] During the period from time T0 to time T1 when the next period expires, node 1 receives data packet b transmitted from node 8 and obtains message b1 and message 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 message b1 and message b2, node 1 processes message b1 and stores message b2 in the transmission waiting message group 1. Meanwhile, node 1 receives data packet d transmitted from node 2 and obtains information about message d1 contained in data packet d and 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 transmission target message group 2. In yet another aspect, node 1 generates message c1, and the destination node corresponding to message c1 is node 4. After generating message c1, node 1 can store message c1 in the transmission target message group 1 and the transmission target message group 2.

[0023] At time T1 when the period expires, node 1 may retrieve message b2 and message c1 waiting to be sent from pre-stored message group 1 and package message b2 and message c1 into packet c. Then, node 1 transmits packet c to node 2. At the same time, node 1 may retrieve message d1 and message c1 waiting to be sent from pre-stored message group 2 and package message d1 and message c1 into packet e. Then, node 1 transmits packet e to node 8. Similarly, other nodes also periodically transmit data in this manner. Therefore, message b2 is transmitted to node 3 via node 2, and message d1 is transmitted to node 6 via nodes 8 and 7. Note that if message c1 is first transmitted to node 4 via nodes 2 and 3, and message c1 in the other transmission direction is transmitted 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 cut off, message c1 will not be sent to node 4 via node 2 and node 3, but may be sent to node 4 via nodes 8 to 5 in another transmission direction. Therefore, according to this embodiment, the data loss rate can be further reduced.

[0024] The present disclosure will now be described in detail with reference to specific examples. 2 is a flowchart of a method for data transmission in a system according to an exemplary embodiment. The method is applied to a data transmission system, which may include a plurality of nodes forming a circular communication link, and the communication link may be a unidirectional communication link or a 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 FIG. 2, in step 201, the target node obtains the pending data, and in step 202, 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.

[0026] In this embodiment, the target node may be adjacent to two nodes, and the two adjacent nodes of 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 in a first transmission direction via the communication link. In the first transmission direction, the first adjacent node may be the node preceding the target node, and the second adjacent node may be the node following 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 FIG. 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 preceding the node m that transmits data to the target node, and the second adjacent node of the target node is node n following the node n that receives 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 in a first transmission direction and a second transmission direction, respectively, via the communication link, where the first transmission direction and the second transmission direction are reversed. In the first transmission direction, the first neighboring node can be the node preceding the target node, and the second neighboring node can be the node following the target node. That is, the first neighboring node transmits data to the target node, and the target node transmits data to the second neighboring node. In the second transmission direction, the second neighboring node can be the node preceding the target node, and the first neighboring node can be the node following the target node. That is, the second neighboring node transmits data to the target node, and the target node transmits data to the first neighboring node. For example, as shown in FIG. 3B, direction x is the first transmission direction, and direction y is the second transmission direction, and data is transmitted between nodes in directions x and y, respectively. In direction x, the first neighboring node of the target node is node m preceding the node that transmits data to the target node, and node n following the node that receives data transmitted to the target node. In the direction y, the second adjacent node of the target node is the previous node n that sends data to the target node, and the first adjacent 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, when the communication link is a unidirectional communication link, the target node may receive first pending data from a first neighboring node. The target node may then determine a 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, when the communication link is a bidirectional communication link, the target node may receive first pending data transmitted from a first adjacent node in a first transmission direction and determine a 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. Meanwhile, the target node may receive second pending data transmitted from a second adjacent node in a second transmission direction and determine a destination node identifier corresponding to the second pending message included 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 identifier of the target node, the target node transmits the pending data to a neighboring node of the target node.

[0031] In one implementation, when the communication link is a unidirectional communication link, the target node receives first pending data from a first adjacent node and determines a destination node identifier corresponding to a first pending message included in the first pending data. If the destination node identifier corresponding to the first pending message is different from the identifier of the target node, the target node may store the received first pending data in first pre-stored data, and the first pre-stored data is used to store data to be transmitted in the first transmission direction. If a first time condition is met (e.g., if a predetermined period expires), some or all of the data stored within a predetermined period may be retrieved from the first pre-stored data as target data of the transmission target, and the target data includes the first pending data. The target node may then generate a first data packet carrying the first pending data based on the target data and transmit the first data packet to the second adjacent node.

[0032] In another implementation, when the communication link is a bidirectional communication link, the target node receives first pending data transmitted from a first adjacent node in a first transmission direction and determines a 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 different from the identifier of the target node, the target node stores the received first pending data in first pre-stored data. If the first time condition is satisfied, the target node obtains target data from the first pre-stored data, generates a first data packet carrying the first pending data based on the target data, and transmits the first data packet to the second adjacent node. Meanwhile, the target node receives second pending data transmitted from a second adjacent node in a second transmission direction and determines a destination node identifier corresponding to the second pending message included in the second pending data. If the destination node identifier corresponding to the second pending message is different from the identifier of the target node, the target node stores the received second pending data in second pre-stored data, and the second pre-stored data is configured to store data transmitted in the second transmission direction. If a second time condition is met, the node can obtain target data from the second pre-stored data, generate a second data packet carrying second data to be processed based on the target data, and send the second data packet to the first adjacent node.

[0033] The target data may include at least one message to be processed, each corresponding to a source node and a destination node, and each message to be processed is generated by the corresponding source node and sent to the corresponding destination node for processing. When there are multiple messages to be processed, the source node and destination node corresponding to different 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, and the message body may include each message to be processed. The key information header may include information on the source node and destination node corresponding to each message to be processed, as well as the generation time corresponding to each message to be processed.

[0034] In addition, the target node may generate a message as a third message waiting to be processed, and the target node may treat the generated third message waiting to be processed and the target node identifier corresponding to the third message waiting to be processed as third data waiting to be processed, and store the third data waiting to be processed in the first pre-stored data and the second pre-stored data.

[0035] A data transmission method in a system according to the present disclosure involves forming a ring-shaped communication link consisting of multiple nodes, with at least one machine room in the data transmission system as a single 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 the node, the node directly processes the message. If the destination node of the pending message is not the node, the node transmits the pending data to an adjacent node connected to the node. Each pending message is then transmitted 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 a transmission path for the pending data; it simply transmits the data via the ring link. This improves data transmission efficiency and reduces error rates and packet loss rates.

[0036] Although the above embodiments describe the operations of the methods according to the embodiments of the present disclosure in a particular order, this does not necessarily require or imply that the operations must be performed in that particular order, and all operations must be performed to achieve a desired result. However, the order of steps shown in the flowcharts may be changed. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be divided into multiple steps.

[0037] In accordance with an embodiment of the present disclosure, a method and apparatus for data transmission in a system includes forming a ring-shaped communication link consisting of multiple nodes, with at least one machine room in the data transmission system serving as a node. A node acquires pending data, including a pending message and its destination node identifier. If the destination node of the pending message is the node, the node processes the message directly. If the destination node of the pending message is not the node, the node transmits the pending data to an adjacent node connected to the node. Each pending message is then transmitted to the corresponding destination node via the communication link. The simple data transmission stream between nodes makes data transmission between nodes easy to manage. Furthermore, when a node transmits data, it does not need to determine a transmission path for the pending data; it simply transmits the data over the ring link. This improves data transmission efficiency and reduces error and packet loss rates.

[0038] Corresponding to the embodiment of the method for data transmission in the system, the present disclosure further provides an embodiment of an apparatus for data transmission in the system.

[0039] As shown in FIG. 4, FIG. 4 is a block diagram of an apparatus for data transmission in a system according to an exemplary embodiment of the present disclosure, where the apparatus is applied to a data transmission system, where the data transmission system includes a plurality of nodes, and the plurality of nodes form a ring communication link, and the apparatus is located at a target node of any of the plurality of nodes, and the apparatus may include an acquisition module 401, a processing module 402, and a transmission module 403.

[0040] The acquiring module 401 acquires pending data, where the pending data includes pending messages and destination node identifiers corresponding to the pending messages.

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

[0042] The sending module 403 sends the pending data to a neighboring node of the target node if the destination node identifier corresponding to the pending message is different from the identifier of the target node.

[0043] In some embodiments, data is transmitted between a plurality of nodes in a first transmission direction over a communication link, and the pending data includes first pending data, and the acquisition module 401 receives the first pending data from a first neighboring node corresponding to a target node, the first neighboring node being connected to the target node via the communication link, and the first neighboring node being configured to be a node preceding the target node in the first transmission direction.

[0044] In some other embodiments, the transmitting module 403 is configured to store the received first to-be-processed data in first pre-stored data, the first pre-stored data is used to store data to be transmitted in a first transmission direction, and when a first time condition is satisfied, retrieve the first to-be-processed data from the first pre-stored data and transmit the first to-be-processed data to a second adjacent node, the second adjacent node being connected to the target node via a communication link, and the second adjacent node being a next node of the target node in the first transmission direction.

[0045] In some other embodiments, the communication link is a bidirectional communication link, and data is transmitted between the plurality of nodes over the communication link along a second transmission direction, the second transmission direction being opposite to the first transmission direction, and the first neighbor node is the node next to the target node in the second transmission direction.

[0046] In some other embodiments, the pending data further includes second pending data. The acquiring module 401 is further configured to receive the second pending 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 a next node of the target node in the first transmission direction, and the second neighboring node being a previous node of the target node in the second transmission direction.

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

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

[0049] The device embodiments basically correspond to the method embodiments, so please refer to the description of some of the method embodiments for relevant parts. The device embodiments described above are merely schematic, and the means described as the separation means may or may not be physically separated, and the means displayed as means may not be physical means, i.e., may be located in one place or distributed across multiple network units. Depending on actual needs, some or all of the modules therein can be selected to achieve the objectives of the technical solutions of the embodiments of the present disclosure. Those skilled in the art can understand and implement them without any creative effort.

[0050] FIG. 5 is a schematic block diagram of an electronic device according to some embodiments of the present disclosure. As shown in FIG. 5, an 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, which, when executed by the processor 911, perform one or more steps of the method for transmitting data in the system described above to realize the method for transmitting data 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 type of connection mechanism (not shown).

[0051] For example, the processor 911 may be a central processing unit (CPU), a graphics processing unit (GPU), or other type of processing unit having data processing capabilities and / or program execution capabilities. 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 special-purpose processor and may control other components in the electronic device 910 to perform desired functions.

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

[0053] It should be noted that in the embodiment of the present disclosure, the specific functions and technical effects of the electronic device 910 can be referred to the description of the data transmission method in the above system, and the description will be omitted here.

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

[0055] 6, the electronic device 920 may include a processing unit (e.g., a central processing unit, a graphics processor, etc.) 921 that can perform various appropriate operations and processes based on programs stored in a read-only memory (ROM) 922 or programs 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, the ROM 922, and the 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 including, for example, a touchscreen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 927 including, for example, a liquid crystal display (LCD), speaker, vibrator, etc.; storage devices 928 including, for example, a magnetic tape, hard disk, etc.; and communication devices 929. The communication devices 929 may allow the electronic device 920 to communicate wirelessly or via wires with other electronic devices to exchange data. While FIG. 6 illustrates the electronic device 920 with various devices, it should be understood that it is not required to implement or include all of the illustrated devices, and the electronic device 920 may alternatively include more or fewer devices.

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

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

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

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

[0061] For example, the description of the storage medium 930 may refer to the description of the memory in the embodiment of the electronic device, and duplicated descriptions will be omitted. The specific functions and technical effects of the storage medium 930 may refer to the description of the data transmission method in the system, and descriptions thereof will be omitted here.

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

[0063] Those skilled in the art will be able to easily devise other embodiments of the present disclosure after reading the specification and practicing the invention disclosed herein. The present disclosure is intended to cover any variations, uses, or adaptations of the present disclosure, which variations, uses, or adaptations comply with the general principles of the present disclosure and include common knowledge or commonly used technical means in the art that are not disclosed in the present disclosure. The presently disclosed embodiments are to be considered in all respects as illustrative and not restrictive.

[0064] The present invention is not limited to the above-described embodiments, and various modifications can be made without departing from the spirit and scope of the present disclosure. The scope of the present disclosure is limited only by the appended claims.

Claims

1. 1. A method of transmitting data in a system, comprising: The method is applied to a data transmission system, the data transmission system including a plurality of nodes, the plurality of nodes forming a ring-shaped communication link, and the method includes: For a target node among the plurality of nodes, the target node acquires pending data, the pending data including a pending message and a destination node identifier corresponding to the pending message; If a destination node identifier corresponding to the pending message is the same as an identifier of the target node, the target node processes the pending message; If a destination node identifier corresponding to the pending message is different from an identifier of the target node, the target node transmits the pending data to a neighboring node of the target node. method.

2. transmitting data between the plurality of nodes along a first transmission direction via the communication link, the pending data including first pending data, and obtaining the pending data includes: receiving the first pending data from a first adjacent node corresponding to the target node, the first adjacent node being connected to the target node via the communication link, and the first adjacent node being a node preceding the target node in the first transmission direction; The method of claim 1.

3. transmitting the pending data to a neighboring node of the target node, storing the received first data to be processed in a first pre-stored data set for storing data to be transmitted in the first transmission direction; If a first time condition is satisfied, acquiring the first to-be-processed data from the first pre-stored data; transmitting the first pending data to a second adjacent node, the second adjacent node being connected to the target node via the communication link, and the second adjacent node being a next node of the target node in the first transmission direction. The method of claim 2.

4. the communication link is a bidirectional communication link, transmitting data between the plurality of nodes over the communication link along a second transmission direction, the second transmission direction being opposite to the first transmission direction, and the first neighboring node being a next node to the target node in the second transmission direction; The method of claim 2.

5. the waiting data further includes second waiting data, and acquiring the waiting data further includes receiving the second waiting data from a second adjacent node, the second adjacent node being connected to the target node via the communication link, the second adjacent node being a node next to the target node in the first transmission direction, and the second adjacent node being a node previous to the target node in the second transmission direction; The method of claim 4.

6. transmitting the pending data to a neighboring node of the target node, storing the received second data to be processed in second pre-stored data for storing data to be transmitted in the second transmission direction; If a second time condition is satisfied, acquiring the second to-be-processed data from the second pre-stored data; transmitting the second pending data to the first adjacent node. The method of claim 5.

7. the data to be processed further includes third data to be processed, and acquiring the data to be processed further includes generating the third data to be processed by the target node. The method of claim 2.

8. 1. A device for transmitting data in a system, comprising: The apparatus is applied to a data transmission system, the data transmission system including a plurality of nodes, the plurality of nodes configuring a ring communication link, and the apparatus performs the following for any target node among the plurality of nodes: an acquisition module for the target node to acquire pending data, the pending data including a pending message and a destination node identifier corresponding to the pending message; a processing module for processing the pending message if a destination node identifier corresponding to the pending message is the same as the identifier of the target node; a sending module for sending the pending data to a neighboring node of the target node when a destination node identifier corresponding to the pending message is different from an identifier of the target node; Device.

9. A computer-readable storage medium having stored thereon a computer program that, when executed on a computer, causes the computer to carry out the method according to any one of claims 1 to 7.

10. 8. An electronic device comprising a memory and a processor, wherein executable code is stored in said memory and wherein the electronic device implements the method of any one of claims 1 to 7 when the processor executes said executable code.

Images