WO2024193483A1

WO2024193483A1 - Method and apparatus for transmitting data in system, and electronic device

Info

Publication number: WO2024193483A1
Application number: PCT/CN2024/082057
Authority: WO
Inventors: 江鑫
Original assignee: 北京有竹居网络技术有限公司
Priority date: 2023-03-17
Filing date: 2024-03-15
Publication date: 2024-09-26
Also published as: CN118677717A

Abstract

The present disclosure provides a method and apparatus for transmitting data in a system, and an electronic device. The method is applied to a data transmission system, the data transmission system comprises a plurality of nodes, and the plurality of nodes form an annular communication link. The method comprises: for any target node among the plurality of nodes, the target node acquires data to be processed, wherein the data to be processed comprises a message to be processed and an identifier of a destination node corresponding to said message; if the identifier of the destination node corresponding to said message is the same as an identifier of the target node, the target node processes said message; and if the identifier of the destination node corresponding to said message is different from the identifier of the target node, the target node transmits, to an adjacent node of the target node, the data to be processed. This implementation mode improves data transmission efficiency and reduces an error rate and a packet loss rate.

Description

Method, device and electronic device for transmitting data in system

This application claims priority to the Chinese invention patent application entitled “Method, device and electronic device for transmitting data in a system” and application number 202310264788.6, filed on March 17, 2023. The entire contents of this application are incorporated by reference into this application.

Technical Field

The present disclosure relates to the field of Internet communication technology, and in particular to a method, device and electronic device for transmitting data in a system.

Background Art

With the rapid development of Internet technology, network communication technology has become increasingly important. At present, it is necessary for nodes in a data transmission system to communicate with each other so as to realize data transmission between nodes. However, due to the complex transmission flow of data between nodes, data transmission between nodes is difficult to manage. Currently, a solution is needed to efficiently transmit data between nodes in a data transmission system.

Summary of the invention

The present disclosure provides a method, device and electronic device for transmitting data in a system.

According to a first aspect, a method for transmitting data in a system is provided, the method being applied to a data transmission system, the data transmission system comprising a plurality of nodes, and the plurality of nodes forming a ring-shaped communication link; the method comprising:

For any target node among the multiple nodes, the target node obtains data to be processed, wherein the data to be processed includes a message to be processed and a destination node identifier corresponding to the message to be processed;

If the destination node identifier corresponding to the message to be processed is the same as the identifier of the target node, the target node processes the message to be processed;

If the destination node identifier corresponding to the message to be processed is different from the identifier of the target node, the target node transmits the data to be processed to an adjacent node of the target node.

According to a second aspect, a device for transmitting data in a system is provided, wherein the device is applied to a data transmission system, wherein the data transmission system comprises a plurality of nodes, and the plurality of nodes constitute a ring-shaped communication link; Any target node, the device comprises:

An acquisition module, used to acquire data to be processed, wherein the data to be processed includes a message to be processed and a destination node identifier corresponding to the message to be processed;

A processing module, configured to process the message to be processed when the destination node identifier corresponding to the message to be processed is the same as the identifier of the target node;

The transmission module is used to transmit the data to be processed to an adjacent node of the target node when the destination node identifier corresponding to the message to be processed is different from the identifier of the target node.

According to a third aspect, a computer-readable storage medium is provided, wherein the storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of the above-mentioned first aspects is implemented.

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

It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to more clearly illustrate the technical solutions of the embodiments of this specification, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in this specification. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

FIG1 is a schematic diagram of a scenario of transmitting data in a system according to an exemplary embodiment of the present disclosure;

FIG2 is a flow chart of a method for transmitting data in a system according to an exemplary embodiment of the present disclosure;

FIG3A is a schematic diagram of a scenario of transmitting data in another system according to an exemplary embodiment of the present disclosure;

FIG3B is a schematic diagram of a scenario of transmitting data in another system according to an exemplary embodiment of the present disclosure;

FIG4 is a block diagram of a device for transmitting data in a system according to an exemplary embodiment of the present disclosure;

FIG5 is a schematic block diagram of an electronic device provided by some embodiments of the present disclosure;

FIG6 is a schematic block diagram of another electronic device provided by some embodiments of the present disclosure;

FIG. 7 is a schematic diagram of a storage medium provided by some embodiments of the present disclosure.

DETAILED DESCRIPTION

In order to enable those skilled in the art to better understand the technical solutions in this specification, the technical solutions in the embodiments of this specification will be clearly and completely described below in conjunction with the drawings in the embodiments of this specification. The examples are only part of the embodiments of this specification, not all of the embodiments. Based on the embodiments in this specification, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of this specification.

When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. Instead, they are only examples of devices and methods consistent with some aspects of the present disclosure as detailed in the attached claims.

The terms used in this disclosure are only for the purpose of describing specific embodiments and are not intended to limit the disclosure. The singular forms of "a", "the" and "the" used in this disclosure are also intended to include plural forms unless the context clearly indicates other meanings. It should also be understood that the term "and/or" used herein refers to and includes any or all possible combinations of one or more associated listed items.

It should be understood that although the terms first, second, third, etc. may be used in the present disclosure to describe various information, such information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of the present disclosure, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the word "if" as used herein may be interpreted as "at the time of" or "when" or "in response to determining".

With the rapid development of Internet technology, network communication technology has become increasingly important. At present, the computer room routes in the data transmission system are usually configured by region, so that the computer rooms can communicate through the routes, thereby realizing data transmission between computer rooms. However, due to the complex transmission flow of data between computer rooms, data transmission between computer rooms is difficult to manage. In addition, when the computer room transmits data, it is necessary to first find and obtain the address of the destination computer room of the data to be transmitted, and then determine the transmission path of the data to be transmitted, and finally transmit the data according to the transmission path. Therefore, only the data with the same path is transmitted each time, the data transmission efficiency is low, and the error rate and packet loss rate are high.

The present disclosure provides a method for transmitting data in a system, which forms a ring-shaped communication link composed of multiple nodes by organizing at least one computer room in the data transmission system into a node. For any node, the data to be processed including the message to be processed and its destination node identifier is obtained. If the destination node of the message to be processed is the node, the message is directly processed. If the destination node of the message to be processed is not the node, the data to be processed is sent to the adjacent node connected to the node, so that each message to be processed is transmitted to the destination node corresponding to the message to be processed through the communication link. Since the transmission flow of data between nodes is simple, the data transmission between nodes is easy to manage. In addition, when a node transmits data, it is not necessary to determine the transmission path of the data to be transmitted, and the data only needs to be transmitted according to the ring link. Data with different destination nodes can be transmitted at the same time, which improves the data transmission efficiency and reduces the error rate and packet loss rate.

Referring to Fig. 1 , it is a schematic diagram showing a scenario of transmitting data in a system according to an exemplary embodiment.

As shown in FIG1 , the system may include, for example, 8 nodes, node 1 to node 8. Each node may correspond to at least one A computer room, each of which may include one or more devices, servers or equipment clusters with computing and processing capabilities. It is understood that although FIG. 1 shows that the system includes 8 nodes, the embodiments of this specification are not limited thereto, but may include other numbers of nodes. The 8 nodes constitute a ring-shaped communication link, and each node is connected to the other two nodes through the communication link, and the communication link may be unidirectional or bidirectional.

If the communication link is unidirectional, the specific data transmission process is illustrated below by taking node 1 as an example. Specifically, node 1 performs data transmission once every period T. For example, at time T0 when a period expires, node 1 checks whether there is a message to be transmitted from the pre-stored data. If there is no message to be transmitted, it waits for time T1 when the next period expires. If there is a message to be transmitted, at least one message to be transmitted can be obtained from the pre-stored data, and the message to be transmitted can be packaged into data packet a and sent to node 2.

During the period from time T0 to time T1 when the next cycle expires, on the one hand, node 1 receives data packet b sent by node 8, and can obtain multiple messages included in data packet b and information about the destination node corresponding to each message (such as the identifier of the destination node). For example, the multiple 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 saves message b2 as a message to be transmitted. On the other hand, node 1 generates message c1, and the destination node corresponding to message c1 is node 4. After generating message c1, node 1 can directly save message c1 as a message to be transmitted.

At time T1 when the cycle expires, node 1 can obtain the message b2 and message c1 to be transmitted from the pre-stored data, and package the message b2 and message c1 into a data packet c, which includes the message b2 and the message c1, as well as the information of the destination node node 3 corresponding to the message b2 and the information of the destination node node 4 corresponding to the message c1. Then, node 1 sends the data packet c to node 2. Thereafter, every other cycle, if there is data to be transmitted in node 1, the data is transmitted to node 2 once. Similarly, other nodes also perform data transmission periodically in this way. Therefore, message b2 is transmitted to node 3 via node 2, and message c1 is transmitted to node 4 via node 2 and node 3. It should be noted that the data transmission cycle of each node can be the same or different.

If the communication link is bidirectional, taking node 1 as an example, node 1 still performs data transmission every period T. Node 1 stores messages to be transmitted in two transmission directions. Messages to be transmitted in the direction of node 2 can be stored in message group 1 to be transmitted, and messages to be transmitted in the direction of node 8 can be stored in message group 2 to be transmitted. At time T0 when the period expires, node 1 checks whether there is a message to be transmitted to node 2 from the pre-stored message group 1 to be transmitted, and checks whether there is a message to be transmitted to node 8 from the pre-stored message group 2 to be transmitted. If neither exists, wait for time T1 when the next period expires.

During the period from time T0 to time T1 when the next cycle expires, on the one hand, node 1 receives data packet b sent by node 8, obtains message b1 and message b2 included in data packet b, and information about node 1 (the destination node corresponding to message b1) and node 3 (the destination node corresponding to message b2). After node 1 determines the destination nodes corresponding to message b1 and message b2, it processes message b1 and stores message b2 in message group 1 to be transmitted. On the other hand, node 1 receives data packet d sent by node 2, obtains message d1 included in data packet d, and information about node 6 (the destination node corresponding to message d1). Node 1 determines the destination node corresponding to message d1. After that, the message d1 is stored in the message group 2 to be transmitted. On the other hand, 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 message group 1 to be transmitted and the message group 2 to be transmitted.

At time T1 when the cycle expires, node 1 can obtain the to-be-transmitted messages b2 and c1 from the pre-stored to-be-transmitted message group 1, and package the messages b2 and c1 into a data packet c. Then, node 1 sends data packet c to node 2. At the same time, node 1 can also obtain the to-be-transmitted messages d1 and c1 from the pre-stored to-be-transmitted message group 2, and package the messages d1 and c1 into a data packet e. Then, node 1 sends data packet e to node 8. Similarly, other nodes also perform periodic data transmission in this way. Therefore, message b2 is transmitted to node 3 via node 2, and message d1 is transmitted to node 6 via node 8 and node 7. It should be noted that if message c1 is first transmitted to node 4 via node 2 and node 3, then when message c1 in another transmission direction is transmitted to node 4 via node 8-node 5, node 4 can directly ignore message c1. If the link between node 2 and node 3 fails and is disconnected, message c1 cannot be transmitted to node 4 via node 2 and node 3, but can be transmitted to node 4 via node 8-node 5 in another transmission direction. Therefore, this embodiment can reduce the data loss rate to a greater extent.

The present disclosure will be described in detail below in conjunction with specific embodiments.

FIG2 is a flow chart of a method for transmitting data in a system according to an exemplary embodiment. The method is applied to a data transmission system, which may include multiple nodes, which form a ring-shaped 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 multiple nodes, and the method may include the following steps:

As shown in FIG. 2 , in step 201 , the target node obtains data to be processed, and in step 202 , if the destination node identifier corresponding to the message to be processed is the same as the identifier of the target node, the target node processes the message to be processed.

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 along a first transmission direction between multiple nodes through the communication link. In the first transmission direction, the first adjacent node may be the previous node of the target node, and the second adjacent node may be the next node of the target node. That is, the first adjacent node transmits data unidirectionally to the target node, and the target node transmits data unidirectionally to the second adjacent node. For example, as shown in FIG3A, 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 the previous node m that transmits data to the target node, and the second adjacent node of the target node is the next node n that receives data transmitted by the target node.

In another implementation, the communication link is a bidirectional communication link, and data can be transmitted between multiple nodes along a first transmission direction and a second transmission direction respectively through the communication link, and the first transmission direction and the second transmission direction are opposite. In the first transmission direction, the first adjacent node can be the previous node of the target node, and the second adjacent node can be the next node of the target node. That is, the first adjacent node transmits data to the target node, and the target node transmits data to the second adjacent node. In the second transmission direction, the second adjacent node can be the previous node of the target node, and the first adjacent node can be the next node of the target node. That is, the second adjacent node transmits data to the target node, and the target node transmits data to the first adjacent node. For example, as shown in FIG3B , direction x is the first transmission direction, direction y is the second transmission direction, and nodes transmit data along direction x and direction y, respectively. In direction x, the first adjacent node of the target node is the previous node m that transmits data to the target node, and the second adjacent node of the target node is the next node n that receives data transmitted by the target node. In direction y, the second adjacent node of the target node is the previous node n that transmits data to the target node, and the first adjacent node of the target node is the next node m that receives data transmitted by the target node.

In this embodiment, the data to be processed may include a message to be processed and a destination node identifier corresponding to the message to be processed. Specifically, in one implementation, if the communication link is a unidirectional communication link, the target node may receive the first data to be processed from the first adjacent node. Then, the target node may determine the destination node identifier corresponding to the first message to be processed included in the first data to be processed. If the destination node identifier corresponding to the first message to be processed is the same as the identifier of the target node, the target node processes the first message to be processed.

In another implementation, if the communication link is a bidirectional communication link, on the one hand, the target node can receive the first data to be processed transmitted along the first transmission direction from the first adjacent node, and determine the destination node identifier corresponding to the first message to be processed included in the first data to be processed. If the destination node identifier corresponding to the first message to be processed is the same as the identifier of the target node, the target node processes the first message to be processed. On the other hand, the target node can also receive the second data to be processed transmitted along the second transmission direction from the second adjacent node, and determine the destination node identifier corresponding to the second message to be processed included in the second data to be processed. If the destination node identifier corresponding to the second message to be processed is the same as the identifier of the target node, the target node processes the second message to be processed.

In step 203, if the destination node identifier corresponding to the message to be processed is different from the identifier of the target node, the target node transmits the data to be processed to the neighboring node of the target node.

In one implementation, if the communication link is a unidirectional communication link, the target node receives the first data to be processed from the first adjacent node, and determines the destination node identifier corresponding to the first message to be processed included in the first data to be processed. If the destination node identifier corresponding to the first message to be processed is different from the identifier of the target node, the target node can store the received first data to be processed in the first pre-stored data, and the first pre-stored data is used to store data transmitted in the first transmission direction. When the first time condition is met (for example, when the preset period expires), part or all of the data stored in the preset time period can be obtained from the first pre-stored data as the target data to be transmitted, and the target data includes the first data to be processed. Then, the target node can generate a first data packet carrying the first data to be processed based on the target data, and transmit the first data packet to the second adjacent node.

In another implementation, if the communication link is a bidirectional communication link, on the one hand, the target node receives the first data to be processed transmitted along the first transmission direction from the first adjacent node, and determines the destination node identifier corresponding to the first message to be processed included in the first data to be processed. If the destination node identifier corresponding to the first message to be processed is different from the identifier of the target node, the target node stores the received first data to be processed in the first pre-stored data. When the first time condition is met, the target data can be obtained from the first pre-stored data, and a first data packet carrying the first data to be processed is generated based on the target data. and transmits the first data packet to the second adjacent node. On the other hand, the target node receives the second data to be processed transmitted along the second transmission direction from the second adjacent node, and determines the destination node identifier corresponding to the second message to be processed included in the second data to be processed. If the destination node identifier corresponding to the second message to be processed is different from the identifier of the target node, the target node stores the received second data to be processed in the second pre-stored data, and the second pre-stored data is used to store data transmitted in the second transmission direction. When the second time condition is met, the target data can be obtained from the second pre-stored data, and a second data packet carrying the second data to be processed is generated based on the target data, and the second data packet is transmitted to the first adjacent node.

It should be noted that the target data may include at least one message to be processed, each message to be processed corresponds to a source node and a destination node, and any message to be processed is generated by its corresponding source node and needs to be transmitted to its corresponding destination node for processing. If there are multiple messages to be processed, the source nodes and destination nodes corresponding to different messages to be processed may be the same or different. Among them, 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.

It should be noted that the target node can generate a message as a third message to be processed. The target node can use the generated third message to be processed and the target node identifier corresponding to the third message to be processed as third data to be processed, and store the third data to be processed in the first pre-stored data and the second pre-stored data.

The present disclosure provides a method for transmitting data in a system, which forms a ring-shaped communication link composed of multiple nodes by organizing at least one computer room in the data transmission system into a node. For any node, the data to be processed including the message to be processed and its destination node identifier is obtained. If the destination node of the message to be processed is the node, the message is directly processed. If the destination node of the message to be processed is not the node, the data to be processed is sent to the adjacent node connected to the node, so that each message to be processed is transmitted to the destination node corresponding to the message to be processed through the communication link. Since the transmission flow of data between nodes is simple, the data transmission between nodes is easy to manage. In addition, when a node transmits data, it is not necessary to determine the transmission path of the data to be transmitted, and the data only needs to be transmitted according to the ring link. The data transmission efficiency is improved and the error rate and packet loss rate are reduced.

It should be noted that although the operations of the method of the disclosed embodiment are described in a specific order in the above embodiments, this does not require or imply that the operations must be performed in this specific order, or that all the operations shown must be performed to achieve the desired results. On the contrary, the steps depicted in the flowchart can change the order of execution. Additionally or alternatively, some steps can be omitted, multiple steps can be combined into one step for execution, and/or one step can be decomposed into multiple steps for execution.

The embodiment of the present disclosure provides a method and device for transmitting data in a system, which forms a ring-shaped communication link composed of multiple nodes by organizing at least one computer room in the data transmission system into a node. For any node, the data to be processed including the message to be processed and its destination node identifier is obtained. If the destination node of the message to be processed is the node, the message is directly processed. If the destination node of the message to be processed is not the node, the message is sent to the corresponding node connected to the node. The neighboring node sends the data to be processed, so that each message to be processed is transmitted to the destination node corresponding to the message to be processed through the communication link. Since the data transmission flow between nodes is simple, the data transmission between nodes is easy to manage. In addition, when a node transmits data, it does not need to determine the transmission path of the data to be transmitted, but only needs to transmit the data according to the ring link. This improves the data transmission efficiency and reduces the error rate and packet loss rate.

Corresponding to the aforementioned method embodiment for transmitting data in the system, the present disclosure also provides an embodiment of an apparatus for transmitting data in the system.

As shown in Figure 4, Figure 4 is a block diagram of a device for transmitting data in a system shown in the present disclosure according to an exemplary embodiment. The device is applied to a data transmission system. The data transmission system includes multiple nodes, and the multiple nodes form a ring-shaped communication link. The device is deployed at any target node among the multiple nodes. The device may include: an acquisition module 401, a processing module 402 and a transmission module 403.

The acquisition module 401 is used to acquire data to be processed, wherein the data to be processed includes a message to be processed and a destination node identifier corresponding to the message to be processed.

The processing module 402 is used to process the message to be processed when the destination node identifier corresponding to the message to be processed is the same as the identifier of the target node.

The transmission module 403 is used to transmit the data to be processed to an adjacent node of the target node when the destination node identifier corresponding to the message to be processed is different from the identifier of the target node.

In some embodiments, data is transmitted between multiple nodes along a first transmission direction via a communication link, and the data to be processed includes first data to be processed. The acquisition module 401 is configured to: receive the first data to be processed from a first adjacent node corresponding to the target node, the first adjacent node is connected to the target node via a communication link, and in the first transmission direction, the first adjacent node is the previous node of the target node.

In other embodiments, the transmission module 403 is configured to: store the received first data to be processed into the first pre-stored data, the first pre-stored data is used to store the data transmitted in the first transmission direction, and when the first time condition is met, obtain the first data to be processed from the first pre-stored data, and transmit the first data to be processed to the second adjacent node. The second adjacent node is connected to the target node via a communication link, and in the first transmission direction, the second adjacent node is the next node of the target node.

In other embodiments, the communication link is a bidirectional communication link, and data is also transmitted between the multiple nodes through the communication link along a second transmission direction, the second transmission direction being opposite to the first transmission direction, wherein the first adjacent node is the next node of the target node in the second transmission direction.

In some other embodiments, the data to be processed also includes second data to be processed. The acquisition module 401 is further configured to: receive the second data to be processed from a second adjacent node, the second adjacent node is connected to the target node via the communication link, and in the first transmission direction, the second adjacent node is the next node of the target node. In the second transmission direction, the second adjacent node is the previous node of the target node.

In some other embodiments, the transmission module 403 is configured to: store the received second data to be processed into second pre-stored data, the second pre-stored data is used to store data transmitted in the second transmission direction. When the second time condition is met, the second data to be processed is obtained from the second pre-stored data, and the second data to be processed is transmitted to the first adjacent node.

In some other implementations, the data to be processed further includes third data to be processed, wherein the acquisition module 401 is further configured to: generate the third data to be processed by the target node.

For the device embodiment, since it basically corresponds to the method embodiment, the relevant parts can refer to the partial description of the method embodiment. The device embodiment described above is only schematic, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the embodiment scheme of the present disclosure. A person of ordinary skill in the art can understand and implement it without paying creative labor.

FIG5 is a schematic block diagram of an electronic device provided in some embodiments of the present disclosure. As shown in FIG5 , the electronic device 910 includes a processor 911 and a memory 912, which can be used to implement a client or a server. The memory 912 is used to store computer executable instructions (e.g., one or more computer program modules) non-transiently. The processor 911 is used to run the computer executable instructions, and when the computer executable instructions are run by the processor 911, one or more steps in the method for transmitting data in the system described above can be executed, thereby implementing the method for transmitting data in the system described above. The memory 912 and the processor 911 can be interconnected via a bus system and/or other forms of connection mechanisms (not shown).

For example, the processor 911 may be a central processing unit (CPU), a graphics processing unit (GPU), or other forms of processing units 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 dedicated processor, and may control other components in the electronic device 910 to perform desired functions.

For example, the memory 912 may include any combination of one or more computer program products, and the computer program product 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), etc. 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 on the computer-readable storage medium, and the processor 911 may run one or more computer program modules to implement various functions of the electronic device 910. Various applications and various data, as well as various data used and/or generated by the application, etc. may also be stored in the computer-readable storage medium.

It should be noted that, in the embodiment of the present disclosure, the specific functions and technical effects of the electronic device 910 can refer to the above description of the method for transmitting data in the system, which will not be repeated here.

FIG6 is a schematic block diagram of another electronic device provided in some embodiments of the present disclosure. The electronic device 920 is suitable for implementing the method for transmitting data in the system provided in the embodiment of the present disclosure, for example. The electronic device 920 may be a terminal device, etc., and may be used to implement a client or a server. The electronic device 920 may include, but is not limited to, mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), wearable electronic devices, etc., and fixed terminals such as digital TVs, desktop computers, smart home devices, etc. It should be noted that the electronic device 920 shown in FIG6 is only an example, which does not impose any restrictions on the functions and scope of use of the embodiments of the present disclosure.

As shown in FIG6 , the electronic device 920 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 921, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 922 or a program loaded from a storage device 928 to a random access memory (RAM) 923. In the RAM 923, various programs and data required for the operation of the electronic device 920 are also stored. The processing device 921, the ROM 922, and the RAM 923 are connected to each other via a bus 924. An input/output (I/O) interface 925 is also connected to the bus 924.

Typically, the following devices may be connected to the I/O interface 925: input devices 926 including, for example, a touch screen, a touchpad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; output devices 927 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 928 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 929. The communication devices 929 may allow the electronic device 920 to communicate with other electronic devices wirelessly or by wire to exchange data. Although FIG. 6 shows an electronic device 920 having various devices, it should be understood that it is not required to implement or have all of the devices shown, and the electronic device 920 may alternatively implement or have more or fewer devices.

For example, according to an embodiment of the present disclosure, the method for transmitting data in the above-mentioned system can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program includes a program code for executing the method for transmitting data in the above-mentioned system. In such an embodiment, the computer program can be downloaded and installed from the network through the communication device 929, or installed from the storage device 928, or installed from the ROM 922. When the computer program is executed by the processing device 921, the functions defined in the method for transmitting data in the system provided by the embodiment of the present disclosure can be implemented.

FIG7 is a schematic diagram of a storage medium provided by some embodiments of the present disclosure. For example, as shown in FIG7, the storage medium 930 may be a non-transitory computer-readable storage medium for storing a non-transitory computer-executable instruction 931. When the non-transitory computer-executable instruction 931 is executed by a processor, the method for transmitting data in the system described in the embodiment of the present disclosure may be implemented. For example, when the non-transitory computer-executable instruction 931 is executed by a processor, one or more steps in the method for transmitting data in the system described above may be executed.

For example, the storage medium 930 may be applied to the above-mentioned electronic device. For example, the storage medium 930 may include a memory in the electronic device.

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

For example, the description of the storage medium 930 can refer to the description of the memory in the embodiment of the electronic device, and the repeated parts are not repeated. The specific functions and technical effects of the storage medium 930 can refer to the description of the method for transmitting data in the system above, and are not repeated here.

It should be noted that in the context of the present disclosure, a computer-readable medium may be a tangible medium that may contain or store a program for use by an instruction execution system, device or equipment or used in combination with an instruction execution system, device or equipment. A computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. A computer-readable storage medium may be, for example, but not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer 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 or stores a program that may be used by an instruction execution system, device or device or used in combination with it. In the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, device, or device. The program code contained on the computer-readable medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. The present disclosure is intended to cover any variations, uses or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The description and examples are to be considered exemplary only, and the true scope and spirit of the present disclosure are indicated by the claims.

It should be understood that the present disclosure is not limited to the exact structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims

A method for transmitting data in a system, the method being applied to a data transmission system, the data transmission system comprising a plurality of nodes, and the plurality of nodes forming a ring-shaped communication link; the method comprising:

For any target node among the multiple nodes, the target node obtains data to be processed, wherein the data to be processed includes a message to be processed and a destination node identifier corresponding to the message to be processed;

If the destination node identifier corresponding to the message to be processed is the same as the identifier of the target node, the target node processes the message to be processed;

If the destination node identifier corresponding to the message to be processed is different from the identifier of the target node, the target node transmits the data to be processed to an adjacent node of the target node.
According to the method of claim 1, data is transmitted between the plurality of nodes through the communication link along a first transmission direction; the data to be processed includes first data to be processed; wherein obtaining the data to be processed includes:

The first to-be-processed data is received 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 previous node of the target node.
The method according to claim 2, wherein the transmitting the to-be-processed data to a neighboring node of the target node comprises:

storing the received first data to be processed into the first pre-stored data; the first pre-stored data is used to store data transmitted in the first transmission direction;

When a first time condition is met, obtaining the first data to be processed from the first pre-stored data;

The first data to be processed is transmitted to a second adjacent node; the second adjacent node is connected to the target node via the communication link, and in the first transmission direction, the second adjacent node is the next node of the target node.
The method according to claim 2, wherein the communication link is a bidirectional communication link; data is also transmitted along a second transmission direction between the multiple nodes through the communication link; the second transmission direction is opposite to the first transmission direction; wherein the first adjacent node is the next node of the target node in the second transmission direction.
According to the method of claim 4, wherein the data to be processed also includes second data to be processed; wherein the obtaining of the data to be processed also includes: receiving the second data to be processed from a second adjacent node; the second adjacent node is connected to the target node through the communication link; in the first transmission direction, the second adjacent node is the next node of the target node; in the second transmission direction, the second adjacent node is the previous node of the target node.
The method according to claim 5, wherein the step of transmitting the to-be-processed data to the target node comprises: Neighboring nodes include:

storing the received second data to be processed into the second pre-stored data; the second pre-stored data is used to store data transmitted in the second transmission direction;

When a second time condition is met, acquiring the second data to be processed from the second pre-stored data;

Transmit the second to-be-processed data to the first neighboring node.
The method according to claim 2, wherein the data to be processed also includes third data to be processed; wherein obtaining the data to be processed further includes: generating the third data to be processed by the target node.
A device for transmitting data in a system, the device being applied to a data transmission system, the data transmission system comprising a plurality of nodes, and the plurality of nodes forming a ring-shaped communication link; for any target node among the plurality of nodes, the device comprises:

An acquisition module, used to acquire data to be processed, wherein the data to be processed includes a message to be processed and a destination node identifier corresponding to the message to be processed;

A processing module, configured to process the message to be processed when the destination node identifier corresponding to the message to be processed is the same as the identifier of the target node;

The transmission module is used to transmit the data to be processed to an adjacent node of the target node when the destination node identifier corresponding to the message to be processed is different from the identifier of the target node.
A computer-readable storage medium having a computer program stored thereon, which, when executed in a computer, causes the computer to execute the method according to any one of claims 1 to 7.
An electronic device comprises a memory and a processor, wherein the memory stores executable code, and when the processor executes the executable code, the method according to any one of claims 1 to 7 is implemented.