Request processing method and apparatus, storage medium and electronic device

Abstract

A request processing method and apparatus, a storage medium, and an electronic device. The request processing method comprises: receiving an access point acquisition request of a client, the access point acquisition request comprising client information; traversing preset rules, matching the preset rules with the client information, and determining unavailable edge nodes corresponding to the client, the preset rules comprising correspondences between the client information and the unavailable edge nodes; removing the unavailable edge nodes from among candidate edge nodes to obtain available edge nodes of the client, and determining at least one target edge node suitable for the client from among the available edge nodes; and issuing node information of the target edge node to the client, such that the client establishes a connection with the target edge node. The method can reduce access failures and retries in the process of a client accessing edge nodes, and improve the access success rate and access efficiency of the client.

Description

Request processing method, device, storage medium and electronic device

[0001] This application claims priority to Chinese Patent Application No. 202410168078.8 filed on February 5, 2024, and the contents of the above-mentioned Chinese patent application disclosure are hereby incorporated by reference in their entirety as a part of this application. Technical Field

[0002] Embodiments of the present disclosure relate to a request processing method, device, storage medium, and electronic device. Background Art

[0003] In streaming media transmission scenarios, the quality of client access to edge nodes is a key factor affecting the performance of client streaming. Edge node failures can lead to client streaming failures. The global network environment is complex, and the level of infrastructure construction varies widely across regions. Failures of individual edge nodes or entire data centers are common.

[0004] If an edge node fails, the client will fail to establish a connection with the edge node and will try again with other edge nodes until it successfully connects to one. This process may require multiple retries before the client can successfully connect, resulting in a low connection success rate and inefficient connection establishment, further increasing client wait times and impacting user experience. Summary of the Invention

[0005] The present disclosure provides a request processing method, device, storage medium and electronic device to improve the connection success rate and connection efficiency between a client and an edge node, thereby improving user experience.

[0006] In a first aspect, an embodiment of the present disclosure provides a request processing method, including:

[0007] receiving an access point acquisition request from a client, wherein the access point acquisition request includes the client information;

[0008] Traversing preset rules, matching the client information based on the preset rules, and determining an unavailable edge node corresponding to the client; the preset rules include a correspondence between the client information and the unavailable edge node;

[0009] Remove the unavailable edge nodes from the candidate edge nodes to obtain available edge nodes for the client, and determine at least one target edge node suitable for the client from the available edge nodes;

[0010] The node information of the target edge node is sent to the client, so that the client establishes a connection with the target edge node.

[0011] In a second aspect, an embodiment of the present disclosure further provides a request processing device, including:

[0012] A request receiving module, configured to receive an access point acquisition request from a client, wherein the access point acquisition request includes the client information;

[0013] An edge node removal module, configured to traverse preset rules, match the client information with the preset rules, and determine an unavailable edge node corresponding to the client; the preset rules include a correspondence between the client information and the unavailable edge node;

[0014] a target edge node determination module, configured to remove the unavailable edge nodes from the candidate edge nodes to obtain available edge nodes for the client, and determine at least one target edge node suitable for the client from the available edge nodes;

[0015] The node information sending module is used to send the node information of the target edge node to the client, so that the client can establish a connection with the target edge node.

[0016] In a third aspect, an embodiment of the present disclosure further provides an electronic device, the electronic device comprising:

[0017] one or more processors;

[0018] a storage device for storing one or more programs,

[0019] When the one or more programs are executed by the one or more processors, the one or more processors implement the request processing method provided by any embodiment of the present disclosure.

[0020] In a fourth aspect, an embodiment of the present disclosure further provides a storage medium containing computer-executable instructions, which, when executed by a computer processor, are used to execute the request processing method provided in any embodiment of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] The above and other features, advantages, and aspects of the various embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and that the originals and elements are not necessarily drawn to scale.

[0022] FIG1 is a schematic diagram of an application scenario provided by an embodiment of the present disclosure;

[0023] FIG2 is a schematic diagram of the process of establishing a connection between client A and an edge node;

[0024] FIG3 is a flowchart of a request processing method provided by an embodiment of the present disclosure;

[0025] FIG4 is a schematic diagram of a first rule generation process provided by an embodiment of the present disclosure;

[0026] FIG5 is a schematic diagram of a second rule generation process provided by an embodiment of the present disclosure;

[0027] FIG6 is a schematic diagram of edge node offline processing provided by an embodiment of the present disclosure;

[0028] FIG7 is a schematic structural diagram of a request processing device provided by an embodiment of the present disclosure; and

[0029] FIG8 is a schematic structural diagram of an electronic device provided by an embodiment of the present disclosure. DETAILED DESCRIPTION

[0030] The following describes embodiments of the present disclosure in more detail with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as limited to the embodiments described herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of protection of the present disclosure.

[0031] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.

[0032] As used herein, the term "including" and its variations are open-ended, i.e., "including but not limited to." The term "based on" means "based, at least in part, on." The term "one embodiment" means "at least one embodiment," the term "another embodiment" means "at least one additional embodiment," and the term "some embodiments" means "at least some embodiments." Other terms are defined in the following description.

[0033] It should be noted that the concepts of "first" and "second" mentioned in this disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0034] It should be noted that the modifications of "one" and "multiple" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, they should be understood as "one or more".

[0035] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0036] It is understandable that before using the technical solutions disclosed in the various embodiments of this disclosure, the type, scope of use, usage scenarios, etc. of the personal information involved in this disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.

[0037] For example, in response to a user's active request, a prompt message is sent to the user to clearly inform the user that the operation requested will require the acquisition and use of the user's personal information. This allows the user to independently choose whether to provide personal information to the electronic device, application, server, storage medium, or other software or hardware that performs the operations of the disclosed technical solution based on the prompt message.

[0038] As an optional but non-limiting implementation, in response to receiving a user's active request, the prompt information may be sent to the user in the form of a pop-up window, in which the prompt information may be presented in text form. Furthermore, the pop-up window may also contain a selection control for the user to select "agree" or "disagree" to provide personal information to the electronic device.

[0039] It is understandable that the above notification and user authorization process are merely illustrative and do not limit the implementation of the present disclosure. Other methods that comply with relevant laws and regulations may also be applied to the implementation of the present disclosure.

[0040] It is understandable that the data involved in this technical solution (including but not limited to the data itself, the acquisition or use of the data) must comply with the requirements of relevant laws, regulations and relevant provisions.

[0041] For example, refer to Figure 1, which is a schematic diagram of an application scenario provided by an embodiment of the present disclosure. In a streaming media transmission scenario, taking the streaming media transmission scenario as real-time communication as an example, the first client and the second client performing communication respectively access the edge nodes under the real-time communication system, and data can be transmitted between the edge nodes to realize communication between different clients. Among them, the edge node is the minimum granularity of scheduling in the real-time communication scenario, generally a machine, and the scheduling system of the real-time communication scenario includes multiple IDC (Internet Data Center) computer rooms, and each IDC computer room may include multiple edge devices. It can be understood that the clients performing real-time communication can be two or more, and Figure 1 is only an example, for example, a voice communication scenario between two clients, a video communication scenario, or a conference scenario between multiple clients.

[0042] In the case where any client requests an access point from the scheduling component, the scheduling component determines a preset number of target edge nodes from the candidate edge nodes, and sends the target edge nodes to the client. Among them, the candidate edge nodes may be all edge nodes included in multiple IDC computer rooms, and the target edge nodes may be screened after quality assessment among the candidate edge nodes. The preset number of target edge nodes may belong to at least two IDC computer rooms. Exemplarily, edge nodes node1 and node2 are sent to the client, see Figure 2, which is a schematic diagram of the connection process between client A and the edge node. Specifically, client A accesses edge node node1. Due to a fault in edge node node1, client A fails to access. Client A automatically retries to access edge node node2. If the client successfully accesses edge node node2, the access process is completed. If both edge node node1 and edge node node2 fail, client A requests a new access point from the scheduling component again and tries to access until the access is successful.

[0043] The process of client accessing edge nodes involves retry overhead. If a large number of nodes fail, the nodes dispatched by the scheduling component may all be faulty. The client will then need to request the scheduling component multiple times and retry the connection, further increasing the connection time. Because clients cannot share information, each client must perform multiple retries before successfully connecting to the edge node. This reduces the connection success rate for a large number of clients and increases the connection time.

[0044] In response to the above technical problems, an embodiment of the present disclosure provides a request processing method. See Figure 3. Figure 3 is a flow chart of a request processing method provided by an embodiment of the present disclosure. The embodiment of the present disclosure is applicable to situations where requests are made by the client. The method can be executed by a request processing device, which can be implemented in the form of software and / or hardware. Optionally, it can be implemented by an electronic device, which can be a computer or a server, etc. The above electronic device can serve as a scheduling end. Optionally, a scheduling component can be deployed in the above electronic device to respond to the client's request; optionally, a scheduling analysis component can also be deployed in the above electronic device to receive feedback information from the client, generate and maintain preset rules, and the preset rules are used to describe the correspondence between client information and unavailable edge nodes.

[0045] As shown in FIG3 , the method includes:

[0046] S110: Receive an access point acquisition request from a client, where the access point acquisition request includes the client information.

[0047] S120 , traversing preset rules, matching the client information based on the preset rules, and determining an unavailable edge node corresponding to the client; the preset rules include a correspondence between the client information and the unavailable edge node.

[0048] S130: Remove the unavailable edge nodes from the candidate edge nodes to obtain available edge nodes for the client, and determine at least one target edge node suitable for the client from the available edge nodes.

[0049] S140: Send the node information of the target edge node to the client, so that the client establishes a connection with the target edge node.

[0050] In response to a communication operation, the client sends an access point acquisition request to the calling component. The access point acquisition request is used to request edge node information from the scheduling end (e.g., the scheduling component). For example, the communication operation can be a triggering operation of a communication control on a communication page, wherein the communication page can be an instant messaging page or a conference page.

[0051] The access point acquisition request sent by the client includes client information, which may be information used to uniquely identify the client, including client location information, network type information, and client unique identifier. The network type information may be the type of network service provider of the client.

[0052] The scheduling analysis component receives historical connection information between multiple clients and edge nodes, generates preset rules, and synchronizes the preset rules to the scheduling component. The scheduling component stores multiple preset rules, where the preset rules are information used to describe the failure status of edge nodes. Each preset rule includes a correspondence between client information and unavailable edge nodes, indicating that the unavailable edge node is in a failure state relative to the client corresponding to the client information. For example, the preset rule can be Client A - Edge Node 1-1, indicating that for Client A, Edge Node 1-1 is in a failure state.

[0053] Optionally, the client information in the preset rule may be a single client information or a set of client information; and / or the unavailable edge node in the preset rule may be a single edge node or a set of edge nodes. Accordingly, the preset rule may include one or more of a rule for a single client information and a single edge node, a many-to-one rule for a set of client information and a single edge node, a rule for a set of client information and a set of edge nodes, or a one-to-many rule for a single client information and a set of edge nodes.

[0054] Among them, the client information set can be a client information class, that is, a class of client information obtained by clustering. The preset rules are determined based on the historical connection information of a large number of clients, and the preset rules are generated based on the historical connection information of failed connections. Specifically, for non-common historical connection information, point-to-point rules can be generated, and for historical connection information with common information, one or more of many-to-one rules, many-to-many rules and one-to-many rules can be generated. Among them, the common information can be obtained by clustering the historical connection information.

[0055] Each preset rule is traversed, and the client information in the access point acquisition request is matched with each preset rule. Specifically, the client information in the access point acquisition request is matched with the client information in the preset rule. If the client information in the preset rule includes the client information in the access point acquisition request, it is determined that the client information in the access point acquisition request successfully matches the preset rule, that is, the client information in the access point acquisition request hits the preset rule. If the client information hits the preset rule, all edge nodes in the preset rule are determined to be unavailable edge nodes corresponding to the client. A single piece of client information can hit one or more preset rules.

[0056] In some embodiments, the preset rules in the scheduling component include a first rule and a second rule, and accordingly, the client information in the access point acquisition request is matched with each of the first rules, and the client information in the access point acquisition request is matched with each of the second rules to determine the unavailable edge node corresponding to the client. Specifically, determining the unavailable edge node corresponding to the client based on matching the preset rules with the client information includes: matching the client information in the access point acquisition request with the client information in each of the first rules, and if a match is successful, determining the edge node in the first rule as the unavailable edge node corresponding to the client; and / or matching the client information in the access point acquisition request with the client information class in the second rule, and if the client information in the access point acquisition request belongs to the client information class, determining the edge node in the edge node set in the second rule as the unavailable edge node corresponding to the client.

[0057] For the first rule, if the client information in the access point acquisition request is consistent with the client information in the first rule, then the match is determined to be successful, and the edge node in the first rule is determined to be the unavailable edge node corresponding to the client. For the second rule, the second rule includes a client information class, and determines whether the client information in the access point acquisition request belongs to the client information class. If so, then the match is determined to be successful, and the multiple edge nodes in the edge node set of the second rule are all determined to be the unavailable edge nodes corresponding to the client. Exemplarily, the client information in the access point acquisition request is Beijing operator A client A, and the preset rules included in the scheduling component include first rule 1, first rule 2, and second rule 3, wherein first rule 1 is Beijing operator A client A-Beijing IDC1 edge node 111, first rule 2 is Tianjin operator B client B-Beijing IDC1 edge node 222, and second rule 3 is Beijing operator A-Beijing IDC2. Beijing operator A client A is matched with each preset rule in the scheduling component respectively. It can be seen that Beijing operator A client A successfully matches the first rule 1, and Beijing IDC1 edge node 111 is determined as the unavailable edge node of the requesting client (i.e. Beijing operator A client A); Beijing operator A client A fails to match the first rule 2; Beijing operator A client A belongs to the client information class of Beijing operator A, that is, Beijing operator A client A successfully matches the second rule 3, and all edge nodes belonging to the Beijing IDC2 edge node set (i.e. all edge nodes located in the Beijing IDC2 computer room) are determined as unavailable edge nodes of the requesting client (i.e. Beijing operator A client A).

[0058] The scheduling component determines the unavailable edge nodes corresponding to the client using preset rules, removes these unavailable edge nodes from the candidate nodes, and obtains the available edge nodes corresponding to the client. The candidate nodes include all edge nodes in each computer room. It will be understood that the preset rules are used to describe the unavailable edge nodes for specific client information. Accordingly, different clients may correspond to different unavailable edge nodes, and thus, different available edge nodes may also correspond to different clients.

[0059] The scheduling component determines at least one target edge node for the client from the available edge nodes corresponding to the client. Optionally, the available edge nodes corresponding to the client may be evaluated for access quality, evaluation data for each available edge node may be obtained, the available edge nodes corresponding to the client may be ranked based on the evaluation data, and a preset number of edge nodes may be selected as target edge nodes based on the ranking of the edge nodes. Exemplarily, the evaluation data for the available edge nodes may be obtained by performing weighted processing based on the distance between the location information of the available edge nodes and the location information of the client, the available resources of the available edge nodes, the number of clients connected to the available edge nodes, etc. Exemplarily, the node information of the available edge nodes and the client information may be input into an evaluation model to obtain the evaluation data of the available edge nodes output by the evaluation model. It is understood that the evaluation data of the available edge nodes may be specific to the client, and the evaluation data of the same edge node may be different for different clients.

[0060] The number of target edge nodes can be pre-set, and can be two or three, etc. By determining multiple target edge nodes, the process of repeatedly requesting the scheduling component when a single target edge node is inaccessible is avoided.

[0061] The scheduling component sends the node information of the target edge node to the client, and the client automatically connects based on the received node information of the target edge node. Optionally, the client sends connection requests to multiple target edge nodes in parallel to establish connections with the target edge nodes. The client receives the connection results fed back by the target edge nodes. The connection results can be either a successful connection or a failed connection. The client can transmit data to any successfully connected target edge node, or the client can transmit data to the target edge node that establishes the fastest connection.

[0062] In the case that multiple target edge nodes fail to connect, an access point acquisition request is resent to the scheduling component to obtain node information of a new target edge node.

[0063] The client generates association information based on the association result of each target edge node, the node information of the target edge node and the client information, and sends the association information to the scheduling end, such as the scheduling analysis component of the scheduling end, to update the preset rules.

[0064] The technical solution of the disclosed embodiment creates and maintains preset rules based on the connection information of multiple clients at the scheduling end, and describes the correspondence between client information and unavailable edge nodes through the preset rules. When a client requests an access point, the client information in the access point acquisition request is parsed, and the unavailable edge node corresponding to the client is determined based on the matching of the client information in the access point acquisition request with the preset rules. The unavailable edge node is removed from the candidate nodes, and the target edge node is determined from the obtained available edge nodes. This reduces the probability of a faulty edge node among the target edge nodes sent to the client, improves the availability of the target edge node, and reduces access failures and retries during the client's access to the edge node, thereby achieving the effect of improving the client access success rate and access efficiency.

[0065] Based on the above embodiment, the method for generating the first rule includes: receiving the client's connection information, the connection information including client information, edge node information and connection results; when the connection result is a connection failure, generating the first rule based on the client information and the edge node information.

[0066] After establishing a connection with a target edge node and receiving feedback on the connection result from the target edge node, each client generates connection information and reports it to the dispatcher in real time. The dispatcher receives connection information reported by multiple clients and generates new preset rules or updates existing preset rules based on the received connection information.

[0067] Identify the connection result in the connection information. When the connection result is a connection failure, establish a first connection rule based on the client information and edge node information in the connection information, that is, establish an association relationship between the client information and edge node information in the connection information as a first rule.

[0068] For example, refer to Figure 4, which is a schematic diagram of the first rule generation process provided by an embodiment of the present disclosure. In Figure 4, client A fails to establish a connection with edge node 1, and client A successfully establishes a connection with edge node 2. The scheduling end (scheduling analysis component) receives the connection information uploaded by client A and generates the first rule between client A and edge node 1. In the case that client A sends an access point acquisition request again, by matching the first rule, it can be determined that edge node 1 is the unused edge node corresponding to client A, and edge node 1 is removed from the candidate nodes, and the node information of edge node 1 is no longer sent to client A, so as to avoid the situation where client A accesses edge node 1 again and causes connection failure.

[0069] In this embodiment, by generating the first rule based on the historical connection information of the client, in subsequent requests from the client, edge nodes that failed to establish connection are no longer sent, thereby reducing the number of connection failures.

[0070] On the basis of the above embodiment, the method for generating the second rule includes: receiving connection information from multiple clients, wherein the connection information includes client information, edge node information and connection results; regularly clustering the connection information within a preset time period to obtain clustering results, and generating the second rule based on the clustering results. Among them, the update time interval of the second rule can be preset, for example, it can be 30s, 1 minute, etc. The scheduling end maintains an information pool, which is used to store the connection information reported by the client. Each connection information carries a reporting timestamp, and the connection information in the information pool is maintained based on the reporting timestamp of the connection information. Optionally, the time interval between the reporting timestamp of the connection information in the information pool and the current moment is less than the preset time interval. When the time interval between the reporting timestamp of the connection information and the current moment exceeds the preset time interval, the connection information is deleted from the information pool to avoid the situation where the historical connection information does not match the status of the current edge node, affecting the accuracy of the obstacle avoidance information.

[0071] The second rule is updated regularly based on the connection information in the information pool, that is, the connection information in the information pool is clustered to obtain clustering results, and the second rule is generated based on the clustering results. Specifically, the correspondence between the client information and the edge node information in the connection information can be clustered. Optionally, multiple dimensions are set for the correspondence between the client information and the edge node information. For example, the clustering dimension of the client information includes the location dimension and the network type dimension, wherein the location dimension can be a location range including different levels, and the location range can include but is not limited to the range of district (county), city, province, country, etc. The network type dimension includes but is not limited to the network provider type of operator A, operator B, mobile, etc. The clustering dimension of the edge node information includes the edge node dimension and the computer room dimension.

[0072] Based on the clustering dimensions corresponding to the client information and edge node information respectively, the connection information is clustered in multiple dimensions to obtain multiple clustering results. The clustering result includes multiple classes, each class includes a client information class and an edge node information class. For example, one class in the clustering result may be City 1-Operator A-Computer Room 1. Optionally, the connection information is clustered based on a preset clustering algorithm to obtain the connection information included in each class, thereby obtaining a clustering result. Optionally, descriptive information of multiple classes is pre-set, namely, a client information class and an edge node information class, and the client information and edge node information in the connection information are matched with the descriptive information of each class respectively. When the client information belongs to the client information class of the first class, and the edge node information belongs to the edge node information class of the first class, it is determined that the connection information belongs to the first class, and the connection information is added to the information set of the first class.

[0073] The clustering results include the information sets corresponding to each category, and the proportion of connection results in the information sets corresponding to each category, i.e., the proportion of connection failures, is counted. For any category, if the proportion of connection failures in the connection results between the client information category and the edge node information category exceeds a first threshold, a second rule is generated based on the client information category and the edge node information category, where the edge node information category corresponds to an edge node set.

[0074] The first threshold may be pre-set, for example, 50%. When the connection failure ratio exceeds the first threshold, it indicates that the connection success rate between the client information class and the edge node information class is low. A second rule is generated based on the client information class and the edge node information class, and the edge nodes in the edge node set corresponding to the edge node information class are no longer sent to clients belonging to the client information class, thereby reducing the number of connection failures.

[0075] For example, refer to Figure 5, which is a schematic diagram of the second rule generation process provided by an embodiment of the present disclosure. The dotted line in Figure 5 represents a connection failure, and the solid line represents a connection success, that is, the client belonging to the client information class of Beijing operator A in Figure 5 cannot access the edge node in the computer room of Beijing IDC1. When the scheduling analysis component receives the connection information reported by the client, it generates a second rule based on the clustering processing of the connection information, namely Beijing operator A-Beijing IDC1. The scheduling analysis component synchronizes the generated second rule to the scheduling component. When the scheduling component receives the access point acquisition request from the client, if the client information in the access point acquisition request belongs to the client information class of Beijing operator A, the edge node in the edge node set corresponding to Beijing IDC1 is determined as the unavailable edge node corresponding to the client.

[0076] A second rule is generated based on the connection information provided by local clients. For a client that has not provided any connection information or has provided very little, if the client successfully matches the second rule, the second rule can be used to identify multiple unavailable edge nodes corresponding to the client, effectively sharing the connection information provided by the client. Many-to-many obstacle avoidance can cover a large number of clients. In the event of an edge data center failure, generating many-to-many rules can quickly relocate a batch of clients away from all nodes in the faulty data center.

[0077] Optionally, after generating the second rule, determine whether the second rule overlaps with the first rule, that is, determine whether the client information in the first rule belongs to the client information class in the second rule, and whether the edge node in the first rule belongs to the edge node set in the second rule. If the client information in the first rule belongs to the client information class in the second rule, and the edge node in the first rule belongs to the edge node set in the second rule, it indicates that the first rule overlaps with the second rule, and the first rule can be deleted to avoid the existence of overlapping preset rules, reduce the number of preset rules, and reduce the matching calculation amount of the preset rules. Exemplarily, the first rule can be Beijing operator A client A-Beijing IDC1 edge node 1, and the second rule can be Beijing operator A-Beijing IDC1. When receiving the access point acquisition request of Beijing operator A client A, all edge nodes in Beijing IDC1 can be determined as unavailable edge nodes through the second rule, including Beijing IDC1 edge node 1, and the first rule that overlaps with the second rule can be deleted.

[0078] On the basis of the above embodiments, the reasons for the unavailability of the edge node may be line failure reasons and equipment failure reasons of the edge node, wherein the edge node may correspond to multiple lines, and in the event of a failure in any line, it will not affect the normal operation of other lines. For example, for the edge node in the Beijing IDC1 computer room, in the event of a line failure of operator A, the line of operator B can operate normally, that is, for the client of operator A, the edge node in the Beijing IDC1 computer room is an unavailable edge node, and for the client of operator B, the edge node in the Beijing IDC1 computer room is an available edge node. The unavailability of the edge node caused by line failure can be circumvented by the second rule. The equipment failure causes all clients to be unable to establish a connection with the edge node. The equipment failure cause may be a failure of a certain edge device or a failure in the computer room.

[0079] In the event of a device failure, the failed edge device is taken offline to reduce connection failures. Device failure can be determined based on the number of second rules. Optionally, if the number of second rules corresponding to the same edge node set exceeds a second threshold, the edge nodes in the edge node set are taken offline. The edge node set may include at least one edge node. The second threshold may be pre-set, for example, 4 or 5.

[0080] Optionally, when the number of second rules corresponding to the same edge node set exceeds the second threshold, determine whether the multiple second rules corresponding to the same edge node set cover different network types. If so, the edge nodes in the edge node set are offline. The offline processing can be implemented by generating a second rule for all clients and edge node sets. For example, refer to Figure 6, which is a schematic diagram of the offline processing of edge nodes provided by an embodiment of the present disclosure. The second rules of the edge node set Beijing IDC1 in Figure 6 include: Beijing operator A-Beijing IDC1, Beijing operator B-Beijing IDC1, Tianjin operator A-Beijing IDC1 (only as an example). When the number of second rules corresponding to Beijing IDC1 reaches or exceeds the second threshold, the edge nodes in Beijing IDC1 are offline, and the second rule of all clients-Beijing IDC1 is set.

[0081] On the basis of the above embodiment, after the preset rules are generated, prompt information is generated based on the preset rules to prompt the user to inspect and maintain the edge nodes. Exemplarily, the edge nodes that have been offline can be put back online after maintenance. In view of the above situation, an effective period is set for the preset rules. The preset rules are valid within the effective period. After the effective period is exceeded, the preset rules become invalid and the invalid preset rules can be deleted. The scheduling analysis component can manage the preset rules and synchronize the preset rules that are updated in real time to the scheduling component. Optionally, the effective period of the first rule and the second rule are the same or different. Exemplarily, the effective period of the first rule can be 2 hours.

[0082] Accordingly, after the preset rule is generated, the validity period of the preset rule is determined; if the validity period of the preset rule reaches the validity period, the preset rule is deleted. For example, a timer may be set for each preset rule to record the validity period of the preset rule. For example, each preset rule may be set to generate a timestamp, and the validity period of the preset rule is determined based on the generation timestamp and the current time.

[0083] By setting the validity period of the preset rules, the impact of the preset rules on the restored edge nodes can be avoided.

[0084] On the basis of the above embodiment, the failure of the client to establish a connection with the edge node may be an accidental event, or the failure of the edge node may have been repaired within the effective period, that is, there is a probability that the edge node corresponding to the preset rule has resumed normal operation within the effective period. In order to verify the operation of the edge node within the effective period, the preset rule can be set with an effective strength, and the effective strength gradually decreases within the effective period, wherein the effective strength is used to describe the probability that the preset rule is effectively implemented within the effective period. Exemplarily, the effective strength of the preset rule can be a value between 0-100%, and an effective strength of 100% indicates that the preset rule is 100% effective, and an effective strength of 50% indicates that the preset rule is 50% effective, that is, there is a 50% probability that it is not affected by the preset rule. When the client hits the preset rule, there is a 50% probability that the edge node in the preset rule will be used as an available edge node. An effective strength of 0% indicates that the preset rule is invalid and the preset rule can be deleted.

[0085] Set multiple time points for the validity period, and degrade the effective strength at each time point. For example, at the first time point, the effective strength can be adjusted from 100% to 99%, at the second time point, the effective strength can be adjusted from 99% to 75%, and so on. The adjustment value at different time points can be different, and the adjustment value can be positively correlated with the validity period.

[0086] Optionally, based on matching the preset rules with the client information, determining the unavailable edge node corresponding to the client includes: when the client information successfully matches any of the preset rules, determining the unavailable edge node corresponding to the client based on the effective strength of the preset rules. Based on matching the client information in the access point acquisition request with each preset rule, determining the preset rule hit by the client information, determining the effective hit preset rule based on the effective strength of the hit preset rule, and determining the edge node in the effective hit preset rule as the unavailable edge node corresponding to the client. Exemplarily, the client information hits preset rule 1 and preset rule 2, wherein the effective strength of preset rule 1 is 100%, and the effective strength of preset rule 2 is 50%. When preset rule 2 fails in the current time, the edge node in preset rule 1 is determined as the unavailable edge node corresponding to the client.

[0087] The technical solution of this embodiment sets the effective strength for the preset rules, resulting in a certain failure probability of the preset rules within the effective period, and the edge nodes in the preset rules can be restored and verified within the effective period.

[0088] Based on the above embodiment, after receiving the node information of the target edge node sent by the scheduling component, the client establishes a connection with the target edge node, generates new connection information and reports it in real time. The scheduling end receives the newly added connection information between the client and the target edge node and updates the preset rules based on the newly added connection information.

[0089] In some embodiments, updating the preset rule includes: generating a new preset rule based on the newly added connection information; if the new preset rule is different from the existing preset rule, retaining the new preset rule; if the new preset rule is the same as the existing preset rule, indicating that the failure of the edge node in the existing preset rule has not been recovered, then initializing the effective duration and effective strength of the existing preset rule, for example, initializing the effective duration of the existing preset rule to zero and initializing the effective strength of the existing preset rule to 100%.

[0090] In some embodiments, updating the preset rules includes: when the newly added connection information indicates a connection failure and the client information and edge node information of the newly added connection information do not belong to the existing preset rules, creating a new preset rule based on the newly added connection information and retaining the new preset rule.

[0091] When the newly added connection information indicates a connection failure, and the client information and edge node information of the newly added connection information belong to an existing preset rule, it indicates that the failure of the edge node in the existing preset rule has not been restored, and the effective duration and effective strength of the existing preset rule are initialized.

[0092] When the newly added connection information indicates a successful connection, and the client information and edge node information of the newly added connection information belong to the existing preset rules, it indicates that the failure of the edge node in the existing preset rules has been restored, reducing the effective strength of the existing preset rules and / or increasing the effective time of the existing preset rules to accelerate the expiration of the existing preset rules and reduce the impact of the existing preset rules.

[0093] The technical solution of this embodiment improves the accuracy and effectiveness of the preset rules by updating the preset rules based on the connection information fed back by the client.

[0094] FIG7 is a schematic diagram of the structure of a request processing device provided by an embodiment of the present disclosure. As shown in FIG7 , the device includes: a request receiving module 210 , an edge node removing module 220 , a target edge node determining module 230 and a node information sending module 240 .

[0095] A request receiving module 210 is configured to receive an access point acquisition request from a client, wherein the access point acquisition request includes the client information;

[0096] The edge node removal module 220 is configured to traverse preset rules and match the client information with the preset rules to determine the unavailable edge node corresponding to the client; the preset rules include the correspondence between the client information and the unavailable edge node;

[0097] a target edge node determination module 230 configured to remove the unavailable edge nodes from the candidate edge nodes to obtain available edge nodes for the client, and determine at least one target edge node suitable for the client from the available edge nodes;

[0098] The node information sending module 240 is configured to send the node information of the target edge node to the client, so that the client can establish a connection with the target edge node.

[0099] The technical solution provided by the embodiment of the present disclosure creates and maintains preset rules based on the connection information of multiple clients at the scheduling end, and describes the correspondence between client information and unavailable edge nodes through the preset rules. When a client requests an access point, the client information in the access point acquisition request is parsed, and the unavailable edge node corresponding to the client is determined based on the matching of the client information in the access point acquisition request with the preset rules. The unavailable edge node is removed from the candidate nodes, and the target edge node is determined from the obtained available edge nodes, thereby reducing the probability of a faulty edge node among the target edge nodes sent to the client, improving the availability of the target edge node, and reducing access failures and retries during the client's access to the edge node, thereby achieving the effect of improving the client access success rate and access efficiency.

[0100] Based on the above embodiment, optionally, the preset rule includes a first rule and / or a second rule;

[0101] The first rule includes a correspondence between single client information and a single edge node;

[0102] The second rule includes a correspondence between a client information class and an edge node set.

[0103] Based on the above embodiment, optionally, the edge node removal module 220 is further configured to:

[0104] matching the client information in the access point acquisition request with the client information in each of the first rules, and if a match is successful, determining the edge node in the first rule as the unavailable edge node corresponding to the client;

[0105] and / or, matching the client information in the access point acquisition request with the client information class in the second rule; and if the client information in the access point acquisition request belongs to the client information class, determining an edge node in the edge node set in the second rule as an unavailable edge node corresponding to the client.

[0106] Based on the above embodiment, optionally, the device further includes:

[0107] The preset rule generation module is used to receive the client's connection information, which includes client information, edge node information and connection results; when the connection result is a connection failure, generate a first rule based on the client information and the edge node information.

[0108] Optionally, the preset rule generation module is further used to:

[0109] Receive connection information of multiple clients, wherein the connection information includes client information, edge node information and connection results; regularly cluster the connection information within a preset time period to obtain clustering results, and generate a second rule based on the clustering results.

[0110] Optionally, the clustering result includes multiple classes, each class including a client information class and an edge node information class;

[0111] The preset rule generation module is also used to:

[0112] If the connection failure ratio in the association result between the client information class and the edge node information class exceeds a first threshold, a second rule is generated based on the client information class and the edge node information class, wherein the edge node information class corresponds to an edge node set.

[0113] Optionally, the preset rule generation module is further used to:

[0114] If the number of second rules corresponding to the same edge node set exceeds a second threshold, the edge nodes in the edge node set are offlined.

[0115] Based on the above embodiment, optionally, the preset rule is set with an effective period;

[0116] The device further includes: a preset rule management module, which is used to determine the validity period of the preset rule after the preset rule is generated; and to delete the preset rule when the validity period of the preset rule reaches the validity period.

[0117] Based on the above embodiment, optionally, the preset rule is set with an effective strength, and the effective strength gradually decreases within the effective period;

[0118] The edge node removal module 220 is further configured to: when the client information successfully matches any of the preset rules, determine an unavailable edge node corresponding to the client based on the effectiveness of the preset rule.

[0119] Based on the above embodiment, optionally, the device further includes:

[0120] A preset rule updating module, configured to receive newly added association information between the client and the target edge node, and update the preset rule based on the newly added association information;

[0121] The updating of the preset rules includes:

[0122] When the newly added connection information indicates a connection failure and the client information and edge node information of the newly added connection information do not belong to an existing preset rule, creating a new preset rule based on the newly added connection information;

[0123] If the newly added connection information indicates a connection failure and the client information and edge node information of the newly added connection information belong to an existing preset rule, initializing the validity period and effective strength of the existing preset rule;

[0124] When the newly added connection information indicates a successful connection and the client information and edge node information of the newly added connection information belong to an existing preset rule, the effective strength of the existing preset rule is reduced and / or the effective duration of the existing preset rule is increased.

[0125] The request processing device provided by the embodiments of the present disclosure can execute the request processing method provided by any embodiment of the present disclosure, and has the corresponding functional modules and beneficial effects of the execution method.

[0126] It is worth noting that the various units and modules included in the above-mentioned device are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the protection scope of the embodiments of the present disclosure.

[0127] FIG8 is a schematic diagram of the structure of an electronic device provided by an embodiment of the present disclosure. Referring to FIG8 , a schematic diagram of the structure of an electronic device (such as a terminal device or server in FIG8 ) 500 suitable for implementing an embodiment of the present disclosure is shown below. The terminal device in the embodiment of the present disclosure may include, but is not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. The electronic device shown in FIG8 is merely an example and should not impose any limitations on the functions and scope of use of the embodiments of the present disclosure.

[0128] As shown in FIG8 , the electronic device 500 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 501, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage device 508 into a random access memory (RAM) 503. Various programs and data required for the operation of the electronic device 500 are also stored in the RAM 503. The processing device 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An edit / output (I / O) interface 505 is also connected to the bus 504.

[0129] Typically, the following devices may be connected to the I / O interface 505: an input device 506 including, for example, a touch screen, a touchpad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 507 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 508 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 509. The communication device 509 may allow the electronic device 500 to communicate with other devices wirelessly or by wire to exchange data. Although FIG8 shows the electronic device 500 with various devices, it should be understood that not all of the devices shown are required to be implemented or present. More or fewer devices may alternatively be implemented or present.

[0130] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication device 509, or installed from the storage device 508, or installed from the ROM 502. When the computer program is executed by the processing device 501, the above-mentioned functions defined in the method of the embodiment of the present disclosure are performed.

[0131] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0132] The electronic device provided by the embodiment of the present disclosure and the request processing method provided by the above embodiment belong to the same inventive concept. For technical details not fully described in this embodiment, please refer to the above embodiment, and this embodiment has the same beneficial effects as the above embodiment.

[0133] An embodiment of the present disclosure provides a computer storage medium on which a computer program is stored. When the program is executed by a processor, the request processing method provided by the above embodiment is implemented.

[0134] It should be noted that the computer-readable medium mentioned above in the present disclosure may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the two. A computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or component, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present disclosure, a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, device, or component. In the present disclosure, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, which carries computer-readable program code. Such a propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport a program for use by or in conjunction with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium may be transmitted using any suitable medium, including but not limited to wires, optical cables, RF (radio frequency), etc., or any suitable combination thereof.

[0135] In some embodiments, the client and server can communicate using any currently known or later developed network protocol, such as HTTP (HyperText Transfer Protocol), and can be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or later developed network.

[0136] The computer-readable medium may be included in the electronic device, or may exist independently without being incorporated into the electronic device.

[0137] The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device:

[0138] The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device is caused to: receive an access point acquisition request from a client, the access point acquisition request including the client information; traverse preset rules, match the client information with the preset rules based on the preset rules, and determine an unavailable edge node corresponding to the client; the preset rules include a correspondence between the client information and the unavailable edge nodes; remove the unavailable edge nodes from candidate edge nodes to obtain available edge nodes for the client, and determine at least one target edge node suitable for the client from the available edge nodes; and send the node information of the target edge node to the client so that the client establishes a connection with the target edge node.

[0139] Computer program code for performing the operations of the present disclosure may be written in one or more programming languages, or a combination thereof, including, but not limited to, object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on the remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0140] The flowcharts and block diagrams in the accompanying drawings illustrate the possible implementation architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram can represent a module, program segment, or a part of code, and the module, program segment, or a part of code contains one or more executable instructions for realizing 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 than that marked in the accompanying drawings. For example, two boxes represented in succession 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 the boxes in the block diagram and / or flowchart, can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0141] The units involved in the embodiments described in this disclosure may be implemented in software or hardware. In some cases, the name of a unit does not limit the unit itself. For example, the first acquisition unit may also be described as a "unit for acquiring at least two Internet Protocol addresses."

[0142] The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, and without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chip (SOCs), complex programmable logic devices (CPLDs), and the like.

[0143] In the context of the present disclosure, a machine-readable medium can be a tangible medium that can contain or store a program for use by or in conjunction with an instruction execution system, device or equipment. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium can include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0144] According to one or more embodiments of the present disclosure, Example 1 provides a request processing method, including:

[0145] receiving an access point acquisition request from a client, wherein the access point acquisition request includes the client information;

[0146] Traversing preset rules, matching the client information based on the preset rules, and determining an unavailable edge node corresponding to the client; the preset rules include a correspondence between the client information and the unavailable edge node;

[0147] Remove the unavailable edge nodes from the candidate edge nodes to obtain available edge nodes for the client, and determine at least one target edge node suitable for the client from the available edge nodes;

[0148] The node information of the target edge node is sent to the client, so that the client establishes a connection with the target edge node.

[0149] According to one or more embodiments of the present disclosure, Example 2 provides the request processing method of Example 1, further comprising:

[0150] The preset rules include a first rule and / or a second rule;

[0151] The first rule includes a correspondence between single client information and a single edge node;

[0152] The second rule includes a correspondence between a client information class and an edge node set.

[0153] According to one or more embodiments of the present disclosure, Example 3 provides the request processing method of Example 1, further comprising:

[0154] Matching the client information with the preset rule to determine an unavailable edge node corresponding to the client includes:

[0155] matching the client information in the access point acquisition request with the client information in each of the first rules, and if a match is successful, determining the edge node in the first rule as the unavailable edge node corresponding to the client;

[0156] and / or, matching the client information in the access point acquisition request with the client information class in the second rule; and if the client information in the access point acquisition request belongs to the client information class, determining an edge node in the edge node set in the second rule as an unavailable edge node corresponding to the client.

[0157] According to one or more embodiments of the present disclosure, Example 4 provides the request processing method of Example 1, further comprising:

[0158] The method for generating the first rule includes: receiving connection information from the client, the connection information including client information, edge node information and connection result; when the connection result is connection failure, generating the first rule based on the client information and the edge node information.

[0159] According to one or more embodiments of the present disclosure, Example 5 provides the request processing method of Example 1, further comprising:

[0160] The method for generating the second rule includes: receiving connection information of multiple clients, the connection information including client information, edge node information and connection results; regularly clustering the connection information within a preset time period to obtain clustering results, and generating the second rule based on the clustering results.

[0161] According to one or more embodiments of the present disclosure, Example 6 provides the request processing method of Example 1, further comprising:

[0162] The clustering result includes multiple classes, each class including a client information class and an edge node information class;

[0163] The generating of the second rule based on the clustering result includes: if the proportion of connection failures in the association results between the client information class and the edge node information class exceeds a first threshold, generating the second rule based on the client information class and the edge node information class, wherein the edge node information class corresponds to an edge node set.

[0164] According to one or more embodiments of the present disclosure, Example 7 provides the request processing method of Example 1, further comprising:

[0165] The method further includes: if the number of second rules corresponding to the same edge node set exceeds a second threshold, performing offline processing on the edge nodes in the edge node set.

[0166] According to one or more embodiments of the present disclosure, Example 8 provides the request processing method of Example 1, further comprising:

[0167] The preset rules are set with an effective period;

[0168] The method further includes: after generating the preset rule, determining the validity period of the preset rule; and deleting the preset rule when the validity period of the preset rule reaches the validity period.

[0169] According to one or more embodiments of the present disclosure, Example 9 provides the request processing method of Example 1, further comprising:

[0170] The preset rule is set with an effective strength, and the effective strength gradually decreases during the effective period;

[0171] The matching the client information based on the preset rule to determine the unavailable edge node corresponding to the client includes:

[0172] In a case where the client information successfully matches any of the preset rules, an unavailable edge node corresponding to the client is determined based on the effectiveness strength of the preset rule.

[0173] According to one or more embodiments of the present disclosure, Example 10 provides the request processing method of Example 1, further comprising:

[0174] The method further includes: receiving newly established association information between the client and the target edge node, and updating the preset rule based on the newly established association information;

[0175] Among them, the updating of the preset rules includes: generating new preset rules based on the newly added association information, and if the new preset rules are different from the existing preset rules, retaining the new preset rules; if the new preset rules are the same as the existing preset rules, initializing the effective time and effective strength of the existing preset rules.

[0176] According to one or more embodiments of the present disclosure, Example 11 provides a request processing device, including:

[0177] A request receiving module, configured to receive an access point acquisition request from a client, wherein the access point acquisition request includes the client information;

[0178] An edge node removal module, configured to traverse preset rules, match the client information with the preset rules, and determine an unavailable edge node corresponding to the client; the preset rules include a correspondence between the client information and the unavailable edge node;

[0179] a target edge node determination module, configured to remove the unavailable edge nodes from the candidate edge nodes to obtain available edge nodes for the client, and determine at least one target edge node suitable for the client from the available edge nodes;

[0180] The node information sending module is used to send the node information of the target edge node to the client, so that the client can establish a connection with the target edge node.

[0181] The above description is merely a preferred embodiment of the present disclosure and an illustration of the technical principles employed. Those skilled in the art should understand that the scope of disclosure involved in the present disclosure is not limited to the technical solutions formed by the specific combination of the above-mentioned technical features, but also includes other technical solutions formed by any combination of the above-mentioned technical features or their equivalents without departing from the above-mentioned disclosed concepts. For example, a technical solution formed by replacing the above-mentioned features with (but not limited to) technical features with similar functions disclosed in this disclosure.

[0182] In addition, although each operation is described in a specific order, this should not be understood as requiring these operations to be performed in the specific order shown or in a sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details have been included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single embodiment in combination. On the contrary, the various features described in the context of a single embodiment can also be implemented in multiple embodiments individually or in any suitable sub-combination mode.

[0183] Although the subject matter has been described in language specific to structural features and / or methodological logical acts, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are merely example forms of implementing the claims.

Claims

1. A request processing method, comprising: Receive an access point acquisition request from a client, where the access point acquisition request includes client information; Traversing preset rules, matching the preset rules with the client information based on the preset rules, and determining an unavailable edge node corresponding to the client, wherein the preset rules include a correspondence between the client information and the unavailable edge node; Remove the unavailable edge nodes from the candidate edge nodes to obtain available edge nodes for the client, and determine at least one target edge node suitable for the client from the available edge nodes; The node information of the target edge node is sent to the client, so that the client establishes a connection with the target edge node.

2. The method according to claim 1, wherein The preset rules include a first rule and / or a second rule; Wherein, the first rule includes a correspondence between single client information and a single edge node; The second rule includes a correspondence between a client information class and an edge node set.

3. The method according to claim 2, wherein: The matching the client information based on the preset rule to determine the unavailable edge node corresponding to the client includes: matching the client information in the access point acquisition request with the client information in each of the first rules, and if a match is successful, determining the edge node in the first rule as the unavailable edge node corresponding to the client; and / or, matching the client information in the access point acquisition request with the client information class in the second rule; and if the client information in the access point acquisition request belongs to the client information class, determining an edge node in the edge node set in the second rule as an unavailable edge node corresponding to the client.

4. The method according to claim 2 or 3, wherein: The first rule is generated in the following manner: Receive connection information from the client, the connection information including client information, edge node information and connection result; When the connection establishment result is connection failure, the first rule is generated based on the client information and the edge node information.

5. The method according to claim 2 or 3, wherein: The second rule is generated in the following manner: Receive connection information from multiple clients, where the connection information includes client information, edge node information, and connection results; Clustering is performed regularly on the association information within a preset time period to obtain a clustering result, and the second rule is generated based on the clustering result.

6. The method according to claim 5, wherein: The clustering result includes multiple classes, each class including a client information class and an edge node information class; Generating the second rule based on the clustering result includes: If the connection failure ratio in the association result between the client information class and the edge node information class exceeds a first threshold, the second rule is generated based on the client information class and the edge node information class, wherein the edge node information class corresponds to an edge node set.

7. The method according to claim 6, further comprising: If the number of second rules corresponding to the same edge node set exceeds a second threshold, the edge nodes in the edge node set are offlined.

8. The method according to any one of claims 1 to 7, wherein: The preset rule is set with an effective period; the method further includes: After the preset rule is generated, the validity period of the preset rule is determined; when the validity period of the preset rule reaches the validity period, the preset rule is deleted.

9. The method according to claim 8, wherein The preset rule is set with an effective strength, and the effective strength gradually decreases during the effective period; The matching the client information based on the preset rule to determine the unavailable edge node corresponding to the client includes: In a case where the client information successfully matches any of the preset rules, an unavailable edge node corresponding to the client is determined based on the effectiveness strength of the preset rule.

10. The method according to claim 9, further comprising: receiving new connection information between the client and the target edge node, and updating the preset rule based on the new connection information; The updating of the preset rules includes: A new preset rule is generated based on the newly added association information. If the new preset rule is different from the existing preset rule, the new preset rule is retained; if the new preset rule is the same as the existing preset rule, the effective time and effective strength of the existing preset rule are initialized.

11. A request processing device, comprising: a request receiving module, configured to receive an access point acquisition request from a client, wherein the access point acquisition request includes client information; an edge node removal module configured to traverse preset rules, match the client information based on the preset rules, and determine an unavailable edge node corresponding to the client, wherein the preset rules include a correspondence between the client information and the unavailable edge node; a target edge node determination module configured to remove the unavailable edge nodes from candidate edge nodes to obtain available edge nodes for the client, and determine at least one target edge node suitable for the client from the available edge nodes; The node information sending module is configured to send the node information of the target edge node to the client, so that the client establishes a connection with the target edge node.

12. An electronic device comprising: one or more processors; A storage device configured to store one or more programs, wherein When the one or more programs are executed by the one or more processors, the one or more processors implement the request processing method according to any one of claims 1 to 10.

13. A storage medium containing computer-executable instructions, wherein: When the computer executable instructions are executed by a computer processor, they are used to perform the request processing method according to any one of claims 1 to 10.

Images