CN114039842A - Fault positioning method, system, equipment and storage medium for distributed service - Google Patents
Fault positioning method, system, equipment and storage medium for distributed service Download PDFInfo
- Publication number
- CN114039842A CN114039842A CN202111131904.4A CN202111131904A CN114039842A CN 114039842 A CN114039842 A CN 114039842A CN 202111131904 A CN202111131904 A CN 202111131904A CN 114039842 A CN114039842 A CN 114039842A
- Authority
- CN
- China
- Prior art keywords
- distributed service
- request
- terminal
- application
- address
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 44
- 230000006870 function Effects 0.000 claims description 14
- 230000008859 change Effects 0.000 claims description 5
- 230000004044 response Effects 0.000 abstract description 3
- 238000012545 processing Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 8
- 230000008901 benefit Effects 0.000 description 4
- 230000002159 abnormal effect Effects 0.000 description 3
- 230000003111 delayed effect Effects 0.000 description 3
- 238000007142 ring opening reaction Methods 0.000 description 3
- 230000009471 action Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 241000533950 Leucojum Species 0.000 description 1
- 230000005856 abnormality Effects 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000003058 natural language processing Methods 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0677—Localisation of faults
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/508—Network service management, e.g. ensuring proper service fulfilment according to agreements based on type of value added network service under agreement
- H04L41/5096—Network service management, e.g. ensuring proper service fulfilment according to agreements based on type of value added network service under agreement wherein the managed service relates to distributed or central networked applications
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention provides a fault positioning method, a system, equipment and a storage medium for distributed service, wherein the scheme method comprises the following steps: acquiring an application request, and analyzing according to the application to obtain the grading level number of the distributed service terminal and the IP address of the distributed service terminal; determining that the feedback time of the application request is greater than a preset time threshold, determining a target terminal according to the grading level number and the IP address, and sending a fault checking request to the target terminal; positioning to obtain a fault node of the distributed service according to the feedback information of the target terminal; the scheme can quickly and accurately position the fault point of the distributed service; the method can also improve the response efficiency of the service request, reduce the delay of request feedback, improve the user experience, and can be widely applied to the technical field of distributed services.
Description
Technical Field
The invention belongs to the technical field of distributed services, and particularly relates to a fault positioning method, a fault positioning system, a fault positioning device and a storage medium for distributed services.
Background
The development of the distributed technology enables services of a plurality of applications to be completed by the cooperation of a plurality of independently deployed systems, so that on one hand, the configuration requirement on the system can be reduced, and meanwhile, the services of one application can be completed by the cooperation of a plurality of systems, the synchronous processing can be realized, and the service request feedback efficiency is improved; in addition, if a service requires a plurality of nodes for auditing, a distributed service mode is usually adopted for processing.
However, with the increase of the business scale, the increase of services and frequent changes, the distributed services face the following problems: in the case of a system failure or abnormality, it is difficult to quickly locate the failure point or abnormal point, resulting in a severe delay in the feedback of subsequent service requests.
Disclosure of Invention
In view of the above, to at least partially solve one of the above technical problems and achieve fast locating of a fault point or an abnormal point of a distributed service system when a system fails or is abnormal, embodiments of the present invention provide a fault locating method, a system, a device, and a storage medium for distributed services.
In a first aspect, a technical solution of the present application provides a method for locating a fault of a distributed service, including:
acquiring an application request, and analyzing the application request to obtain the level number of the distributed service terminal and the IP address of the distributed service terminal;
determining that the feedback time of the application request is greater than a preset time threshold, determining a target terminal according to the level number and the IP address, and sending a fault checking request to the target terminal;
and positioning to obtain the fault node of the distributed service according to the feedback information of the target terminal.
In a possible embodiment of the solution of the present application, the method further comprises the steps of:
constructing an index table, and constructing a binary tree of the application request according to the index table;
the step of locating a failed node that gets distributed services includes:
and traversing the binary tree to locate the fault node of the distributed service.
In a possible embodiment of the present disclosure, the step of constructing an index table and constructing a binary tree of the application request according to the index table includes:
acquiring a plurality of historical application requests, and extracting unique identifiers of the historical application requests;
determining a target routing path according to the relationship between the upper level and the lower level of the distributed service terminal;
and constructing an index table according to the unique identifier and the target routing path.
In a possible embodiment of the present disclosure, the step of obtaining a plurality of historical application requests and extracting a unique identifier of the historical application requests includes:
and acquiring a plurality of keywords of the historical application request through an atomic function, and converting the keywords into signed integers serving as the unique identifier.
In a possible embodiment of the present disclosure, the step of obtaining a plurality of historical application requests and extracting a unique identifier of the historical application requests further includes:
determining similar application requests in the plurality of historical application requests, extracting word frequencies in the similar application requests, determining the keywords according to the word frequencies, and converting the keywords into the unique identifier.
In a possible embodiment of the present application, when the application request is a new service request; after the step of obtaining the level number of the distributed service terminal and the IP address of the distributed service terminal according to the application analysis, the method includes:
newly adding the IP address and the unique identifier of the newly added service request in the index table, generating a new node of the binary tree according to the IP address, and determining a target routing path of the new node;
and acquiring the level number of the new node through the target routing path.
In a possible embodiment of the present application, when the application request is a change application request; after the step of obtaining the level number of the distributed service terminal and the IP address of the distributed service terminal according to the application analysis, the method includes:
in the index table, modifying the IP address and/or the unique identifier according to the change application request, updating the binary tree according to the modified index table, and updating the target routing path according to the updated binary tree;
and acquiring the level number of the modified nodes through the updated target routing path.
In a second aspect, a technical solution of the present invention further provides a fault location system for distributed services, where the system includes:
the request acquisition module is used for acquiring an application request and analyzing the application request to obtain the level number of the distributed service terminal and the IP address of the distributed service terminal;
the request sending module is used for determining that the feedback time of the application request is greater than a preset time threshold, determining a target terminal according to the level number and the IP address, and sending a fault checking request to the target terminal;
and the fault positioning module is used for positioning the fault node of the distributed service according to the feedback information of the target terminal.
In a third aspect, a technical solution of the present invention further provides a fault location device for distributed services, including:
at least one processor;
at least one memory for storing at least one program;
when the at least one program is executed by the at least one processor, the at least one processor is caused to perform the method of the first aspect.
In a fourth aspect, the present invention further provides a storage medium, in which a processor-executable program is stored, where the processor-executable program is used to execute the fault location method for a distributed service according to the first aspect when executed by a processor.
Advantages and benefits of the present invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention:
the technical scheme of the application includes that the grade number of distributed service terminals requested by an application and the IP addresses of the distributed service terminals are determined, when the feedback time of a certain application is delayed, request information is sent to each grade of terminal through the IP addresses, and fault points of the distributed service can be located quickly and accurately according to the feedback information of each grade of terminal; in addition, the scheme can also improve the response efficiency of the service request, reduce the delay of request feedback and improve the user experience.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a flowchart illustrating steps of a method for locating a fault in a distributed service according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating steps of a method for locating a fault in distributed services according to another embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention, and are not to be construed as limiting the present invention. The step numbers in the following embodiments are provided only for convenience of illustration, the order between the steps is not limited at all, and the execution order of each step in the embodiments can be adapted according to the understanding of those skilled in the art.
In a first aspect, as shown in fig. 1, a technical solution of the present application provides a fault location method for distributed services, which may include steps S100 to S300:
s100, acquiring an application request, and analyzing according to the application to obtain the level number of the distributed service terminal and the IP address of the distributed service terminal;
in the embodiment, whether the terminals are directly connected or not can be judged by the hierarchical level number of the distributed service terminals, or a complete data link of the terminal can be formed with another terminal only by a route or a switch; in addition, the embodiment may further acquire the IP address of the upper terminal and the IP address of the lower terminal from the application request on the basis of determining the number of hierarchical levels and the IP address, so as to clarify the route of the connection target terminal. Specifically, the embodiment first obtains an application request of a user, where the application request may be an instruction request for connecting a certain node in a distributed service network and performing data exchange with the node; when the distributed service terminal receives each application request related to the distributed service, the IP address of a target terminal of the application request can be obtained through analysis, the grading grade number of the IP address in the distributed service network is determined according to a local cache or record (such as an index table) of the terminal, the grading grade number is compared with the index table stored by the distributed service terminal, whether the IP address of the upper-stage terminal corresponding to the corresponding application request is matched or not is judged, and if the IP address of the upper-stage terminal corresponding to the corresponding application request is matched, the application request is sent out according to the IP address of the lower-stage terminal.
S200, determining that the feedback time of the application request is greater than a preset time threshold, determining a target terminal according to the grading level number and the IP address, and sending a fault checking request to the target terminal;
specifically, the feedback time of the application request in the embodiment refers to a time period from when the application request is sent by the initial terminal to when the target terminal performs processing and feedback; the failure check request is a time for the initial terminal to resend a request instruction for acquiring the processing application request saved in other nodes in the path for sending the application request to the target terminal after determining that the feedback time of the application request is greater than the preset time threshold of the embodiment.
S300, positioning to obtain a fault node of the distributed service according to the feedback information of the target terminal;
specifically, in the embodiment, when the feedback time of a certain application request is greater than a preset value, request information is sent to each level of terminals in the distributed service network through an IP address; each level of terminal feeds back the time for processing the application request and the identification information for representing the application request to the initial terminal; and the distributed service terminal without message feedback is the fault point of the distributed service. In addition, the embodiment can also judge which application requests are processed and which application requests are not processed due to the fault problem according to the information fed back by all the distributed service terminals, and the subsequent fault needs to be recovered after being eliminated.
As shown in fig. 2, in some alternative embodiments, before the step of obtaining the application request, the fault location method for distributed service of the embodiment may further generate an index table, and the step of constructing the index table may include steps S010-S012:
s010, acquiring a plurality of historical application requests, and extracting unique identifiers of the historical application requests;
s011, determining a target routing path according to the relationship between the upper level and the lower level of the distributed service terminal;
s012, constructing an index table according to the unique identifier and the target routing path;
the unique identification in the embodiment is identification information used for representing each application request; the target routing path is a relationship between each terminal node involved in the network path and the upper and lower levels between the terminal nodes when the request message is sent to different target terminals according to the historical application request, and the upper and lower levels may be a relationship between the IP address of the upper terminal and the IP address of the lower terminal formed in the network path. Specifically, when processing a historical application request, the embodiment may simultaneously obtain the unique identifier corresponding to each application request related to the distributed service, and the distributed service terminal stores the unique identifier of the processed application request in the index table, so as to subsequently obtain a new application request, may compare the unique identifier of the new application request with a record in the index table, and may directly access the target terminal according to a route (a relationship between upper and lower levels of the terminal) in which the unique identifier is recorded, in the case where it is determined that the application request is recorded with the unique identifier, thereby avoiding a waste of computing resources due to repeated request analysis. If necessary, the embodiment can judge whether the corresponding IP address of the upper-level terminal in the corresponding application request is matched with the record in the index table, and if so, the application request is sent out according to the IP address of the lower-level terminal; meanwhile, in the distributed service terminal, a table can be additionally created and the time for processing the application request can be recorded. When the feedback time of a certain application request is greater than a preset value, request information is sent to each level of terminal through an IP address; each level of terminal feeds back the time for processing the application request and the unique identification information corresponding to the application request; and the distributed service terminal without message feedback is the fault point of the distributed service.
In the embodiment, the index table is set, so that the distributed service terminal can be simultaneously used as one of the distributed service terminals requested by a plurality of applications to perform multi-service parallel processing.
After building the index table, in some alternative embodiments, the method of an embodiment may further include step S013:
s013, constructing a binary tree of the application request according to the index table;
specifically, the embodiment extracts the unique identifier of the same application request in each index table, and constructs a binary tree corresponding to each application request according to the level number of the terminal in the corresponding distributed service. Because the index table set in the distributed service terminal contains the unique identifier of the application request related to the index table, and the IP address of the upper-level terminal and the IP address of the lower-level terminal corresponding to the corresponding application request, the unique identifier of the same application request in the index table of the distributed service terminal is extracted (simultaneously contains the identification code of the corresponding distributed service terminal, such as the IP address, etc.), that is, all the distributed service terminals related to the processing of the application request are correspondingly obtained; and then determining the level number of each terminal in the corresponding distributed service according to the IP address of the upper-level terminal and the IP address of the lower-level terminal corresponding to the corresponding application request in the index table, thereby constructing a binary tree corresponding to each application request.
In some alternative embodiments, in the fault location method for a distributed service with the index table and the binary tree being constructed, the process of locating a fault node that obtains the distributed service may further include step S013:
s013: traversing a binary tree to locate and obtain fault nodes of the distributed service;
specifically, in the embodiment, after the binary tree corresponding to each application request is constructed, when it is determined that a certain distributed service terminal has a fault, it may be quickly determined whether the faulty distributed service terminal affects processing of the corresponding application request by traversing whether the binary tree corresponding to the application request includes the faulty distributed service terminal, so as to facilitate taking corresponding countermeasures.
It should be noted that, in some other embodiments, the index table may not be set in the distributed service terminal. Under the condition of not setting an index table, the corresponding distributed service terminal can only process one application request and can not process a plurality of application requests simultaneously.
In some alternative embodiments, several historical application requests are obtained, and the unique identifier of the historical application request is extracted S010, which may include more specific steps S010A:
S011A, acquiring a plurality of keywords of historical application requests through an atomic function, and converting the keywords into signed integers serving as unique identifiers;
in particular, embodiments may generate a unique identifier for each application request involving a distributed service by employing a Redis-based atomic function INCR method, since Redis does not have a specific integer type, the key stored value will be interpreted as a decimal 64-digit signed integer when executing the INCR command.
Take the specific code in an embodiment as an example:
redis>SET unique_key 1
OK
redis>INCR unique_key
(integer)2
redis > GET unique _ key #, i.e., the number "2" is saved in Redis in the form of a string; the string can be used as a unique identifier of the corresponding application request. In some other embodiments, other algorithms may be used to generate a unique identifier for each application request involving a distributed service, including but not limited to a snowflake algorithm, a UUID algorithm, and the like.
In some alternative embodiments, the step S010 of obtaining a plurality of historical application requests and extracting unique identifiers of the historical application requests may further include the step S010B:
S010B, determining similar application requests in the historical application requests, determining keywords according to the word frequencies by extracting the word frequencies in the similar application requests, and converting the keywords into unique identifiers; the method comprises the steps of extracting word frequency of character strings of similar historical application requests through related tools of natural language processing, regarding contents meeting a word frequency threshold, using the contents as similar or homogeneous application requests, and selecting the contents meeting the word frequency threshold as unique identifications of the application requests.
In some alternative embodiments, when the application request is a new service request, after the step of obtaining the number of hierarchical levels of the distributed service terminal and the IP address of the distributed service terminal according to the application resolution in the embodiment method, the steps S210 to S220 may be included:
s210, in the index table, adding the IP address and the unique identifier of the service request, generating a new node of a binary tree according to the IP address, and determining a target routing path of the new node
S220, acquiring the grading level number of the new node through the target routing path;
specifically, the embodiment first adds a unique identifier of a corresponding application request, a set IP address of a previous-stage terminal, and an IP address of a next-stage terminal in an index table of a terminal of a corresponding distributed service; then sending request information to the last-stage terminal through the IP address; then the last-stage terminal initiates the action of returning the information, and returns the information to the IP address of the last-stage terminal according to the information in the index table of the last-stage terminal; repeating the steps until the information is transmitted back to the first-stage terminal; according to the receiving time of the data of each terminal recorded in the return information, the embodiment determines the level number of the terminal of the distributed service corresponding to the new application request.
In some alternative embodiments, when the application request is a request for changing an application, after the step S200 of obtaining the number of hierarchical levels of the distributed service terminal and the IP address of the distributed service terminal according to the application parsing, the method may further include steps S230 to S240:
s230, in the index table, modifying the IP address and/or the unique identifier according to the change application request, updating the binary tree according to the modified index table, and updating the target routing path according to the updated binary tree;
s240, acquiring the grading level number of the modified nodes through the updated target routing path;
specifically, the embodiment modifies the corresponding unique identifier and/or the corresponding IP address of the upper-level terminal and the corresponding IP address of the lower-level terminal in the index table of the distributed service terminal corresponding to the application request; then sending request information to the last-stage terminal through the IP address; then, the last-stage terminal initiates the action of returning the information, and returns the information to the IP address of the last-stage terminal according to the information in the index table of the last-stage terminal; repeating the steps until the information is transmitted back to the first-stage terminal; finally, determining the level number of the modified distributed service terminal corresponding to the application request according to the receiving time of the data of each terminal recorded in the return information; constructing a corresponding binary tree according to the obtained modified terminal level number of the distributed service; and deleting the original binary tree corresponding to the application request.
With reference to fig. 1 and fig. 2, a complete implementation process of an embodiment of the present embodiment is as follows:
taking a service scene in the communication service industry as an example, for example, the handling process of the VoLTE video color ring back tone function is as follows:
1. and the user initiates a video color ring opening and closing request in the group channel or the provincial CRM channel.
2. The provincial CRM sends the video color ring back tone account opening request to a provincial service operation system (OSS).
3. The provincial service system (OSS) sends the video color ring back tone account opening request to the provincial HSS.
4. After completing iFC signing/de-signing success, the provincial HSS returns a service acceptance success message to a provincial service system (OSS).
5. The provincial service system (OSS) sends the video color ring back tone account opening request to the group service system, and the group service system sends the video color ring back tone account opening request to the service acceptance platform.
6. And the service acceptance platform sends the video color ring back tone account opening request to the province video color ring back tone gateway to complete the video color ring back tone account opening.
7. The service acceptance platform returns the video color ring opening and closing result to the group service opening system, the group service opening system informs the provincial service opening system (OSS), and the provincial service opening system (OSS) returns the result to the provincial CRM. 8. And the service acceptance platform sends a video color ring opening and canceling result short message to the terminal user through the group short message gateway.
In the above process, the related province CRM, the province service system (OSS), the province HSS, the group service system, the service acceptance platform, etc. cooperate together to complete the application request of the VoLTE video color ring function, i.e. serve as the distributed service terminal of the application request; when the application request of the VoLTE video color ring back tone function is delayed, the request information can be sent according to the IP addresses of the terminals, and which terminal has a fault can be judged according to the feedback condition. In these province CRM, province service system (OSS), province HSS, group service system, service acceptance platform, etc., an index table may be set; in the index table, the unique identifier of each application request related to the distributed service is used as a key word, so that the terminals can process not only the VoLTE video color ring function acceptance service, but also other service requests, such as the VoLTE video color ring DIY service and the like.
In a second aspect, a technical solution of the present invention further provides a fault location system for distributed services, where the system includes:
the request acquisition module is used for acquiring an application request and obtaining the grading level number of the distributed service terminal and the IP address of the distributed service terminal according to application analysis;
the request sending module is used for determining that the feedback time of the application request is greater than a preset time threshold, determining a target terminal according to the grading grade number and the IP address, and sending a fault checking request to the target terminal;
and the fault positioning module is used for positioning the fault node of the distributed service according to the feedback information of the target terminal.
In a third aspect, an embodiment of the present application provides a fault location device for distributed services, including: at least one processor; at least one memory for storing at least one program; when the at least one program is executed by the at least one processor, the at least one processor is caused to perform the method of the first aspect.
From the above specific implementation process, it can be concluded that the technical solution provided by the present invention has the following advantages or advantages compared to the prior art:
1. according to the technical scheme, when the feedback time of a certain application is delayed, the request information is sent to each level of terminal through the IP address, and the fault point of the distributed service can be quickly and accurately positioned according to the feedback information of each level of terminal.
2. According to the technical scheme, the index table is arranged in the distributed service terminal, so that when the distributed service of an application request is added or modified, the index table can be arranged only for the terminal needing to be changed without global adjustment, and the response efficiency of the service request is improved; in addition, an index table is set in the distributed service terminal, and the unique identifier of each application request related to the distributed service is used as a key word, so that the same service terminal can simultaneously work as one distributed service terminal of a plurality of application requests, and the plurality of application requests can be processed in parallel. When the request information is sent to each level of terminal through the IP address, the feedback information of each level of terminal contains the unique identifier of the application request processed in the preset time period, so that which application requests are processed and which application requests are not processed can be accurately judged, and the application requests of the user can be responded again after the fault is repaired.
In alternative embodiments, the functions/acts noted in the block diagrams may occur out of the order noted in the operational illustrations. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality/acts involved. Furthermore, the embodiments presented and described in the flow charts of the present invention are provided by way of example in order to provide a more thorough understanding of the technology. The disclosed methods are not limited to the operations and logic flows presented herein. Alternative embodiments are contemplated in which the order of various operations is changed and in which sub-operations described as part of larger operations are performed independently.
Furthermore, although the present invention is described in the context of functional modules, it should be understood that, unless otherwise stated to the contrary, one or more of the functions and/or features may be integrated in a single physical device and/or software module, or one or more of the functions and/or features may be implemented in a separate physical device or software module. It will also be appreciated that a detailed discussion of the actual implementation of each module is not necessary for an understanding of the present invention. Rather, the actual implementation of the various functional modules in the apparatus disclosed herein will be understood within the ordinary skill of an engineer, given the nature, function, and internal relationship of the modules. Accordingly, those skilled in the art can, using ordinary skill, practice the invention as set forth in the claims without undue experimentation. It is also to be understood that the specific concepts disclosed are merely illustrative of and not intended to limit the scope of the invention, which is defined by the appended claims and their full scope of equivalents.
The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
While embodiments of the invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.
While the preferred embodiments of the present invention have been illustrated and described, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. A fault positioning method for distributed service is characterized by comprising the following steps:
acquiring an application request, and analyzing the application request to obtain the level number of the distributed service terminal and the IP address of the distributed service terminal;
determining that the feedback time of the application request is greater than a preset time threshold, determining a target terminal according to the level number and the IP address, and sending a fault checking request to the target terminal;
and positioning to obtain the fault node of the distributed service according to the feedback information of the target terminal.
2. The method of claim 1, further comprising the steps of:
constructing an index table, and constructing a binary tree of the application request according to the index table;
the step of locating a failed node that gets distributed services includes:
and traversing the binary tree to locate the fault node of the distributed service.
3. The method according to claim 2, wherein the step of constructing an index table and constructing a binary tree of the application request according to the index table comprises:
acquiring a plurality of historical application requests, and extracting unique identifiers of the historical application requests;
determining a target routing path according to the relationship between the upper level and the lower level of the distributed service terminal;
and constructing an index table according to the unique identifier and the target routing path.
4. The method according to claim 3, wherein the step of obtaining a plurality of historical application requests and extracting the unique identifier of the historical application requests comprises:
and acquiring a plurality of keywords of the historical application request through an atomic function, and converting the keywords into signed integers serving as the unique identifier.
5. The method of claim 3, wherein the step of obtaining a plurality of historical application requests and extracting the unique identifier of the historical application requests further comprises:
determining similar application requests in the plurality of historical application requests, extracting word frequencies in the similar application requests, determining the keywords according to the word frequencies, and converting the keywords into the unique identifier.
6. The method according to claim 3, wherein when the application request is a new service request; after the step of obtaining the level number of the distributed service terminal and the IP address of the distributed service terminal according to the application analysis, the method includes:
newly adding the IP address and the unique identifier of the newly added service request in the index table, generating a new node of the binary tree according to the IP address, and determining a target routing path of the new node;
and acquiring the level number of the new node through the target routing path.
7. The method according to claim 3, wherein when the application request is a change application request; after the step of obtaining the level number of the distributed service terminal and the IP address of the distributed service terminal according to the application analysis, the method includes:
in the index table, modifying the IP address and/or the unique identifier according to the change application request, updating the binary tree according to the modified index table, and updating the target routing path according to the updated binary tree;
and acquiring the level number of the modified nodes through the updated target routing path.
8. A system for fault location of a distributed service, comprising:
the request acquisition module is used for acquiring an application request and analyzing the application request to obtain the level number of the distributed service terminal and the IP address of the distributed service terminal;
the request sending module is used for determining that the feedback time of the application request is greater than a preset time threshold, determining a target terminal according to the level number and the IP address, and sending a fault checking request to the target terminal;
and the fault positioning module is used for positioning the fault node of the distributed service according to the feedback information of the target terminal.
9. A fault location device for a distributed service, comprising:
at least one processor;
at least one memory for storing at least one program; when executed by the at least one processor, cause the at least one processor to perform the method of any one of claims 1-7.
10. A storage medium having stored therein a processor-executable program, wherein the processor-executable program is configured to execute a method for fault location of a distributed service according to any one of claims 1-7 when executed by a processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111131904.4A CN114039842A (en) | 2021-09-26 | 2021-09-26 | Fault positioning method, system, equipment and storage medium for distributed service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111131904.4A CN114039842A (en) | 2021-09-26 | 2021-09-26 | Fault positioning method, system, equipment and storage medium for distributed service |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114039842A true CN114039842A (en) | 2022-02-11 |
Family
ID=80140219
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111131904.4A Pending CN114039842A (en) | 2021-09-26 | 2021-09-26 | Fault positioning method, system, equipment and storage medium for distributed service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114039842A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107896165A (en) * | 2017-11-28 | 2018-04-10 | 新华三技术有限公司 | The method, apparatus and automated test device of locating network fault |
| CN108989128A (en) * | 2018-08-15 | 2018-12-11 | 北京天元创新科技有限公司 | Fault Locating Method and device based on networking structure |
| CN109120432A (en) * | 2018-07-18 | 2019-01-01 | 北京奇艺世纪科技有限公司 | A kind of failed server localization method and device |
| CN111163150A (en) * | 2019-12-25 | 2020-05-15 | 上海精鲲计算机科技有限公司 | Distributed calling tracking system |
-
2021
- 2021-09-26 CN CN202111131904.4A patent/CN114039842A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107896165A (en) * | 2017-11-28 | 2018-04-10 | 新华三技术有限公司 | The method, apparatus and automated test device of locating network fault |
| CN109120432A (en) * | 2018-07-18 | 2019-01-01 | 北京奇艺世纪科技有限公司 | A kind of failed server localization method and device |
| CN108989128A (en) * | 2018-08-15 | 2018-12-11 | 北京天元创新科技有限公司 | Fault Locating Method and device based on networking structure |
| CN111163150A (en) * | 2019-12-25 | 2020-05-15 | 上海精鲲计算机科技有限公司 | Distributed calling tracking system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6405361B1 (en) | Automatically generating a program | |
| CN109150572B (en) | Method, device and computer readable storage medium for realizing alarm association | |
| CN111049696B (en) | Method, node and computing device for node management of blockchain system | |
| US20220100644A1 (en) | METHOD AND SYSTEM FOR AUTOMATED TESTING OF WEB SERVICE APIs | |
| CN114285852A (en) | Service calling method and device based on multi-stage service platform | |
| CN112395339B (en) | Intersystem data admission verification method, device, computer equipment and storage medium | |
| CN106095511A (en) | A kind of server updating method and apparatus | |
| US7065085B2 (en) | Method for summarizing default address of PNNI lowest level node in ATM switching system | |
| CN114039842A (en) | Fault positioning method, system, equipment and storage medium for distributed service | |
| CN111625474A (en) | Automatic testing method of alliance chain | |
| CN115756494A (en) | Business data processing method and device, electronic equipment and storage medium | |
| CN108206823B (en) | Method, system and network equipment for processing message | |
| Seol et al. | Interoperability test generation and minimization for communication protocols based on the multiple stimuli principle | |
| CN108322459B (en) | EPaxos-based decentralized network domain name service method and system | |
| US20050076343A1 (en) | Persistent storage of network management data using object references | |
| CN111736917A (en) | Data verification method and device, computer equipment and storage medium | |
| CN117424848B (en) | Node call optimization method, system, equipment and medium based on machine learning | |
| CN112860708B (en) | Data consistency restoration method, system, device and equipment | |
| CN106936716B (en) | TTP (time to live) analysis and conversion method, forwarding table entry sending method and device | |
| CN113965489B (en) | Link timeout detection method, device, computer equipment and storage medium | |
| EP1720285B1 (en) | Apparatus and method for processing messages in a network management system | |
| KR100454179B1 (en) | Connection Information Correspondence Method Between TMN Agent And Exchange System | |
| EP1460859A1 (en) | Method, system and apparatus for managing signaling connections in a telecommunications network | |
| CN113703988B (en) | Capability arrangement method, device, equipment and medium | |
| CN111061233B (en) | Design method and device for industrial control system and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220211 |