Half-duplex bus network expansion method, device and electronic equipment

Abstract

The present invention relates to a network expansion method, device and electronic device for a half-duplex bus, the method comprising: parsing an original data packet and cutting it into multiple smaller data segments according to a preset segmentation rule, and assigning a unique serial number to each segmented data; dynamically selecting multiple transmission paths according to real-time network conditions, the network conditions including network bandwidth, transmission delay, packet loss rate and error rate; regularly analyzing the network topology, identifying bottleneck nodes, and optimizing network transmission performance; sequentially reorganizing the segmented data based on the unique serial number, and outputting the complete original data packet. The invention improves data transmission efficiency by dividing a large data packet into multiple small segments and adopting a multi-path transmission strategy, and can effectively solve the problems of network congestion and limited transmission of large data packets caused by single-path transmission.

Description

Technical Field

[0001] The present invention relates to the field of network expansion of a half-duplex bus, and in particular to a network expansion method, device and electronic equipment for a half-duplex bus. Background Art

[0002] With the continuous development of internet technology, data transmission has become an indispensable part of modern society. Data transmission over lines can be categorized into three modes: simplex, half-duplex, and full-duplex. In half-duplex communication, data can be transmitted in both directions, but only one direction is permitted per channel at a time. This is also known as bidirectional alternating communication. Changing the transmission direction requires a switch. Half-duplex requires both a transmitter and receiver on both ends. Due to its low cost, ease of use, and reduced transmission lines, the half-duplex bus remains in high demand. However, the frequent changes in channel direction lead to low efficiency. Single-path transmission is susceptible to network congestion and node failures. Transmission of large data packets is limited by bandwidth and prone to packet loss. Consequently, traditional transmission technologies struggle to meet the growing demand for data transmission, especially in the context of high bandwidth and low latency. Therefore, improvements are needed. Summary of the Invention

[0003] Based on this, it is necessary to provide a half-duplex bus network expansion method, device and electronic equipment to address the problems of frequent channel direction changes, low efficiency, network congestion caused by single-path transmission, and limited transmission of large data packets in the traditional half-duplex mode.

[0004] The present invention provides a half-duplex bus network expansion method, the method comprising:

[0005] Parse the original data packet and cut it into multiple smaller data segments according to the preset segmentation rules, and assign a unique serial number to each segment data;

[0006] Dynamically select multiple transmission paths based on real-time network conditions, including network bandwidth, transmission delay, packet loss rate, and error rate;

[0007] Regularly analyze network topology, identify bottleneck nodes, and optimize network transmission performance;

[0008] Based on the unique sequence number, the segmented data is reassembled in sequence and the complete original data packet is output.

[0009] In one embodiment, the parsing of the original data packet and cutting it into multiple smaller data segments according to a preset segmentation rule, and assigning a unique serial number to each segmented data, includes:

[0010] Receive large data packets to be transmitted;

[0011] Calculating the optimal number of segments and the size of each segment based on network conditions and transmission requirements, where the transmission requirement is the network's maximum transmission unit;

[0012] Based on the segmentation algorithm, large data packets are divided into multiple small segments;

[0013] Assign a unique serial number to each segment data.

[0014] In one embodiment, parsing the original data packet and dividing it into multiple smaller data segments according to a preset segmentation rule further includes:

[0015] Execute a CRC algorithm or other applicable checksum algorithm on each segmented data to generate an initial checksum;

[0016] Add the initial checksum to the end of the corresponding segmented data to form a new data packet;

[0017] Extracting the segmented data and the initial check code from the new data packet, and recalculating the check code of the segmented data to generate a new check code;

[0018] In response to the new check code being different from the initial check code, the network is instructed to retransmit the segmented data.

[0019] In one embodiment, the dynamically selecting multiple transmission paths according to real-time network conditions includes:

[0020] Obtain performance data for each path in the network;

[0021] Analyze the performance data of each path and evaluate the transmission capacity of each path;

[0022] Based on the evaluation results, multiple optimal paths are selected for data transmission.

[0023] In one embodiment, selecting multiple optimal paths for data transmission based on the evaluation results includes:

[0024] For each segment of data, one or more optimal paths will be dynamically selected from a set of predefined transmission paths based on the current network conditions;

[0025] Send segmented data to the optimal path;

[0026] In response to a degradation in performance of a path, segmented data on the path is transferred to other paths.

[0027] In one embodiment, the periodic analysis of the network topology, identification of bottleneck nodes, and optimization of network transmission performance includes:

[0028] Obtaining status information of all nodes and links in the network, including bandwidth, latency, and traffic;

[0029] Identify nodes that restrict network traffic based on graph theory algorithms;

[0030] Calculate and add new paths based on network topology and link capacity;

[0031] Calculate the optimal routing strategy based on the new network topology.

[0032] In one embodiment, the sequentially reassembling the segmented data based on the unique sequence number and outputting the complete original data packet includes:

[0033] Acquire segmented data on all transmission paths, wherein each segmented data includes a unique sequence number;

[0034] Sort the segmented data based on the sequence number;

[0035] Store the sorted segmented data in a temporary buffer;

[0036] In response to all the segmented data being transmitted to the temporary buffer, the segmented data are spliced ​​one by one according to the order of the sequence numbers to complete the data reassembly, and the reassembled complete original data packet is output.

[0037] The present invention also provides a network expansion device for a half-duplex bus, comprising:

[0038] The parsing module is used to parse the original data packet and cut it into multiple smaller data segments according to the preset segmentation rules, and assign a unique serial number to each segment data;

[0039] A selection module for dynamically selecting multiple transmission paths based on real-time network conditions, including network bandwidth, transmission delay, packet loss rate, and error rate;

[0040] Analysis module, used to regularly analyze the network topology, identify bottleneck nodes, and optimize network transmission performance;

[0041] The output module is used to sequentially reassemble the segmented data based on the unique sequence number and output the complete original data packet.

[0042] The present invention also provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements any of the above-mentioned methods for expanding the network of the half-duplex bus when executing the computer program.

[0043] The present invention also provides a computer-readable storage medium storing a computer program, wherein when the computer program is executed by a processor, the network expansion method of the half-duplex bus as described above is implemented.

[0044] The network expansion method, device and electronic device of the above-mentioned half-duplex bus improve the data transmission efficiency by dividing large data packets into multiple small segments and adopting a multi-path transmission strategy. It can effectively solve the problems of network congestion and limited transmission of large data packets caused by single-path transmission. At the same time, by identifying bottleneck nodes to optimize network transmission performance, it is convenient to dynamically adjust the network configuration, thereby improving the reliability and overall performance of half-duplex bus data transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] In order to more clearly illustrate the technical solutions in the present invention or the prior art, a brief introduction will be given below to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0046] Figure 1 A schematic flow chart of a method for network expansion of a half-duplex bus in one embodiment;

[0047] Figure 2 1 is a flow chart of a data packet segmentation method in one embodiment;

[0048] Figure 3 A schematic diagram of a process for verifying data integrity in one embodiment;

[0049] Figure 4 FIG. 1 is a flow chart of dynamically selecting multiple transmission paths according to network conditions in one embodiment;

[0050] Figure 5 is a schematic diagram of a process of performing multipath data transmission according to an evaluation result in one embodiment;

[0051] Figure 6 Schematic diagram of a process for optimizing network transmission performance based on bottleneck nodes in one embodiment;

[0052] Figure 7 Schematic diagram of a process for sequentially reorganizing segmented data in one embodiment;

[0053] Figure 8 A schematic diagram of the structure of a network expansion device for a half-duplex bus in one embodiment;

[0054] Figure 9 FIG. 1 is a diagram showing the internal structure of an electronic device according to an embodiment. DETAILED DESCRIPTION

[0055] To make the objectives, technical solutions, and advantages of the embodiments of the present invention more clear, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts shall fall within the scope of protection of the present invention.

[0056] The following combination Figures 1-9 The present invention describes a network expansion method, device and electronic equipment for a half-duplex bus.

[0057] like Figure 1 As shown, in one embodiment, a network expansion method for a half-duplex bus includes the following steps:

[0058] Step S100: parse the original data packet and cut it into multiple smaller data segments according to a preset segmentation rule, and assign a unique serial number to each data segment.

[0059] By adopting a data packet segmentation strategy, it is convenient to realize multi-path parallel transmission, thereby optimizing the transmission efficiency of large data packets.

[0060] Step S200 , dynamically selecting multiple transmission paths based on real-time network conditions, where the network conditions include network bandwidth, transmission delay, packet loss rate, and error rate.

[0061] By selecting multiple paths based on network conditions to transmit segmented data simultaneously, multi-path transmission is easily achieved, avoiding transmission problems caused by congestion on a single path.

[0062] Step S300: regularly analyzing the network topology, identifying bottleneck nodes, and optimizing network transmission performance.

[0063] By identifying and eliminating bottleneck nodes, the overall transmission performance of the network can be improved.

[0064] Step S400: reorganize the segmented data in sequence based on the unique sequence number and output a complete original data packet.

[0065] This ensures that the received segmented data can be accurately reassembled into the original large data packet.

[0066] This half-duplex bus network expansion method improves data transmission efficiency by dividing large data packets into multiple small segments and adopting a multi-path transmission strategy. It can effectively solve the problems of network congestion and limited large data packet transmission caused by single-path transmission. At the same time, it optimizes network transmission performance by identifying bottleneck nodes, thereby facilitating dynamic adjustment of network configuration and improving the reliability and overall performance of half-duplex bus data transmission.

[0067] In this embodiment, see Figure 2 , parse the original data packet and cut it into multiple smaller data segments according to the preset segmentation rules, and assign a unique serial number to each segment data, including the following steps:

[0068] Step S110: receiving a large data packet to be transmitted.

[0069] Step S120 , calculating the optimal number of segments and the size of each segment according to the network status and transmission requirements, where the transmission requirement is the maximum transmission unit of the network.

[0070] Determine an appropriate number of segments n based on factors such as network bandwidth, transmission delay, and error rate. The size of each segment data is denoted as d i (where i = 1, 2, ..., n), satisfying the following formula:

[0071]

[0072] Where D is the total size of the large data packet to be transmitted, and this formula means that the combination of all segmented data is exactly equal to the original data packet.

[0073] Step S130 : based on a segmentation algorithm, the large data packet is segmented into multiple small segments.

[0074] Determine the segment size: Determine the size of each segment based on the network's MTU (Maximum Transmission Unit) and the current network conditions.

[0075] Determining segment size is a crucial step in network communications. When transmitting data, the size of a packet is determined by the network's MTU. The MTU refers to the maximum packet size that can be transmitted simultaneously on a network, and different network types may have different MTU values. To ensure efficient transmission of data packets across the network, the size of each segment is typically set to be less than or equal to the MTU.

[0076] The following is an example of a formula for determining segment size:

[0077] Segment size = min (MTU, maximum transmission unit under current network conditions),

[0078] In practical applications, network conditions, such as bandwidth, latency, and packet loss rate, also need to be considered to dynamically adjust the segment size to optimize transmission efficiency.

[0079] Split the data packet: Use a splitting algorithm to evenly split the data packet D into n segments.

[0080] Step S140: assign a unique serial number to each segmented data.

[0081] By making each segment d i Contains a sequence number to facilitate subsequent reassembly.

[0082] In this way, parallel data transmission can be achieved, greatly improving transmission efficiency and reliability.

[0083] In this embodiment, see Figure 3 , parses the original data packet and cuts it into multiple smaller data segments according to the preset segmentation rules, and also includes the following steps:

[0084] Step S150 : executing a CRC algorithm or other applicable check algorithm on each segmented data to generate an initial check code.

[0085] Among them, the CRC algorithm (Cyclic Redundancy Check) is a commonly used data transmission error detection technology. Its basic principle is to add one or more check bits (i.e., CRC code) to the transmitted data. After receiving the data, the receiving end uses the same CRC algorithm to calculate the check bits and compares them with the sent check bits to determine whether the data has changed during transmission.

[0086] The specific expression is as follows:

[0087] C i =CRC(d i ),

[0088] Among them, C i is the segmented data d i “CRC” represents the CRC checksum algorithm.

[0089] Step S160: Add the initial check code to the end of the corresponding segmented data to form a new data packet.

[0090] This makes it convenient to transmit segmented data with checksums during the transmission process.

[0091] Step S170 : extracting the segmented data and the initial check code from the new data packet, and recalculating the check code of the segmented data to generate a new check code.

[0092] By extracting the initial check code and calculating the new check code, it is convenient to verify the integrity of the data by comparing the initial check code and the new check code.

[0093] Step S180: In response to the new check code being different from the initial check code, instruct the network to retransmit the segmented data.

[0094] When the new check code is the same as the initial check code, the data transmission is considered correct; if they are different, it is necessary to request retransmission of the segmented data.

[0095] By embedding a checksum in each segment, errors can be detected and corrected in a timely manner during data transmission, greatly improving the reliability and accuracy of data transmission.

[0096] In this embodiment, see Figure 4 , dynamically select multiple transmission paths according to the real-time network conditions, including the following steps:

[0097] Step S210: Acquire performance data of each path in the network.

[0098] By monitoring the network status in real time, it is convenient to obtain performance data such as bandwidth, delay, packet loss rate, etc. of each path in the network.

[0099] Step S220: Analyze the performance data of each path and evaluate the transmission capacity of each path.

[0100] By analyzing the performance data of each path and then evaluating the transmission capacity of each path, it is convenient to match the appropriate path for each segment of data.

[0101] Step S230: Based on the evaluation result, multiple optimal paths are selected for data transmission.

[0102] By dynamically selecting multiple transmission paths based on real-time network conditions to transmit the segmented data segments in parallel, not only the data transmission speed is improved, but also the robustness of the entire transmission system is enhanced, ensuring that the data can reach the destination reliably.

[0103] In this embodiment, see Figure 5 ,Based on the evaluation results, multiple optimal paths are selected for data transmission,,including the following steps:

[0104] Step S231 : For each segmented data, one or more optimal paths are dynamically selected from a set of predefined transmission paths according to the current network conditions.

[0105] Assuming there are multiple networks, each with real-time monitoring or status feedback, the quality or status of each network can be easily known, and the best one or more paths can be selected for data transmission.

[0106] Step S232: Send the segmented data to the optimal path.

[0107] Convenient to realize parallel transmission.

[0108] Step S233: In response to the degradation of the path performance, the segmented data on the path is transferred to another path.

[0109] When it is found that the transmission rate of a certain path decreases or is interrupted by interference or damage, the segmented data on this path is transferred to other paths. Dynamic adjustment ensures that the data segments can be transmitted in the shortest time possible, while reducing transmission delays caused by network congestion.

[0110] In this embodiment, see Figure 6 , regularly analyze the network topology, identify bottleneck nodes, and optimize network transmission performance, including the following steps:

[0111] Step S310: Acquire status information of all nodes and links in the network, including bandwidth, delay, and flow.

[0112] By monitoring the bandwidth, delay, traffic and other status information of all nodes and links in the network in real time, it is convenient to regularly analyze the network topology.

[0113] Step S320: Identify nodes that limit network traffic based on graph theory algorithms.

[0114] By using algorithms from graph theory, such as the maximum flow minimum cut theorem, it is easy to identify nodes that restrict network flow.

[0115] The specific expression is as follows:

[0116] Bottleneck capacity = min c ∈C{c|c is the capacity of a link in the network},

[0117] Where C is the capacity set of all links in the network; bottleneck capacity refers to the bottleneck capacity of the network, that is, the maximum amount of data that can be transmitted in the network, which is determined by the capacity of the smallest link in the network; c is an element in the set C, representing the capacity of a link in the network; min c ∈C represents the operation of finding the minimum value in the set C; {c|c is the capacity of a link in the network} represents the capacity of all links in the network.

[0118] Step S330: Calculate and add a new path based on the network topology and link capacity.

[0119] By adding new links in the network, the capacity of the bottleneck node is increased, thereby improving the throughput of the entire network.

[0120] Step S340: Calculate the optimal routing strategy based on the new network topology.

[0121] By modifying the routing table in the network, traffic is redistributed to reduce the load on bottleneck nodes.

[0122] Adjusting routing policies is a key operation in network management, which aims to improve the overall performance of the network by optimizing the transmission path of data packets.

[0123] New routing strategy = optimization (current routing table, bottleneck node identification algorithm),

[0124] Among them, the bottleneck node identification algorithm is used to identify nodes with higher loads in the network. By modifying the routing table in the network, traffic can be redistributed so that data packets bypass these bottleneck nodes, thereby reducing their load and improving the overall transmission efficiency of the network.

[0125] For example, the SPF (Shortest Path First) algorithm is used to calculate the optimal path for data packets from the source node to the destination node. If a node (such as node A) is found to be a bottleneck, the routing policy can be adjusted by following these steps:

[0126] Use network monitoring tools to identify bottleneck node A.

[0127] Calculate the shortest paths from all nodes in the network to other nodes, excluding the paths passing through node A.

[0128] Update the routing table to direct traffic that originally passed through Node A to the alternative path.

[0129] Here is a simplified example:

[0130] Assume that there are four nodes A, B, C, and D in the network. Under the current routing policy, all traffic from B to D passes through A, causing A to become a bottleneck.

[0131] The adjusted routing policy may be:

[0132] Traffic from B to D now goes through node C instead of A, which reduces the load on A.

[0133] In the routing table, this might appear as a change to the following entry:

[0134] Original routing entry: B->A->D

[0135] New routing entry: B->C->D

[0136] In this way, the traffic is redistributed and bypasses the bottleneck node A.

[0137] Specific embodiments are as follows:

[0138] Assume that node X is the bottleneck node in the network. Through analysis, it is found that the capacity of link XY is the smallest.

[0139] For optimization, a new link XZY is added between nodes X and Y so that traffic can be transmitted through the new path, reducing the load on link XY. At the same time, the routing policy is adjusted so that part of the traffic is transmitted through the new path, thereby improving the overall performance of the network.

[0140] This approach not only improves network transmission efficiency but also enhances network robustness, ensuring the continuity and reliability of data transmission. The following is the final result:

[0141] Improved throughput: By adding redundant paths and adjusting routing policies, network throughput has been significantly improved.

[0142] Reduced latency: The optimized network reduces data transmission delays and improves user experience.

[0143] Enhanced reliability: The network can better adapt to traffic changes and reduce transmission failures caused by bottleneck nodes.

[0144] In this implementation, see Figure 7 , based on the unique sequence number, the segmented data is sequentially reassembled and the complete original data packet is output, including the following steps:

[0145] Step S410: Acquire segmented data on all transmission paths, each segmented data including a unique sequence number.

[0146] By collecting segmented data with sequence numbers on all transmission paths, it is convenient to sort and reassemble the segmented data.

[0147] Step S420: sort the segmented data based on the sequence number.

[0148] Since the sequence number can indicate the position of the segmented data in the original data packet, it is convenient to sort the segmented data according to the sequence number.

[0149] Step S430: storing the sorted segmented data in a temporary buffer.

[0150] By collecting all segmented data in a temporary buffer, it is convenient for subsequent reassembly.

[0151] In step S440 , in response to all the segmented data being transmitted to the temporary buffer, the segmented data are spliced ​​one by one according to the order of the sequence numbers to complete the data reassembly, and the reassembled complete original data packet is output.

[0152] The specific reorganization process expression is as follows:

[0153]

[0154] Among them, D' is the complete data packet after reassembly, d i (where i = 1, 2, ..., n) represents the size of each segment data, s i Represents each segment data d i ’ is a corresponding serial number.

[0155] Specific embodiments are as follows:

[0156] Assume that three segmented data d1′, d2′, and d3′ are received, and their sequence numbers are 1, 2, and 3 respectively.

[0157] Sort the three segmented data by sequence number, and then concatenate them one by one to finally restore the original data packet D′.

[0158] In this way, data integrity and transmission reliability can be ensured, and the original data can be accurately reconstructed even in the case of multi-path transmission and possible out-of-order arrival of segmented data.

[0159] The network expansion device of the half-duplex bus provided by the present invention is described below. The network expansion device of the half-duplex bus described below and the network expansion method of the half-duplex bus described above can be referred to each other.

[0160] like Figure 8 As shown, in one embodiment, a network expansion device for a half-duplex bus includes a parsing module 810 , a selection module 820 , an analysis module 830 and an output module 840 .

[0161] The parsing module 810 is used to parse the original data packet and cut it into multiple smaller data segments according to a preset segmentation rule, and assign a unique serial number to each segment data.

[0162] The selection module 820 is used to dynamically select multiple transmission paths according to real-time network conditions, including network bandwidth, transmission delay, packet loss rate, and error rate.

[0163] The analysis module 830 is used to regularly analyze the network topology, identify bottleneck nodes, and optimize network transmission performance.

[0164] The output module 840 is used to sequentially reassemble the segmented data based on the unique sequence number and output a complete original data packet.

[0165] In this embodiment, the parsing module 810 is specifically configured to:

[0166] Receive large data packets to be transmitted;

[0167] Calculate the optimal number of segments and the size of each segment based on the network conditions and transmission requirements. The transmission requirement is the maximum transmission unit of the network.

[0168] Based on the segmentation algorithm, large data packets are divided into multiple small segments;

[0169] Assign a unique serial number to each segment data.

[0170] In this embodiment, the parsing module 810 is further specifically configured to:

[0171] Execute a CRC algorithm or other applicable checksum algorithm on each segmented data to generate an initial checksum;

[0172] Add the initial checksum to the end of the corresponding segmented data to form a new data packet;

[0173] Extracting the segmented data and the initial check code from the new data packet, and recalculating the check code of the segmented data to generate a new check code;

[0174] In response to the new check code being different from the initial check code, the network is instructed to retransmit the segmented data.

[0175] In this embodiment, the selection module 820 is specifically configured to:

[0176] Obtain performance data for each path in the network;

[0177] Analyze the performance data of each path and evaluate the transmission capacity of each path;

[0178] Based on the evaluation results, multiple optimal paths are selected for data transmission.

[0179] In this embodiment, based on the evaluation results, multiple optimal paths are selected for data transmission, specifically for:

[0180] For each segment of data, one or more optimal paths will be dynamically selected from a set of predefined transmission paths based on the current network conditions;

[0181] Send segmented data to the optimal path;

[0182] In response to a degradation in performance of a path, segmented data on the path is transferred to other paths.

[0183] In this embodiment, the analysis module 830 is specifically configured to:

[0184] Obtain status information of all nodes and links in the network, including bandwidth, latency, and traffic;

[0185] Identify nodes that restrict network traffic based on graph theory algorithms;

[0186] Calculate and add new paths based on network topology and link capacity;

[0187] Calculate the optimal routing strategy based on the new network topology.

[0188] In this embodiment, the output module 840 is specifically configured to:

[0189] Obtain segmented data on all transmission paths, each segmented data contains a unique sequence number;

[0190] Sort the segmented data based on the sequence number;

[0191] Store the sorted segmented data in a temporary buffer;

[0192] In response to all the segmented data being transmitted to the temporary buffer, the segmented data are spliced ​​one by one according to the order of the sequence numbers to complete the data reassembly;

[0193] Output the complete original data packet after reassembly.

[0194] The network expansion device of the half-duplex bus improves data transmission efficiency by dividing large data packets into multiple small segments and adopting a multi-path transmission strategy. It can effectively solve the problems of network congestion and limited transmission of large data packets caused by single-path transmission. At the same time, it optimizes network transmission performance by embedding check codes in each segment and identifying bottleneck nodes, thereby facilitating dynamic adjustment of network configuration and improving the reliability and overall performance of half-duplex bus data transmission.

[0195] Figure 9 The following is a schematic diagram of the physical structure of an electronic device. The electronic device may be a smart terminal, and its internal structure diagram may be as follows: Figure 9As shown. The electronic device includes a processor, a memory, and a network interface connected via a system bus. The processor of the electronic device is used to provide computing and control capabilities. The memory of the electronic device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer program in the non-volatile storage medium. The network interface of the electronic device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, a network expansion method for a half-duplex bus is implemented, the method comprising:

[0196] Parse the original data packet and cut it into multiple smaller data segments according to the preset segmentation rules, and assign a unique serial number to each segment data;

[0197] Dynamically select multiple transmission paths based on real-time network conditions, including network bandwidth, transmission delay, packet loss rate, and error rate;

[0198] Regularly analyze network topology, identify bottleneck nodes, and optimize network transmission performance;

[0199] Based on the unique sequence number, the segmented data is reassembled in sequence and the complete original data packet is output.

[0200] Those skilled in the art will understand that Figure 9 The structure shown in the figure is merely a block diagram of a portion of the structure related to the solution of the present invention, and does not constitute a limitation on the electronic device to which the solution of the present invention is applied. The specific electronic device may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0201] On the other hand, the present invention further provides a computer storage medium storing a computer program, which, when executed by a processor, implements a network expansion method for a half-duplex bus, the method comprising:

[0202] Parse the original data packet and cut it into multiple smaller data segments according to the preset segmentation rules, and assign a unique serial number to each segment data;

[0203] Dynamically select multiple transmission paths based on real-time network conditions, including network bandwidth, transmission delay, packet loss rate, and error rate;

[0204] Regularly analyze network topology, identify bottleneck nodes, and optimize network transmission performance;

[0205] Based on the unique sequence number, the segmented data is reassembled in sequence and the complete original data packet is output.

[0206] In another aspect, a computer program product or computer program is provided, the computer program product or computer program including computer instructions stored in a computer-readable storage medium. A processor of an electronic device reads the computer instructions from the computer-readable storage medium, and when the processor executes the computer instructions, implements a network expansion method for a half-duplex bus, the method comprising:

[0207] Parse the original data packet and cut it into multiple smaller data segments according to the preset segmentation rules, and assign a unique serial number to each segment data;

[0208] Dynamically select multiple transmission paths based on real-time network conditions, including network bandwidth, transmission delay, packet loss rate, and error rate;

[0209] Regularly analyze network topology, identify bottleneck nodes, and optimize network transmission performance;

[0210] Based on the unique sequence number, the segmented data is reassembled in sequence and the complete original data packet is output.

[0211] Those skilled in the art will understand that all or part of the processes in the above-mentioned embodiment methods can be implemented by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided by the present invention may include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory.

[0212] By way of illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0213] The technical features of the above embodiments can be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0214] The above-described embodiments merely illustrate several embodiments of the present invention, and while the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present invention. It should be noted that a person skilled in the art would be able to make various modifications and improvements without departing from the spirit of the present invention, and these modifications and improvements fall within the scope of the present invention. Therefore, the scope of the present invention shall be determined by the appended claims.

Claims

1. A network expansion method for a half-duplex bus, characterized in that: The method comprises: Parsing the original data packet and cutting it into multiple smaller data segments according to a preset segmentation rule, and assigning a unique serial number to each segmented data, including: executing a CRC algorithm or other applicable check algorithm on each segmented data to generate an initial check code; adding the initial check code to the end of the corresponding segmented data to form a new data packet; extracting the segmented data and the initial check code from the new data packet, and recalculating the check code of the segmented data to generate a new check code; in response to the new check code being different from the initial check code, instructing the network to retransmit the segmented data; Dynamically select multiple transmission paths based on real-time network conditions, including network bandwidth, transmission delay, packet loss rate, and error rate; Regularly analyze the network topology and identify bottleneck nodes that limit network traffic based on the maximum flow and minimum cut theorem in graph theory. Calculate and add redundant links based on the network topology and link capacity. Calculate the optimal routing strategy based on the new network topology to optimize network transmission performance. Based on the unique sequence number, the segmented data is reassembled in sequence and the complete original data packet is output.

2. The network expansion method of the half-duplex bus according to claim 1, characterized in that: The original data packet is parsed and cut into multiple smaller data segments according to a preset segmentation rule, and each segmented data is assigned a unique serial number, including: Receive large data packets to be transmitted; Calculating the optimal number of segments and the size of each segment based on network conditions and transmission requirements, where the transmission requirement is the network's maximum transmission unit; Based on the segmentation algorithm, large data packets are divided into multiple small segments; Assign a unique serial number to each segment data.

3. The network expansion method of the half-duplex bus according to claim 2, characterized in that: The method of dynamically selecting multiple transmission paths according to real-time network conditions includes: Obtain performance data for each path in the network; Analyze the performance data of each path and evaluate the transmission capacity of each path; Based on the evaluation results, multiple optimal paths are selected for data transmission.

4. The network expansion method of the half-duplex bus according to claim 3, characterized in that: The method of selecting multiple optimal paths for data transmission based on the evaluation results includes: For each segment of data, one or more optimal paths will be dynamically selected from a set of predefined transmission paths based on the current network conditions; Send segmented data to the optimal path; In response to a degradation in performance of a path, segmented data on the path is transferred to other paths.

5. The network expansion method of a half-duplex bus according to any one of claims 1 to 4, characterized in that: The network topology is regularly analyzed, bottleneck nodes are identified based on graph theory algorithms, and network transmission performance is optimized by adding redundant links or adjusting routing strategies, including: Obtaining status information of all nodes and links in the network, including bandwidth, latency, and traffic; Identify nodes that restrict network traffic based on graph theory algorithms; Calculate and add new paths based on network topology and link capacity; Calculate the optimal routing strategy based on the new network topology.

6. The network expansion method of the half-duplex bus according to claim 5, characterized in that: The segmented data is sequentially reassembled based on the unique sequence number and the complete original data packet is output, including: Acquire segmented data on all transmission paths, wherein each segmented data includes a unique sequence number; Sort the segmented data based on the sequence number; Store the sorted segmented data in a temporary buffer; In response to all the segmented data being transmitted to the temporary buffer, the segmented data are spliced ​​one by one according to the order of the sequence numbers to complete the data reassembly, and the reassembled complete original data packet is output.

7. A network expansion device for a half-duplex bus, characterized in that: include: A parsing module is configured to parse an original data packet and cut it into multiple smaller data segments according to a preset segmentation rule, and assign a unique serial number to each segmented data, including: executing a CRC algorithm or other applicable checksum algorithm on each segmented data to generate an initial checksum; adding the initial checksum to the end of the corresponding segmented data to form a new data packet; extracting the segmented data and the initial checksum from the new data packet, and recalculating the checksum of the segmented data to generate a new checksum; and instructing the network to retransmit the segmented data in response to the new checksum being different from the initial checksum. A selection module for dynamically selecting multiple transmission paths based on real-time network conditions, including network bandwidth, transmission delay, packet loss rate, and error rate; The analysis module is used to regularly analyze the network topology and identify bottleneck nodes that limit network traffic based on the maximum flow minimum cut theorem in graph theory algorithms. It also calculates and adds redundant links based on the network topology and link capacity, and calculates the optimal routing strategy based on the new network topology to optimize network transmission performance. The output module is used to sequentially reassemble the segmented data based on the unique sequence number and output the complete original data packet.

8. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the network expansion method for a half-duplex bus according to any one of claims 1 to 6 are implemented.

9. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the network expansion method for a half-duplex bus according to any one of claims 1 to 6 are implemented.

Images