Multi-node network agent system and method, electronic equipment and storage medium

Abstract

The embodiment of the invention provides a multi-node network proxy system and method, electronic equipment and a storage medium, and relates to the technical field of network communication. The system comprises a plurality of entry hosts used for being connected with any proxy node; the agent nodes comprise a plurality of agent nodes of a public network and a plurality of agent nodes of at least one internal network, and are used for storing state information of adjacent nodes and generating a connection information table, so that an entrance host connected with the agent nodes performs line planning according to the connection information table. A plurality of entrance hosts are adopted to access an internal network and a network at the same time, automatic route planning is achieved according to a network topological graph, flexibility is enhanced, and the problem that an existing method cannot automatically plan a route is solved.

Description

Technical Field

[0001] The present application relates to the field of network communication technology, and in particular to a multi-node network proxy system, method, electronic device and storage medium. Background Art

[0002] With the rapid development of information technology and the increasing complexity of enterprise network architecture, access to intranet resources has become increasingly important. Many enterprises and organizations use multi-layered network architectures to meet the needs of different users and applications while ensuring security. These network architectures usually include edge networks, internal LANs, and core networks, and users need to flexibly and securely access these different layers of intranet resources.

[0003] Traditional proxy systems use fixed paths and a single proxy server, which is less flexible and cannot dynamically adjust access routes based on network status or user needs. This leads to inefficient use of network resources and is prone to congestion during peak hours. Summary of the invention

[0004] The purpose of the embodiments of the present application is to provide a multi-node network proxy system, method, electronic device and storage medium, which use multiple entry hosts to access the internal network and the network at the same time, and automatically plan routes according to the network topology diagram, thereby enhancing flexibility and solving the problem that the existing methods cannot automatically plan routes.

[0005] The present application provides a multi-node network proxy system, the system comprising:

[0006] Multiple entry hosts for connecting to any proxy node;

[0007] The proxy nodes, including multiple proxy nodes of a public network and multiple proxy nodes of at least one internal network, are used to store status information of adjacent nodes and generate a connection information table so that the entry host connected thereto can perform line planning according to the connection information table.

[0008] In the above implementation process, multiple entry hosts can access any proxy node and adopt distributed storage. Each proxy node stores the information of the proxy nodes adjacent to it. The storage is not centralized, which can ensure data security. The entry host can obtain the proxy node information through the connection information table without manually entering the node information. It can also automatically plan the line according to the connection information table, which enhances flexibility and solves the problem that the existing method cannot automatically plan the line.

[0009] The present application also provides a multi-node network proxy method, which is applied to the multi-node network proxy system described above, and the method includes:

[0010] Modify the configuration file of the proxy node so that it can connect with the adjacent proxy node, and generate a connection information table based on the status information of the adjacent node;

[0011] The entry host can connect to any proxy node, obtain the connection information table of each proxy node in the proxy network, and perform line planning according to the connection information table.

[0012] In the above implementation process, the proxy node is connected to the adjacent nodes and adopts distributed storage. Each proxy node stores the information of the proxy nodes adjacent to it. The storage is not centralized, which can ensure data security. The entry host can obtain the proxy node information through the connection information table without manually entering the node information. The line planning can also be automatically performed according to the connection information table, which enhances flexibility and solves the problem that the existing method cannot automatically plan the line.

[0013] Further, the modifying of the configuration file of the proxy node so as to connect it with the adjacent proxy node includes:

[0014] Specify the listening port of the proxy node for the entry host to connect to;

[0015] Specify the IP address and port of the entry host where the adjacent proxy node is located;

[0016] The proxy node performs identity authentication with the adjacent node, and after successful authentication, starts a status detection thread to detect and store status information of the adjacent proxy node in real time.

[0017] In the above implementation process, by setting the configuration file of the proxy node so that it can connect with the adjacent nodes, the status information of the adjacent nodes can be obtained in real time, which is convenient for the dynamic expansion of the proxy node.

[0018] Furthermore, the entry host can connect to any proxy node and obtain the connection information table of each proxy node in the proxy network, including:

[0019] After the entry host connects to the designated node, it performs identity authentication, and after successful authentication, sends instructions to obtain node information to each proxy node in the proxy network, and receives the connection information table returned by each proxy node, which includes: the IP, MAC address, network delay and node ID of the adjacent proxy node.

[0020] In the above implementation process, the entry host can obtain the connection relationship of each proxy node through the connection information table to generate a network topology diagram.

[0021] Further, performing line planning according to the connection information table includes:

[0022] Generate a network topology diagram according to the connection information table;

[0023] Receive the designated proxy target request sent by the client;

[0024] Line planning is performed according to the network topology diagram and the designated proxy target request.

[0025] In the above implementation process, line planning is carried out according to customer needs, which can avoid network line congestion and improve the utilization rate of network resources.

[0026] Furthermore, the performing of line planning according to the network topology diagram and the designated proxy target request includes:

[0027] Use Dijkstra's algorithm to generate the shortest path.

[0028] In the above implementation process, the Dijkstra algorithm is used to obtain the shortest path in terms of time consumption, which can avoid network line congestion and improve the utilization rate of network resources.

[0029] Furthermore, the method further comprises:

[0030] When a new proxy node is added, the new proxy node is connected to the designated proxy node, and after the connection is successful, the node information is actively sent to the corresponding entry host, so that the entry host updates the network topology map based on the new node information.

[0031] In the above implementation process, the network topology map is updated according to the increase of proxy nodes to achieve the effect of dynamic expansion.

[0032] Furthermore, the method further comprises:

[0033] When the proxy node is reduced, the entry host detects the change in node status and updates the network topology map.

[0034] In the above implementation process, the network topology map is updated according to the reduction of proxy nodes to achieve the effect of dynamic expansion.

[0035] An embodiment of the present application also provides an electronic device, which includes a memory and a processor, wherein the memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to execute the above-mentioned multi-node network proxy method.

[0036] An embodiment of the present application further provides a readable storage medium, wherein the readable storage medium stores computer program instructions, and when the computer program instructions are read and executed by a processor, the multi-node network proxy method described above is executed. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments of the present application will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0038] Figure 1 A structural block diagram of a multi-node network proxy system provided in an embodiment of the present application;

[0039] Figure 2 A flowchart of a multi-node network proxy method provided in an embodiment of the present application;

[0040] Figure 3 A flowchart for automatically obtaining node information provided in an embodiment of the present application;

[0041] Figure 4 A connection flow chart of a proxy node provided in an embodiment of the present application;

[0042] Figure 5 Access flow chart of the entry host provided in the embodiment of the present application;

[0043] Figure 6 A flow chart of route planning provided for an embodiment of the present application;

[0044] Figure 7 A flowchart of a client sending a request provided in an embodiment of the present application.

[0045] icon:

[0046] 100-entry host; 200-agent node. DETAILED DESCRIPTION

[0047] The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

[0048] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in subsequent drawings. At the same time, in the description of this application, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.

[0049] Example 1

[0050] Please see Figure 1 , Figure 1This is a structural block diagram of a multi-node network proxy system provided in an embodiment of the present application. After authenticating the user, the proxy system can plan the best route for the user to access the services he needs to access, while hiding the internal network details from the user. This allows the network to be dynamically expanded and has stronger anti-attack capabilities and dynamism.

[0051] The system includes:

[0052] Multiple entry hosts 100, used to connect to any proxy node 200;

[0053] The proxy nodes 200, including multiple proxy nodes 200 of a public network and multiple proxy nodes 200 of at least one internal network, are used to store status information of adjacent nodes and generate a connection information table so that the entry host 100 connected thereto can perform line planning according to the connection information table.

[0054] For example, Figure 1 As shown, it includes an entry host A and an entry host B, wherein the proxy node 200 is connected to the adjacent proxy node 200, and the arrows in the figure only indicate the active connection end, not the data transmission direction, and the entry host 100 can access any proxy node 200. In addition, the number of internal networks is not limited, and the number of proxy nodes 200 in the internal network and the number of proxy nodes 200 in the public network are not limited.

[0055] Compared with the prior art, the system supports multiple entry hosts 100 to access the system at the same time, thus improving flexibility. Figure 1 If you are currently in internal network 1, you can deploy entry host A in internal network 1. For example, you can connect entry host A directly to proxy node A. After successful access, you can access other nodes in this proxy network. If you are currently in a public network, you can deploy entry host B in the public network. For example, you can connect entry host B directly to proxy node B. After successful access, you can directly access other nodes in this proxy network without using additional VPN software to connect to entry host A in internal network 1.

[0056] After the portal host 100 accesses the network, it performs identity authentication. After successful authentication, it sends a command to obtain node information to each node in the proxy network. After receiving the command from the portal host 100, the node sends the connection information table of the current proxy node 200 to the portal host 100. The connection information table includes: adjacent proxy node IP, MAC address, network delay and node ID (a unique identifier generated when the node is initialized). After receiving the connection information table, the portal host 100 generates a network topology diagram based on the node's connection information table.

[0057] The user uses the client program to connect to the entry host 100. After the identity authentication is completed, the node to be accessed is specified. The entry host 100 generates the best path according to the Dijkstra algorithm and forwards the client request according to this path. When adding or reducing the proxy node 200, the entry host 100 detects the node status and updates the topology map. The entry host 100 will compare the topology map in real time. When the node status changes, the client will be notified in real time to achieve the effect of dynamic expansion.

[0058] The multiple entry hosts 100 in the system can access any proxy node 200 and adopt distributed storage. Each proxy node 200 stores the information of the proxy nodes 200 adjacent to it. The storage is not centralized, which can ensure data security. The entry host 100 can obtain the proxy node 200 information through the connection information table without manually entering the node information. The line planning can also be automatically performed according to the connection information table, which enhances flexibility and solves the problem that the existing method cannot automatically plan the line.

[0059] The system can be used for secure Internet access in enterprises. The multi-node network proxy system uses multiple proxy nodes 200 (servers) to forward the data stream of user requests and responses. Through the forwarding of multiple intermediate proxy nodes 200, the user's real identity and location are effectively hidden, thereby enhancing security and privacy protection.

[0060] Specifically, it can avoid network attacks, hide the real IP, and resist various network attacks.

[0061] Example 2

[0062] The embodiment of the present application provides a multi-node network proxy method, which is applied to the multi-node network proxy system described in Example 1. The system can realize dynamic expansion of the network structure and automatic planning of lines, and has high flexibility; at the same time, the proxy node 200 only stores the information of adjacent proxy nodes 200, and adopts a distributed storage method, rather than storing all the proxy node 200 information uniformly in the entry host 100, which has high security.

[0063] like Figure 2 FIG. 1 is a flowchart of a multi-node network proxy method, wherein the method specifically comprises the following steps:

[0064] Step S100: modifying the configuration file of the proxy node 200 so that it is connected to the adjacent proxy node 200, and generating a connection information table based on the status information of the adjacent node;

[0065] Step S200: The portal host 100 can connect to any proxy node 200, obtain the connection information table of each proxy node 200 in the proxy network, and perform line planning according to the connection information table.

[0066] like Figure 3 As shown in FIG. 1 , it is a flowchart for automatically obtaining node information, and step S100 specifically includes the following steps:

[0067] Step S101: specifying the listening port of the proxy node 200 for the entry host 100 to connect to;

[0068] Step S102: specifying the IP address and port of the entry host 100 where the adjacent proxy node 200 is located;

[0069] Step S103: the proxy node 200 performs identity authentication with the adjacent node, and after successful authentication, starts a status detection thread to detect and store status information of the adjacent proxy node 200 in real time.

[0070] like Figure 4 As shown, it is a connection flow chart of the proxy node 200, for example, Figure 1 The proxy node A is deployed in the internal network 1. Modify the configuration file to specify the listening port for the entry host A to use when connecting. At the same time, specify the IP address and port of the host where the proxy node B in the public network is located. After the modification is completed, start the proxy node 200 program, and the program completes the initialization according to the configuration file. Next, modify the configuration file of the proxy node B, specify the listening port for the entry host B to use, and also specify the IP address and port of the host where the proxy node C and the proxy node D are located. After the modification is completed, start the proxy node B. At this time, the initialization of the proxy node B is completed, and the proxy node A and the proxy node B have been successfully connected. And so on, initialize the proxy nodes C to G. By setting the configuration file of the proxy node 200 so that it is connected to the adjacent nodes, the status information of the adjacent nodes can be obtained in real time, which is convenient for the dynamic expansion of the proxy node 200 in the network structure.

[0071] The portal host 100 can obtain the connection relationship of each proxy node 200 by acquiring the connection information table, and can automatically obtain the node information without manually entering the node information into the portal host 100.

[0072] The proxy system does not centrally store the connection information and network topology of the proxy node 200, but uses a distributed storage method. Each proxy node 200 stores the status information of the proxy nodes 200 adjacent to it. When the portal host 100 needs to obtain the network topology, each proxy node 200 will send its stored data to the portal host 100, and the portal host 100 will process the received data to obtain the network topology and the connection status of each proxy node 200, but it will not be recorded in the database. The use of a distributed storage method to store the proxy node 200 information effectively ensures data security.

[0073] like Figure 5As shown, it is a flow chart of the access of the portal host 100. The proxy system supports the portal host 100 to access any proxy node 200, and supports multiple portal hosts 100 to be online at the same time. Figure 1 In the example, the entry host A is connected to the proxy node A in the internal network 1, and the entry host B is connected to the proxy node B in the public network.

[0074] In step S200, the connection information table of each proxy node 200 in the proxy network is obtained, specifically:

[0075] After the entry host 100 connects to the designated node, it performs identity authentication, and after successful authentication, sends instructions for obtaining node information to each proxy node 200 in the proxy network, and receives the connection information table returned by each proxy node 200, wherein the connection information table includes: the IP, MAC address, network delay and node ID of the adjacent proxy node 200.

[0076] Specifically, after the portal host 100 connects to the designated node, it performs identity authentication. After successful authentication, it sends an instruction to obtain node information to each node in the proxy network. After receiving the instruction from the portal host 100, the node sends the connection information table of the current proxy node 200 to the portal host 100. The connection information table includes: adjacent proxy node IP, MAC address, network delay and node ID (a unique identifier generated when the node is initialized). After receiving the connection information table, the portal host 100 generates a network topology map based on the connection information table of the proxy node 200.

[0077] Among them, identity authentication can use the ECDSA signature algorithm (Elliptic Curve Digital Signature Algorithm, elliptic curve digital signature algorithm), specifically:

[0078] The designated node (receiving end) authenticates the entry host (sender): Use the program's built-in key S1 to perform ECDSA signature on the sender's ECDHE (Elliptic Curve Diffie-Hellman Ephemeral) public key p1 to obtain sig1, encrypt sig1 and send it to the receiving end. After receiving sig1, the receiving end uses the sender's public key to verify the signature. The specific process of the sender verifying the receiver's identity is the same as above and will not be repeated here. After confirming each other's identities, communication begins.

[0079] The entry host 100 can obtain the proxy node 200 information through the connection information table without manually entering the node information, and can also automatically plan the line according to the connection information table to enhance flexibility. Figure 6As shown in the figure, it is a flow chart of route planning. In step S200, route planning specifically includes the following steps:

[0080] Step S201: Generate a network topology map according to the connection information table;

[0081] Step S202: receiving a designated proxy target request sent by the client;

[0082] Step S203: performing line planning according to the network topology diagram and the designated proxy target request.

[0083] In step S203, the Dijkstra algorithm may be used to generate the path with the shortest time consumption.

[0084] The user uses the client program to connect to the portal host 100. After identity authentication, the user can access the authorized proxy node 200. The user specifies the proxy node 200 to be accessed, and the portal host 100 generates the best path according to the Dijkstra algorithm. According to this path, the client request is forwarded, and the client can access the specified network. The user's authority is configured by the administrator on the portal host 100. The configuration of each portal host 100 does not affect each other. Figure 7 As shown in FIG. 1 , it is a flow chart of a client sending a request.

[0085] Assuming that you need to access server C in internal network 3, you need to specify the proxy target as proxy node 200G, and send the request to the entry host 100. The entry host 100 uses the Dijkstra algorithm (single-source shortest path algorithm in a computational weighted graph) to generate the shortest path based on the topology map and target node G generated in the above steps. The path may be: proxy node A→B→D→F→G, or: proxy node A→B→C→E→F→G. The specific line is calculated based on the network delay. The entry host 100 will forward the client's request based on the calculated line. In this way, line planning can be carried out according to customer needs, network line congestion can be avoided, and the utilization rate of network resources can be improved.

[0086] The method further comprises:

[0087] When a new proxy node 200 is added, the new proxy node 200 is connected to the designated proxy node 200, and after the connection is successful, the node information is actively sent to the corresponding portal host 100, so that the portal host 100 updates the network topology map based on the new node information.

[0088] When the proxy node 200 is reduced, the portal host 100 detects that the node status has changed and updates the network topology map.

[0089] If the number of proxy nodes 200 decreases, the connection information table obtained by the entry host 100 will change. By comparing the connection information table, the new node connection relationship can be determined, thereby updating the network topology map.

[0090] When adding or reducing proxy nodes 200, the entry host 100 detects the node status and updates the topology map. The entry host 100 will compare the topology map in real time. When the node status changes, it will notify the customer in real time, thereby achieving the effect of dynamic expansion and having high flexibility.

[0091] Specifically, when a new node is added, for example, the proxy node H is started in the internal network 4, the proxy node 200 is specified to connect to the proxy node E in the public network. After the connection is successful, the node information is actively sent to the entry host 100. After the entry host 100 obtains the new node information, it updates the network topology map, recalculates the path, and updates the existing connection, replacing it with a more optimal route.

[0092] Data centers are usually infrastructure that carries a large amount of computing resources and storage resources. As data centers expand in size and globalize, using this proxy system has the following advantages:

[0093] Privacy and security: Multi-node network proxy can effectively protect the privacy of communication between users and data centers and prevent traffic from being monitored by third parties. Each proxy node 200 only knows the transmission information of the previous and next levels, and the complete privacy of the entire transmission path is guaranteed.

[0094] It can effectively prevent data leakage: if a proxy node 200 in the middle is attacked, the attacker cannot obtain the complete communication content due to the use of identity authentication.

[0095] High fault tolerance and high availability: The multi-node network proxy can improve the fault tolerance of the system through the redundant design of multiple proxy nodes 200. If a proxy node 200 fails, the system can automatically select other proxy nodes 200 to continue transmission, ensuring the continuity of data center services.

[0096] An embodiment of the present application also provides an electronic device, which includes a memory and a processor, wherein the memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to execute the above-mentioned multi-node network proxy method.

[0097] An embodiment of the present application further provides a readable storage medium, wherein the readable storage medium stores computer program instructions, and when the computer program instructions are read and executed by a processor, the multi-node network proxy method described above is executed.

[0098] In several embodiments provided in the present application, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device embodiments described above are merely schematic. For example, the flowcharts and block diagrams in the accompanying drawings show the possible architecture, functions and operations of the devices, methods and computer program products according to multiple embodiments of the present application. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of a code, and the module, a program segment or a part of a code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of boxes in the block diagram and / or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0099] In addition, the functional modules in the various embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.

[0100] If the functions are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0101] The above description is only an embodiment of the present application and is not intended to limit the scope of protection of the present application. For those skilled in the art, the present application may have various changes and variations. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application should be included in the scope of protection of the present application. It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings.

[0102] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0103] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

Claims

1. A multi-node network proxy system, characterized in that: The system comprises: Multiple entry hosts for connecting to any proxy node; The proxy nodes, including multiple proxy nodes of a public network and multiple proxy nodes of at least one internal network, are used to store status information of adjacent nodes and generate a connection information table so that the entry host connected thereto can perform line planning according to the connection information table.

2. A multi-node network proxy method, characterized in that: Applied to the multi-node network proxy system of claim 1, the method comprises: Modify the configuration file of the proxy node so that it can connect with the adjacent proxy node, and generate a connection information table based on the status information of the adjacent node; The entry host can connect to any proxy node, obtain the connection information table of each proxy node in the proxy network, and perform line planning according to the connection information table.

3. The multi-node network proxy method according to claim 2, characterized in that: The step of modifying the configuration file of the proxy node so as to connect it with the adjacent proxy node includes: Specify the listening port of the proxy node for the entry host to connect to; Specify the IP address and port of the entry host where the adjacent proxy node is located; The proxy node performs identity authentication with the adjacent node, and after successful authentication, starts a status detection thread to detect and store status information of the adjacent proxy node in real time.

4. The multi-node network proxy method according to claim 2, characterized in that: The entry host can connect to any proxy node and obtain the connection information table of each proxy node in the proxy network, including: After the entry host connects to the designated node, it performs identity authentication, and after successful authentication, sends instructions to obtain node information to each proxy node in the proxy network, and receives the connection information table returned by each proxy node, which includes: the IP, MAC address, network delay and node ID of the adjacent proxy node.

5. The multi-node network proxy method according to claim 2, characterized in that: The performing line planning according to the connection information table includes: Generate a network topology diagram according to the connection information table; Receive the designated proxy target request sent by the client; Line planning is performed according to the network topology diagram and the designated proxy target request.

6. The multi-node network proxy method according to claim 5, characterized in that: The performing of line planning according to the network topology diagram and the designated proxy target request includes: Use Dijkstra's algorithm to generate the shortest path.

7. The multi-node network proxy method according to claim 2, characterized in that: The method further comprises: When a new proxy node is added, the new proxy node is connected to the designated proxy node, and after the connection is successful, the node information is actively sent to the corresponding entry host, so that the entry host updates the network topology map based on the new node information.

8. The multi-node network proxy method according to claim 2, characterized in that: The method further comprises: When the proxy node is reduced, the entry host detects the change in node status and updates the network topology map.

9. An electronic device, characterized in that: The electronic device comprises a memory and a processor, wherein the memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to execute the multi-node network proxy method according to any one of claims 2 to 8.

10. A readable storage medium, characterized in that: The readable storage medium stores computer program instructions, and when the computer program instructions are read and executed by a processor, the multi-node network proxy method according to any one of claims 2 to 8 is executed.

Images