CN105610947A - Method, device and system for realizing high-available distributed queue service - Google Patents
Method, device and system for realizing high-available distributed queue service Download PDFInfo
- Publication number
- CN105610947A CN105610947A CN201511023490.8A CN201511023490A CN105610947A CN 105610947 A CN105610947 A CN 105610947A CN 201511023490 A CN201511023490 A CN 201511023490A CN 105610947 A CN105610947 A CN 105610947A
- Authority
- CN
- China
- Prior art keywords
- queue
- data
- node
- zookeeper
- server
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer And Data Communications (AREA)
Abstract
This invention discloses a method and a device for realizing high-available distributed queue service. The method comprises the following steps: when a queue interface server receives data sent by a client, requesting Zookeeper server cluster to create persistent sequence nodes of the data; after the nodes are created, storing the data into a local memory queue; when a request for acquiring the data sent by the client is received, extracting queue head data from the local memory queue and requesting the Zookeeper server cluster to delete the persistent sequence nodes of the data; after the nodes are deleted successfully, feeding back the extracted data to the client; and when a node change in the Zookeeper server cluster is monitored, synchronizing a data change caused by the node change into the local memory queue. This invention provides a high available, high extensible and high subsequent queue service realizing plan, and provides a reliable choice for the enterprise application integration and the distributed business collaboration.
Description
Technical field
The present invention relates to the communications field, relate in particular to a kind of high-available distributed queue service implementing method, dressPut and system.
Background technology
The website that interface service is used website service business to provide for third party developer provides open use to put downPlatform. Existing interface service presentation mode mainly comprises:
Scheme one: standalone version; Queue service data and interface service that this scheme realizes are deployed in same machineOn device, only have an interface server that service is externally provided, and store data in local internal memory, fileOr in database.
Scheme two: single storage, many interface service; This scheme externally has many interface servers, can provideHigher concurrent. But data are stored in independently caching server or database server.
Scheme three: multimachine storage, many interface servers; These scheme data are dispersed in each interface server,Each interface server storage area data. And there is special main control server recording data placeAddress.
But above-mentioned each scheme exists following not enough:
For scheme one, exist Single Point of Faliure problem, concurrency low;
For scheme two, data storage may produce single-point problem, and if can not without synchrolock mechanismEnsure data consistency, if add synchrolock mechanism, can lower efficiency.
For scheme three, when access interface, need the process of an addressing, reduce concurrency. Though andSo data are stored in respectively different machines, but for each machine, still have unit problem.
So, how to overcome the problems referred to above, can provide a set of high available, Highly Scalable, high concurrent, goThe queue interface service of centralization, becomes technical problem to be solved by this invention.
Summary of the invention
In view of the above problems, the present invention has been proposed to a kind of address the above problem high-available distributed is providedQueue service implementing method, device and system.
According to one aspect of the present invention, provide a kind of high-available distributed queue service implementing method, applicationIn queue interface server, described method comprises:
In the time receiving the data of client transmission, request Zookeeper server cluster creates holding of these dataOrder node for a long time, after lasting order node creates, deposits described data in local memory queue;
In the time receiving the request of obtaining data of client transmission, from local memory queue, win team's headData, and ask described Zookeeper server cluster to delete the lasting order node of these data, treat that node deletesAfter removing successfully, by the data feedback of winning to client;
And in the time listening to node in described Zookeeper server cluster and change, node is changed and causedData variation be synchronized to local memory queue.
According to another aspect of the present invention, a kind of high-available distributed queue service implementing method is provided, shouldFor Zookeeper server cluster, described method comprises:
The establishment that queue interface server in receiving queue service cluster sends or the request of deletion of node;
Based on request, in the Zookeeper queue of safeguarding, create new lasting order node or delete existing holdingOrder node for a long time, and node is changed to the individual queue interface server being synchronized in described queue service cluster.
According to the 3rd aspect of the present invention, a kind of queue interface server is provided, comprising:
Data supplementing processing module, the data that send for receiving client, request Zookeeper serverCluster creates the lasting order node of these data, after lasting order node creates, deposits described data in thisThe memory queue on ground;
Data acquisition process module, the request of obtaining data sending for receiving client, from this localityIn memory queue, win team's data, and ask described Zookeeper server cluster to delete the lasting of these dataOrder node, after knot removal success, by the data feedback of winning to client;
Data synchronization processing module, for changing when the node listening in described Zookeeper server clusterTime, node is changed to the data variation causing and be synchronized to local memory queue.
According to the 4th aspect of the present invention, provide a kind of Zookeeper server cluster, described ZookeeperServer cluster comprises some Zookeeper servers, and described Zookeeper server comprises:
Request receiving module, the establishment sending for queue interface server in receiving queue service cluster orThe request of deletion of node;
Request processing module, for based on request, the Zookeeper safeguarding at Zookeeper server clusterIn queue, create new lasting order node or delete existing lasting order node;
Monitoring module, for changing described Zookeeper queue nodes to be synchronized in described queue service clusterIndividual queue interface server.
According to the 5th aspect of the present invention, provide a kind of high-available distributed queue service to realize system, bagDraw together queue service cluster, Zookeeper server cluster provided by the present invention and one or at least two clientsEnd; Wherein, in described queue service cluster, comprise some queue interface servers provided by the present invention.
Beneficial effect of the present invention is as follows:
The present invention adopts group scheme, has effectively avoided Single Point of Faliure. Any interface server orZookeeper server exception can not affect integrity service. And, each queue in scheme of the present inventionInterface server can externally provide service according to self queue, and takes effective means to keep data consistentProperty. Effectively solve the problem of distributed lock, avoided resource to fight for and the problem of resource deadlock. It is visible,The implementation that the invention provides a kind of high available, Highly Scalable, high concurrent queue service is enterpriseApplication integration and distributed service are collaborative provides one to select reliably.
Brief description of the drawings
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, below will be to implementingIn example or description of the Prior Art, the accompanying drawing of required use is briefly described, and apparently, retouches belowAccompanying drawing in stating is only some embodiments of the present invention, for those of ordinary skill in the art, notPay under the prerequisite of creative work, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is the system architecture diagram of high-available distributed queue service implementing method application provided by the invention;
Fig. 2 is the figure of Zookeeper queue structure in the present invention;
Fig. 3 is that in the present invention, the Watcher mechanism based on Zookeeper realizes the synchronous schematic diagram of data;
Fig. 4 is distributed queue's schematic diagram in the present invention;
Fig. 5 is the flow chart that the present invention realizes queue supplemental data;
Fig. 6 is the flow chart that the present invention realizes queue and obtain data;
Fig. 7 is the structured flowchart of a kind of queue interface server provided by the invention;
Fig. 8 is the structured flowchart of a kind of Zookeeper server provided by the invention.
Detailed description of the invention
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clearlyChu, intactly description, obviously, described embodiment is only the present invention's part embodiment, instead ofWhole embodiment. Based on the embodiment in the present invention, those of ordinary skill in the art are not making creationThe every other embodiment obtaining under property work prerequisite, belongs to the scope of protection of the invention.
Embodiment of the method
The embodiment of the present invention provides a kind of high-available distributed queue service implementing method, and the method adoptsZookeeper mechanism provides a set of high available, Highly Scalable, high concurrent queue service implementation.
Described in the present embodiment, the enforcement of method relates generally to following functions entity: Zookeeper server cluster andQueue service cluster; Wherein, Zookeeper server cluster comprises some Zookeeper servers, queueService cluster comprises some queue interface servers. Set forth respectively the specific implementation process of each functional entity below,So that method proposed by the invention is elaborated. Concrete:
In the embodiment of the present invention, realize the realization of high-available distributed queue service in queue interface server sideMethod comprises:
In the time receiving the data of client transmission, request Zookeeper server cluster creates holding of these dataOrder node for a long time, after lasting order node creates, deposits described data in local memory queue;
In the time receiving the request of obtaining data of client transmission, from local memory queue, win team's headData, and ask described Zookeeper server cluster to delete the lasting order node of these data, treat that node deletesAfter removing successfully, by the data feedback of winning to client;
And in the time listening to node in described Zookeeper server cluster and change, node is changed and causedData variation be synchronized to local memory queue.
Wherein, the variation of the node in Zookeeper server cluster may be by under queue interface serverThe node that in queue service cluster, the operation of arbitrary queue interface server causes changes.
In a specific embodiment of the present invention, queue interface server is by the Watcher of ZookeeperThe node that mechanism is monitored in described Zookeeper server cluster changes.
In the embodiment of the present invention, realize high-available distributed queue service in Zookeeper server cluster sideImplementation method comprises:
The establishment that queue interface server in receiving queue service cluster sends or the request of deletion of node;
Based on request, in the Zookeeper queue of safeguarding, create new lasting order node or delete existing holdingOrder node for a long time, and node is changed to the individual queue interface server being synchronized in described queue service cluster.
In a specific embodiment of the present invention, Zookeeper server cluster is real by Watcher mechanismNow node is changed to the individual queue interface server being synchronized in described queue service cluster.
It is pointed out that in the embodiment of the present invention, in the time that multiple clients are obtained data from queue simultaneously,Queue need to ensure that First come first served and element are not repeated to obtain. To this, Zookeeper server cluster is when connecingReceive the multiple deletions for same lasting order node of queue interface server in described queue service clusterWhen request, according to the order of First come first served, respond one of them removal request. Queue interface server is at jointPoint is when unsuccessful deletion, judges that these data have been taken away by other clients, now queue interface serverThe current data of winning are deleted, and from described memory queue, continue to win team's data, until winLasting order node corresponding to data successfully deleted.
In summary, the present invention adopts group scheme, has effectively avoided Single Point of Faliure. Any queueInterface server or Zookeeper server exception can not affect integrity service. And each queue connectsMouth server can externally provide service according to self queue, and takes effective means to keep data consistency.Effectively solve the problem of distributed lock, avoided resource to fight for and the problem of resource deadlock. Visible, thisThe bright queue service implementation of having realized a set of high available, high expansion, high concurrent, queue decentralization,Provide one selects reliably for enterprise's application integration and distributed service are collaborative.
Below by concrete an enforcement, the method for the invention is carried out to more detailed explanation. Need to illustrateThat a large amount of ins and outs that disclose in the present embodiment are for explaining the present invention but not unique restriction the present invention.
What the high-available distributed queue service implementing method providing for the present embodiment as shown in Figure 1, was applied isSystem Organization Chart. In figure, client is by Http access queue service cluster, and queue service cluster adopts loadThe clustered deploy(ment) of balanced device+N platform queue interface server pattern, Zookeeper server cluster is by manyZookeeper server composition, and elect Master (leader) by Paxos election algorithm.
In the present embodiment, Zookeeper server cluster is safeguarded a Zookeeper queue structure, as Fig. 2Shown in, be queue structure's schematic diagram. SEQUENTIAL node in Zookeeper queue structure is (lastingOrder node) characteristic ensures the sorting with creation-time of node. A SEQUENTIAL type of each increaseNode, Zookeeper queue structure ensures that nodename suffix increases progressively in order. The node first increasingSequence number is little, and the node ID of rear increase is large.
In the present embodiment, it is synchronous that the Watcher mechanism based on Zookeeper realizes data, as shown in Figure 3,For the synchronous schematic diagram of data. In figure, each queue interface server is peer-to-peer, each queue interface clothesMemory queue of business device self maintained. The memory queue data that individual queue interface server is safeguarded are passed throughThe Watcher mechanism of Zookeeper keeps highly consistent, and each queue interface server can complete transmissionWith obtain affairs, and by result by Zookeeper server cluster real-time synchronization give other queue interface serviceDevice.
In the present embodiment, individual queue interface server has all been safeguarded memory queue, has formed distributed queue,As shown in Figure 4, be the schematic diagram of distributed queue's use-case. Each queue is all linearities of a first in first outList data structure. The producer is to supplemental data in queue, and consumer obtains data from queue. Each teamRow can provide service for multiple producers and multiple consumer. When multiple producers send number to queue simultaneouslyAccording to time, queue need ensure to arrive first advanced order. In the time that multiple consumers obtain element from queue simultaneously, teamRow need the order and the element that ensure First come first served not to be repeated to obtain.
Just obtain two aspects of data from queue supplemental data and queue respectively below, to concrete reality of the present inventionThe process of executing is set forth.
As shown in Figure 5, for the flow chart that the present invention realizes queue supplemental data, comprise the steps:
Step S501, producer's (client) calls the PUSH interface of queue interface server, by dataSend to queue interface server A;
Step S502, queue interface server A request Zookeeper server cluster creates these dataSEQUENTIAL node;
Step S503, Zookeeper server cluster creates new node in the Zookeeper of its maintenance queue,And after creating successfully, the request of the interface server A of response queue; Meanwhile, individual queue interface server existsIn Zookeeper server cluster, the Watcher of registration monitors node variation, and node is changed and is synchronized to respectivelyQueue interface server;
Step S504, queue interface server A is receiving after the response of Zookeeper server cluster,The data that the producer is sent deposit the memory queue A of self maintained in; Other queue interface servers B based onThe simultaneously operating of Zookeeper server cluster, also deposits data in the memory queue B of its maintenance, finally realThe now memory queue of every queue interface server and Zookeeper queue is consistent.
It should be noted that, queue interface server A registers in Zookeeper server clusterWatcher also can change this node to be synchronized to this queue interface server A, due to queue interface server AData have been added to memory queue A, thus queue interface server A through comparison after, can ignore byThe synchrodata that the node producing in the operation of self changes.
As shown in Figure 6, for the flow chart that the present invention realizes queue and obtain data, comprise the steps:
Step S601, consumer's (client) calls the TAKE interface of queue interface server A, to teamRow interface server A sends data acquisition request;
Step S602, queue interface server A wins team's data from the memory queue A of self maintained;Wherein, win index deletes after taking out from memory queue.
Step S603, queue interface server A deletes team's data to the pocket transmission of Zookeeper server setThe request of corresponding node;
Step S604, Zookeeper server cluster to be to ensure that a node can only be deleted once as principle,Carry out knot removal operation; In the time that node is successfully deleted, individual queue interface server is at Zookeeper serverIn cluster, the Watcher of registration monitors node variation, and node is changed and is synchronized to individual queue interface server;
Step S605, if knot removal failure, queue interface server A deletes the team a winning data,And continue to win team's data, return to step S603; Wherein, knot removal failure, has represented these dataObtained by other clients, these data lost efficacy.
Step S606, if knot removal success, queue interface server A returns to the team a winning dataGive consumer; The simultaneously operating of other queue interface servers B based on Zookeeper server cluster, alsoData are deleted from the memory queue B of its maintenance, finally realize the internal memory team of every queue interface serverRow are consistent with Zookeeper queue.
It should be noted that, queue interface server A registers in Zookeeper server clusterWatcher also can change this node to be synchronized to this queue interface server A, due to queue interface server AData are deleted from memory queue A, so queue interface server A is after comparison, can ignoreThe synchrodata that the node producing due to the operation of self changes.
Known in sum, the present invention utilizes the SEQUENTIAL node characteristic of Zookeeper to realize queueCore arrive first advanced highly effective algorithm. Utilize the Watcher mechanism of Zookeeper, realize queuing data manyThe real time data synchronization of individual queue interface server, and queue decentralization. Utilize the One of ZookeeperThe characteristic of NodeDeleteOnce realizes the First come first served of queue core, and element is not repeated to obtain. In conjunction with negativeCarry interface service cluster+Zookeeper cluster of building of balanced device and realize a set of high available, Highly Scalable, heightConcurrent queue service.
Device embodiment
The embodiment of the present invention provides a kind of queue interface server, as shown in Figure 7, comprising:
Data supplementing processing module 710, the data that send for receiving client, request Zookeeper clothesBusiness device cluster creates the lasting order node of these data, after lasting order node creates, described data is depositedEnter local memory queue;
Data acquisition process module 720, the request of obtaining data sending for receiving client, from this localityMemory queue in win team's data, and ask described Zookeeper server cluster to delete holding of these dataFor a long time order node, after knot removal success, by the data feedback of winning to client;
Data synchronization processing module 730, for the node when listening in described Zookeeper server clusterWhen variation, node is changed to the data variation causing and be synchronized to local memory queue.
In a specific embodiment of the present invention, when the unsuccessful deletion joint of described Zookeeper server clusterWhen point, data acquisition process module 720, also for the current data of winning are deleted, and from described internal memory teamIn row, continue to win team's data, until lasting order node corresponding to the data of winning successfully deleted.
In another specific embodiment of the present invention, data synchronization processing module 730, specifically for passing throughThe node that the Watcher mechanism of Zookeeper is monitored in described Zookeeper server cluster changes.
The embodiment of the present invention also provides a kind of Zookeeper server cluster, described Zookeeper server setGroup comprises some Zookeeper servers, and as shown in Figure 8, described Zookeeper server comprises:
Request receiving module 810, the establishment sending for the queue interface server in receiving queue service clusterOr the request of deletion of node;
Request processing module 820, for based on request, safeguards at Zookeeper server clusterIn Zookeeper queue, create new lasting order node or delete existing lasting order node;
Monitoring module 830, for changing described Zookeeper queue nodes to be synchronized to described queue services setIndividual queue interface server in group.
In a specific embodiment of the present invention, when request receiving module 810 receives described queue serviceQueue interface server in cluster is during for multiple removal request of same lasting order node, and request is processedModule 820, according to the order of First come first served, responds one of them removal request.
In another specific embodiment of the present invention, monitoring module 830, specifically for passing through Watcher mechanismDescribed Zookeeper queue nodes is changed to the individual queue interface service being synchronized in described queue service clusterDevice.
It is pointed out that in the present embodiment and just the improvements of Zookeeper server cluster have been carried outIllustrate, the Zookeeper server cluster described in the present embodiment still has more known Zookeeper at presentCluster characteristic, does not repeat inferior.
In summary, the present invention adopts group scheme, has effectively avoided Single Point of Faliure. Any queueInterface server or Zookeeper server exception can not affect integrity service. And each queue connectsMouth server can externally provide service according to self queue, and takes effective means to keep data consistency.Effectively solve the problem of distributed lock, avoided resource to fight for and the problem of resource deadlock. Visible, thisThe bright queue service implementation of having realized a set of high available, high expansion, high concurrent, queue decentralization,Provide one selects reliably for enterprise's application integration and distributed service are collaborative.
System embodiment
The embodiment of the present invention provides a kind of high-available distributed queue service to realize system, comprising: queue serviceZookeeper server cluster and one or at least two clients described in cluster, device embodiment; ItsIn, in described queue service cluster, comprise the queue interface server described in some device embodiment.
Due in device embodiment to system in structure and the function of each device elaborate,At this, it is no longer repeated. Because system described in the present embodiment comprises the Zookeeper described in device embodimentServer cluster, queue service cluster, so also must reach the technology that device embodiment can reachEffect.
Each embodiment in this description all adopts the mode of going forward one by one to describe, phase homophase between each embodimentLike part mutually referring to, what each embodiment stressed is its from other embodiment different itPlace. Especially for device, system embodiment, because it is substantially similar and embodiment of the method, so,That describes is fairly simple, and relevant part is referring to the part explanation of embodiment of the method.
One of ordinary skill in the art will appreciate that all or part of step in the whole bag of tricks of above-described embodimentBe can carry out the hardware that instruction is relevant by program to complete, this program can be stored in a computer-readable and depositIn storage media, storage medium can comprise: ROM, RAM, disk or CD etc.
In a word, the foregoing is only preferred embodiment of the present invention, be not intended to limit guarantor of the present inventionProtect scope. Within the spirit and principles in the present invention all, any amendment of doing, be equal to replacement, improvement etc.,Within all should being included in protection scope of the present invention.
Claims (13)
1. a high-available distributed queue service implementing method, is characterized in that, is applied to queue interface clothesBusiness device, described method comprises:
In the time receiving the data of client transmission, request Zookeeper server cluster creates holding of these dataOrder node for a long time, after lasting order node creates, deposits described data in local memory queue;
In the time receiving the request of obtaining data of client transmission, from local memory queue, win team's headData, and ask described Zookeeper server cluster to delete the lasting order node of these data, treat that node deletesAfter removing successfully, by the data feedback of winning to client;
And in the time listening to node in described Zookeeper server cluster and change, node is changed and causedData variation be synchronized to local memory queue.
2. the method for claim 1, is characterized in that, described method also comprises:
In the time of the unsuccessful deletion of node of described Zookeeper server cluster, the current data of winning are deleted,And continue to win team's data from described memory queue, until lasting order node corresponding to the data of winningSuccess is deleted.
3. method as claimed in claim 1 or 2, is characterized in that, described queue interface server passes throughThe node that the monitoring Watcher mechanism of Zookeeper is monitored in described Zookeeper server cluster changes.
4. a high-available distributed queue service implementing method, is characterized in that, is applied to ZookeeperServer cluster, described method comprises:
The establishment that queue interface server in receiving queue service cluster sends or the request of deletion of node;
Based on request, in the Zookeeper queue of safeguarding, create new lasting order node or delete existing holdingOrder node for a long time, and node is changed to the individual queue interface server being synchronized in described queue service cluster.
5. method as claimed in claim 4, is characterized in that, when receiving in described queue service clusterQueue interface server during for multiple removal request of same lasting order node, according to First come first servedSequentially, respond one of them removal request.
6. the method as described in claim 4 or 5, is characterized in that, described Zookeeper server setGroup is realized node is changed to the individual queue interface being synchronized in described queue service cluster by Watcher mechanismServer.
7. a queue interface server, is characterized in that, comprising:
Data supplementing processing module, the data that send for receiving client, request Zookeeper serverCluster creates the lasting order node of these data, after lasting order node creates, deposits described data in thisThe memory queue on ground;
Data acquisition process module, the request of obtaining data sending for receiving client, from this localityIn memory queue, win team's data, and ask described Zookeeper server cluster to delete the lasting of these dataOrder node, after knot removal success, by the data feedback of winning to client;
Data synchronization processing module, for changing when the node listening in described Zookeeper server clusterTime, node is changed to the data variation causing and be synchronized to local memory queue.
8. queue interface server as claimed in claim 7, is characterized in that, as described ZookeeperWhen the unsuccessful deletion of node of server cluster, described data acquisition process module, also for winning currentData are deleted, and from described memory queue, continue to win team's data, until corresponding the holding of the data of winningOrder node is successfully deleted for a long time.
9. queue interface server as claimed in claim 7 or 8, is characterized in that, described data are synchronousProcessing module, monitors described Zookeeper server specifically for the Watcher mechanism by ZookeeperNode in cluster changes.
10. a Zookeeper server cluster, is characterized in that, described Zookeeper server clusterComprise some Zookeeper servers, described Zookeeper server comprises:
Request receiving module, the establishment sending for queue interface server in receiving queue service cluster orThe request of deletion of node;
Request processing module, for based on request, the Zookeeper safeguarding at Zookeeper server clusterIn queue, create new lasting order node or delete existing lasting order node;
Monitoring module, for changing described Zookeeper queue nodes to be synchronized in described queue service clusterIndividual queue interface server.
11. Zookeeper server clusters as claimed in claim 10, is characterized in that, ask when describedThe queue interface server of asking receiver module to receive in described queue service cluster saves for same lasting orderPoint multiple removal request time, described request processing module, according to the order of First come first served, responds one of themRemoval request.
The 12. Zookeeper server clusters of stating as claim 10 or 11, is characterized in that described prisonControl module, described in being synchronized to described Zookeeper queue nodes variation by Watcher mechanismIndividual queue interface server in queue service cluster.
13. 1 kinds of high-available distributed queue services realize system, it is characterized in that, comprise queue services setGroup, Zookeeper server cluster described in claim 10 to 12 any one and one or at least twoClient; Wherein, in described queue service cluster, comprise described in some claim 7 to 9 any oneQueue interface server.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511023490.8A CN105610947A (en) | 2015-12-30 | 2015-12-30 | Method, device and system for realizing high-available distributed queue service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511023490.8A CN105610947A (en) | 2015-12-30 | 2015-12-30 | Method, device and system for realizing high-available distributed queue service |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105610947A true CN105610947A (en) | 2016-05-25 |
Family
ID=55990481
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201511023490.8A Pending CN105610947A (en) | 2015-12-30 | 2015-12-30 | Method, device and system for realizing high-available distributed queue service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105610947A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108009029A (en) * | 2017-11-30 | 2018-05-08 | 中电福富信息科技有限公司 | Method and system based on the data cached decoupling persistence of Ignite grids |
| CN109150558A (en) * | 2017-06-15 | 2019-01-04 | 北京京东尚科信息技术有限公司 | The methods, devices and systems of managing message queues node |
| CN109324942A (en) * | 2018-08-07 | 2019-02-12 | 顺丰科技有限公司 | The dual-active processing method of micro services, apparatus and system, equipment, storage medium |
| CN110958150A (en) * | 2019-12-10 | 2020-04-03 | 深圳前海环融联易信息科技服务有限公司 | Management method and device for dynamic service configuration |
| CN111552660A (en) * | 2020-04-20 | 2020-08-18 | 青岛联众智芯科技有限公司 | Management system and method based on RS485 manager |
| CN111782399A (en) * | 2020-07-03 | 2020-10-16 | 北京思特奇信息技术股份有限公司 | Method for efficiently realizing configuration server based on UDP (user Datagram protocol) |
| CN112637268A (en) * | 2020-11-30 | 2021-04-09 | 广州大学 | Radio astronomical data storage consistency guarantee method, device, system and storage medium |
| CN113190353A (en) * | 2021-05-12 | 2021-07-30 | 北京睿芯高通量科技有限公司 | Software implementation method for integrating queue read-write management |
| CN115550361A (en) * | 2022-09-20 | 2022-12-30 | 三未信安科技股份有限公司 | Cluster implementation method based on message queue |
| US11960933B2 (en) | 2020-04-30 | 2024-04-16 | Red Hat, Inc. | Versioned progressive chunked queue for a scalable multi-producer and multi-consumer queue |
-
2015
- 2015-12-30 CN CN201511023490.8A patent/CN105610947A/en active Pending
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109150558A (en) * | 2017-06-15 | 2019-01-04 | 北京京东尚科信息技术有限公司 | The methods, devices and systems of managing message queues node |
| CN108009029B (en) * | 2017-11-30 | 2022-01-04 | 中电福富信息科技有限公司 | Method and system for decoupling and persisting cache data based on Ignite grid |
| CN108009029A (en) * | 2017-11-30 | 2018-05-08 | 中电福富信息科技有限公司 | Method and system based on the data cached decoupling persistence of Ignite grids |
| CN109324942A (en) * | 2018-08-07 | 2019-02-12 | 顺丰科技有限公司 | The dual-active processing method of micro services, apparatus and system, equipment, storage medium |
| CN109324942B (en) * | 2018-08-07 | 2022-06-07 | 顺丰科技有限公司 | Double-activity processing method, device, system, equipment and storage medium for microservice |
| CN110958150A (en) * | 2019-12-10 | 2020-04-03 | 深圳前海环融联易信息科技服务有限公司 | Management method and device for dynamic service configuration |
| CN111552660A (en) * | 2020-04-20 | 2020-08-18 | 青岛联众智芯科技有限公司 | Management system and method based on RS485 manager |
| CN111552660B (en) * | 2020-04-20 | 2022-05-06 | 青岛联众芯云科技有限公司 | Management system based on RS485 manager |
| US11960933B2 (en) | 2020-04-30 | 2024-04-16 | Red Hat, Inc. | Versioned progressive chunked queue for a scalable multi-producer and multi-consumer queue |
| CN111782399A (en) * | 2020-07-03 | 2020-10-16 | 北京思特奇信息技术股份有限公司 | Method for efficiently realizing configuration server based on UDP (user Datagram protocol) |
| CN111782399B (en) * | 2020-07-03 | 2023-12-01 | 北京思特奇信息技术股份有限公司 | UDP-based efficient realization method for configuration server |
| CN112637268A (en) * | 2020-11-30 | 2021-04-09 | 广州大学 | Radio astronomical data storage consistency guarantee method, device, system and storage medium |
| CN112637268B (en) * | 2020-11-30 | 2022-03-18 | 广州大学 | Radio astronomical data storage consistency guarantee method, device, system and storage medium |
| CN113190353A (en) * | 2021-05-12 | 2021-07-30 | 北京睿芯高通量科技有限公司 | Software implementation method for integrating queue read-write management |
| CN115550361A (en) * | 2022-09-20 | 2022-12-30 | 三未信安科技股份有限公司 | Cluster implementation method based on message queue |
| CN115550361B (en) * | 2022-09-20 | 2024-08-06 | 三未信安科技股份有限公司 | Cluster realization method based on message queue |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105610947A (en) | Method, device and system for realizing high-available distributed queue service | |
| CN103973725B (en) | A kind of distributed cooperative algorithm and synergist | |
| CN108234306A (en) | Network equipment, network method and computer readable storage medium | |
| AU2015241457A1 (en) | Geographically-distributed file system using coordinated namespace replication | |
| CN108234302A (en) | Keep the consistency in the distributed operating system of network equipment | |
| CN108280080A (en) | A kind of method of data synchronization, device and electronic equipment | |
| US10127077B2 (en) | Event distribution pattern for use with a distributed data grid | |
| CN106528574A (en) | Data synchronization method and device | |
| CN109173270B (en) | Game service system and implementation method | |
| CN113568624A (en) | Mirror image pulling method and system, computer equipment and readable storage medium | |
| CN110213156B (en) | Cross-center group instant messaging method and system | |
| CN113785281B (en) | Message transfer implementing operation serialization to achieve consistency of distributed data structures | |
| CN110196843A (en) | A kind of document distribution method and container cluster based on container cluster | |
| CN111597197B (en) | Data reconciliation method and device between databases, storage medium and electronic equipment | |
| CN106713391A (en) | Session information sharing method and sharing system | |
| CN109639773A (en) | A kind of the distributed data cluster control system and its method of dynamic construction | |
| CN112988377B (en) | Resource allocation method, system and medium for cloud service | |
| Chen et al. | Omen: Overlay mending for topic-based publish/subscribe systems under churn | |
| US20090144333A1 (en) | System for maintaining a database | |
| US8230444B2 (en) | Global attribute uniqueness (GAU) using an ordered message service (OMS) | |
| US8458803B2 (en) | Global account lockout (GAL) and expiration using an ordered message service (OMS) | |
| CN113254511B (en) | Distributed vector retrieval system and method | |
| CN115967611B (en) | Cross-domain switching processing method, device, equipment and storage medium | |
| Meiklejohn et al. | Loquat: A framework for large-scale actor communication on edge networks | |
| CN113934577A (en) | Disaster recovery method for block chain network consensus node deployed across data centers |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160525 |