CN117201504A - Edge node network data flow direction control method, system, equipment and medium - Google Patents

Abstract

The application relates to a method, a system, equipment and a medium for controlling the data flow direction of an edge node network, wherein the method comprises the following steps: the user requests the edge node to support service from the nearby edge node and sends the self characteristic information to the server; the server screens out available node lists from the edge nodes of all access servers according to the characteristic information of the user and the characteristic information of each edge node, and returns the available node lists to the requesting party; the user initiates an access application to the edge node support service, initiates a request to each edge node in the available node list to acquire the delay condition of the corresponding edge node, selects the edge node to connect according to the delay condition and/or the transmission protocol and sends the request; and the edge node receiving the user request analyzes the user request and dispatches the resource to the user according to the analysis content.

Description

An edge node network data flow control method, system, device and medium

Technical field

The invention relates to an edge node network data flow control method, system, equipment and medium, and belongs to the technical field of network data control.

Background technique

There will be a significant delay gap when accessing edge nodes (devices) in a region from different regions. Connected customers who need to smoothly connect to the corresponding edge nodes need to use proxies and other methods for network processing. As a result, the customers that a physical area can receive are subject to regional or technical restrictions. The connected users need to be users in a physical area or users who have certain agency technologies and resources.

Moreover, the real IP of edge nodes is exposed to the outside world, and the market encounters port scanning, protocol attacks, flood attacks, etc., and the operating environment of internal services is relatively harsh. Additional development resources and security testing are required.

Contents of the invention

In order to solve the above-mentioned problems existing in the prior art, the present invention proposes an edge node network data flow control method, system, device and medium.

The technical solution of the present invention is as follows:

On the one hand, the present invention provides an edge node network data flow control method, which includes the following steps:

Users request edge node support services from nearby edge nodes and send their own characteristic information to the server;

The server selects a list of available nodes from all edge nodes connected to the server based on the user's own characteristic information and the characteristic information of each edge node and returns it to the requester;

The user initiates an access application to the edge node support service, initiates a request to each edge node in the available node list to obtain the delay situation of the corresponding edge node, selects the edge node to connect and initiates the request based on the delay situation and/or transmission protocol;

The edge node that receives the user request parses the user request and schedules resources to the user based on the parsed content.

As a preferred embodiment, the server selects a list of available nodes from all edge nodes that access the server based on the user's own characteristic information and the characteristic information of each edge node and returns it to the requesting party as follows:

The server performs weight calculation based on the user's own characteristic information and the characteristic information of each edge node, and initially selects edge nodes that meet the preset weight range;

Obtain the load status of each edge node initially screened out, and filter out edge nodes whose load is at a preset ratio;

Randomly select some edge nodes from the remaining edge nodes to form an available node list.

As a preferred implementation, the user's own characteristic information and the characteristic information of edge nodes include:

Outbound IP address, preset weights supported by operators, preset weights supported by different types of network protocols, weights of recorded IP segments, and preset weights of each edge node's device.

As a preferred embodiment, the edge node includes a service support node;

The service support node is provided with an edge node access service;

When any newly created edge node appears, the newly created edge node reports its own characteristic information to the service support node;

The service support node sets the newly created edge node access through the edge node access service, and controls the newly created edge node to perform self-detection. After completing the self-detection, the newly created edge node is enabled.

As a preferred implementation, the step of selecting an edge node for connection and initiating a request based on delay conditions and/or transmission protocols includes:

Obtain the delay of each edge node in the available node list, and select the edge node with the fastest delay;

Within a set period, all interaction requests requiring short delays are sent to the selected edge nodes.

As a preferred implementation, the step of selecting an edge node for connection and initiating a request based on delay conditions and/or transmission protocols includes:

Use the corresponding transport protocol to connect multiple edge nodes in the available node list;

Obtain the latency of multiple edge nodes selected based on the corresponding transmission protocol, and select the edge node with the fastest latency as the preferred node;

Effectively use preferred nodes to maintain a long connection for a period of time, and perform ping-pong operations on temporarily abandoned edge nodes during the long connection;

Among them, the temporarily abandoned edge node still has messages returned. Once the message return and ping-pong operation are faster than the current preferred node, the long-term connection will be transferred to the temporarily abandoned edge node, and the original preferred node will be converted into a temporarily abandoned node. edge nodes.

As a preferred embodiment, the edge node that receives the user request parses the user request and schedules resources to the user based on the parsed content is specifically as follows:

The edge node that receives the user's request obtains the transmission protocol type of the user's request;

Use the preset parser to parse the corresponding request information according to the transmission protocol type and verify it;

After passing the verification, the edge node searches the nearest resource pool for resource information based on the parsed content;

Schedule resources in the resource pool to users.

On the other hand, the present invention also provides an edge node network data flow control system, including:

Edge nodes, servers and clients;

Users request edge node support services from nearby edge nodes through the client, and send their own characteristic information to the server;

The server selects a list of available nodes from all edge nodes that access the server based on the user's own characteristic information and the characteristic information of each edge node and returns it to the client that initiated the request;

The user initiates an access application to the edge node support service through the client, initiates a request to each edge node in the available node list to obtain the delay situation of the corresponding edge node, selects the edge node to connect and initiates the connection based on the delay situation and/or transmission protocol ask;

The edge node that receives the user request parses the user request and schedules resources to the client that initiated the request based on the parsed content.

In another aspect, the present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, any implementation of the present invention is implemented. The edge node network data flow control method described in the example.

On the other hand, the present invention also provides a computer-readable storage medium on which a computer program is stored, characterized in that when the program is executed by a processor, the edge node network data flow as described in any embodiment of the present invention is realized. Control Method.

The invention has the following beneficial effects:

1. This invention can control the specific node information that users can obtain. Nodes are screened and filtered during the control process. In this way, the device node content obtained by a user in a region and a time interval is always similar, protecting most nodes from relative safety. At the same time, the attacker's traffic is consumed in this way. It draws in the attacker's resource consumption and the resource consumption of the attacked, increasing the attacker's attack cost.

2. The present invention controls the newly created edge node to perform self-detection. After completing the self-detection, the newly created edge node is enabled and reported to the service support node. Self-testing can confirm the running status of the service and ensure that the node is available. At the same time, self-testing can determine whether the node is adapted to the current situation, so that service support nodes can be allocated more accurately.

3. Based on the edge node access service provided by the present invention, the nodes used can be continuously adjusted. It can not only continuously optimize our node structure by adding new nodes by discarding nodes with low usage rates, but also enable attackers to attack discarded nodes. In terms of IP, the security of most nodes is protected.

Description of the drawings

Figure 1 is a schematic flow chart of the method according to Embodiment 1 of the present invention;

Figure 2 is a schematic diagram of edge node support services in an embodiment of the present invention;

Figure 3 is a schematic diagram of edge node access services in an embodiment of the present invention;

Figure 4 is a schematic diagram of a user selectively selecting to connect to a single node in an embodiment of the present invention;

Figure 5 is a schematic diagram of a user selectively selecting nodes to maintain a long connection in an embodiment of the present invention;

Figure 6 is a schematic diagram of a node scheduling resources to users in an embodiment of the present invention.

Detailed ways

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without making creative efforts fall within the scope of protection of the present invention.

It should be understood that the step numbers used in the text are only for convenience of description and are not intended to limit the execution order of the steps.

It should be understood that the terminology used in the description of the present invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in this specification and the appended claims, the singular forms "a", "an" and "the" are intended to include the plural forms unless the context clearly dictates otherwise.

The terms "comprises" and "comprising" indicate the presence of described features, integers, steps, operations, elements and/or components but do not exclude the presence of one or more other features, integers, steps, operations, elements, components and/or The existence or addition to its collection.

The term "and/or" refers to any and all possible combinations of one or more of the associated listed items and includes such combinations.

Example 1:

Referring to Figure 1, this embodiment provides an edge node network data flow control method, which includes the following steps:

S100. The user requests edge node support services from the nearest edge node, and sends its characteristic information to the server; in this embodiment, the edge node support service is a set of broad interfaces, as long as the corresponding interface is supported. It can be called edge node support service. The content of this set of services mainly provides support for network data flow control. Specifically, the following content is provided:

Supports edge node acquisition of regional characteristics, automatic expansion detection of regions, information recording of edge nodes, and automatic balancing of different current edge nodes.

S200: The server selects a list of available nodes from all edge nodes that access the server based on the user's own characteristic information and the characteristic information of each edge node and returns it to the requester.

S300. The user initiates an access application to the edge node support service, initiates a request to each edge node in the available node list to obtain the delay situation of the corresponding edge node, selects the edge node to connect according to the delay situation and/or transmission protocol, and initiates the request. .

S400: The edge node that receives the user request parses the user request and schedules resources to the user according to the parsed content.

Specifically referring to Figure 2, as a preferred implementation of this embodiment, in step S200, the server selects an available node list from all edge nodes that access the server based on the user's own characteristic information and the characteristic information of each edge node. The specific steps to return to the requester are:

S201. The server performs weight calculation based on the user's own characteristic information and the characteristic information of each edge node, and initially selects edge nodes that meet the requirements and are within the preset weight range.

The calculation of the weight value is based on the weight of the configuration items configured on the client recorded in the user's own characteristic information and the weight values of different characteristic information recorded by the edge node; for example:

The user configures the allocation weight of the network segment IP address 172.16.0.0/24 on the client to be 100, the device weight of edge node 1 is allocated to 50, the device weight of edge node 2 is allocated to 50, and the server records the device weight of edge node 1 The allocation weight of the network segment IP address 172.16.0.0/24 is 100, the device weight of edge node 1 is 100, and the performance pressure of edge node 1 is 125%, and the special status weight is 0.05. Based on the above information, the comprehensive weight value of edge node 1 can be initially screened out as (100*100+100*50)*0.05=750. If it is within the weight range configured by the user on the client, edge node 1 will be included in the preliminary screening list.

The initially selected edge nodes represent those that can accept the user's data flow control tasks to a certain extent.

S202. The server obtains the load status of each edge node initially screened out. The load status determines whether the edge node is suitable for receiving the user's selection; performs secondary screening to filter out edge nodes whose load is at a preset ratio to prevent some popular nodes from being used in large quantities. User congestion causes node downtime. For example, filter out edge nodes with a load greater than 80%.

S203. Randomly select some edge nodes from the remaining edge nodes to form an available node list. This prevents a user from acquiring too many nodes at once, resulting in a waste of resources or being attacked. Moreover, random acquisition can also prevent an avalanche from encountering too many connections due to a certain node being excellent.

Based on the above steps, this embodiment can control the specific node information that the user can obtain. Nodes are screened and filtered during the control process. In this way, the device node content obtained by a user in a region and a time interval is always similar, protecting most nodes from relative safety. At the same time, the attacker's traffic is consumed in this way. It draws in the resource consumption of the attacker and the resource consumption of the attacked, increasing the attack cost of the attacker.

As a preferred implementation of this embodiment, the user's own characteristic information and the characteristic information of the edge node include:

Outbound IP address, preset weights supported by operators, preset weights supported by different types of network protocols, weights of recorded IP segments, and preset weights of each edge node's device. The edge node support service and the edge node access service each hold a copy of the above characteristic information, and the edge node access service reports it to the information edge node support service. In the calculation of the weight, the accessed edge node detects the network status of the environment and calculates the supported weight value. The edge node support service calculates the node content required by the customer based on the edge node and client configuration. The user's client obtains services through the delivered edge node.

In addition to edge node support services, this embodiment also develops edge node access services. The edge node access service provides services for traffic control. It provides detailed control on how to conduct traffic and is the boundary of our service support. Edge node access services specifically provide:

User access verification, user resource acquisition, access information feedback, edge node access configuration, ping-pong interfaces of different protocols, and persistence interfaces of different protocols.

Referring specifically to Figure 3, as a preferred implementation of this embodiment, the edge node includes a service support node;

The service support node is provided with an edge node access service;

When any newly created edge node appears, the newly created edge node reports its own characteristic information to the service support node; when the edge node is created, the device does not fully understand the characteristics of the node, so it needs to be informed by the node itself. The nodes reported for the first time will not be directly used and served, but need to be self-tested before they can be used.

The service support node sets up the newly created edge node access through the edge node access service and configures it so that it can quickly support the missing service types provided by the current edge node access service to users, such as edge node services with different transmission protocols. , Edge node services required by different network environments.

Control the newly created edge node to perform self-detection. After completing the self-detection, enable the newly created edge node and report it to the service support node. Self-testing can confirm the running status of the service and ensure that the node is available. At the same time, self-testing can determine whether the node is adapted to the current situation, so that service support nodes can be allocated more accurately.

Based on the edge node access service provided by this embodiment, we can continuously adjust the nodes we use. Not only can we continuously optimize our node structure by discarding nodes with low utilization rates and adding new nodes, but also allow attackers to attack discarded nodes. In terms of IP, the security of most nodes is protected.

As an implementation manner, step S300 is specifically:

S301. The user initiates an application for access information to the edge node support service and obtains a list of available nodes.

S302. The user requests each edge node in the available node list to obtain the delay information of each edge node.

S303. The user selects a better edge node or connects all edge nodes according to different protocols and policies.

S304. The user makes a request for the comprehensive optimal edge node.

S305. Repeat the above S301~S304 processes at intervals during use. To dynamically adapt to users' potentially changing network environments.

Specifically referring to Figure 4, as an implementation manner, when dealing with scenarios requiring segment delay, the user can choose to connect to a single edge node. In this case, step S300 specifically includes:

S311. The user initiates an application for access information to the edge node support service and obtains a list of available nodes.

S312. Obtain the delay status of each edge node in the available node list, and select the edge node with the fastest delay.

S313. Within the set period, send all interaction requests requiring short delay to the selected edge node.

S314. Repeat the above steps S311 to S313.

Specifically referring to Figure 5, as an implementation manner, when dealing with a scenario requiring segment delay, the user can select one of the edge nodes to maintain a long connection. In this case, step S300 specifically includes:

S321. The user initiates an application for access information to the edge node support service and obtains a list of available nodes.

S322. Use the corresponding transmission protocol to connect multiple edge nodes in the available node list.

S323. Obtain the delay conditions of multiple selected edge nodes based on the corresponding transmission protocol.

S324. Select an edge node with the fastest delay as the preferred node.

S325. Effectively use the preferred node to maintain a long connection within a period of time, and perform a ping-pong operation on the temporarily abandoned edge node during the long connection period.

S326. Repeat the above-mentioned steps S323 to S325 for a single long connection, and repeat the above-mentioned steps S321 to S323 for multiple long connections.

S327. Among them, the temporarily abandoned edge node still has messages returned. Once the message return and ping-pong operation are faster than the current preferred node, the long connection will be transferred to the temporarily abandoned edge node, and the original preferred node will be converted into Temporarily abandoned edge nodes.

Based on the different implementations of the above step S300, this embodiment provides a variety of connection offloading solutions, which provide users with a faster and lower-latency connection method. And users can decide whether they need to use the traffic-for-delay solution.

Referring specifically to Figure 6, as a preferred implementation of this embodiment, in step S400, the edge node that receives the user request parses the user request and schedules resources to the user according to the parsed content is specifically as follows:

S401. Users may request edge nodes through protocols such as udp, quic, tcp, http, websocket, etc., and the edge node that receives the user's request obtains the transmission protocol type of the request initiated by the user.

S402. The edge node uses a preset parser to parse the corresponding request information according to the transmission protocol type and perform verification as needed; specifically, UDP, QUIC, and TCP will quickly determine whether the IP protocol header information is legal. HTTP and WebSocket will further verify whether the header information is legal.

S403. After the verification is passed, the edge node searches the nearest resource pool for resource information based on the parsed content; UDP, QUIC, and TCP connection requests will reuse Socket and forward the data to the resource pool where it is located. WebSockets that require long-term connections will be forwarded. When the user initiates a request for the first time after access, the connection will be triggered and forwarded. Otherwise only a connectability check is performed.

S404. Schedule the resources in the resource pool to the user.

Based on the above steps, the information sent by the user is processed and invalid information is filtered out. Prevent invalid client data from connecting to the real server and interfering with the normal operation of the service.

Example 2:

This embodiment provides an edge node network data flow control system, including:

Edge nodes, servers and clients;

The user requests edge node support services from the nearest edge node through the client, and sends its own characteristic information to the server; this part is used to implement the function of step S100 in the first embodiment, and will not be described again here;

The server selects a list of available nodes from all edge nodes that access the server based on the user's own characteristic information and the characteristic information of each edge node and returns it to the client that initiated the request; this part is used to implement the function of step S200 in Embodiment 1. , which will not be described in detail here;

The user initiates an access application to the edge node support service through the client, initiates a request to each edge node in the available node list to obtain the delay situation of the corresponding edge node, selects the edge node to connect and initiates the connection based on the delay situation and/or transmission protocol Request; This part is used to implement the function of step S300 in Embodiment 1, and will not be described again here;

The edge node that receives the user's request parses the user's request, and dispatches resources to the client that initiated the request based on the parsed content; this part is used to implement the function of step S400 in Embodiment 1, and will not be described again here.

Embodiment three:

This embodiment proposes an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the method described in any embodiment of the present invention. Edge node network data flow control method.

Embodiment 4:

This embodiment provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the edge node network data flow control method as described in any embodiment of the present invention is implemented.

In the embodiments of this application, "at least one" refers to one or more, and "multiple" refers to two or more. "And/or" describes the relationship between associated objects, indicating that there can be three relationships. For example, A and/or B can represent the existence of A alone, the existence of A and B at the same time, or the existence of B alone. Where A and B can be singular or plural. The character "/" generally indicates that the related objects are in an "or" relationship. "At least one of the following" and similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b and c can mean: a, b, c, a and b, a and c, b and c or a and b and c, where a, b, c can be single, also Can be multiple.

Those of ordinary skill in the art can realize that each unit and algorithm step described in the embodiments disclosed herein can be implemented by a combination of electronic hardware, computer software, and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each specific application, but such implementations should not be considered beyond the scope of this application.

Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working processes of the systems, devices and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be described again here.

In the several embodiments provided in this application, if any function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the existing technology or the part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of this application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (Read-Only Memory; hereafter referred to as: ROM), random access memory (Random Access Memory; hereafter referred to as: RAM), magnetic disk or optical disk, etc., which can store programs The medium of the code.

The above are only examples of the present invention, and do not limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made by using the description and drawings of the present invention, or directly or indirectly applied to other related technologies fields are equally included in the scope of patent protection of the present invention.

Claims (10)

1. An edge node network data flow control method, characterized by including the following steps: Users request edge node support services from nearby edge nodes and send their own characteristic information to the server; The server selects a list of available nodes from all edge nodes connected to the server based on the user's own characteristic information and the characteristic information of each edge node and returns it to the requester; The user initiates an access application to the edge node support service, initiates a request to each edge node in the available node list to obtain the delay situation of the corresponding edge node, selects the edge node to connect and initiates the request based on the delay situation and/or transmission protocol; The edge node that receives the user request parses the user request and schedules resources to the user based on the parsed content. 2. An edge node network data flow control method according to claim 1, characterized in that the server selects edge nodes from all edge nodes that access the server based on the user's own characteristic information and the characteristic information of each edge node. The specific steps for returning the available node list to the requester are: The server performs weight calculation based on the user's own characteristic information and the characteristic information of each edge node, and initially selects edge nodes that meet the preset weight range; Obtain the load status of each edge node initially screened out, and filter out edge nodes whose load is at a preset ratio; Randomly select some edge nodes from the remaining edge nodes to form an available node list. 3. An edge node network data flow control method according to claim 1, characterized in that the user's own characteristic information and the characteristic information of the edge node include: Outbound IP address, preset weights supported by operators, preset weights supported by different types of network protocols, weights of recorded IP segments, and preset weights of each edge node's device. 4. An edge node network data flow control method according to claim 1, characterized in that: The edge node includes a service support node; The service support node is provided with an edge node access service; When any newly created edge node appears, the newly created edge node reports its own characteristic information to the service support node; The service support node sets the newly created edge node access through the edge node access service, and controls the newly created edge node to perform self-detection. After completing the self-detection, the newly created edge node is enabled. 5. An edge node network data flow control method according to claim 1, characterized in that the step of selecting an edge node for connection and initiating a request according to delay conditions and/or transmission protocols includes: Obtain the delay of each edge node in the available node list, and select the edge node with the fastest delay; Within a set period, all interaction requests requiring short delays are sent to the selected edge nodes. 6. An edge node network data flow control method according to claim 1, characterized in that the step of selecting an edge node for connection and initiating a request according to delay conditions and/or transmission protocols includes: Use the corresponding transport protocol to connect multiple edge nodes in the available node list; Obtain the latency of multiple edge nodes selected based on the corresponding transmission protocol, and select the edge node with the fastest latency as the preferred node; Effectively use preferred nodes to maintain a long connection for a period of time, and perform ping-pong operations on temporarily abandoned edge nodes during the long connection; Among them, the temporarily abandoned edge node still has messages returned. Once the message return and ping-pong operation are faster than the current preferred node, the long-term connection will be transferred to the temporarily abandoned edge node, and the original preferred node will be converted into a temporarily abandoned node. edge nodes. 7. An edge node network data flow control method according to claim 1, characterized in that the edge node that receives the user request parses the user request, and the step of scheduling resources to the user according to the parsed content is specifically: The edge node that receives the user's request obtains the transmission protocol type of the user's request; Use the preset parser to parse the corresponding request information according to the transmission protocol type and verify it; After passing the verification, the edge node searches the nearest resource pool for resource information based on the parsed content; Schedule resources in the resource pool to users. 8. An edge node network data flow control system, characterized by including: Edge nodes, servers and clients; Users request edge node support services from nearby edge nodes through the client, and send their own characteristic information to the server; The server selects a list of available nodes from all edge nodes that access the server based on the user's own characteristic information and the characteristic information of each edge node and returns it to the client that initiated the request; The user initiates an access application to the edge node support service through the client, initiates a request to each edge node in the available node list to obtain the delay situation of the corresponding edge node, selects the edge node to connect and initiates the connection based on the delay situation and/or transmission protocol ask; The edge node that receives the user request parses the user request and schedules resources to the client that initiated the request based on the parsed content. 9. An electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that when the processor executes the program, it implements any one of claims 1 to 7 The edge node network data flow control method described in the item. 10. A computer-readable storage medium with a computer program stored thereon, characterized in that when the program is executed by a processor, the edge node network data flow control method according to any one of claims 1 to 7 is implemented.