CN106547626A - For the method and server of peer-to-peer architecture equalization server - Google Patents
For the method and server of peer-to-peer architecture equalization server Download PDFInfo
- Publication number
- CN106547626A CN106547626A CN201611040886.8A CN201611040886A CN106547626A CN 106547626 A CN106547626 A CN 106547626A CN 201611040886 A CN201611040886 A CN 201611040886A CN 106547626 A CN106547626 A CN 106547626A
- Authority
- CN
- China
- Prior art keywords
- data
- message
- server
- task
- peer
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5083—Techniques for rebalancing the load in a distributed system
Abstract
A kind of method and server for peer-to-peer architecture equalization server of disclosure.For the method for peer-to-peer architecture equalization server, including：Obtain the message data from waiting task；First data are synthesized according to the message data；Using first data as in the major key insertion database table of data base；And according to the result in the first insertion of data into data storehouse, process the waiting task.Method for peer-to-peer architecture equalization server disclosed in the present application, can solve multiple servers well while when working, the not reciprocity problem of business.
Description
Technical field
The present invention relates to server resource distribution field, is used for peer-to-peer architecture equalization server in particular to a kind of
Method and server.
Background technology
Most of servers are required for keeping continual work, and developing with system, more and more
Server, needs collaborative work, completes jointly task.By taking care management system as an example, care management system is mainly supported to high-end
Elder in old community, there is provided the related Informatization Service of long-term care.For the long-term care service of elder, it is desirable to which comparison is special
Very, need to provide elder 7*24 hour persistent services, the operation of care management system also require that be 7*24 hours not
Discontinuous.In order to meet this requirement, care management system employs F5 equally loaded device frameworks, below F5 equally loaded devices
There are two service servers, the operation conditions that F5 equally loadeds device can well according to this two-server, by Business Processing
Request is distributed to them.So any service server delay machine or process it is busy when, business all can be connect by another
Handss, business thus will not interrupt.
Under normal circumstances, this set framework has solved most of problem, but care management system also has two classes special
Business：1st, monitoring information queue server (MQ servers), 2, the process of backstage timing operation.This two classes business has been only needed to
And can only have a machine to go to process, otherwise business is just repeatedly processed through vaporization, condensation and absorption, and transaction processing system can be disorderly.For this two classes industry
The process of business, currently existing scheme is：Wherein one server is set to into master server, one is set to from server in addition, only
Master server could process this two classes business.The defect of this scheme is that two service servers are not reciprocity, master servers
Delay machine when, can to business produce have a strong impact on.
Accordingly, it would be desirable to a kind of new method and server for peer-to-peer architecture equalization server.
Disclosed in the background section, above- mentioned information is only used for the understanding for strengthening the background to the present invention, therefore it
Can include not constituting the information to prior art known to persons of ordinary skill in the art.
The content of the invention
In view of this, the present invention provides a kind of method and server for peer-to-peer architecture equalization server, can solve the problem that
The not reciprocity problem of service server in F5 load balancing frameworks.
Other characteristics and advantage of the present invention will be apparent from by detailed description below, or partially by the present invention
Practice and acquistion.
According to an aspect of the present invention, there is provided a kind of method for peer-to-peer architecture equalization server, including：
Obtain the message data from waiting task；
First data are synthesized according to message data；
Using the first data as in the major key insertion database table of data base；And
According to the result in the first insertion of data into data storehouse, waiting task is processed.
In a kind of exemplary embodiment of the disclosure, also include：
Set up database table.
In a kind of exemplary embodiment of the disclosure, the message data from waiting task is obtained, including：
Obtain the message data from Message Queuing server；And
Obtain the message data from backstage timed task.
In a kind of exemplary embodiment of the disclosure, the message data from Message Queuing server is obtained, including：
Extract the ID of the message from Message Queuing server；
Judge whether the ID of message is empty；And
The ID of message is space-time, and by the content of message, encryption obtains the ID of message.
In a kind of exemplary embodiment of the disclosure, the ID of message is space-time, and by the content of message, encryption is disappeared
The ID of breath, including：
The ID of message is obtained using md5 encryption.
In a kind of exemplary embodiment of the disclosure, the first data are synthesized according to message data, including：
Counted with current date, pending task names synthesis first according to the message data from Message Queuing server
According to.
In a kind of exemplary embodiment of the disclosure, the first data are synthesized according to message data, including：
Counted with current date, pending task names synthesis first according to the message data from backstage timed task
According to.
In a kind of exemplary embodiment of the disclosure, data base is set up, including：
Opening relationships type database table.
In a kind of exemplary embodiment of the disclosure, according to the result in the first insertion of data into data storehouse, process and wait to locate
Reason task, including：
If the first insertion of data into data storehouse table is unsuccessful, waiting task is not processed.
According to an aspect of the present invention, there is provided a kind of server, including：
Acquisition module, for obtaining the message data from waiting task；
Data Synthesis module, for synthesizing the first data according to message data；
Major key inserts module, using the first data as in the major key insertion database table of data base；And
Task processing module, according to the result in the first insertion of data into data storehouse table, processes waiting task.
In a kind of exemplary embodiment of the disclosure, also include：
Database table module, sets up database table.
Method and server for peer-to-peer architecture equalization server of the invention can solve the problem that F5 load balancing framves
The not reciprocity problem of service server in structure.
According to other embodiments, the method and server for peer-to-peer architecture equalization server of the present invention can will be more
Business between platform service server keeps equity, and any one or partial service server are delayed machine, nor affect on and wait to locate
The process of reason business.
It should be appreciated that the general description of the above and detailed description hereinafter are only exemplary, this can not be limited
Invention.
Description of the drawings
Its example embodiment is described in detail by referring to accompanying drawing, above and other target of the present invention, feature and advantage will
Become more fully apparent.Drawings discussed below is only some embodiments of the present invention, for the ordinary skill of this area
For personnel, do not pay it is creative come on the premise of move, can be with according to these accompanying drawings acquisition others accompanying drawings.
Fig. 1 is a kind of flow process of the method for peer-to-peer architecture equalization server according to an exemplary embodiment
Figure.
Fig. 2 is a kind of flow process of the method for peer-to-peer architecture equalization server for implementing to exemplify according to another exemplary
Figure.
Fig. 3 is a kind of flow process of the method for peer-to-peer architecture equalization server for implementing to exemplify according to another exemplary
Figure.
Fig. 4 is a kind of block diagram of the system of the server according to an exemplary embodiment.
Specific embodiment
Example embodiment is described more fully with referring now to accompanying drawing.However, example embodiment can be real in a variety of forms
Apply, and be not understood as limited to embodiment set forth herein；Conversely, thesing embodiments are provided so that the present invention will be comprehensively and complete
It is whole, and the design of example embodiment is comprehensively conveyed to into those skilled in the art.In figure, identical reference is represented
Same or similar part, thus repetition thereof will be omitted.
Additionally, described feature, structure or characteristic can in any suitable manner with reference in one or more enforcements
In example.In the following description, there is provided many details are fully understood to embodiments of the invention so as to be given.However,
It will be appreciated by persons skilled in the art that it is one or more during technical scheme can be put into practice without specific detail,
Or can be using other methods, constituent element, device, step etc..In other cases, it is not shown in detail or describes known side
Method, device, realization operate to avoid fuzzy each aspect of the present invention.
Block diagram shown in accompanying drawing is only functional entity, not necessarily must be corresponding with physically separate entity.
I.e., it is possible to these functional entitys are realized using software form, or realize in one or more hardware modules or integrated circuit
These functional entitys, or these functional entitys are realized in heterogeneous networks and/or processor device and/or microcontroller device.
Flow chart shown in accompanying drawing is merely illustrative, it is not necessary to including all of content and operation/step,
It is not required to perform by described order.For example, some operation/steps can also be decomposed, and some operation/steps can be closed
And or part merge, therefore the actual order for performing is possible to be changed according to practical situation.
It should be understood that although various assemblies may be described using term first, second, third, etc. herein, these groups
Part should not be limited by these terms.These terms are to distinguish a component with another component.Therefore, first group for being discussed herein below
Part can be described as teaching of second component without departing from disclosure concept.As used herein, term " and/or " including associated
The all combinations for listing any one and one or more in project.
It will be understood by those skilled in the art that accompanying drawing is the schematic diagram of example embodiment, the module or flow process in accompanying drawing
Not necessarily implement the present invention necessary, therefore cannot be used for limiting the scope of the invention.
Fig. 1 is a kind of flow process of the method for peer-to-peer architecture equalization server according to an exemplary embodiment
Figure.
As shown in figure 1, in S102, obtaining the message data from waiting task.
The message data from waiting task is obtained, by taking the above care management system as an example, management is looked after
System has the special business of two classes：1st, monitoring information queue server (MQ servers), if message, then receives and processes；
2nd, the process of backstage timing operation.For business 1, MQ servers can give the server dispatch messages of all monitorings, the clothes of monitoring
It is all identical that business device receives message；For business 2, server is arranging several set time points daily, is going to searching data storehouse,
The data (task data) that the satisfaction for finding is required, task can all be processed, and after having processed task, server is by state write-back
Data base.The message data of pending task, for example, can obtain the message data of monitoring information queue server；Can also example
Such as, obtain the process task from backstage timing operation.The present invention is not limited.
In S104, the first data are synthesized according to message data.
Will above, the message for acquiring, through processing, synthesizes the data of predetermined format.Can for example, for the ease of with
Task afterwards is searched, or task orientation, and the data of predetermined format can include task current date, the business of task message
Title and timed task process time etc. message.The present invention is not limited.
In S106, using the first data as in the major key insertion database table of data base.
What is recorded in data base has several attributes, if wherein some set of properties energy unique mark per bar in record
One record, the set of properties can be just defined as a major key.Can be such as：Student's table, comprising：Student number, name, sex, class
Level.The student number of wherein each student is unique, and student number is exactly a major key.Can also be such as：User's table, comprising：It is user name, close
Code, login rank.Wherein user name is unique, and user name is exactly a major key.Major key is can determine that one in database table
The unique mark of record, such as, in table, a record includes identification card number, name, the age, wherein, only identification card number is
This people is can determine that uniquely, other may all have repetition, so, identification card number is the major key of this table.By what is above generated
First data, as the major key of tables of data, are inserted in the tables of data of data base.
In S108, according to the result in the first insertion of data into data storehouse, waiting task is processed.
As described above, when data base is set up, need to be that every table specifies a major key, so-called major key is exactly can
The attribute or set of properties of certain a line in enough unique mark tables, a table can only have a major key.Because major key can be with unique mark
Certain a line is recorded, it is possible to guarantee that it is not in the mistake fastened one person's story upon another person to perform when data update, delete.Major key except
Outside above-mentioned effect, usually referential integrity constraints are constituted with external key, prevent data inconsistent.So data base is in design
When, major key serves critically important effect.Due to the nonrepeatability of major key, when the first data are inserted in data base
Wait, can for example, comprising two kinds of results：Can be inserted into or not can be inserted into, the server for inserting major key can be inserted according to both the above
As a result, complete follow-up task to process.
Method for peer-to-peer architecture equalization server of the invention can solve the problem that business in F5 load balancing frameworks
The not reciprocity problem of server
It will be clearly understood that the present disclosure describe how being formed and using particular example, but the principle of the present invention to be not limited to
Any details of these examples.Conversely, the teaching based on present disclosure, these principles can be applied to many other
Embodiment.
In a kind of exemplary embodiment of the disclosure, also include：Set up database table.A relation can be set up for example
Type database table, and specify, any service server can read and write this table.
In a kind of exemplary embodiment of the disclosure, the message data from waiting task is obtained, including：Obtain and
From the message data of Message Queuing server；And acquisition is from the message data of backstage timed task.
Fig. 2 is a kind of flow process of the method for peer-to-peer architecture equalization server for implementing to exemplify according to another exemplary
Figure.
As shown in Fig. 2 in S202, obtaining the ID of the message from Message Queuing server.
Service server can for example, monitoring information queue server, when receiving message, extracts Message Queuing server's message
ID.
In S204, judge whether the ID of message is empty.
If the ID of message is sky, jump procedure S206；If the ID of message is not sky, continue other follow-up behaviour
Make.
In S206, the ID of message is space-time, and by the content of message, encryption obtains the ID of message.
As described above, the effect of major key is the record of one data table of unique mark, it is impossible to have repetition, do not allow be
It is empty.If the ID of the message of server acquisition is space-time, server carries out message encryption according to message content, and after encrypting
Data as the message message id.
In a kind of exemplary embodiment of the disclosure, the ID of message is space-time, and by the content of message, encryption is disappeared
The ID of breath, including：The ID of message is obtained using md5 encryption.
Server carries out Message Digest Algorithm 5 (Message Digest Algorithm according to message content
MD5) encrypt, and using the data after encryption as the message new information ID.MD5 is computer safety field widely used
Hash function is planted, for guaranteeing that information transfer is completely consistent.It is that one of widely used hash algorithm of computer (is translated summary to calculate again
Method, hash algorithm), main flow programming language generally has MD5 and realizes.It is another fixed-length value by data (such as Chinese character) computing,
It is the basic principle of hash algorithm, MD5 algorithms have the characteristics that：Compressibility：The data of random length, the MD5 values for calculating are long
Degree is all fixed；Easily calculate：MD5 values are calculated from former data to be easy to；Anti- modification：Any changing is carried out to former data
Dynamic, even only changing 1 byte, resulting MD5 values have very big difference.Strong impact resistant：Known former data and its MD5 value,
Want that it is extremely difficult to find a data (i.e. data falsification) with identical MD5 values.Md5 encryption ensure that, as long as disappearing
Breath content is identical, encrypts the ID for obtaining also identical；This ensures that, even if the ID of Message Queuing server's message is space-time,
The new ID that all service server md5 encryptions are obtained, and identical.
In a kind of exemplary embodiment of the disclosure, the first data are synthesized according to message data, including：According to from disappearing
The message data of breath queue server synthesizes the first data with current date, pending task names.
Can for example, when receiving Message Queuing server's message, according to ID or the md5 encryption of Message Queuing server's message
ID, and current date, the Business Name of message synthesize the first data, and first data can be used as relational database master
Key, includes the Business Name of date and message in the first data, be easy to investigate problem use in the future.For example the first data can example
Such as it is：
“20160823_BusinessName_23e25c6b4c57445981c03e83aae0f198”。
In a kind of exemplary embodiment of the disclosure, the first data are synthesized according to message data, including：According to from rear
The message data of platform timed task synthesizes the first data with current date, pending task names.
Can for example, during the process of backstage timing operation, the execution date, time and task names information according to timed task closes
Into the first data, first data can be used as relational database major key, and the first data can be such as：
“2016-08-18_23:30_TaskName”。
In a kind of exemplary embodiment of the disclosure, data base is set up, including：Opening relationships type database table.Relation
Data base, the data base being built upon on the basis of relational model process number by means of the mathematical concepts such as algebra of sets and method
According to the data in storehouse.The various contacts between various entities and entity in real world are represented with relational model.Close
It is type data base, is made up of multiple relation database tables.The structure of each tables of data is identical.One table is by multiple fields
Constitute.May wherein there are multiple fields to be suitable as major key.
In a kind of exemplary embodiment of the disclosure, according to the result in the first insertion of data into data storehouse, process and wait to locate
Reason task, including：If the first insertion of data into data storehouse table is unsuccessful, waiting task is not processed.
Can for example, all service servers, before MQ message is processed or before execution backstage timing operation, first according to synthesis
Relational database major key, in relational database table insert one record, if it succeeds, process, otherwise abandon.
Fig. 3 is a kind of flow process of the method for peer-to-peer architecture equalization server for implementing to exemplify according to another exemplary
Figure.
As shown in figure 3, after service server starts, when receiving message data, first determining whether that whether message data be
Message Queuing server (MQ) message, if MQ message, then according to the information such as the ID of message, the master of compositive relation data base
Key.Wherein, if the ID of message is empty, need using MD5 algorithms, generate message id (this is not shown).If connect
The message for receiving is timed task message, then the information such as lift directly according to task, the major key of compositive relation data base.Closing
Into after major key, server is inserted into Major key in the table of public relational database, if inserted successfully, processes this
Business.If insertion is unsuccessful, it was demonstrated that in this task of process, the server does not do other process to existing other servers.If connect
The task message for receiving not is above two message, and server is normally carried out task process.
According to other embodiments, the method and server for peer-to-peer architecture equalization server of the present invention can will be more
Keep business equity between platform service server, any one or partial service server are delayed machine, nor affect on business
Process.
It will be appreciated by those skilled in the art that realizing that all or part of step of above-described embodiment is implemented as being performed by CPU
Computer program.When the computer program is performed by CPU, the above-mentioned work(limited by the said method of present invention offer is performed
Energy.Described program can be stored in a kind of computer-readable recording medium, and the storage medium can be read only memory, magnetic
Disk or CD etc..
Further, it should be noted that above-mentioned accompanying drawing is only the place included by method according to an exemplary embodiment of the present invention
That what is managed schematically illustrates, rather than limits purpose.It can be readily appreciated that above-mentioned process shown in the drawings is not intended that or limits at these
The time sequencing of reason.In addition, being also easy to understand, these process for example either synchronously or asynchronously can be performed in multiple modules.
It is following for apparatus of the present invention embodiment, can be used for performing the inventive method embodiment.For apparatus of the present invention reality
The details not disclosed in applying example, refer to the inventive method embodiment.
Fig. 4 is a kind of block diagram of the system of the server according to an exemplary embodiment.Server as shown in Figure 4
In 40, including：Acquisition module 402, Data Synthesis module 404, major key insertion module 406, task processing module 408, data base
Table module 410.
Acquisition module 402 is used to obtain the message data from waiting task.
Data Synthesis module 404 is for according to message data the first data of synthesis.
Major key inserts module 406 and inserts the first data as the major key of data base in database table.
Task processing module 408 processes waiting task according to the result in the first insertion of data into data storehouse table.
Database table module 410 sets up database table.
It will be appreciated by those skilled in the art that above-mentioned each module can be distributed in device according to the description of embodiment, also may be used
To carry out in one or more devices of respective change uniquely different from the present embodiment.The module of above-described embodiment can be merged into
One module, it is also possible to be further split into multiple submodule.
The description of the embodiment by more than, those skilled in the art is it can be readily appreciated that example embodiment described herein
Can be realized by software, it is also possible to realize by way of software is with reference to necessary hardware.Therefore, according to present invention enforcement
The technical scheme of example can be embodied in the form of software product, and the software product can be stored in a non-volatile memories
In medium (can be CD-ROM, USB flash disk, portable hard drive etc.) or on network, including some instructions so that a computing device (can
Being personal computer, server, mobile terminal or network equipment etc.) perform method according to embodiments of the present invention.
Detailed description by more than, those skilled in the art is it can be readily appreciated that according to embodiments of the present invention for right
Deng the method and server of framework equalization server, have one or more of the following advantages.
According to some embodiments, the method and server for peer-to-peer architecture equalization server of the present invention can solve the problem that F5
The not reciprocity problem of service server in load balancing framework.
According to other embodiments, the method and server for peer-to-peer architecture equalization server of the present invention can will be more
Keep business equity between platform service server, any one or partial service server are delayed machine, nor affect on business
Process.
The exemplary embodiment of the present invention is particularly shown and described more than.It should be appreciated that the invention is not restricted to
Detailed construction described herein, set-up mode or implementation method；On the contrary, it is intended to cover be included in claims
Various modifications and equivalence setting in spirit and scope.
Additionally, structure, ratio, size shown by this specification Figure of description etc., only to coordinate description institute
Disclosure, for skilled in the art realises that with reading, be not limited to the enforceable qualificationss of the disclosure, therefore
Do not have technical essential meaning, the modification of any structure, the change of proportionate relationship or the adjustment of size are not affecting the disclosure
Under the technique effect that can be generated and achieved purpose, still all should fall obtain and can cover in the technology contents disclosed in the disclosure
In the range of.Meanwhile, in this specification it is cited such as " on ", " first ", the term of " second " and " " etc., be also only and be easy to
Narration understands, and be not used to limit the disclosure enforceable scope, and its relativeness is altered or modified, without substantive change
Under technology contents, when being also considered as enforceable category of the invention.
Claims (11)
1. a kind of method for peer-to-peer architecture equalization server, it is characterised in that include：
Obtain the message data from waiting task；
First data are synthesized according to the message data；
Using first data as in the major key insertion database table of data base；And
According to the result in the first insertion of data into data storehouse, the waiting task is processed.
2. the method for claim 1, it is characterised in that also include：
Set up the database table.
3. the method for claim 1, it is characterised in that obtain the message data from waiting task, including：
Obtain the message data from Message Queuing server；And
Obtain the message data from backstage timed task.
4. method as claimed in claim 3, it is characterised in that obtain the message data from Message Queuing server,
Including：
Obtain the ID of the message from the Message Queuing server；
Judge whether the ID of the message is empty；And
The ID of the message is space-time, and by the content of the message, encryption obtains the ID of the message.
5. method as claimed in claim 4, it is characterised in that the ID of the message is space-time, by the content of the message,
Encryption obtains the ID of the message, including：
The ID of the message is obtained using md5 encryption.
6. the method as described in claim 1 or 3, it is characterised in that the first data are synthesized according to the message data, including：
According to the message data from Message Queuing server and current date, the pending task names synthesis institute
State the first data.
7. the method as described in claim 1 or 3, it is characterised in that the first data are synthesized according to the message data, including：
According to the message data from backstage timed task is with current date, the pending task names synthesis
First data.
8. method as claimed in claim 2, it is characterised in that set up the database table, including：
Opening relationships type database table.
9. the method for claim 1, it is characterised in that according to the result in the first insertion of data into data storehouse, place
The waiting task is managed, including：
If the first insertion of data into data storehouse table is unsuccessful, the waiting task is not processed.
10. a kind of server, it is characterised in that include：
Acquisition module, for obtaining the message data from waiting task；
Data Synthesis module, for synthesizing the first data according to the message data；
Major key inserts module, using first data as in the major key insertion database table of data base；And
Task processing module, according to the result in the first insertion of data into data storehouse table, processes the waiting task.
11. servers as claimed in claim 10, it is characterised in that also include：
Database table module, sets up the database table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611040886.8A CN106547626B (en) | 2016-11-23 | 2016-11-23 | Method for balancing server in peer-to-peer architecture and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611040886.8A CN106547626B (en) | 2016-11-23 | 2016-11-23 | Method for balancing server in peer-to-peer architecture and server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106547626A true CN106547626A (en) | 2017-03-29 |
| CN106547626B CN106547626B (en) | 2020-04-07 |
Family
ID=58394706
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611040886.8A Active CN106547626B (en) | 2016-11-23 | 2016-11-23 | Method for balancing server in peer-to-peer architecture and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106547626B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109063070A (en) * | 2018-07-23 | 2018-12-21 | 郑州云海信息技术有限公司 | A kind of operating method and database server of database |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007144568A1 (en) * | 2006-06-13 | 2007-12-21 | British Telecommunications Public Limited Company | Peer to peer reporting system on reputation of quality for service |
| CN101467406B (en) * | 2006-09-27 | 2011-11-23 | 中兴通讯股份有限公司 | System and method for processing multimedia information timing task |
| CN105426442A (en) * | 2015-11-06 | 2016-03-23 | 努比亚技术有限公司 | Distributed database based message data management method and system |
-
2016
- 2016-11-23 CN CN201611040886.8A patent/CN106547626B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007144568A1 (en) * | 2006-06-13 | 2007-12-21 | British Telecommunications Public Limited Company | Peer to peer reporting system on reputation of quality for service |
| CN101467406B (en) * | 2006-09-27 | 2011-11-23 | 中兴通讯股份有限公司 | System and method for processing multimedia information timing task |
| CN105426442A (en) * | 2015-11-06 | 2016-03-23 | 努比亚技术有限公司 | Distributed database based message data management method and system |
Non-Patent Citations (1)
| Title |
|---|
| 王雪莲: "LVS集群负载调度机制的研究", 《中国科技信息》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109063070A (en) * | 2018-07-23 | 2018-12-21 | 郑州云海信息技术有限公司 | A kind of operating method and database server of database |
| CN109063070B (en) * | 2018-07-23 | 2022-03-25 | 郑州云海信息技术有限公司 | Database operation method and database server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106547626B (en) | 2020-04-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20230126005A1 (en) | Consistent filtering of machine learning data | |
| US10366053B1 (en) | Consistent randomized record-level splitting of machine learning data | |
| US11100420B2 (en) | Input processing for machine learning | |
| CN111344706A (en) | Optimization of high volume transaction performance over blockchains | |
| US20130138636A1 (en) | Image Searching | |
| CN110765272B (en) | Knowledge graph-based signing method and device, computer equipment and computer storage medium | |
| TW200845657A (en) | Techniques for a web services data access layer | |
| US10360394B2 (en) | System and method for creating, tracking, and maintaining big data use cases | |
| WO2022174491A1 (en) | Artificial intelligence-based method and apparatus for medical record quality control, computer device, and storage medium | |
| US11681719B2 (en) | Efficient access of chainable records | |
| CN112613917A (en) | Information pushing method, device and equipment based on user portrait and storage medium | |
| WO2022105119A1 (en) | Training corpus generation method for intention recognition model, and related device thereof | |
| CN115668194A (en) | Cross-partition calls in a partition's tamper-resistant data store | |
| CN111026858A (en) | Project information processing method and device based on project recommendation model | |
| CN110597946A (en) | Case storage method, device, equipment and storage medium | |
| US11797617B2 (en) | Method and apparatus for collecting information regarding dark web | |
| WO2022267769A1 (en) | Method and apparatus for generating graph data | |
| US20140244641A1 (en) | Holistic customer record linkage via profile fingerprints | |
| CN111476595A (en) | Product pushing method and device, computer equipment and storage medium | |
| CN111159040A (en) | Test data generation method, device, equipment and storage medium | |
| CN114070847A (en) | Current limiting method, device, equipment and storage medium of server | |
| CN106547626A (en) | For the method and server of peer-to-peer architecture equalization server | |
| CN114422586B (en) | Event notification method, event notification device, computer equipment and storage medium | |
| US9378230B1 (en) | Ensuring availability of data in a set being uncorrelated over time | |
| CN115481026A (en) | Test case generation method and device, computer equipment and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |