CN102902676A - Information processing method and information processing equipment - Google Patents
Information processing method and information processing equipment Download PDFInfo
- Publication number
- CN102902676A CN102902676A CN2011102102612A CN201110210261A CN102902676A CN 102902676 A CN102902676 A CN 102902676A CN 2011102102612 A CN2011102102612 A CN 2011102102612A CN 201110210261 A CN201110210261 A CN 201110210261A CN 102902676 A CN102902676 A CN 102902676A
- Authority
- CN
- China
- Prior art keywords
- remainder
- server
- associated data
- carrying
- data information
- 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.)
- Granted
Links
Images
Abstract
The invention discloses an information processing method and information processing equipment. The information processing method comprises the following steps that: a splitting management server receives external request information; the external request information carries related data information; the splitting management server obtains a corresponding related data value according to the related data information, and obtains a quantity Y of bearing servers for processing the external request information; and the splitting management server selects to process the bearing servers for processing the external request information according to the related data value and the quantity Y of the bearing servers. In the information processing method and the information processing equipment provided by the invention, the occurrence of hotspots can be stabilized without manual intervention; and the problem that each bearing server is non-uniform in distribution when the level of the related data is expanded can be solved, so that the data splitting speed is rapid without error splitting; and the hotspots can be effectively avoided, and the stability and the reliability can be realized.
Description
Technical field
The application relates to networking technology area, particularly relates to a kind of disposal route and equipment of message.
Background technology
Because the load capacity of separate unit server is limited, in internet and business circles, can by the mode of linear superposition, increase the server that the same application service is provided at present, so that a plurality of servers can provide identical application service to outside application request, thereby promote service performance.
In order to use a plurality of servers to provide identical application service as the applications request, and guarantee the performance of each server, need to carry out to outside application request the horizontal cutting of data, process thereby different applications requests is assigned on the server that application service respectively is provided.Horizontal cutting refers to, by with a plurality of parallel accesses of servers that the same application service is provided, each server all can externally provide service, and a plurality of server externally provides service with parallel mode, thereby improves the method for processing power.
The present level slit mode is to carry out cutting according to the associated data information (such as zone bit) in the applications request message, but the quantity of the applications request that each zone bit is corresponding is also inhomogeneous, this causes can not the request of balanced cutting applications, when the quantity of applications request corresponding to a certain zone bit is too much, will cause the pressure of server of this zone bit of alignment processing excessive.
For example, the applications request is when passing through each server stores car plate relevant information, zone bit can be Shanghai A, Zhejiang A, processed the applications request of corresponding Shanghai A by server 1, processed the applications request of corresponding Zhejiang A by server 2, if the applications request that the applications request that the applications request of corresponding Shanghai A much larger than the applications request of corresponding Zhejiang A, then can cause server 1 to be processed is processed much larger than server 2.
As shown in Figure 1, schematic diagram for its server process situation, the processing power of each server is identical, and provide identical application service, but above-mentioned horizontal slit mode meeting is so that the applications request of processing between each server differs larger, cause the treatment capacity of applications request of part of server (such as server 1, server 3 etc.) much smaller than processing power, and the treatment capacity of the applications request of another part server (such as server 15 etc.) is much larger than processing power.
In the prior art, when selecting to process the server of applications request, also can adopt hash algorithm or congruence algorithm to realize.
But hash algorithm and congruence algorithm can't guarantee the even distribution of applications request; And the data cutting speed is slow, wrong cutting easily occurs, and can not can't check the accuracy of data according to as a result backstepping cutting process, and stability and reliability are all very low; And can't avoid not occurring the hot-zone.The hot-zone refers to process the more server of applications request, for example, a, b, three servers of c is arranged, and a has distributed 10% applications request, and c has distributed 10% applications request, and b has distributed 80% applications request, and then b is the hot-zone.
The current mode of hot-zone of avoiding can be manual intervention, namely needs manual intervention, and the data in the server that pressure ratio is larger are put into other independent servers, but the mode of this Data Migration, moving costs is high, and the migration situation complexity, and is maintainable poor.
Summary of the invention
The application provides a kind of disposal route and equipment of message, so that being assigned on each carrying server of external request message equilibrium processed.
To achieve these goals, the application proposes a kind of disposal route of message, and by Y carrying server process external request message, the method may further comprise the steps:
The cutting management server receives external request message, carries associated data information in the described external request message;
Described cutting management server obtains corresponding associated data value according to described associated data information;
Described cutting management server selects to process the carrying server of described external request message according to the quantity Y of described associated data value and carrying server.
The application proposes a kind of server, comprising:
Receiver module is used for receiving external request message, carries associated data information in the described external request message;
Obtain module, be used for according to described associated data information, obtain corresponding associated data value;
Select module, be used for the quantity Y according to described associated data value and carrying server, select to process the carrying server of described external request message.
Compared with prior art, the application comprises following advantage: the appearance that can stabilize the hot-zone, need not manual intervention, and can solve the problem of respectively carrying the server-assignment inequality when associated data level is expanded, the data cutting speed is fast, the cutting of mistake can not occur, and can effectively avoid the hot-zone, can check data accuracy according to as a result backstepping cutting process, reliable and stable.Certainly, arbitrary product of enforcement the application's embodiment might not need to reach simultaneously above-described all advantages.
Description of drawings
Fig. 1 is server process situation schematic diagram in the prior art;
Fig. 2 is the application's network architecture schematic diagram;
Fig. 3 is the process flow figure of the message in the embodiment of the present application one;
Fig. 4 is that the cutting management server utilizes quantity Y and associated data value to select the process flow diagram of carrying server in the embodiment of the present application one;
Fig. 5 is the effect schematic diagram in the embodiment of the present application one;
Fig. 6 and Fig. 7 are the server architecture figure in the embodiment of the present application two.
Embodiment
Embodiment one
The embodiment of the present application one provides a kind of disposal route of message, as shown in Figure 2, be the application's application scenarios schematic diagram, each carries the server (as can be the database of storage data) of server for the same application service is provided, for the treatment of external request message, and the quantity of carrying server is Y; The cutting management server is used for management and respectively carries server, gives the carrying server with the external request distribution of messages.Based on the network architecture shown in Figure 2, as shown in Figure 3, the method may further comprise the steps:
Step 301, each front server receives external request message, and external request message is sent to the cutting management server.
Carry associated data information (data that context dependency is arranged are associated data) in this external request message, for example, the applications request is for by accident relevant information corresponding to each carrying server stores car plate the time, then associated data information can be Shanghai A12345, Zhejiang A23456, each car may have repeatedly accident, so the accident record that car plate is identical should be put in the same service.
Step 302, the cutting management server receives external request message, and the associated data value corresponding according to the associated data information acquisition in the external request message.
Among the application, can associated data information be converted to corresponding associated data value by methods such as digital codings, for example, can pass through ASCII, perhaps the mode of encode Chinese characters for computer conversion is converted to the associated data value with associated data information such as Shanghai A12345, Zhejiang A23456.This conversion regime can be selected according to practical application, does not repeat them here.
Step 303, the cutting management server is according to the quantity Y of associated data value and carrying server, select to process the carrying server of this external request message, by the carrying server of selecting outside request message is processed (such as storage car plate relevant information).
The cutting management server can be according to the deployment scenario of the network architecture, knows the quantity Y (describing for example take Y value as 4) of carrying server, and utilizes quantity Y and associated data value, selects the carrying server of this external request message of processing.
As shown in Figure 4, the cutting management server utilizes quantity Y and associated data value, selects the process of carrying server, may further comprise the steps:
Among the application, the value of merger number of times T is larger, and then the value of cutting constant Z is larger, and cutting is finer and smoother, and the ability of balance hot-zone is also just larger.For example, when T=2, Z=4*Y then; When T=3, Z=8*Y then; When T=4, Z=16*Y then.
In the practical application, consider that associated data information (such as Shanghai A12345, Zhejiang A23456 etc.) is finite aggregate or unlimited set, therefore, corresponding data acquisition to be slit is (take data set A as example, then the data among the data set A are each associated data information) be finite aggregate or unlimited set, tentation data integrates quantity among the A, and (probably total how many associated data information can be estimated in advance and know as N, its quantity is N), then when selecting the T value, as long as quantity N＞Y*2^ (T+1).
For convenience of description, take Y=4, T=2 as example, the quantity＞Y*8 among then Z=4*4=16, so the data set A gets final product among the application.
Among the application, safeguard on the cutting management server route remainder group and the routing relation of carrying server are arranged, this route remainder group is specially, after carrying out the balanced statistics of memory space according to the associated data information of having stored of the different remainder M of correspondence, the set that resulting each remainder M that should store same carrying server into forms.
For example, after carrying out the balanced statistics of memory space, remainder M is 0,1,2,3 o'clock, and corresponding associated data information should store carrying server 1 into; By that analogy, remainder M is 12,13,14,15 o'clock, and corresponding associated data information should store carrying server 4 into; Based on above-mentioned example, then a kind of routing relation is as shown in table 1.
Table 1
| Route remainder group | The carrying server |
| Remainder M is 0,1,2,3 | |
| Remainder M is 4,5,6,7 | Carrying server 2 |
| Remainder M is 8,9,10,11 | |
| Remainder M is 12,13,14,15 | Carrying server 4 |
By table 1, then when the value of the remainder M that obtains in the step 402 is 9, can determine to process the said external request message by carrying server 3 by the routing relation of table 1.
Among the application, in order to realize said process, need to determine route remainder group and the routing relation of carrying server, with the routing relation shown in the Maintenance Table 1.This route remainder group comprises with definite process of the routing relation of carrying server:
Cutting management server associated data value that the associated data information of having stored in the sample time interval is corresponding is determined corresponding remainder M respectively divided by cutting constant Z.For example, the sample time interval is 100 days, then need to determine remainder M corresponding to all associated data information in 100 days, and each value of remainder M is all with the relevant data message of correspondence.
The remainder M that the cutting management server is maximum with corresponding associated data information content (such as remainder 15) the remainder M (such as remainder 1) minimum with corresponding associated data information content forms a first order remainder group, and in remaining other remainders M, the minimum remainder M of continuation remainder M that corresponding associated data information content is maximum and corresponding associated data information content forms other first order remainder groups, until all remainder M all belong to different first order remainder groups.
It should be noted that said process can sort to realize by the associated data information content that each remainder M is corresponding.Take first order remainder group as (0,15), (1,14) ... (7,8) are example.
The first order remainder group that the cutting management server is maximum with corresponding associated data information content (such as first order remainder group (0, the 15)) first order remainder group (such as first order remainder group (7,8)) minimum with corresponding associated data information content forms a second level remainder group, and in remaining other first order remainder groups, continue the minimum first order remainder group of the first order remainder group that corresponding associated data information content is maximum and corresponding associated data information content and form other second level remainder groups; Until all first order remainder groups all belong to different second level remainder groups.
By that analogy, (T has determined the merger number of times of remainder group until all remainder M have formed the T level equal with carrying number of servers, the larger merger number of times of T value is more, calculated amount is corresponding to be increased, can select as one sees fit in the practical implementation) after the remainder group, the cutting management server determines that T level remainder group is route remainder group, and sets up corresponding routing relation from different carrying servers respectively.
Among the application, because T=2, then remainder group in the second level is route remainder group, take second level remainder group as (0,15,7,8), (1,14,6,9), (2,13,5,10), (3,12,4,11) are as example; Each second level remainder group is corresponding 4 of carrying in the servers arbitrarily, can draw the routing relation shown in the table 2 thus.
Table 2
| Route remainder group | The carrying server |
| Remainder M is 0,15,7,8 | |
| Remainder M is 1,14,6,9 | Carrying server 2 |
| Remainder M is 2,13,5,10 | |
| Remainder M is 3,12,4,11 | Carrying server 4 |
By table 1, then when the value of the remainder M that obtains in the step 402 is 9, can determine to process the said external request message by carrying server 2 by the routing relation of table 2.
Among the application, in order to safeguard above-mentioned routing relation, can carry out based on predetermined period (such as 100 days) definite process of the routing relation of above-mentioned route remainder group and carrying server; The difference of memory space that also can be between a plurality of carrying servers reaches when specifying first threshold (such as 10000), carries out definite process of above-mentioned route remainder group and the routing relation of carrying server; Wherein, this appointment first threshold can be selected according to the practical experience value.
Concrete, because the dynamic of data, after obtaining routing relation, owing to the variation of data balancing in the follow-up data processing procedure, may occur, therefore when the difference that the memory space between any two carrying servers is arranged surpasses the appointment first threshold, illustrate that then data balancing changes, need to regenerate routing relation this moment, and utilize the routing relation that regenerates to continue to provide service, based on the routing relation that regenerates, can be so that data can reach balance again, each carries server can balanced processing external request message.
(this appointment Second Threshold can be selected according to practical experience when the memory space that the carrying server is arranged reaches the appointment Second Threshold, as 100000 or maximum storage 90% etc.) time, then need to increase the quantity of carrying server, can increase the individual carrying server of Y*n (n is positive integer) among the application, and according to preset strategy the associated data information transfer of having stored in current Y the carrying server be carried in the server to the Y*n that newly increases; For example, during n=1, then increase by 4 carrying servers, preset strategy can be 50% of the associated data information of will current Y having stored in the carrying server and moves in the carrying server that newly increases, as will carry in the server 1 half associated data information transfer to the carrying server 5 in, with carrying half associated data information transfer in the server 2 in carrying server 6, by that analogy.
Afterwards, after the quantity that increases the carrying server, the cutting management server need to redefine the routing relation of route remainder group and carrying server based on current Y Y*n carrying server that carries server and newly increase.For example, the cutting management server redefines routing relation based on 8 carrying servers, determines that accordingly mode is identical with said process, and just Y value (becoming 8 by 4) changes, and does not repeat them here.Afterwards, according to the routing relation that redefines, the associated data information transfer of having stored in current Y the carrying server is carried in the server to the Y*n that newly increases.
Therefore, among the application, by increasing the carrying server, can reduce the memory space of current carrying server, provide service so that current carrying server can continue as the applications request, and by increasing Y*n carrying server, can reduce the data volume of migration.Certainly, being not limited in the practical application increases Y*n carrying server, and for example, only increasing by 1 carrying server, 2, to carry servers all passable, do not repeat them here.
In addition, among the application, in order to improve the reliability of processing, can also when networking, dispose backup cutting management server, backup cutting management server has identical function with the cutting management server, when the cutting management server breaks down, can be realized by backup cutting management server the function of cutting management server.
In sum, can be so that respectively carry the external request message of the similar quantity of server process among the application.For example, for the Ku Biaonei that crosses web advertisement click data district's cutting to 512 of hundred million, after the selection by carrying server among the application, as shown in Figure 5, be schematic diagram of each carrying server process situation.As can be seen from Figure 5, the data volume of each storehouse table is between 230,000-240,000, and pressure is in admirable proportion, and need not artificial interference.
By the technical scheme that adopts the application to provide, can be by associated data information be carried out digital coding, utilize the intersection way that sample data is broken up again, carrying out merger according to capacity again processes, and then stabilize the appearance of hot-zone, need not manual intervention, and can solve the problem of respectively carrying the server-assignment inequality when associated data level is expanded, the data cutting speed is fast, the cutting of mistake can not occur, and can effectively avoid the hot-zone, can be according to as a result backstepping cutting process, check data accuracy, reliable and stable.Certainly, arbitrary product of enforcement the application's embodiment might not need to reach simultaneously above-described all advantages.
Embodiment two
Based on the same application design of above-mentioned application, the embodiment of the present application two provides a kind of server, and as shown in Figure 6, this server comprises:
Obtain module 12, be used for according to described associated data information, obtain corresponding associated data value;
As shown in Figure 7, described selection module 13 further comprises:
The first calculating sub module 131 is used for calculating cutting constant Z, and wherein, Z is Y*2
T, T is the merger number of times;
The second calculating sub module 132 is used for calculating described associated data value divided by the value of the remainder M of described cutting constant Z;
Wherein, described route remainder group is specially, carry out the balanced statistics of memory space according to the associated data information of having stored of the different remainder M of correspondence after, the set that each the remainder M that stores same carrying server into that obtains forms.
Described selection module also comprises: determine submodule 134, be used for determining described route remainder group and the routing relation of carrying server; And specifically be used for the associated data value that the associated data information of having stored in the sample time interval is corresponding respectively divided by described cutting constant Z, determine corresponding remainder M;
First order remainder group of remainder M composition that the remainder M that corresponding associated data information content is maximum is minimum with corresponding associated data information content, and in remaining other remainders M, continue the minimum remainder M of the remainder M that corresponding associated data information content is maximum and corresponding associated data information content and form other first order remainder groups; Until all remainder M all belong to different first order remainder groups;
Second level remainder group of first order remainder group composition that the first order remainder group that corresponding associated data information content is maximum is minimum with corresponding associated data information content, and in remaining other first order remainder groups, continue the minimum first order remainder group of the first order remainder group that corresponding associated data information content is maximum and corresponding associated data information content and form other second level remainder groups;
By that analogy, until all remainder M formed with the equal T level remainder group of described carrying number of servers after, determine that T level remainder group is described route remainder group, and set up corresponding routing relation from different carrying servers respectively.
Described definite submodule 134 also is used for redefining described route remainder group and the routing relation of carrying server when the difference of the memory space between a plurality of carrying servers reaches the appointment first threshold.
Described definite submodule 134 also is used for when the memory space of carrying server reaches the appointment Second Threshold, and increases Y*n carrying server, and wherein, n is positive integer;
And based on current Y Y*n carrying server that carries server and newly increase, redefine described route remainder group and the routing relation of carrying server;
According to the routing relation that redefines, the associated data information transfer of having stored in current Y the carrying server is carried in the server to the Y*n that newly increases.
It will be appreciated by those skilled in the art that the module in the device among the embodiment can be distributed in the device of embodiment according to the embodiment description, also can carry out respective change and be arranged in the one or more devices that are different from the present embodiment.The module of above-described embodiment can be merged into a module, also can further split into a plurality of submodules.
Through the above description of the embodiments, those skilled in the art can be well understood to the application and can realize by the mode that software adds essential general hardware platform, can certainly pass through hardware, but the former is better embodiment in a lot of situation.Based on such understanding, the part that the application's technical scheme contributes to prior art in essence in other words can embody with the form of software product, this computer software product is stored in the storage medium, comprise that some instructions are with so that a station terminal equipment (can be mobile phone, personal computer, server, the perhaps network equipment etc.) carry out the described method of each embodiment of the application.
The above only is the application's preferred implementation; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the application's principle; can also make some improvements and modifications, these improvements and modifications also should be looked the application's protection domain.
It will be appreciated by those skilled in the art that the module in the device among the embodiment can be distributed in the device of embodiment according to the embodiment description, also can carry out respective change and be arranged in the one or more devices that are different from the present embodiment.The module of above-described embodiment can be integrated in one, and also can separate deployment; A module can be merged into, also a plurality of submodules can be further split into.Above-mentioned the embodiment of the present application sequence number does not represent the quality of embodiment just to description.
Above disclosed only be several specific embodiments of the application, still, the application is not limited thereto, the changes that any person skilled in the art can think of all should fall into the application's protection domain.
Claims (10)
1. the disposal route of a message is characterized in that, by Y carrying server process external request message, may further comprise the steps:
The cutting management server receives external request message, carries associated data information in the described external request message;
Described cutting management server obtains corresponding associated data value according to described associated data information;
Described cutting management server selects to process the carrying server of described external request message according to the quantity Y of described associated data value and carrying server.
2. the method for claim 1 is characterized in that, described cutting management server selects to process the carrying server of described external request message according to the quantity Y of described associated data value and carrying server, comprising:
Described cutting management server calculates cutting constant Z, and wherein, Z is Y*2
T, T is the merger number of times;
Described cutting management server calculates described associated data value divided by the value of the remainder M of described cutting constant Z;
Described cutting management server is selected carrying server corresponding to value of described remainder M according to the routing relation of the route remainder group under the value of remainder M with the carrying server;
Wherein, described route remainder group is specially, carry out the balanced statistics of memory space according to the associated data information of having stored of the different remainder M of correspondence after, the set that each the remainder M that stores same carrying server into that obtains forms.
3. method as claimed in claim 2 is characterized in that, described route remainder group and the routing relation of carrying server are specifically determined in the following manner:
Described cutting management server associated data value that the associated data information of having stored in the sample time interval is corresponding is determined corresponding remainder M respectively divided by described cutting constant Z;
First order remainder group of remainder M composition that the remainder M that described cutting management server is maximum with corresponding associated data information content is minimum with corresponding associated data information content, and in remaining other remainders M, continue the minimum remainder M of the remainder M that corresponding associated data information content is maximum and corresponding associated data information content and form other first order remainder groups; Until all remainder M all belong to different first order remainder groups;
Second level remainder group of first order remainder group composition that the first order remainder group that described cutting management server is maximum with corresponding associated data information content is minimum with corresponding associated data information content, and in remaining other first order remainder groups, continue the minimum first order remainder group of the first order remainder group that corresponding associated data information content is maximum and corresponding associated data information content and form other second level remainder groups;
By that analogy, until all remainder M formed with the equal T level remainder group of described carrying number of servers after, described cutting management server determines that T level remainder group is described route remainder group, and sets up corresponding routing relation from different carrying servers respectively.
4. method as claimed in claim 3 is characterized in that, described method also comprises:
When the difference of the memory space between a plurality of carrying servers reached the appointment first threshold, described cutting management server redefined described route remainder group and the routing relation of carrying server.
5. method as claimed in claim 3 is characterized in that, described method also comprises:
When the memory space of carrying server reaches the appointment Second Threshold, increase Y*n carrying server, wherein, n is positive integer;
Described cutting management server redefines described route remainder group and the routing relation of carrying server based on current Y Y*n carrying server that carries server and newly increase;
According to the routing relation that redefines, the associated data information transfer of having stored in current Y the carrying server is carried in the server to the Y*n that newly increases.
6. a server is characterized in that, comprising:
Receiver module is used for receiving external request message, carries associated data information in the described external request message;
Obtain module, be used for according to described associated data information, obtain corresponding associated data value;
Select module, be used for the quantity Y according to described associated data value and carrying server, select to process the carrying server of described external request message.
7. server as claimed in claim 6 is characterized in that, described selection module comprises:
The first calculating sub module is used for calculating cutting constant Z, and wherein, Z is Y*2
T, T is the merger number of times;
The second calculating sub module is used for calculating described associated data value divided by the value of the remainder M of described cutting constant Z;
The chooser module is used for selecting carrying server corresponding to value of described remainder M according to the routing relation of the route remainder group under the value of remainder M with the carrying server;
Wherein, described route remainder group is specially, carry out the balanced statistics of memory space according to the associated data information of having stored of the different remainder M of correspondence after, the set that each the remainder M that stores same carrying server into that obtains forms.
8. server as claimed in claim 7 is characterized in that, described selection module also comprises:
Determine submodule, be used for determining described route remainder group and the routing relation of carrying server; And specifically be used for the associated data value that the associated data information of having stored in the sample time interval is corresponding respectively divided by described cutting constant Z, determine corresponding remainder M;
First order remainder group of remainder M composition that the remainder M that corresponding associated data information content is maximum is minimum with corresponding associated data information content, and in remaining other remainders M, continue the minimum remainder M of the remainder M that corresponding associated data information content is maximum and corresponding associated data information content and form other first order remainder groups; Until all remainder M all belong to different first order remainder groups;
Second level remainder group of first order remainder group composition that the first order remainder group that corresponding associated data information content is maximum is minimum with corresponding associated data information content, and in remaining other first order remainder groups, continue the minimum first order remainder group of the first order remainder group that corresponding associated data information content is maximum and corresponding associated data information content and form other second level remainder groups;
By that analogy, until all remainder M formed with the equal T level remainder group of described carrying number of servers after, determine that T level remainder group is described route remainder group, and set up corresponding routing relation from different carrying servers respectively.
9. server as claimed in claim 8 is characterized in that,
Described definite submodule also is used for redefining described route remainder group and the routing relation of carrying server when the difference of the memory space between a plurality of carrying servers reaches the appointment first threshold.
10. server as claimed in claim 8 is characterized in that,
Described definite submodule also is used for when the memory space of carrying server reaches the appointment Second Threshold, and increases Y*n carrying server, and wherein, n is positive integer; And based on current Y Y*n carrying server that carries server and newly increase, redefine described route remainder group and the routing relation of carrying server; According to the routing relation that redefines, the associated data information transfer of having stored in current Y the carrying server is carried in the server to the Y*n that newly increases.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110210261.2A CN102902676B (en) | 2011-07-26 | 2011-07-26 | A kind of disposal route of message and equipment |
| HK13103665.3A HK1176428A1 (en) | 2011-07-26 | 2013-03-25 | Method and equipment for processing a message |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110210261.2A CN102902676B (en) | 2011-07-26 | 2011-07-26 | A kind of disposal route of message and equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102902676A true CN102902676A (en) | 2013-01-30 |
| CN102902676B CN102902676B (en) | 2015-08-26 |
Family
ID=47574916
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110210261.2A Active CN102902676B (en) | 2011-07-26 | 2011-07-26 | A kind of disposal route of message and equipment |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102902676B (en) |
| HK (1) | HK1176428A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104252457A (en) * | 2013-06-25 | 2014-12-31 | 北京百度网讯科技有限公司 | Method and device for managing data set |
| CN105743772A (en) * | 2016-01-26 | 2016-07-06 | 深圳宸睿科技有限公司 | Message processing method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030220998A1 (en) * | 1999-08-27 | 2003-11-27 | Raymond Byars Jennings | Server site restructuring |
| CN1750498A (en) * | 2004-09-17 | 2006-03-22 | 杭州华为三康技术有限公司 | Equalizing ring selecting method for elastic block ring flow |
| CN101247349A (en) * | 2008-03-13 | 2008-08-20 | 华耀环宇科技（北京）有限公司 | Network flux fast distribution method |
| CN102098730A (en) * | 2011-03-04 | 2011-06-15 | 浙江大学 | Multi-data-stream processing method based on wireless sensor network |
-
2011
- 2011-07-26 CN CN201110210261.2A patent/CN102902676B/en active Active
-
2013
- 2013-03-25 HK HK13103665.3A patent/HK1176428A1/en unknown
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030220998A1 (en) * | 1999-08-27 | 2003-11-27 | Raymond Byars Jennings | Server site restructuring |
| CN1750498A (en) * | 2004-09-17 | 2006-03-22 | 杭州华为三康技术有限公司 | Equalizing ring selecting method for elastic block ring flow |
| CN101247349A (en) * | 2008-03-13 | 2008-08-20 | 华耀环宇科技（北京）有限公司 | Network flux fast distribution method |
| CN102098730A (en) * | 2011-03-04 | 2011-06-15 | 浙江大学 | Multi-data-stream processing method based on wireless sensor network |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104252457A (en) * | 2013-06-25 | 2014-12-31 | 北京百度网讯科技有限公司 | Method and device for managing data set |
| CN104252457B (en) * | 2013-06-25 | 2018-11-23 | 北京百度网讯科技有限公司 | A kind of method and apparatus for being managed to data acquisition system |
| CN105743772A (en) * | 2016-01-26 | 2016-07-06 | 深圳宸睿科技有限公司 | Message processing method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102902676B (en) | 2015-08-26 |
| HK1176428A1 (en) | 2013-07-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6716727B2 (en) | Streaming data distributed processing method and apparatus | |
| EP3792766A1 (en) | Data storage method, apparatus, and system | |
| CN104765749A (en) | Data storage method and device | |
| CN103873507A (en) | Data block uploading and storing system and method | |
| CN103678293B (en) | Data storage method and device | |
| CN101771715A (en) | Method, device and system for establishing distribution type network | |
| CN103488687A (en) | Searching system and searching method of big data | |
| CN106096021A (en) | A kind of static page gray scale dissemination method and system | |
| CN113655969B (en) | Data balanced storage method based on streaming distributed storage system | |
| CN106897280A (en) | Data query method and device | |
| CN104348793A (en) | Storage server system and storage method for data information | |
| CN112351088A (en) | CDN cache method, device, computer equipment and storage medium | |
| CN102902676B (en) | A kind of disposal route of message and equipment | |
| CN101819586A (en) | Intelligent sorting server and method and system for data statistics | |
| CN111770150B (en) | Access flow control method and device and electronic equipment | |
| CN103607731A (en) | Method and device for processing measurement reports | |
| CN111506271B (en) | Data segment unit transmission differentiation management method and distributed block storage system | |
| CN104850656A (en) | Dynamic self-adaptive multistage Bloom filter device | |
| CN104486769A (en) | Method and device for selecting valuable cell | |
| CN105024400A (en) | Method and system achieving photovoltaic renewable energy source off-network control | |
| JP2019121333A (en) | Data dynamic migration method and data dynamic migration device | |
| CN105357317A (en) | Data uploading method and system based on multi-client polling queuing | |
| CN105472029A (en) | Single sign-on method and system based on cache | |
| CN112040413B (en) | User track calculation method and device and electronic equipment | |
| Pinagapany et al. | Solving channel allocation problem in cellular radio networks using genetic algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1176428 Country of ref document: HK |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: GR Ref document number: 1176428 Country of ref document: HK |