CN108076103A - A kind of message treatment method, system and message producer's cluster - Google Patents
A kind of message treatment method, system and message producer's cluster Download PDFInfo
- Publication number
- CN108076103A CN108076103A CN201611020095.9A CN201611020095A CN108076103A CN 108076103 A CN108076103 A CN 108076103A CN 201611020095 A CN201611020095 A CN 201611020095A CN 108076103 A CN108076103 A CN 108076103A
- Authority
- CN
- China
- Prior art keywords
- message
- cluster
- cache node
- producer
- node
- 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/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- 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/55—Push-based network services
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
This application involves message processing technique fields, a kind of message treatment method, system and message producer's cluster are disclosed, to improve message handling ability.This method is：Message producer cluster produces first message, and treats cache node according to what setting routing mode determined the first message in cache node cluster；The message producer cluster is definite described when, there is no during the second message identical with the first message, to first message described in message queue collection pocket transmission, the first message externally provides subscription service for the message queue cluster in cache node.
Description
Technical field
This application involves message processing technique field, more particularly to a kind of message treatment method, system and the message producer
Cluster.
Background technology
With the growing data behavioral requirements of user, database access amount is constantly increasing.Some message at present
Queue system can realize the data processing of processing massive logs, user behavior and website operation statistics etc..In high-throughput
On the basis of, it can realize real-time and persistence.
The cluster that Message Queuing system is generally made of several servers, the message of each type are defined as theme
(i.e. topic), the message inside same subject are partitioned (i.e. partition) according to certain algorithm and are stored in different services
On device, each message producer can send message to one or more servers, and each consumer can be to one or more
Server consumes message.
Message Queuing system can be applied in the system that some need to handle a large amount of message, such as form ordering system.General meeting
Carry out asynchronous process using Producer-consumer problem pattern to ask, achieve the purpose that eliminate request peak.But in the situation of high concurrent
Under, there are a large amount of repetition messages, cause to repeat inquiry database, repeated accesses file system or repeat network call etc.,
Consumer's client database visit capacity will necessarily be caused to roll up, message handling ability declines, and system stability and service are effective
Property decline.
The content of the invention
The embodiment of the present application provides a kind of message treatment method, system and message producer's cluster, to solve due to weight
The problem of multiple message causes the increase of database access amount, message handling ability decline, system stability and availability of service to decline.
Specific technical solution provided by the embodiments of the present application is as follows：
On the one hand, a kind of message treatment method is provided, including：
Message producer cluster produces first message, and determines according to setting routing mode in cache node cluster described
First message treats cache node；
The message producer cluster is treated in cache node described in judging with the presence or absence of identical with the first message the
Two message, there is no the second message identical with the first message in cache node is treated described in determining, to message queue collection
First message described in pocket transmission, the first message externally provide subscription service for the message queue cluster.
Optionally, the message producer cluster is waited to cache according to the first message determined by setting routing mode
Node is unique.
Optionally, the message producer cluster according to setting routing mode determine the first message treat caching section
Point, including：
The message producer cluster is each cache node according to the quantity of cache node in the cache node cluster
Serial number, optionally, the quantity of cache node is N in the cache node cluster, be 1 for each cache node number,
2nd ... N, N are natural number；
The message producer cluster obtains the unique mark of the first message, determines the corresponding number of the unique mark
The numerical value is carried out remainder calculating to N, obtains remainder by value；
It is that the cache node of the remainder is determined as the first message and waits to delay that the message producer cluster, which will number,
Deposit node.
Optionally, the message producer cluster determines the corresponding numerical value of the unique mark, including：
The message producer cluster determines the corresponding numerical value of the unique mark according to hash algorithm.
Optionally, the message producer cluster is determining described to treat to be not present in cache node and the first message phase
After same second message, further include：
The relevant information of the first message is buffered in and described treats cache node by the message producer cluster.
Optionally, the method further includes：
The message producer cluster has identical with the first message second in cache node is treated described in determining
During message, the first message is abandoned.
On the other hand, a kind of message producer cluster is provided, the message producer cluster includes at least one message
The producer, any message producer include：
Production unit, for producing first message；
Routing unit, for determining the institute of the production unit production according to setting routing mode in cache node cluster
That states first message treats cache node；
Determination unit, for determining described to treat with the presence or absence of identical with the first message second to disappear in cache node
Breath, the first message externally provide subscription service for the message queue cluster；
Transmitting element, for determining described to treat to be not present in cache node and the first message phase in the determination unit
With second message when, to first message described in message queue collection pocket transmission.
Optionally, the routing unit treats cache node only according to the first message determined by setting routing mode
One.
Optionally, the routing mode that sets is hash algorithm
Optionally, the routing unit is specifically used for：
Quantity according to cache node in the cache node cluster is each cache node serial number；
Obtain the unique mark of the first message, determine the corresponding numerical value of the unique mark, by the numerical value to N into
Row remainder calculates, and obtains remainder；
By number be the remainder cache node be determined as the first message treat cache node.
Optionally, the routing unit is specifically used for：According to hash algorithm, the corresponding numerical value of the unique mark is determined.
Optionally, the determination unit is additionally operable to：
Determining described when there is the second message identical with the first message in cache node, discarding described first
Message.
Optionally, further include：
Buffer unit, for determining described to treat to be not present in cache node and the first message phase in the determination unit
With second message after, the relevant information of the first message is buffered in and described treats cache node.
In another aspect, provide a kind of message handling system, including message producer cluster, the caching as described in terms of above-mentioned
Node cluster, message queue cluster and consumer's cluster；
The message producer cluster includes at least one message producer, and the cache node cluster includes at least one
A cache node, the message queue cluster include at least one server, and consumer's cluster includes at least one
Consumer；
Each message producer is used to submit message at least one server, each consumer be used for it is described extremely
A few server subscribes to message；
The cache node cluster is connected with the message producer cluster, for the message producer to described
Before at least one server submits message, processing is filtered to message to be committed.
In the application, by the way that before message is submitted, processing is filtered to message so that the number being submitted on server
According to there is no repeated data, consumer can directly do business logic processing after subscribing to message on the server, be not in difference
The problem of message that consumer subscribes to repeats, effectively improves message handling ability, improves system stability and service is effective
Property.
Description of the drawings
Fig. 1 is application system Organization Chart in the embodiment of the present application；
Fig. 2 is message treatment method flow diagram in the embodiment of the present application；
Fig. 3 is message producer's structure diagram in the embodiment of the present application.
Specific embodiment
In order to make the purpose, technical scheme and advantage of the application clearer, the application is made below in conjunction with attached drawing into
It is described in detail to one step, it is clear that described embodiments are only a part of embodiments of the present application rather than whole implementation
Example.Based on the embodiment in the application, those of ordinary skill in the art are obtained without making creative work
All other embodiment, shall fall in the protection scope of this application.
In view of in the prior art, for this high concurrent field for often duplicating message of form ordering system or payment system
Under scape, since every message needs to consume more system resource in repetition message, database access amount is caused to increase, at message
The problem of decline of reason ability, system stability and availability of service decline, a kind of message treatment method of the embodiment of the present application offer,
System and message producer's cluster, by before message is submitted, processing being filtered to message so that be submitted on server
Data there is no repeated data, consumer can directly do business logic processing after subscribing to message on the server, be not in
The problem of message that different consumers subscribe to repeats, the message handling ability effectively improved, improves system stability kimonos
Business validity.
Message treatment method provided by the embodiments of the present application, system and message producer's cluster are done below in conjunction with attached drawing
It is described in detail.
The embodiment of the present application is optionally applied to the high concurrent field that form ordering system, payment system etc. often duplicate message
Scape.
As shown in Figure 1, the application system 100 of the embodiment of the present application includes message producer cluster 101, cache node cluster
102nd, message queue cluster 103 and consumer's cluster 104.Wherein：
Message producer cluster 101 includes at least one message producer, (is disappeared with including 3 message producers in Fig. 1
Cease the producer 1, the message producer 2, the message producer 3) exemplified by；Cache node cluster 102 includes at least one cache node, figure
In 1 exemplified by including 3 cache nodes (node 1, node 2, node 3)；Message queue cluster 103 includes at least one service
Device, in Fig. 1 exemplified by including 3 servers (server 1, server 2, server 3)；Consumer's cluster 104 is included at least
One consumer, in Fig. 1 exemplified by including 3 consumers (consumer 1, consumer 2, consumer 3)；
Message queue cluster 103 can include but is not limited to the clusters such as Kafka, Active MQ.Each server is according to one
Fixed theme (topic) storage message.Each message producer is used at least one clothes included to message queue cluster 103
Business device submits message, and each consumer is used to subscribe to message at least one server that message queue cluster 103 includes；
Cache node cluster 102 is connected with message producer cluster 101, for the message producer to described at least one
Before a server submits message, processing is filtered to message to be committed.
Optionally, cache node cluster 102 is using the Memcache for supporting high-performance distributed caching, using key-
Value pattern caching message, it is assumed that the system is form ordering system, and message is sequence information, then Memcache gives birth to form ordering system
Into order number as caching in key, using the corresponding order of order number as cache in value.
With reference to system architecture shown in FIG. 1, as shown in Fig. 2, in the embodiment of the present application, the method flow of Message Processing is as follows
It is described.Executive agent in following methods is message producer's cluster, of course, it is possible to disappear for any in message producer's cluster
Cease the producer.
Step 201：Message producer cluster produces first message.
First message is arbitrary a piece of news, and to be distinguished with following message, for the sake of facilitating explanation, referred to herein as first disappears
Breath.
Step 202：Message producer cluster determines first message in cache node cluster according to setting routing mode
Treat cache node.
Wherein, message producer cluster can only determine uniquely after first message is determined according to the routing mode of setting
One cache node treats cache node for the first message.In the application, the routing mode of setting is not especially limited, as long as
Be can uniquely determine first message treat cache node.
For example, this sets routing mode as hash algorithm.Then message producer cluster determines that first disappears according to hash algorithm
Breath treat cache node, it is following 1)~3) described in by way of realize：
1) message producer cluster is compiled according to the quantity of cache node in cache node cluster for each cache node order
Number.If in cache node cluster the quantity of cache node be N, can be each cache node number consecutively 1,2 ... N, N
For natural number.
2) message producer cluster obtains the unique mark of first message, the corresponding numerical value of unique mark is determined, by numerical value
Remainder calculating is carried out to the quantity of cache node in cache node cluster, obtains remainder.For example, in form ordering system or payment system
In system, the unique mark of first message can be order number, by the corresponding numerical value of order number directly as the unique of first message
Mark, alternatively, order number is converted to the unique mark that numerical value is used as first message by the mapping relations of setting.
3) message producer cluster by number be remainder cache node be determined as first message treat cache node.
Because the quantity of cache node is to determine in cache node cluster, and true by the unique mark of first message
Fixed numerical value is unique, and therefore, the remainder obtained according to first message is unique, i.e. the cache node of first message is only
One, in this manner it is possible to treat cache node by what above-mentioned routing mode uniquely determined first message, pass through above-mentioned routing mode
Each message can be uniquely determined treats cache node.
Specifically, using the unique mark of first message as Hash password (HashCode), unique mark of first message
Knowledge can be represented with numerical value, it is assumed that be 50.Assuming that N is 3, i.e., have 3 cache nodes in cache node cluster, number respectively 1,2,
3.The remainder that 50 pair of 3 remainder obtains be 1, then first message treat cache node be number be 1 cache node.
Step 203：The judgement of message producer cluster treats whether there is no identical with first message second in cache node
Message determines to treat whether the message repeated with first message is not present in cache node, if so, determining that first message is not
Repetition message performs step 204；Otherwise, first message is determined as repetition message, performs step 205.
Optionally, message producer cluster is determining to treat that there is no the second messages identical with first message in cache node
Afterwards, the relevant information of first message is buffered in and treats cache node.The relevant information of first message includes order number, unique mark
Etc. it is at least one in information.First message externally provides subscription service for message queue cluster.
Wherein, the meaning of above-mentioned repetition message not only including first message treat to be not present in cache node and first message
The message repeated, further includes in any one cache node in cache node cluster not including and disappears with what first message repeated
Breath.This is because after first message is generated, according to setting routing mode definite first message treat that cache node is unique
, therefore, other treat that the message repeated with first message will not be included in cache node.
Step 204：To message queue collection pocket transmission first message.
In this way, by the above method, the first message to message queue collection pocket transmission is unique, can be played to message
The effect of each message screening of producer's cluster production, does not have any repetition message in message queue cluster.Message queue collection
After group receives first message, consumer's cluster can subscribe to first message into message queue cluster, and can be straight after subscription
It connects and does business processing.
Step 205：First message is abandoned, i.e., the processing such as follow-up transmission are not done to first message.
To sum up, by above-mentioned message treatment method, producer's cluster by cache node cluster before the message is transmitted, it is right
Message is filtered processing so that the message received in message queue cluster does not repeat, and consumer's cluster is from message queue collection
After subscribing to message in group, related service processing can be directly done.
Based on same inventive concept, as shown in fig.3, the embodiment of the present application additionally provides a kind of message producer cluster,
Message producer's cluster includes at least one message producer 300, and any message producer 300 includes：Production unit 301,
Routing unit 302, determination unit 303 and transmitting element 304.
Production unit 301, for producing first message；
Routing unit 302, for determining the of production unit production according to setting routing mode in cache node cluster
One message treats cache node；
Determination unit 303, for determining to treat in cache node with the presence or absence of the second message identical with first message, first
Message externally provides subscription service for message queue cluster；
Transmitting element 304, for there is no identical with first message the in determining to treat cache node in determination unit 303
During two message, to message queue collection pocket transmission first message；And for existing in determining to treat cache node and first message
During identical second message, cancel to message queue collection pocket transmission first message.
Optionally, routing unit 302 treats that cache node is unique according to first message determined by setting routing mode.
Optionally, routing unit 302 is specifically used for：
Quantity according to cache node in cache node cluster is each cache node serial number.For example, cache node
The quantity of cache node is compiled as N in cluster, be 1 for each cache node number, 2 ... N, N are natural number；
The unique mark of first message is obtained, determines the corresponding numerical value of unique mark, numerical value is subjected to remainder calculating to N,
Obtain remainder；
By number be remainder cache node be determined as first message treat cache node.
Optionally, the message producer 300 further includes buffer unit 305, for determining to treat cache node in determination unit 303
In there is no after the second message identical with first message, the relevant information of first message is buffered in and described treats cache node.
Routing unit 302 is specifically used for when determining the corresponding numerical value of the unique mark：
According to hash algorithm, the corresponding numerical value of the unique mark is determined.
Determination unit 303 is additionally operable to：
Determining described when there is the second message identical with the first message in cache node, discarding described first
Message.
It should be understood by those skilled in the art that, embodiments herein can be provided as method, system or computer program
Product.Therefore, the reality in terms of complete hardware embodiment, complete software embodiment or combination software and hardware can be used in the application
Apply the form of example.Moreover, the computer for wherein including computer usable program code in one or more can be used in the application
The computer program production that usable storage medium is implemented on (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.)
The form of product.
The application is with reference to the flow according to the method for the embodiment of the present application, equipment (system) and computer program product
Figure and/or block diagram describe.It should be understood that it can be realized by computer program instructions every first-class in flowchart and/or the block diagram
The combination of flow and/or box in journey and/or box and flowchart and/or the block diagram.These computer programs can be provided
The processor of all-purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices is instructed to produce
A raw machine so that the instruction performed by computer or the processor of other programmable data processing devices is generated for real
The device for the function of being specified in present one flow of flow chart or one box of multiple flows and/or block diagram or multiple boxes.
These computer program instructions, which may also be stored in, can guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works so that the instruction generation being stored in the computer-readable memory includes referring to
Make the manufacture of device, the command device realize in one flow of flow chart or multiple flows and/or one box of block diagram or
The function of being specified in multiple boxes.
These computer program instructions can be also loaded into computer or other programmable data processing devices so that counted
Series of operation steps is performed on calculation machine or other programmable devices to generate computer implemented processing, so as in computer or
The instruction offer performed on other programmable devices is used to implement in one flow of flow chart or multiple flows and/or block diagram one
The step of function of being specified in a box or multiple boxes.
Although the preferred embodiment of the application has been described, those skilled in the art once know basic creation
Property concept, then can make these embodiments other change and modification.So appended claims be intended to be construed to include it is excellent
It selects embodiment and falls into all change and modification of the application scope.
Obviously, those skilled in the art can carry out the embodiment of the present application various modification and variations without departing from this Shen
Please embodiment spirit and scope.In this way, if these modifications and variations of the embodiment of the present application belong to the application claim
And its within the scope of equivalent technologies, then the application is also intended to comprising including these modification and variations.
Claims (10)
1. a kind of message treatment method, which is characterized in that including：
Message producer cluster produces first message, and determines described first according to setting routing mode in cache node cluster
Message treats cache node；
The message producer cluster is treated with the presence or absence of identical with the first message second to disappear in cache node described in judging
Breath, determine it is described when the second message identical with the first message is not present in cache node, to message queue cluster
The first message is sent, the first message externally provides subscription service for the message queue cluster.
2. the method as described in claim 1, which is characterized in that the message producer cluster is determined according to setting routing mode
The first message treats cache node, including：
The message producer cluster is each cache node order according to the quantity of cache node in the cache node cluster
Number；
The message producer cluster obtains the unique mark of the first message, determines the corresponding numerical value of the unique mark,
The numerical value is subjected to remainder calculating to the quantitative value of cache node in the cache node cluster, obtains remainder；
The message producer cluster by number be the remainder cache node be determined as the first message treat caching section
Point.
3. method as claimed in claim 2, which is characterized in that the message producer cluster determines that the unique mark corresponds to
Numerical value, including：
The message producer cluster determines the corresponding numerical value of the unique mark according to hash algorithm.
4. the method as described in claim 1, which is characterized in that the message producer cluster is determining described to treat cache node
In be not present the second message identical with the first message when, further include：
The relevant information of the first message is buffered in and described treats cache node by the message producer cluster.
5. such as Claims 1 to 4 any one of them method, which is characterized in that the method further includes：
There is the second message identical with the first message in cache node is treated described in determining in the message producer cluster
When, abandon the first message.
6. a kind of message producer cluster, which is characterized in that the message producer cluster includes at least one message production
Person, any message producer include：
Production unit, for producing first message；
Routing unit, for determining described the of production unit production according to setting routing mode in cache node cluster
One message treats cache node；
Determination unit, for determining described treat in cache node with the presence or absence of the second message identical with the first message, institute
It states first message and externally provides subscription service for the message queue cluster；
Transmitting element, for determining described to treat that there is no identical with the first message in cache node in the determination unit
During second message, to first message described in message queue collection pocket transmission.
7. message producer cluster as claimed in claim 6, which is characterized in that the routing unit is specifically used for：
Quantity according to cache node in the cache node cluster is each cache node serial number；
The unique mark of the first message is obtained, determines the corresponding numerical value of the unique mark, by the numerical value to described slow
The quantitative value for depositing cache node in node cluster carries out remainder calculating, obtains remainder；
By number be the remainder cache node be determined as the first message treat cache node.
8. message producer cluster as claimed in claim 7, which is characterized in that the routing unit is specifically used for：
According to hash algorithm, the corresponding numerical value of the unique mark is determined.
9. message producer cluster as claimed in claim 6, which is characterized in that the determination unit is additionally operable to：
It is determining described when there is the second message identical with the first message in cache node, is abandoning described first and disappear
Breath.
10. a kind of message handling system, which is characterized in that including such as claim 6~10 any one of them message producer
Cluster, cache node cluster, message queue cluster and consumer's cluster；
The message producer cluster includes at least one message producer, and the cache node cluster includes at least one slow
Node is deposited, the message queue cluster includes at least one server, and consumer's cluster includes at least one consumption
Person；
Each message producer is used to submit message at least one server, and each consumer is used for described at least one
A server subscribes to message；
The cache node cluster is connected with the message producer cluster, for the message producer to it is described at least
Before one server submits message, processing is filtered to message to be committed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611020095.9A CN108076103A (en) | 2016-11-18 | 2016-11-18 | A kind of message treatment method, system and message producer's cluster |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611020095.9A CN108076103A (en) | 2016-11-18 | 2016-11-18 | A kind of message treatment method, system and message producer's cluster |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108076103A true CN108076103A (en) | 2018-05-25 |
Family
ID=62160494
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611020095.9A Pending CN108076103A (en) | 2016-11-18 | 2016-11-18 | A kind of message treatment method, system and message producer's cluster |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108076103A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110798495A (en) * | 2018-08-03 | 2020-02-14 | 北京京东尚科信息技术有限公司 | Method and server for end-to-end message push in cluster architecture mode |
| CN111459689A (en) * | 2020-04-07 | 2020-07-28 | 中国建设银行股份有限公司 | Message processing system and method based on distributed queue |
| CN113132678A (en) * | 2019-12-31 | 2021-07-16 | 深圳云天励飞技术有限公司 | Data transmission method and device, electronic equipment and storage medium |
| CN113360487A (en) * | 2021-06-03 | 2021-09-07 | 上海微盟企业发展有限公司 | Message duplication eliminating method and related device |
| CN113542314A (en) * | 2020-04-13 | 2021-10-22 | 烽火通信科技股份有限公司 | Method and system for realizing subscription mode based on keyword filtering |
| CN114827145A (en) * | 2022-04-24 | 2022-07-29 | 阿里巴巴（中国）有限公司 | Server cluster system, and metadata access method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050125788A1 (en) * | 2003-12-03 | 2005-06-09 | International Business Machines Corporation | Wizard-based installation package with run-time debugging support |
| CN102006330A (en) * | 2010-12-01 | 2011-04-06 | 北京瑞信在线系统技术有限公司 | Distributed cache system, data caching method and inquiring method of cache data |
| CN104092717A (en) * | 2013-12-13 | 2014-10-08 | 深圳市腾讯计算机系统有限公司 | Message processing method and system, message destination end device and distributed message system |
| CN104754036A (en) * | 2015-03-06 | 2015-07-01 | 合一信息技术（北京）有限公司 | Message processing system and processing method based on kafka |
-
2016
- 2016-11-18 CN CN201611020095.9A patent/CN108076103A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050125788A1 (en) * | 2003-12-03 | 2005-06-09 | International Business Machines Corporation | Wizard-based installation package with run-time debugging support |
| CN102006330A (en) * | 2010-12-01 | 2011-04-06 | 北京瑞信在线系统技术有限公司 | Distributed cache system, data caching method and inquiring method of cache data |
| CN104092717A (en) * | 2013-12-13 | 2014-10-08 | 深圳市腾讯计算机系统有限公司 | Message processing method and system, message destination end device and distributed message system |
| CN104754036A (en) * | 2015-03-06 | 2015-07-01 | 合一信息技术（北京）有限公司 | Message processing system and processing method based on kafka |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110798495A (en) * | 2018-08-03 | 2020-02-14 | 北京京东尚科信息技术有限公司 | Method and server for end-to-end message push in cluster architecture mode |
| CN110798495B (en) * | 2018-08-03 | 2023-05-30 | 北京京东尚科信息技术有限公司 | Method and server for end-to-end message push in cluster architecture mode |
| CN113132678A (en) * | 2019-12-31 | 2021-07-16 | 深圳云天励飞技术有限公司 | Data transmission method and device, electronic equipment and storage medium |
| CN111459689A (en) * | 2020-04-07 | 2020-07-28 | 中国建设银行股份有限公司 | Message processing system and method based on distributed queue |
| CN113542314A (en) * | 2020-04-13 | 2021-10-22 | 烽火通信科技股份有限公司 | Method and system for realizing subscription mode based on keyword filtering |
| CN113360487A (en) * | 2021-06-03 | 2021-09-07 | 上海微盟企业发展有限公司 | Message duplication eliminating method and related device |
| CN114827145A (en) * | 2022-04-24 | 2022-07-29 | 阿里巴巴（中国）有限公司 | Server cluster system, and metadata access method and device |
| CN114827145B (en) * | 2022-04-24 | 2024-01-05 | 阿里巴巴（中国）有限公司 | Server cluster system, metadata access method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108076103A (en) | A kind of message treatment method, system and message producer's cluster | |
| Liu et al. | Adaptive asynchronous federated learning in resource-constrained edge computing | |
| Jiang et al. | Autonomous resource provisioning for multi-service web applications | |
| Cui et al. | A blockchain-based containerized edge computing platform for the internet of vehicles | |
| CN109075988B (en) | Task scheduling and resource issuing system and method | |
| CN105933408B (en) | A kind of implementation method and device of Redis universal middleware | |
| CN105045871B (en) | Data aggregate querying method and device | |
| JP2009529183A (en) | Multi-cache coordination for response output cache | |
| Gao et al. | Improving availability and performance with application-specific data replication | |
| CN109804354A (en) | Message cache management for message queue | |
| US20190129771A1 (en) | Balanced message distribution in distributed message handling systems | |
| CN110058949B (en) | Sensing cloud low-coupling control method based on intelligent edge computing | |
| Zhang et al. | HotGraph: Efficient asynchronous processing for real-world graphs | |
| CN107545005A (en) | A kind of data processing method and device | |
| Liu et al. | Mix‐flow scheduling using deep reinforcement learning for software‐defined data‐center networks | |
| CN108416054A (en) | Dynamic HDFS copy number calculating methods based on file access temperature | |
| Pandey et al. | Minimizing the communication cost of aggregation in publish/subscribe systems | |
| Soleimanzadeh et al. | SD‐WLB: An SDN‐aided mechanism for web load balancing based on server statistics | |
| US10579676B2 (en) | Highly scalable fine grained rate limiting | |
| KR20070032441A (en) | Load balancing system based on fuzzy grouping and the load balancing method | |
| Kalnis et al. | Mizan: Optimizing graph mining in large parallel systems | |
| Kim et al. | A signalling explanation for preferential attachment in the evolution of social networks | |
| CN110321218A (en) | A method of based on point to point network system solution MIXED INTEGER program | |
| Jiang et al. | Understanding and improvement of the selection of replica servers in key–value stores | |
| CN109981726A (en) | A kind of distribution method of memory node, server and 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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180525 |
|
| WD01 | Invention patent application deemed withdrawn after publication |