CN111416888A - Addressing method and device based on service gateway - Google Patents
Addressing method and device based on service gateway Download PDFInfo
- Publication number
- CN111416888A CN111416888A CN202010265712.1A CN202010265712A CN111416888A CN 111416888 A CN111416888 A CN 111416888A CN 202010265712 A CN202010265712 A CN 202010265712A CN 111416888 A CN111416888 A CN 111416888A
- Authority
- CN
- China
- Prior art keywords
- access
- skip count
- failure
- host
- count value
- 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 49
- 238000004590 computer program Methods 0.000 claims description 20
- 238000009825 accumulation Methods 0.000 claims description 3
- 230000007246 mechanism Effects 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 18
- 230000006870 function Effects 0.000 description 9
- 238000004891 communication Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 6
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000000750 progressive effect Effects 0.000 description 2
- 108010001267 Protein Subunits Proteins 0.000 description 1
- 239000007795 chemical reaction product Substances 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides an addressing method and device based on a service gateway, comprising the following steps: acquiring the access attempt times of a service gateway; determining whether to carry out addressing access according to the relation between the access attempt times and the number of the hosts in the host list; and if the addressing access is carried out, determining whether the address of the host is accessed or not by judging the failure skip count value of the host in the host list. The addressing method provided by the invention has the advantages that the failure address is skipped for a certain number of times, and then the failure address is isolated, so that the server which fails in access can be prevented from being accessed for many times, the transaction success rate is improved, the number of times of the server which fails in back-end access is reduced, the request pressure of the back-end access failure server is reduced, and the time for the back-end failure server to recover the service is given.
Description
Technical Field
The present application belongs to the field of computer network technology, and in particular, to an addressing method and device based on a service gateway.
Background
In the distributed platform, the service gateway selects an address by configuring a plurality of backend service addresses, by polling or selecting a weight, and the like, so as to perform backend service access. However, when the address of the back-end service is unavailable, the service gateway does not isolate the failed address, but continues to send a request to the failed address, resulting in multiple failures of transactions.
Disclosure of Invention
The application provides an addressing method and device based on a service gateway, which at least solve the problem that in the prior art, when the address of a back-end service is unavailable, the service gateway cannot isolate a failed address, but continues to send a request to the failed address, so that multiple transaction failures occur.
According to an aspect of the present application, there is provided a service gateway-based addressing method, including:
acquiring the access attempt times of a service gateway;
determining whether to carry out addressing access according to the relation between the access attempt times and the number of the hosts in the host list;
and if the addressing access is carried out, determining whether the address of the host is accessed or not by judging the failure skip count value of the host in the host list.
In one embodiment, determining whether to perform an addressing access according to a relationship between a number of access attempts and a number of hosts in a host list comprises:
judging the number of access attempts and the number of hosts in the host list; if the access attempt times are not more than the number of the hosts, performing addressing access; if the number of access attempts is greater than the number of hosts, no addressing access is performed.
In one embodiment, determining whether to access the address of the host by determining a failure skip count value of the host in the host list comprises:
sequentially acquiring host addresses in a host list and a current failure skip count value of the host;
if the current failure skip count value is not 0, updating the current failure skip count value according to a preset failure skip count threshold value, and updating the access attempt times;
and if the current failure skip count value is 0, accessing the host through the host address to obtain an access result.
In one embodiment, updating the current skip count value according to a preset skip count threshold value includes:
when the current failure skip count value is smaller than the failure skip count threshold value, the updated failure skip count value is the current failure skip count value plus 1;
when the current failed skip count value is equal to the failed skip count threshold, the updated failed skip count value is 0.
In an embodiment, the service gateway-based addressing method further includes:
and judging whether the access result is successful, and if the access result is unsuccessful, updating the failure skip count value and the access attempt times.
According to another aspect of the present application, there is also provided a service gateway-based addressing apparatus, including:
an acquisition unit, configured to acquire the number of access attempts of a service gateway;
the first judgment unit is used for determining whether to carry out addressing access according to the relation between the access attempt times and the number of the hosts in the host list;
and a second judging unit for determining whether to access the address of the host by judging a failure skip count value of the host in the host list when performing the address access.
In one embodiment, the first judging unit includes:
the size judging module is used for judging the access attempt times and the number of the hosts in the host list;
the decision module is used for addressing access when the number of access attempts is not more than the number of the hosts; when the number of access attempts is greater than the number of hosts, no addressing access is performed.
In one embodiment, the second determination unit includes:
the address and failure skip count value acquisition module is used for sequentially acquiring the host addresses in the host list and the current failure skip count values of the host;
the skip updating module is used for updating the current failure skip count value according to a preset failure skip count threshold value and updating the access attempt times when the current failure skip count value is not 0;
and the access module is used for accessing the host through the host address to obtain an access result when the current failure skip count value is 0.
In one embodiment, the skip update module includes:
the accumulation module is used for adding 1 to the current failure skip count value after updating when the current failure skip count value is smaller than the failure skip count threshold value;
and the zeroing module is used for updating the failure skip count value to be 0 when the current failure skip count value is equal to the failure skip count threshold value.
In one embodiment, the service gateway-based addressing means further comprises:
and the result judging unit is used for judging whether the access result is successful or not, and updating the failure skip count value and the access attempt times if the access result is unsuccessful.
According to the method and the device, the failure skip count value is added, the number of times that each address is skipped due to access failure is recorded in detail, whether the address is accessed or not is determined by judging the number of times of the failure skip count value, and therefore the result that multiple times of failure are caused by multiple times of access to an inaccessible address is avoided.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of an addressing method based on a service gateway according to the present application.
Fig. 2 is a flowchart illustrating determining whether to access an address of a host by determining a failure skip count value of the host in a host list according to an embodiment of the present application.
Fig. 3 is a flowchart illustrating a method for updating a current skip count value according to a preset skip count threshold in the embodiment of the present application.
Fig. 4 is a flowchart of an addressing method provided in an embodiment of the present application.
Fig. 5 is a block diagram illustrating a structure of an addressing apparatus based on a service gateway according to the present application.
Fig. 6 is a block diagram of a first determining unit in the embodiment of the present application.
Fig. 7 is a block diagram of a second determining unit in the embodiment of the present application.
Fig. 8 is a block diagram of a skip update module in the embodiment of the present application.
Fig. 9 is a specific implementation of an electronic device in an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The service gateway in the existing distributed platform configures a plurality of backend service addresses, selects the addresses by polling or weighting and the like, and performs backend service access, and the method has the following disadvantages:
once a certain back-end address service fails, the failed address is not skipped and isolated, but a request is continuously sent to the failed address, so that the service fails, and the transaction failure rate is increased.
Based on the above drawbacks in the prior art, the present application provides a service gateway-based addressing method, as shown in fig. 1, including the following steps:
s101: and acquiring the access attempt times of the service gateway.
In a specific embodiment, the number of access attempts of the service gateway is initialized first, and the initialization value of the number of access attempts T is 0.
S102: and determining whether to carry out addressing access according to the relation between the access attempt times and the number of the hosts in the host list.
In a specific embodiment, the access attempt number T of the service gateway and the number N of hosts in the host list are obtained, whether addressing access should be performed is determined according to the relationship between the attempt number T and the number N of hosts, and if addressing access is not performed, the process is directly ended.
S103: and if the addressing access is carried out, determining whether the address of the host is accessed or not by judging the failure skip count value of the host in the host list.
In one embodiment, if the address access is performed, the host address in the host list and the failure skip count value of the host are obtained, and whether the address of the host is accessed is determined by judging whether the failure skip count value is in a composite requirement or not.
In one embodiment, determining whether to perform an addressing access according to a relationship between a number of access attempts and a number of hosts in a host list comprises:
judging the number of access attempts and the number of hosts in the host list; if the access attempt times are not more than the number of the hosts, performing addressing access; if the number of access attempts is greater than the number of hosts, no addressing access is performed.
In a specific embodiment, if the number of access attempts T is less than or equal to the number N of hosts, the next addressing access is performed, and if the number of access attempts T is greater than the number N of hosts, the addressing access is not performed, and the process is ended directly.
In one embodiment, determining whether to access the address of the host by determining the failure skip count value of the host in the host list, as shown in fig. 2, includes:
s201: the host addresses in the host list and the current failure skip count value of the host are sequentially obtained.
In one embodiment, if the number of access attempts, T, is less than or equal to the number of hosts, N, then the host addresses in the host list and the current failure skip count value, C, for that host are sequentially obtained.
S202: and if the current failure skip count value is not 0, updating the current failure skip count value according to a preset failure skip count threshold value, and updating the access attempt times.
In a specific embodiment, whether the address should be accessed is determined according to the skip fail count value C obtained in S201, and if the skip fail count value C is not 0, it indicates that the address has been skipped by the miss last time, so that it is determined to skip directly without accessing the address, but the current skip fail count value and the number of access attempts need to be updated according to a preset skip fail count threshold. For example, the algorithm is C ═ C + 1)% (threshold of number of failed skips +1), the number of attempts T is number of attempts T +1, if the threshold of the failed skip count is set to 3, then when the first access fails, C is recorded as 1, when the second access request is made, C at this time is judged not to be 0(C is 1), then the count of C is continuously increased: c ═ C + 1)% (threshold of number of failed skips +1), updated C ═ 2; then, when the third access request is made, C is still not 0(C is 2), and C continues to increase, and C is (2+ 1)% (3+1) = 3; when the fourth access request is made, C is not 0(C is 3), at this time, since C has reached the set failure skip count threshold value, (3+ 1)% (3+1) = 0, and then, when the fifth access request is found to be 0, the request is initiated to the back end, and thus 3 times of failure skip count are performed in total.
S203: and if the current failure skip count value is 0, accessing the host through the host address to obtain an access result.
In one embodiment, if the failure skip count value C is 0, which indicates that the previous access of the address has not failed, the access may be directly performed on the address to obtain the access result.
In an embodiment, updating the current skip count value according to the preset skip count threshold value, as shown in fig. 3, includes:
s301: when the current failed skip count value is less than the failed skip count threshold, the updated failed skip count value is the current failed skip count value incremented by 1.
In one embodiment, when the current value C of the failed skip count is 1 and the value of the failed skip count is 3, the updated value C of the failed skip count is 2, and the number of access attempts of the serving gateway is increased by 1 on the original basis.
S302: when the current failed skip count value is equal to the failed skip count threshold, the updated failed skip count value is 0.
In one embodiment, when the current value C of the failed skip count is 3 and the value of the failed skip count is 3, the updated value C of the failed skip count is 0 (return to zero), and the number of access attempts of the serving gateway is increased by 1 on the original basis.
In an embodiment, the service gateway-based addressing method further includes:
and judging whether the access result is successful, and if the access result is unsuccessful, updating the failure skip count value and the access attempt times.
In one embodiment, if the access to the address is unsuccessful, the failed skip count is incremented by 1, and the number of access attempts by the serving gateway is incremented by 1.
To fully explain the present solution, fig. 4 is a flowchart of an embodiment of the present solution.
Based on the same inventive concept, the present application further provides an addressing device based on a service gateway, which can be used to implement the method described in the foregoing embodiments, as described in the following embodiments. Because the principle of solving the problem of the addressing device based on the service gateway is similar to that of the addressing method based on the service gateway, the implementation of the addressing device based on the service gateway can refer to the implementation of the addressing method based on the service gateway, and repeated parts are not described again. As used hereinafter, the term "unit" or "module" may be a combination of software and/or hardware that implements a predetermined function. While the system described in the embodiments below is preferably implemented in software, implementations in hardware, or a combination of software and hardware are also possible and contemplated.
As shown in fig. 5, the present application further provides an addressing apparatus based on a service gateway, including:
an obtaining unit 501, configured to obtain the number of access attempts of a service gateway;
a first judging unit 502, configured to determine whether to perform addressing access according to a relationship between the number of access attempts and the number of hosts in the host list;
a second judging unit 503, configured to determine whether to access the address of the host by judging the failure skip count value of the host in the host list when performing the addressing access.
In one embodiment, as shown in fig. 6, the first determining unit 502 includes:
a size determining module 601, configured to determine the number of access attempts and the number of hosts in the host list;
a decision module 602, configured to perform addressing access when the number of access attempts is not greater than the number of hosts; when the number of access attempts is greater than the number of hosts, no addressing access is performed.
In one embodiment, as shown in fig. 7, the second determining unit 503 includes:
an address and failure skip count value obtaining module 701, configured to sequentially obtain host addresses in a host list and a current failure skip count value of the host;
a skip updating module 702, configured to update the current skip count value according to a preset skip count threshold value when the current skip count value is not 0, and update the number of access attempts;
the accessing module 703 is configured to access the host through the host address to obtain an access result when the current failure skip count value is 0.
In one embodiment, as shown in FIG. 8, skip update module 702 includes:
an accumulation module 801, configured to, when the current failure skip count value is smaller than the failure skip count threshold value, add 1 to the current failure skip count value by the updated failure skip count value;
a zeroing module 802, configured to update the failure skip count value to be 0 when the current failure skip count value is equal to the failure skip count threshold.
In one embodiment, the service gateway-based addressing means further comprises:
and the result judging unit is used for judging whether the access result is successful or not, and updating the failure skip count value and the access attempt times if the access result is unsuccessful.
The invention has two advantages: firstly, when a local addressing mode is provided, a certain number of times of skipping operation is carried out on a failed address, and then a mechanism for isolating the failed address is carried out, so that a server which fails in access can be prevented from being accessed for many times, and the transaction success rate is improved; and secondly, the frequency of sending the server with the back-end access failure is reduced, the request pressure of the server with the back-end access failure is reduced, and the time for the server with the back-end access failure to recover the service is given to the server with the back-end access failure.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The principle and the implementation mode of the invention are explained by applying specific embodiments in the invention, and the description of the embodiments is only used for helping to understand the method and the core idea of the invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
An embodiment of the present application further provides a specific implementation manner of an electronic device capable of implementing all steps in the method in the foregoing embodiment, and referring to fig. 9, the electronic device specifically includes the following contents:
a processor (processor)901, a memory 902, a communication Interface (Communications Interface)903, a bus 904, and a nonvolatile memory 905;
the processor 901, the memory 902 and the communication interface 903 complete mutual communication through the bus 904;
the processor 901 is configured to call the computer programs in the memory 902 and the nonvolatile memory 905, and when the processor executes the computer programs, the processor implements all the steps in the method in the foregoing embodiments, for example, when the processor executes the computer programs, the processor implements the following steps:
s101: and acquiring the access attempt times of the service gateway.
S102: and determining whether to carry out addressing access according to the relation between the access attempt times and the number of the hosts in the host list.
S103: and if the addressing access is carried out, determining whether the address of the host is accessed or not by judging the failure skip count value of the host in the host list.
Embodiments of the present application also provide a computer-readable storage medium capable of implementing all the steps of the method in the above embodiments, where the computer-readable storage medium stores thereon a computer program, and the computer program when executed by a processor implements all the steps of the method in the above embodiments, for example, the processor implements the following steps when executing the computer program:
s101: and acquiring the access attempt times of the service gateway.
S102: and determining whether to carry out addressing access according to the relation between the access attempt times and the number of the hosts in the host list.
S103: and if the addressing access is carried out, determining whether the address of the host is accessed or not by judging the failure skip count value of the host in the host list.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the hardware + program class embodiment, since it is substantially similar to the method embodiment, the description is simple, and the relevant points can be referred to the partial description of the method embodiment. Although embodiments of the present description provide method steps as described in embodiments or flowcharts, more or fewer steps may be included based on conventional or non-inventive means. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. When an actual apparatus or end product executes, it may execute sequentially or in parallel (e.g., parallel processors or multi-threaded environments, or even distributed data processing environments) according to the method shown in the embodiment or the figures. The terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, the presence of additional identical or equivalent elements in a process, method, article, or apparatus that comprises the recited elements is not excluded. For convenience of description, the above devices are described as being divided into various modules by functions, and are described separately. Of course, in implementing the embodiments of the present description, the functions of each module may be implemented in one or more software and/or hardware, or a module implementing the same function may be implemented by a combination of multiple sub-modules or sub-units, and the like. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form. The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
As will be appreciated by one skilled in the art, embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, embodiments of the present description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present description may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein. The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment. In the description herein, references to the description of "an embodiment," "a particular embodiment," 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 embodiments herein.
In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction. The above description is only an example of the embodiments of the present disclosure, and is not intended to limit the embodiments of the present disclosure. Various modifications and variations to the embodiments described herein will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the embodiments of the present specification should be included in the scope of the claims of the embodiments of the present specification.
Claims (12)
1. A service gateway based addressing method, comprising:
acquiring the access attempt times of a service gateway;
determining whether to carry out addressing access according to the relation between the access attempt times and the number of the hosts in the host list;
and if the addressing access is carried out, determining whether the address of the host is accessed or not by judging the failure skip count value of the host in the host list.
2. The addressing method of claim 1, wherein said determining whether to perform an addressing access according to the relationship between the number of access attempts and the number of hosts in the host list comprises:
judging the access attempt times and the number of hosts in a host list; if the access attempt times are not more than the number of the hosts, performing addressing access; and if the access attempt times are larger than the number of the hosts, not performing addressing access.
3. The addressing method of claim 1, wherein determining whether to access the address of the host by determining a failure skip count value of the host in the host list comprises:
sequentially acquiring host addresses in the host list and current failure skip count values of the host;
if the current failure skip count value is not 0, updating the current failure skip count value according to a preset failure skip count threshold value, and updating the access attempt times;
and if the current failure skip count value is 0, accessing the host through the host address to obtain an access result.
4. The addressing method according to claim 3, wherein said updating the current skip count value according to the preset skip count threshold value comprises:
when the current failure skip count value is smaller than the failure skip count threshold value, the updated failure skip count value is the current failure skip count value plus 1;
when the current failed skip count value is equal to the failed skip count threshold, the updated failed skip count value is 0.
5. The addressing method of claim 3, further comprising:
and judging whether the access result is successful or not, and if the access result is unsuccessful, updating the failure skip count value and the access attempt times.
6. An addressing mechanism based on a service gateway, comprising:
an acquisition unit, configured to acquire the number of access attempts of a service gateway;
the first judgment unit is used for determining whether to carry out addressing access according to the relation between the access attempt times and the number of the hosts in the host list;
and a second judging unit for determining whether to access the address of the host by judging a failure skip count value of the host in the host list when performing the address access.
7. The addressing device as claimed in claim 6, wherein the first judging unit comprises:
the size judging module is used for judging the access attempt times and the size of the number of the hosts in the host list;
the decision module is used for carrying out addressing access when the access attempt times are not more than the number of the hosts; when the number of access attempts is greater than the number of hosts, no addressing access is performed.
8. The addressing device as recited in claim 6, wherein the second determining unit comprises:
an address and failure skip count value obtaining module, configured to sequentially obtain host addresses in the host list and a current failure skip count value of the host;
a skip updating module, configured to update the current skip count value according to a preset skip count threshold value when the current skip count value is not 0, and update the number of access attempts;
and the access module is used for accessing the host through the host address to obtain an access result when the current failure skip count value is 0.
9. The addressing mechanism as recited in claim 8, wherein the skip update module comprises:
the accumulation module is used for adding 1 to the current failure skip count value after updating when the current failure skip count value is smaller than the failure skip count threshold value;
and the zeroing module is used for updating the failure skip count value to be 0 when the current failure skip count value is equal to the failure skip count threshold value.
10. The addressing device as recited in claim 8, further comprising:
and the result judging unit is used for judging whether the access result is successful or not, and if the access result is unsuccessful, updating the failure skip count value and the access attempt times.
11. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the service gateway based addressing method of any of claims 1 to 5 when executing the program.
12. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the service gateway based addressing method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010265712.1A CN111416888A (en) | 2020-04-07 | 2020-04-07 | Addressing method and device based on service gateway |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010265712.1A CN111416888A (en) | 2020-04-07 | 2020-04-07 | Addressing method and device based on service gateway |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111416888A true CN111416888A (en) | 2020-07-14 |
Family
ID=71494797
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010265712.1A Pending CN111416888A (en) | 2020-04-07 | 2020-04-07 | Addressing method and device based on service gateway |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111416888A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112055083A (en) * | 2020-09-08 | 2020-12-08 | 工银科技有限公司 | Request processing method and device, electronic equipment and medium |
| CN115002027A (en) * | 2022-05-26 | 2022-09-02 | 中国邮政储蓄银行股份有限公司 | Data addressing method and device for in-transit process |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006314A (en) * | 2009-09-02 | 2011-04-06 | 中国银联股份有限公司 | Multiserver adaptive task scheduling method and device thereof |
| WO2014048572A1 (en) * | 2012-09-27 | 2014-04-03 | Amadeus S.A.S. | System and method for load distribution in a network |
| US20140325067A1 (en) * | 2011-11-07 | 2014-10-30 | Square Enix Holdings Co., Ltd. | Management apparatus and control method of management apparatus |
| CN107018182A (en) * | 2017-03-23 | 2017-08-04 | 深圳市创梦天地科技有限公司 | The fault-tolerance processing method and device of load balancing |
| CN108600005A (en) * | 2018-04-23 | 2018-09-28 | 国云科技股份有限公司 | A method of defence micro services avalanche effect |
| CN108712489A (en) * | 2018-05-11 | 2018-10-26 | 中国平安人寿保险股份有限公司 | A kind of breaking control method, device and its readable storage medium storing program for executing of network linking |
| CN109450691A (en) * | 2018-11-20 | 2019-03-08 | 深圳前海微众银行股份有限公司 | Gateway monitoring method, equipment and computer readable storage medium |
-
2020
- 2020-04-07 CN CN202010265712.1A patent/CN111416888A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006314A (en) * | 2009-09-02 | 2011-04-06 | 中国银联股份有限公司 | Multiserver adaptive task scheduling method and device thereof |
| US20140325067A1 (en) * | 2011-11-07 | 2014-10-30 | Square Enix Holdings Co., Ltd. | Management apparatus and control method of management apparatus |
| WO2014048572A1 (en) * | 2012-09-27 | 2014-04-03 | Amadeus S.A.S. | System and method for load distribution in a network |
| CN107018182A (en) * | 2017-03-23 | 2017-08-04 | 深圳市创梦天地科技有限公司 | The fault-tolerance processing method and device of load balancing |
| CN108600005A (en) * | 2018-04-23 | 2018-09-28 | 国云科技股份有限公司 | A method of defence micro services avalanche effect |
| CN108712489A (en) * | 2018-05-11 | 2018-10-26 | 中国平安人寿保险股份有限公司 | A kind of breaking control method, device and its readable storage medium storing program for executing of network linking |
| CN109450691A (en) * | 2018-11-20 | 2019-03-08 | 深圳前海微众银行股份有限公司 | Gateway monitoring method, equipment and computer readable storage medium |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112055083A (en) * | 2020-09-08 | 2020-12-08 | 工银科技有限公司 | Request processing method and device, electronic equipment and medium |
| CN112055083B (en) * | 2020-09-08 | 2022-06-10 | 中国工商银行股份有限公司 | Request processing method and device, electronic equipment and medium |
| CN115002027A (en) * | 2022-05-26 | 2022-09-02 | 中国邮政储蓄银行股份有限公司 | Data addressing method and device for in-transit process |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108683516B (en) | Application instance upgrading method, device and system | |
| EP2893443B1 (en) | Re-configuration in cloud computing environments | |
| CN107005435B (en) | Network service descriptor shelving method and device | |
| US20180152339A1 (en) | APPLICATION RESILIENCY USING APIs | |
| CN105979007A (en) | Acceleration resource processing method and device and network function virtualization system | |
| CN111416888A (en) | Addressing method and device based on service gateway | |
| CN105516086A (en) | Service processing method and apparatus | |
| CN108667864B (en) | Method and device for scheduling resources | |
| CN112470119B (en) | Service upgrading method and device in distributed system and distributed system | |
| CN110471744B (en) | Password modification method, device, equipment and computer readable storage medium | |
| CN110609707B (en) | Online data processing system generation method, device and equipment | |
| CN113869989B (en) | Information processing method and device | |
| US20220027137A1 (en) | Automatically orchestrating deployments of software-defined storage stacks | |
| CN109962963B (en) | Message processing method and device | |
| CN113157586A (en) | Financial market unit test case generation method and device | |
| CN115826845A (en) | Storage resource allocation method and device, storage medium and electronic device | |
| US10642680B2 (en) | Chronologically ordered log-structured key-value store from failures during garbage collection | |
| CN112818336A (en) | Data access method, data access device and computer readable storage medium | |
| CN112988405A (en) | Micro-service automatic degradation method and device and computing equipment | |
| CN112306371A (en) | Method, apparatus and computer program product for storage management | |
| US11163462B1 (en) | Automated resource selection for software-defined storage deployment | |
| CN111338651B (en) | Method and device for providing download resource, and method and device for downloading resource | |
| CN115277408B (en) | Agent configuration information updating method, device, equipment and storage medium | |
| CN108833492B (en) | Method, device, client and system for improving server calling accuracy | |
| CN102868594A (en) | Method and device for message processing |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20220907 Address after: 25 Financial Street, Xicheng District, Beijing 100033 Applicant after: CHINA CONSTRUCTION BANK Corp. Address before: 25 Financial Street, Xicheng District, Beijing 100033 Applicant before: CHINA CONSTRUCTION BANK Corp. Applicant before: Jianxin Financial Science and Technology Co.,Ltd. |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200714 |