CN112929296A - High-concurrency service opening method and device based on distributed queue - Google Patents
High-concurrency service opening method and device based on distributed queue Download PDFInfo
- Publication number
- CN112929296A CN112929296A CN201911238589.8A CN201911238589A CN112929296A CN 112929296 A CN112929296 A CN 112929296A CN 201911238589 A CN201911238589 A CN 201911238589A CN 112929296 A CN112929296 A CN 112929296A
- Authority
- CN
- China
- Prior art keywords
- service
- work order
- fulfillment
- controller
- opening
- 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 48
- 238000012545 processing Methods 0.000 claims description 18
- 238000004590 computer program Methods 0.000 claims description 13
- 230000004083 survival effect Effects 0.000 claims description 8
- 230000002159 abnormal effect Effects 0.000 claims description 5
- 238000012544 monitoring process Methods 0.000 claims description 3
- 238000009825 accumulation Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 19
- 230000008569 process Effects 0.000 description 8
- 230000006870 function Effects 0.000 description 4
- 230000003213 activating effect Effects 0.000 description 2
- 230000004913 activation Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 210000004556 brain Anatomy 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000003313 weakening effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/78—Architectures of resource allocation
- H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Telephonic Communication Services (AREA)
Abstract
The invention provides a high concurrency service opening method and a device based on a distributed queue, wherein the method comprises the following steps: acquiring a service opening work order according to the distributed queue; sending the service fulfillment work order to the first controller, and acquiring a service fulfillment result of the first controller; acquiring a next service fulfillment work order in the distributed queue according to the service fulfillment result; and sending the next service fulfillment work order to the second controller so as to enable the second controller to perform service fulfillment. According to the invention, the service opening work order is obtained according to the distributed queue, so that the problem of high concurrency when the service work order is issued can be solved, the performance of the server is improved, and the hardware cost is reduced; and controlling the acquisition of the next service fulfillment work order according to the service fulfillment result of the first controller, thereby preventing the accumulation of the service fulfillment work orders caused by the failure of the service fulfillment result and improving the success rate and efficiency of service fulfillment.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a high concurrency service opening method and device based on distributed queues.
Background
A distributed SDN (Software Defined Network) controller is responsible for (taking province as an example) provisioning of services for hundreds of millions of Network devices and terminals in province. With the increase of the service level, the problem of server performance caused by high concurrency is brought, so that the opening failure rate is increased and the opening efficiency is reduced. It is not a long time to solve the problem by increasing the hardware and number of servers.
Disclosure of Invention
The invention provides a high-concurrency service opening method and device based on distributed queues, which can relieve the pressure of high concurrency on an SDN controller and improve the success rate of service opening.
In a first aspect, an embodiment of the present invention provides a method for opening a high concurrent service based on a distributed queue, where the method includes: acquiring a service opening work order according to the distributed queue; sending the service fulfillment work order to a first controller, and acquiring a service fulfillment result of the first controller; acquiring a next service fulfillment work order in the distributed queue according to the service fulfillment result; and sending the next service fulfillment work order to a second controller so as to enable the second controller to perform service fulfillment.
In a second aspect, an embodiment of the present invention further provides a device for provisioning a high concurrent service based on a distributed queue, where the device includes: the first acquisition module is used for acquiring a service opening work order according to the distributed queue; the first sending module is used for sending the service fulfillment work order to a first controller and acquiring a service fulfillment result of the first controller; the second obtaining module is used for obtaining a next service opening work order in the distributed queue according to the service opening result; and the second sending module is used for sending the next service fulfillment work order to a second controller so as to enable the second controller to perform service fulfillment.
In a third aspect, an embodiment of the present invention further provides a computer device, including a memory and a processor, where the memory stores a computer program that can run on the processor, and the processor, when executing the computer program, implements the method for provisioning high concurrent services based on distributed queues.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable medium having a non-volatile program code executable by a processor, where the program code causes the processor to execute the method for provisioning high concurrent services based on distributed queues.
The embodiment of the invention has the following beneficial effects: the embodiment of the invention provides a high-concurrency service opening scheme based on a distributed queue, which is characterized in that a service opening work order is obtained through the distributed queue, so that basic data required by service opening is obtained, the service opening work order is sent to a first controller, so that the first controller carries out service opening operation according to the service opening work order, the service opening result of the first controller is obtained, the next service opening work order in the distributed queue is obtained according to the service opening result, and then the next service opening work order is sent to a second controller, so that the second controller carries out service opening. In the embodiment of the invention, the service activating work order is obtained according to the distributed queue, so that the problem of high concurrency when the service work order is issued can be solved, the performance of the server is improved, and the hardware cost is reduced; and controlling the acquisition of the next service fulfillment work order according to the service fulfillment result of the first controller, thereby preventing the accumulation of the service fulfillment work orders caused by the failure of the service fulfillment result and improving the success rate and efficiency of service fulfillment.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
In order to make the aforementioned and other objects, features and advantages of the present invention comprehensible, preferred embodiments accompanied with figures are described in detail below.
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, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a flowchart of a method for provisioning a high concurrent service based on a distributed queue according to an embodiment of the present invention;
fig. 2 is a schematic diagram of an implementation flow framework of a distributed queue-based high concurrent service provisioning method according to an embodiment of the present invention;
fig. 3 is a block diagram of a structure of a high concurrent service provisioning apparatus based on a distributed queue according to an embodiment of the present invention;
fig. 4 is a block diagram of another structure of a high concurrent service provisioning apparatus based on a distributed queue according to an embodiment of the present invention;
fig. 5 is a block diagram of a computer device according to an embodiment of the present invention.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some, but not all embodiments of the present invention. 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 SDN controller serves as a unified control plane, and plays a role of the whole network brain. Once an SDN controller fails, a control plane of the entire network is disabled, which causes an entire network outage accident, and how to effectively solve the problem of high concurrent pressure on the SDN controller is an urgent task.
Based on this, the method and the device for opening the high concurrent service based on the distributed queue provided by the embodiment of the invention can improve the success rate and efficiency of opening the service and reduce the hardware cost of the server.
To facilitate understanding of the embodiment, first, a detailed description is given to a high concurrent service provisioning method based on a distributed queue disclosed in the embodiment of the present invention.
The embodiment of the invention provides a high concurrent service provisioning method based on a distributed queue, which is shown in a flow chart of the high concurrent service provisioning method based on the distributed queue in figure 1 and comprises the following steps:
and step S102, obtaining a service fulfillment work order according to the distributed queue.
In the embodiment of the invention, the service fulfillment work order comprises related data required by service fulfillment. The service opening work order in the distributed queue has the processing sequence or the processing priority. The service opening work orders can be acquired one by one according to the sequence of the work orders in the distributed queue.
And step S104, sending the service fulfillment work order to the first controller, and acquiring a service fulfillment result of the first controller.
In the embodiment of the present invention, the first controller may be an idle SDN controller selected according to a preset rule, the first controller may be configured to perform a service provisioning operation according to a received service provisioning work order, and the service provisioning result may be a successful provisioning or a failed provisioning, and the service provisioning result generated by the first controller according to the service provisioning work order is obtained.
And step S106, acquiring a next service fulfillment work order in the distributed queue according to the service fulfillment result.
In the embodiment of the invention, the service fulfillment result may be success or failure, if the service fulfillment result is failure, the processor may process the current service fulfillment work order for a long time or repeatedly, which affects the progress of service fulfillment, and in addition, as the number of service fulfillment work orders is large, the accumulation of service work orders may be caused as new service fulfillment work orders are continuously generated. Therefore, the step of obtaining the next service fulfillment work order in the distributed queue is controlled according to the service fulfillment result, and the problem that the performance of the server is affected due to the stagnation of the service fulfillment process caused by the service fulfillment result is avoided.
It should be noted that the next service fulfillment work order is a service fulfillment work order to be processed, which is sequenced in the distributed queue after the current service fulfillment work order.
And step S108, sending the next service fulfillment work order to the second controller so as to enable the second controller to perform service fulfillment.
In an embodiment of the present invention, the second controller may be the same or a different idle SDN controller as the first controller. And after the second controller receives the next service fulfillment work order, performing service fulfillment processing. And obtaining a service fulfillment result of the second controller, and controlling to obtain a next service fulfillment work order in the distributed queue according to the service fulfillment result, where the process may refer to step S106, and details of the embodiment of the present invention are not repeated.
The embodiment of the invention provides a high-concurrency service opening scheme based on a distributed queue, which is characterized in that a service opening work order is obtained through the distributed queue, so that basic data required by service opening is obtained, the service opening work order is sent to a first controller, so that the first controller carries out service opening operation according to the service opening work order, the service opening result of the first controller is obtained, the next service opening work order in the distributed queue is obtained according to the service opening result, and then the next service opening work order is sent to a second controller, so that the second controller carries out service opening. In the embodiment of the invention, the service activating work order is obtained according to the distributed queue, so that the problem of high concurrency when the service work order is issued can be solved, the performance of the server is improved, and the hardware cost is reduced; and controlling the acquisition of the next service fulfillment work order according to the service fulfillment result of the first controller, thereby preventing the accumulation of the service fulfillment work orders caused by the failure of the service fulfillment result and improving the success rate and efficiency of service fulfillment.
In order to ensure the continuous operation of service provisioning without losing the work order, the next service provisioning work order in the distributed queue is obtained according to the service provisioning result, and the method can be executed according to the following steps:
if the service opening result is successful, acquiring a next service opening work order in the distributed queue; and if the service opening result is opening failure, synchronizing the service opening work order to the backup queue according to the number of opening failure times or the survival time of the service opening work order, and acquiring the next service opening work order in the distributed queue.
In the embodiment of the invention, if the service opening result in the first controller is successful, the next service opening work order is obtained according to the sequence in the distributed queue, and the service opening is continued. If the service opening result in the first controller is opening failure, counting the number of times of opening failure, presetting a failure number threshold, if the number of times of opening failure reaches the preset failure number threshold, synchronizing the service opening work order of opening failure to the backup queue, or monitoring the survival time of the service opening work order of opening failure, presetting a time threshold, if the survival time reaches the time threshold, synchronizing the service opening work order of opening failure to the backup queue, and then acquiring the next service opening work order according to the sequence in the distributed queue.
In the embodiment of the invention, the backup queue is used for storing the service fulfillment work order of which the failure times reach the failure time threshold or the survival time reaches the time threshold, and after the relevant information of the service fulfillment work order of which the fulfillment failures are synchronized to the backup queue, the next service fulfillment work order is obtained to ensure that the service fulfillment work order is continuously processed and the pressure of the server is reduced.
It should be noted that, in the embodiment of the present invention, the service fulfillment work order includes a retry-failure policy, and for a certain service fulfillment work order, when one service fulfillment is unsuccessful, the service fulfillment work order may be repeatedly implemented again according to the service fulfillment work order. Therefore, for a service provisioning work order, the condition of multiple service provisioning failures or the condition of service provisioning failures within a period of time may occur, and the time length is taken as the survival time length of the work order. Therefore, the frequency of the service fulfillment work order fulfillment failure can be counted, and the survival time of the service fulfillment work order can be monitored.
Considering that in order to further process the service opening work order with failed opening, the method can also execute the following steps:
circularly traversing the backup alignment according to a preset time length; removing a service opening work order with opening failure or generating a manual retry notification according to the traversal result and the abnormal rule; and the manual retry notification is used for prompting the service opening work order which fails to be manually processed and opened.
In the embodiment of the present invention, the preset duration may be set according to actual requirements, which is not specifically limited in the embodiment of the present invention. The backup queue is traversed, and basic information of the service fulfillment work order in the queue, for example, related information of the service fulfillment user, can be obtained. The abnormal rule is a preset business fulfillment work order processing rule, and whether to remove or manually retry the business fulfillment work order can be judged by combining with relevant information of users. And if manual retry is needed, generating a manual retry notification so that an operator manually processes the service opening work order in the backup queue according to the prompt.
Considering that in order to prevent an identical task under distributed conditions from being treated as two different tasks, the method may further perform the following steps:
and adding a unique identification to the service opening work order in the distributed queue.
In the embodiment of the present invention, the Unique identification of the service provisioning work order in the distributed queue may be obtained by using a UUID (universal Unique Identifier) generation policy.
In view of the reduction of high concurrent pressure on the service provisioning work order, the method may further perform the steps of:
and configuring a business fulfillment work order storage quantity threshold value of the distributed queue, and configuring a processing quantity threshold value of the business fulfillment work order.
In the embodiment of the present invention, the storage quantity of the service fulfillment work orders in the distributed queue refers to the quantity of the service fulfillment work orders that can be stored in the distributed queue, and the processing quantity of the service fulfillment work orders refers to the quantity of the fulfillment work orders that can be processed by the fulfillment processor. The high concurrency pressure of the business fulfillment work order can be relieved by setting the size of the queue and the processing capacity of the fulfillment processor.
In order to relieve the memory pressure, the method can further execute the following steps:
and storing the service opening work order of the distributed queue to a Remote Dictionary service (Redis) database.
In the embodiment of the invention, the service activation work order is issued to the distributed service activation queue, and the service work objects in the queue are automatically stored in Redis, so that the pressure of a memory database can be reduced, and the data processing efficiency is improved.
Referring to fig. 2, a schematic diagram of an implementation flow framework of a distributed queue-based high concurrent service provisioning method is shown, and the method is described below with reference to specific implementation steps.
(1) And the service fulfillment work order is issued to a distributed service fulfillment queue, and the service work objects in the queue are automatically stored in Redis.
(2) And the service opening work order object ID in the queue uses a UUID generation strategy by default, so that the completely same task under the distributed mode is prevented from being treated as two different tasks.
(3) And opening the processor (cluster) within the effective time (the effective time can be configured in the configuration file) to read the service opening work order and call the controller to open the service.
(4) The business opens the work order and has the retry strategy of failing, the monitor monitors the work order and reaches the synchronization that the retry number still fails or the work order survives overtime to opening the backup queue.
(5) And the backup queue adopts a timing task strategy and circularly traverses the backup queue. The monitor monitors the backup queue and performs operations such as removal and manual retry according to the user-customized exception rule.
(6) By setting the size of the queue and setting the processing capacity of the opening processor, the high concurrent pressure weakening of the business work order can be achieved.
The issued service opening work order is firstly pressed into a distributed queue, the size of the queue can be set by the distributed queue, and when the queue is full, user prompt information is returned or the queue is waited. And the service work order pressed into the queue carries out UUID identification. And the opening processor reads the opening work order from the queue and judges whether the opening work order is processed by other processors or not according to the UUID, when no processing identifier exists, the processor calls the controller and issues the work order, and the controller opens the equipment service according to the work order information. And the monitor re-issues the work order according to the failure retry strategy, and the retry times are still failed or the work order is kept alive overtime and is synchronized to the opening backup queue. And the timing module in the monitor periodically and circularly traverses the backup queue. The monitor monitors the backup queue and performs operations such as removal and manual retry according to the user-customized exception rule.
The invention provides a high-concurrency service opening method and device based on a distributed queue.
An embodiment of the present invention further provides a device for provisioning a high concurrent service based on a distributed queue, referring to a structural block diagram of the device for provisioning a high concurrent service based on a distributed queue shown in fig. 3, where the device includes:
a first obtaining module 71, configured to obtain a service provisioning work order according to the distributed queue; a first sending module 72, configured to send the service fulfillment work order to the first controller, and obtain a service fulfillment result of the first controller; a second obtaining module 73, configured to obtain a next service fulfillment work order in the distributed queue according to the service fulfillment result; and a second sending module 74, configured to send the next service fulfillment work order to the second controller, so that the second controller performs service fulfillment.
In an embodiment, the second obtaining module is specifically configured to: if the service opening result is successful, acquiring a next service opening work order in the distributed queue; and if the service opening result is opening failure, synchronizing the service opening work order to the backup queue according to the number of opening failure times or the survival time of the service opening work order, and acquiring the next service opening work order in the distributed queue.
In an embodiment, referring to a block diagram of a distributed queue-based high concurrent service provisioning apparatus shown in fig. 4, the apparatus further includes a monitoring module 75, specifically configured to: circularly traversing the backup alignment according to a preset time length; removing a service opening work order with opening failure or generating a manual retry notification according to the traversal result and the abnormal rule; and the manual retry notification is used for prompting the service opening work order which fails to be manually processed and opened.
In an embodiment, referring to a block diagram of a distributed queue-based high concurrent service provisioning apparatus shown in fig. 4, the apparatus further includes an identification module 76, specifically configured to: and adding a unique identification to the service opening work order in the distributed queue.
In an embodiment, referring to a block diagram of a distributed queue-based high concurrent service provisioning apparatus shown in fig. 4, the apparatus further includes a configuration module 77, specifically configured to: and configuring a business fulfillment work order storage quantity threshold value of the distributed queue, and configuring a processing quantity threshold value of the business fulfillment work order.
In an embodiment, referring to a block diagram of a distributed queue-based high concurrent service provisioning apparatus shown in fig. 4, the apparatus further includes a storage module 78, specifically configured to: and storing the service opening work order of the distributed queue to a Redis database.
The embodiment of the present invention further provides a computer device, referring to the schematic block diagram of the structure of the computer device shown in fig. 5, the computer device includes a memory 81 and a processor 82, the memory stores a computer program that can be executed on the processor, and the processor implements the steps of any one of the methods when executing the computer program.
It is clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working process of the computer device described above may refer to the corresponding process in the foregoing method embodiments, and no further description is provided herein
Embodiments of the present invention also provide a computer readable medium having non-volatile program code executable by a processor, the program code causing the processor to perform any of the steps of the above-described method.
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 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.
Finally, it should be noted that: the above-mentioned embodiments are only specific embodiments of the present invention, which are used for illustrating the technical solutions of the present invention and not for limiting the same, and the protection scope of the present invention is not limited thereto, although the present invention is described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: any person skilled in the art can modify or easily conceive the technical solutions described in the foregoing embodiments or equivalent substitutes for some technical features within the technical scope of the present disclosure; such modifications, changes or substitutions do not depart from the spirit and scope of the embodiments of the present invention, and they should be construed as being included therein. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A high concurrency service opening method based on distributed queues is characterized by comprising the following steps:
acquiring a service opening work order according to the distributed queue;
sending the service fulfillment work order to a first controller, and acquiring a service fulfillment result of the first controller;
acquiring a next service fulfillment work order in the distributed queue according to the service fulfillment result;
and sending the next service fulfillment work order to a second controller so as to enable the second controller to perform service fulfillment.
2. The method of claim 1, wherein obtaining a next service fulfillment work order in the distributed queue according to the service fulfillment result comprises:
if the service opening result is successful, acquiring a next service opening work order in the distributed queue;
and if the service opening result is opening failure, synchronizing the service opening work order to a backup queue according to the number of opening failure times or the survival time of the service opening work order, and acquiring the next service opening work order in the distributed queue.
3. The method of claim 2, further comprising:
circularly traversing the backup alignment according to a preset time length;
removing the service opening work order which fails to open or generating a manual retry notification according to the traversal result and the abnormal rule; and the manual retry notification is used for prompting the service fulfillment work order which is failed in manual processing fulfillment.
4. The method of claim 1, wherein before obtaining the service provisioning work order according to the distributed queue, the method further comprises:
and adding a unique identification to the service opening work order in the distributed queue.
5. The method of claim 1, wherein before obtaining the service provisioning work order according to the distributed queue, the method further comprises:
and configuring a storage quantity threshold value of the service fulfillment work order of the distributed queue and configuring a processing quantity threshold value of the service fulfillment work order.
6. The method of claim 1, wherein before obtaining the service provisioning work order according to the distributed queue, the method further comprises:
and storing the service opening work order of the distributed queue to a Redis database.
7. A high concurrency service opening device based on distributed queues is characterized by comprising:
the first acquisition module is used for acquiring a service opening work order according to the distributed queue;
the first sending module is used for sending the service fulfillment work order to a first controller and acquiring a service fulfillment result of the first controller;
the second obtaining module is used for obtaining a next service opening work order in the distributed queue according to the service opening result;
and the second sending module is used for sending the next service fulfillment work order to a second controller so as to enable the second controller to perform service fulfillment.
8. The apparatus of claim 7, further comprising a monitoring module to:
circularly traversing the backup alignment according to a preset time length;
removing the service opening work order which fails to open or generating a manual retry notification according to the traversal result and the abnormal rule; and the manual retry notification is used for prompting the service fulfillment work order which is failed in manual processing fulfillment.
9. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the method of any one of claims 1 to 6 when executing the computer program.
10. A computer-readable medium having non-volatile program code executable by a processor, the program code causing the processor to perform the method of any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911238589.8A CN112929296A (en) | 2019-12-06 | 2019-12-06 | High-concurrency service opening method and device based on distributed queue |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911238589.8A CN112929296A (en) | 2019-12-06 | 2019-12-06 | High-concurrency service opening method and device based on distributed queue |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112929296A true CN112929296A (en) | 2021-06-08 |
Family
ID=76161269
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911238589.8A Pending CN112929296A (en) | 2019-12-06 | 2019-12-06 | High-concurrency service opening method and device based on distributed queue |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112929296A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113806068A (en) * | 2021-07-30 | 2021-12-17 | 上海晶赞融宣科技有限公司 | Method and device for expanding business system, readable storage medium and terminal |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH06110699A (en) * | 1992-09-25 | 1994-04-22 | Nippon Telegr & Teleph Corp <Ntt> | Work execution order control method |
| CN101360309A (en) * | 2007-08-03 | 2009-02-04 | 华为技术有限公司 | Execution method, apparatus and system for service open command |
| CN107483276A (en) * | 2017-09-26 | 2017-12-15 | 中国联合网络通信集团有限公司 | Processing method, device and the sending down service platform of business |
| CN108829466A (en) * | 2018-06-27 | 2018-11-16 | 中国建设银行股份有限公司 | A kind of data processing method, device, electronic equipment and storage medium |
-
2019
- 2019-12-06 CN CN201911238589.8A patent/CN112929296A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH06110699A (en) * | 1992-09-25 | 1994-04-22 | Nippon Telegr & Teleph Corp <Ntt> | Work execution order control method |
| CN101360309A (en) * | 2007-08-03 | 2009-02-04 | 华为技术有限公司 | Execution method, apparatus and system for service open command |
| CN107483276A (en) * | 2017-09-26 | 2017-12-15 | 中国联合网络通信集团有限公司 | Processing method, device and the sending down service platform of business |
| CN108829466A (en) * | 2018-06-27 | 2018-11-16 | 中国建设银行股份有限公司 | A kind of data processing method, device, electronic equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113806068A (en) * | 2021-07-30 | 2021-12-17 | 上海晶赞融宣科技有限公司 | Method and device for expanding business system, readable storage medium and terminal |
| CN113806068B (en) * | 2021-07-30 | 2023-12-12 | 上海晶赞融宣科技有限公司 | Capacity expansion method and device for service system, readable storage medium and terminal |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2940596B1 (en) | Data acquisition method and device | |
| CN108132837B (en) | Distributed cluster scheduling system and method | |
| CN106921508B (en) | Virtualized network element fault self-healing method and device | |
| CN108089915B (en) | Method and system for business control processing based on message queue | |
| CN110830283B (en) | Fault detection method, device, equipment and system | |
| CN112948174A (en) | Message processing method and device, computer equipment and storage medium | |
| CN111104237A (en) | Configurable fault automation handling method and system and computer storage medium | |
| CN106506278B (en) | Service availability monitoring method and device | |
| CN110196749B (en) | Virtual machine recovery method and device, storage medium and electronic device | |
| CN112052095B (en) | Distributed high-availability big data mining task scheduling system | |
| CN105589756A (en) | Batch processing cluster system and method | |
| CN111538585B (en) | Js-based server process scheduling method, system and device | |
| CN112929296A (en) | High-concurrency service opening method and device based on distributed queue | |
| CN113419935B (en) | Mobile terminal performance monitoring method, device, equipment and storage medium | |
| CN111767122A (en) | Distributed task scheduling management method and device | |
| CN115509769A (en) | Kafka deployment method and device in private cloud and electronic equipment | |
| CN114528151A (en) | Data backup and restoration method, device, equipment and medium based on control station | |
| CN112269693B (en) | Node self-coordination method, device and computer readable storage medium | |
| CN111610992B (en) | Deployment component update processing method and device and storage medium | |
| WO2016206501A1 (en) | Process recovery method and device in network management system, and computer readable storage medium | |
| CN111756778A (en) | Server disk cleaning script pushing method and device and storage medium | |
| CN108184141B (en) | Processing method of monitoring video task and server | |
| CN111865685B (en) | Network service recovery method, device, equipment and readable storage medium | |
| CN111966474B (en) | Method and device for controlling timing task | |
| CN111176935B (en) | Application-oriented service monitoring method of integrated monitoring system |
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 |
Application publication date: 20210608 |
|
| RJ01 | Rejection of invention patent application after publication |