CN106547626B

CN106547626B - Method for balancing server in peer-to-peer architecture and server

Info

Publication number: CN106547626B
Application number: CN201611040886.8A
Authority: CN
Inventors: 张志祥; 王雪莲
Original assignee: Taikang Insurance Group Co Ltd
Current assignee: Taikang Insurance Group Co Ltd
Priority date: 2016-11-23
Filing date: 2016-11-23
Publication date: 2020-04-07
Anticipated expiration: 2036-11-23
Also published as: CN106547626A

Abstract

The application discloses a method for balancing a server by a peer-to-peer architecture and the server. A method for a peer-to-peer architecture balancing server, comprising: acquiring message data from a task to be processed; synthesizing first data according to the message data; inserting the first data into a database table as a primary key of the database; and processing the task to be processed according to the result of the first data inserted into the database. The method for balancing the servers through the peer-to-peer architecture can well solve the problem that when a plurality of servers work simultaneously, services are not peer to peer.

Description

Method for balancing server in peer-to-peer architecture and server

Technical Field

The invention relates to the field of server resource allocation, in particular to a method for balancing a server by a peer-to-peer architecture and the server.

Background

Most servers need to work continuously, and as the system grows, more and more servers need to work cooperatively to complete tasks. Taking the care management system as an example, the care management system mainly provides long-term care related information services for the senior citizens in the high-end aged-care community. The long-term care service of the long person is required to be special, the long person needs to be provided with 7-24-hour uninterrupted service, and the operation of the care management system is also required to be 7-24-hour uninterrupted work. In order to meet the requirement, the care management system adopts an F5 balanced loader architecture, two service servers are arranged below an F5 balanced loader, and an F5 balanced loader can well distribute service processing requests to the two servers according to the operating conditions of the two servers. Therefore, when any one service server is down or busy to process, the service can be handed over by the other service server, and the service cannot be interrupted.

Normally, the architecture has solved most of the problems, but the nursing management system has two special services: 1. and monitoring a message queue server (MQ server), and 2, processing a background timing job. The two types of services only need to have one machine to process, otherwise, the services are processed repeatedly, and the service processing system is disordered. For the processing of these two types of services, the existing solutions are: one of the servers is set as a master server, and the other server is set as a slave server, so that only the master server can process the two types of services. The defect of the scheme is that the two service servers are not equivalent, and when the main server is down, the service is seriously influenced.

Therefore, a new method for balancing a server in a peer-to-peer architecture and a server are needed.

The above information disclosed in this background section is only for enhancement of understanding of the background of the invention and therefore it may contain information that does not constitute prior art that is already known to a person of ordinary skill in the art.

Disclosure of Invention

In view of this, the present invention provides a method for balancing servers in a peer-to-peer architecture and a server, which can solve the problem that service servers in an F5 load balancing architecture are not peer-to-peer.

Additional features and advantages of the invention will be set forth in the detailed description which follows, or may be learned by practice of the invention.

According to an aspect of the present invention, there is provided a method for a peer-to-peer architecture balancing server, comprising:

acquiring message data from a task to be processed;

synthesizing first data according to the message data;

inserting the first data into a database table as a primary key of the database; and

and processing the task to be processed according to the result of the first data inserted into the database.

In an exemplary embodiment of the present disclosure, further comprising:

a database table is established.

In an exemplary embodiment of the present disclosure, acquiring message data from a task to be processed includes:

acquiring message data from a message queue server; and

message data from a background timing task is acquired.

In an exemplary embodiment of the present disclosure, acquiring message data from a message queue server includes:

extracting an ID of a message from a message queue server;

judging whether the ID of the message is empty; and

when the ID of the message is empty, the ID of the message is obtained by encrypting the content of the message.

In an exemplary embodiment of the present disclosure, when the ID of the message is empty, the encrypting obtains the ID of the message through the content of the message, including:

the ID of the message is obtained by means of MD5 encryption.

In an exemplary embodiment of the present disclosure, synthesizing first data from message data includes:

and synthesizing first data according to the message data from the message queue server, the current date and the name of the task to be processed.

and synthesizing first data according to the message data from the background timing task, the current date and the name of the task to be processed.

In an exemplary embodiment of the present disclosure, building a database includes:

a relational database table is established.

In an exemplary embodiment of the present disclosure, processing a task to be processed according to a result of the first data insertion into the database includes:

if the first data insertion into the database table is unsuccessful, the pending task is not processed.

According to an aspect of the present invention, there is provided a server including:

the acquisition module is used for acquiring message data from the task to be processed;

the data synthesis module is used for synthesizing first data according to the message data;

the primary key insertion module is used for inserting the first data serving as a primary key of the database into the database table; and

and the task processing module is used for processing the task to be processed according to the result of the first data inserted into the database table.

In an exemplary embodiment of the present disclosure, further comprising:

and the database table module is used for establishing a database table.

The method for balancing the server in the peer-to-peer architecture and the server can solve the problem that the service servers in the F5 load balancing architecture are not peer to each other.

According to other embodiments, the method for balancing servers in peer-to-peer architecture and the server of the present invention can keep the services among a plurality of service servers peer to peer, and any one or some service servers are down, without affecting the processing of the services to be processed.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.

Drawings

The above and other objects, features and advantages of the present invention will become more apparent by describing in detail exemplary embodiments thereof with reference to the attached drawings. The drawings described below are only some embodiments of the invention and other drawings may be derived by those skilled in the art without inventive step.

Fig. 1 is a flow chart illustrating a method for a peer-to-peer architecture balancing server in accordance with an exemplary embodiment.

Fig. 2 is a flow chart illustrating a method for a peer-to-peer architecture balancing server in accordance with another exemplary embodiment.

Fig. 3 is a flow chart illustrating a method for a peer-to-peer architecture balancing server in accordance with another exemplary embodiment.

FIG. 4 is a block diagram illustrating a system of servers in accordance with an exemplary embodiment.

DETAILED DESCRIPTION OF EMBODIMENT (S) OF INVENTION

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The same reference numerals denote the same or similar parts in the drawings, and thus, a repetitive description thereof will be omitted.

Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention may be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known methods, devices, implementations or operations have not been shown or described in detail to avoid obscuring aspects of the invention.

The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.

The flow charts shown in the drawings are merely illustrative and do not necessarily include all of the contents and operations/steps, nor do they necessarily have to be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.

It will be understood that, although the terms first, second, third, etc. may be used herein to describe various components, these components should not be limited by these terms. These terms are used to distinguish one element from another. Thus, a first component discussed below may be termed a second component without departing from the teachings of the disclosed concept. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.

It will be appreciated by those skilled in the art that the drawings are merely schematic representations of exemplary embodiments, and that the blocks or flow charts in the drawings are not necessarily required to practice the present invention and are, therefore, not intended to limit the scope of the present invention.

As shown in fig. 1, in S102, message data from a task to be processed is acquired.

Acquiring message data from a task to be processed, taking the care management system described above as an example, the care management system has two types of special services: 1. monitoring a message queue server (MQ server), and receiving and processing if a message exists; 2. and processing a background timing job. For the service 1, the MQ server distributes messages to all the monitored servers, and the messages received by the monitored servers are the same; for the service 2, the server arranges a plurality of fixed time points every day to search the database, the tasks of the found data (task data) meeting the requirements are processed, and after the tasks are processed, the server writes the state back to the database. The message data of the task to be processed may, for example, be obtained from a listening message queue server; processing tasks from background timed jobs may also be acquired, for example. The invention is not limited thereto.

In S104, the first data is synthesized from the message data.

And processing the acquired message to synthesize data in a preset format. The data in the predetermined format may include, for example, a current date of the task, a business name of the task message, and a processing time of the timed task, for facilitating future task search, or task location. The invention is not limited thereto.

In S106, the first data is inserted into a database table as a primary key of the database.

Each record in the database has several attributes, and if one attribute group can uniquely identify one record, the attribute group can be defined as a main key. Can be for example: a student watch, comprising: school number, name, gender, class. The number of each student is unique, and the number of each student is a main key. It is also possible, for example: a user table, comprising: username, password, login level. The user name is unique, and the user name is a primary key. The primary key is a unique identifier that can determine a record in the database table, for example, in the table, a record includes an identification number, a name, and an age, wherein only the identification number is unique to determine the person, and others may be duplicated, so the identification number is the primary key of the table. And inserting the first data generated in the previous step into a data table of the database as a primary key of the data table.

In S108, the task to be processed is processed according to the result of the first data insertion into the database.

As described above, when building a database, each table needs to be assigned a primary key, i.e. an attribute or attribute group that can uniquely identify a row in the table, and a table only has one primary key. Because the primary key can uniquely identify a certain row of records, the error of putting on the piece of baggage can be avoided when data updating and deleting are carried out. In addition to the above-described effects, the primary key often forms referential integrity constraints with the foreign key to prevent data inconsistencies. The primary key plays an important role in the design of the database. Due to the non-repeatability of the primary key, when the first data is inserted into the database, two results may be included, for example: the server inserted with the primary key can complete the subsequent task processing according to the two insertion results.

The method for the peer-to-peer architecture balancing server can solve the problem that the service servers in the F5 load balancing architecture are not peer to each other

It should be clearly understood that the present disclosure describes how to make and use particular examples, but the principles of the present disclosure are not limited to any details of these examples. Rather, these principles can be applied to many other embodiments based on the teachings of the present disclosure.

In an exemplary embodiment of the present disclosure, further comprising: a database table is established. A relational database table may be created, for example, and it is specified that any one of the business servers can read and write the table.

In an exemplary embodiment of the present disclosure, acquiring message data from a task to be processed includes: acquiring message data from a message queue server; and acquiring message data from the background timing task.

As shown in fig. 2, in S202, the ID of the message from the message queue server is acquired.

The service server may, for example, listen to the message queue server and, upon receipt of the message, extract the ID of the message queue server message.

In S204, it is determined whether the ID of the message is empty.

If the ID of the message is null, jumping to step S206; if the ID of the message is not null, the subsequent other operations are continued.

In S206, when the ID of the message is null, the ID of the message is obtained by encrypting the content of the message.

As described above, the primary key serves to uniquely identify a record of a data table, cannot be duplicated, and is not allowed to be empty. And if the ID of the message obtained by the server is empty, the server encrypts the message according to the message content and takes the encrypted data as the message ID of the message.

In an exemplary embodiment of the present disclosure, when the ID of the message is empty, the encrypting obtains the ID of the message through the content of the message, including: the ID of the message is obtained by means of MD5 encryption.

The server encrypts the Message Digest algorithm fifth version (Message Digest AlgorithmMD5) according to the Message content, and takes the encrypted data as the new Message ID of the Message. MD5 is a hash function widely used in the field of computer security to ensure that information is transmitted in a complete and consistent manner. Is one of the hash algorithms (also known as digest algorithm and hash algorithm) widely used by computers, and the mainstream programming language is generally realized by MD 5. The operation of data (such as Chinese characters) into another fixed length value is the basic principle of the hash algorithm, and the MD5 algorithm has the following characteristics: compressibility: for data with any length, the calculated MD5 value length is fixed; easy to calculate: the MD5 value is easy to calculate from the original data; resistance to modification: any change to the original data, even if only 1 byte is modified, can result in a great difference in the value of MD 5. Strong collision resistance: knowing the original data and its MD5 value, it is very difficult to find a data with the same MD5 value (i.e., counterfeit data). The MD5 encryption can ensure that as long as the message content is the same, the ID obtained by encryption is also the same; this ensures that the new ID encrypted by all the service servers MD5 is the same even if the ID of the message queue server message is empty.

In an exemplary embodiment of the present disclosure, synthesizing first data from message data includes: and synthesizing first data according to the message data from the message queue server, the current date and the name of the task to be processed.

For example, when a message queue server message is received, first data is synthesized according to the ID of the message queue server message or the ID encrypted by the MD5, the current date and the service name of the message, the first data can be used as a main key of a relational database, and the date and the service name of the message are contained in the first data, so that the problem investigation at a later date is facilitated. For example, the first data may be, for example:

“20160823_BusinessName_23e25c6b4c57445981c03e83aae0f198”。

in an exemplary embodiment of the present disclosure, synthesizing first data from message data includes: and synthesizing first data according to the message data from the background timing task, the current date and the name of the task to be processed.

For example, when a background timed job is processed, first data is synthesized according to the execution date, time and task name information of the timed task, the first data can be used as a primary key of a relational database, and the first data can be, for example:

“2016-08-18_23:30_TaskName”。

in an exemplary embodiment of the present disclosure, building a database includes: a relational database table is established. The relational database is a database established on the basis of a relational model, and data in the database is processed by means of mathematical concepts and methods such as set algebra and the like. Various entities in the real world and various connections between entities are represented by relational models. The relational database is composed of a plurality of relational database tables. The structure of each data table is the same. A table is composed of a plurality of fields. Where there may be multiple fields that are suitable as primary keys.

In an exemplary embodiment of the present disclosure, processing a task to be processed according to a result of the first data insertion into the database includes: if the first data insertion into the database table is unsuccessful, the pending task is not processed.

For example, all the service servers insert a record in the relational database table according to the synthesized relational database primary key before processing the MQ message or executing the background timing operation, and if the record is successfully processed, the record is processed, otherwise the record is abandoned.

As shown in fig. 3, after the service server is started, when receiving the message data, it first determines whether the message data is a message queue server (MQ) message, and if the message data is an MQ message, synthesizes the primary key of the relational database according to the information such as the ID of the message. If the ID of the message is empty, the message ID needs to be generated by using the MD5 algorithm (not shown in this figure). If the received message is a timing task message, the primary key of the relational database is synthesized directly according to information such as lifting of the task and the like. After synthesizing the primary key, the server inserts the primary key value into a table of a common relational database, and if the insertion is successful, the task is processed. If the insertion is unsuccessful, it is verified that other servers are already processing the task and the server does not do other processing. And if the received task message is not the two messages, the server normally processes the task.

According to other embodiments, the method for balancing the servers in the peer-to-peer architecture and the servers can keep the service peer among a plurality of service servers, any one or part of the service servers are down, and the processing of the service is not influenced.

Those skilled in the art will appreciate that all or part of the steps implementing the above embodiments are implemented as computer programs executed by a CPU. The computer program, when executed by the CPU, performs the functions defined by the method provided by the present invention. The program may be stored in a computer readable storage medium, which may be a read-only memory, a magnetic or optical disk, or the like.

Furthermore, it should be noted that the above-mentioned figures are only schematic illustrations of the processes involved in the method according to exemplary embodiments of the invention, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.

The following are embodiments of the apparatus of the present invention that may be used to perform embodiments of the method of the present invention. For details which are not disclosed in the embodiments of the apparatus of the present invention, reference is made to the embodiments of the method of the present invention.

FIG. 4 is a block diagram illustrating a system of servers in accordance with an exemplary embodiment. The server 40 shown in fig. 4 includes: the system comprises an acquisition module 402, a data synthesis module 404, a primary key insertion module 406, a task processing module 408 and a database table module 410.

The obtaining module 402 is configured to obtain message data from a task to be processed.

The data synthesis module 404 is configured to synthesize the first data according to the message data.

Primary key insertion module 406 inserts the first data into a database table as a primary key of the database.

The task processing module 408 processes the task to be processed according to the result of the first data insertion into the database table.

The database table module 410 builds database tables.

Those skilled in the art will appreciate that the modules described above may be distributed in the apparatus according to the description of the embodiments, or may be modified accordingly in one or more apparatuses unique from the embodiments. The modules of the above embodiments may be combined into one module, or further split into multiple sub-modules.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiment of the present invention can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the embodiment of the present invention.

Those skilled in the art will readily appreciate from the foregoing detailed description that the method for balancing servers in a peer-to-peer architecture and the server according to embodiments of the present invention have one or more of the following advantages.

According to some embodiments, the method and the server for the peer-to-peer architecture balancing server can solve the problem that the service servers in the F5 load balancing architecture are not peer-to-peer.

Exemplary embodiments of the present invention are specifically illustrated and described above. It is to be understood that the invention is not limited to the precise construction, arrangements, or instrumentalities described herein; on the contrary, the invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

In addition, the structures, the proportions, the sizes, and the like shown in the drawings of the present specification are only used for matching with the contents disclosed in the specification, so as to be understood and read by those skilled in the art, and are not used for limiting the limit conditions which the present disclosure can implement, so that the present disclosure has no technical essence, and any modification of the structures, the change of the proportion relation, or the adjustment of the sizes, should still fall within the scope which the technical contents disclosed in the present disclosure can cover without affecting the technical effects which the present disclosure can produce and the purposes which can be achieved. In addition, the terms "above", "first", "second" and "first" used in the present specification are for the sake of clarity only, and are not intended to limit the scope of the present disclosure, and changes or adjustments of the relative relationship thereof may be considered as the scope of the present invention without substantial changes in the technical content.

Claims

1. A method for a peer-to-peer architecture balancing server, comprising:

monitoring a message queue server and a timing task database to obtain message data from a task to be processed; wherein the message data comprises: the message data from a message queue server, and the message data from a background timing task;

acquiring the ID of the message from the message queue server to judge whether the ID of the message is empty; when the ID of the message is empty, the ID of the message is obtained by encrypting the content of the message;

identifying the message type of the message data as a message queue server message or a timed task server message, and synthesizing first data according to the message data based on a preset rule corresponding to the message type;

and acquiring a result of the first data inserted into the database, and processing the task to be processed when the first data is successfully inserted.

2. The method of claim 1, further comprising:

and establishing the database table.

3. The method of claim 1, wherein the ID of the message is obtained by encrypting the content of the message when the ID of the message is empty, and the method comprises:

the ID of the message is encrypted using MD 5.

4. The method of claim 1, wherein synthesizing first data from the message data comprises:

and synthesizing the first data according to the message data from the message queue server, the current date and the task name to be processed.

5. The method of claim 1, wherein synthesizing first data from the message data comprises:

and synthesizing the first data according to the message data from the background timing task, the current date and the task name to be processed.

6. The method of claim 2, wherein building the database table comprises:

a relational database table is established.

7. The method of claim 1, wherein processing the task to be processed based on a result of the first data insertion into the database comprises:

and if the first data is unsuccessfully inserted into the database table, not processing the task to be processed.

8. A server, comprising:

the acquisition module is used for monitoring the message queue server and the timing task database so as to acquire message data from the task to be processed; wherein the message data comprises: the message data from a message queue server, and the message data from a background timing task; acquiring the ID of the message from the message queue server to judge whether the ID of the message is empty; when the ID of the message is empty, the ID of the message is obtained by encrypting the content of the message;

the data synthesis module is used for identifying the message type of the message data as a message queue server message or a timed task server message, and synthesizing first data according to the message data based on a preset rule corresponding to the message type;

the primary key insertion module is used for inserting the first data serving as a primary key of the database into a database table; and

and the task processing module is used for acquiring a result of the first data inserted into the database table and processing the task to be processed when the first data is successfully inserted.

9. The server of claim 8, further comprising:

and the database table module is used for establishing the database table.