CN109101337A - A kind of server node upgrade method and electronic equipment based on HAProxy - Google Patents
A kind of server node upgrade method and electronic equipment based on HAProxy Download PDFInfo
- Publication number
- CN109101337A CN109101337A CN201810813266.6A CN201810813266A CN109101337A CN 109101337 A CN109101337 A CN 109101337A CN 201810813266 A CN201810813266 A CN 201810813266A CN 109101337 A CN109101337 A CN 109101337A
- Authority
- CN
- China
- Prior art keywords
- server node
- stickiness
- record
- server
- haproxy
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- 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
- G06F8/00—Arrangements for software engineering
- G06F8/60—Software deployment
- G06F8/65—Updates
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- Stored Programmes (AREA)
Abstract
The disclosure provides a kind of server node upgrade method and electronic equipment based on HAProxy, and when method includes: that user accesses application system, user's request is assigned to first server node by HAProxy；The first server node is arranged the first stickiness and records, and the first stickiness transcript is sent to conversation server, the copy is saved as the 2nd stickiness record by the conversation server, wherein, the first stickiness record and the 2nd stickiness record indicate that subsequent user's request is assigned in the first server node；When the first server node is upgraded, user request is re-assigned to second server node；The second server node inquires the 2nd stickiness record to conversation server, fetches and save as the 3rd stickiness record, and the 3rd stickiness record indicates that subsequent user's request is assigned in the second server node.
Description
Technical field
This disclosure relates to Internet technical field, and in particular, to a kind of server node upgrading side based on HAProxy
Method and electronic equipment.
Background technique
With the continuous development of Internet technology, to meet increasingly complicated application demand, the system page is mainly presented
For interactivity dynamic page form, it is followed by that requirement of the dynamic website to server running environment is constantly promoted,
In most of enterprise-level application, client is frequently necessary to repeatedly interact with server could complete an issued transaction, due to
These interactions and the identity of user are closely related, and therefore, application request relevant to this client generally requires to be forwarded to one
Platform server is completed, and cannot be supported equilibrium and be forwarded on different server and be handled.When system is updated, if
It shuts down and updates, user needs to wait, if be forwarded on other servers, user information will lose.In order to realize service
The smooth upgrade of system in device, it would be desirable to which configuration session keeps mechanism in load balancing, to ensure client and server
Between interaction problem will not occur because load balancing is deployed.HAProxy provides three kinds of session hold modes: source
Location hash, setting cookie and session sticky table stick table.Stick table is that one of HAProxy is very outstanding
Characteristic, what this table the inside stored is stickiness record, and it is corresponding that stickiness has recorded client and server 1:1
Adduction relationship.By this relationship, the request of client can be directed to the back-end services serviced before for it by HAProxy
On device, the function of session holding is realized.
Summary of the invention
In view of the above problems, the server node upgrade method and electronics that present disclose provides a kind of based on HAProxy are set
It is standby, smooth upgrade is unable to application system in settlement server, client is caused to need to wait for the letter at update or the end lost customer
Breath.
The disclosure provides a kind of server node upgrade method based on HAProxy, wherein application system is distributed in multiple
In server node, when method includes: that user accesses application system, user's request is assigned to first server section by HAProxy
Point；The first server node is arranged the first stickiness and records, and the first stickiness transcript is sent out
It send to conversation server, which saves as the 2nd stickiness for the copy and record, wherein this first
Stickiness record and the 2nd stickiness record indicate that subsequent user's request is assigned to the first server section
Point in；When the first server node is upgraded, user request is re-assigned to second server node；Described
Two server nodes inquire the 2nd stickiness record to conversation server, fetch and save as the 3rd stickiness
Record, the 3rd stickiness record indicate that subsequent user's request is assigned in the second server node.
Optionally, the first server node is arranged the first stickiness and records, and by the first stickiness
Transcript is sent to conversation server, which saves as the 2nd stickiness for the copy and record, also
If including: the user is to access the first server node for the first time, the first server node is user foundation
The first stickiness record is arranged in new stickiness record；If the user is not to access described for the first time
One server node, the first server node fetch what the conversation server stored from the conversation server
Stickiness record, and it is set as the first stickiness record.
Optionally, when session data needs to update, the first stickiness is changed in the first server node
Record, and the first stickiness transcript after change is sent to conversation server, conversation server saves it
The 2nd stickiness record be updated and save.
Optionally, the second server node inquires the 2nd stickiness record to conversation server, fetches
And save as the 3rd stickiness record, further includes: the conversation server records the 2nd stickiness and carries out
It modifies and saves；The second server node fetches modified 2nd stickiness record, and saves as third
Stickiness record.
Optionally, HAProxy has created stick table, which is stored with stickiness record pair
The statistic data answered, the statistic data indicate that the first server node and second server node are built with user
The state of vertical connection.
Optionally, the stick table further includes the user and the first server node and second server
The mapping relations of node.
Optionally, when the HAProxy updates, old HAProxy process can establish TCP with new HAProxy process
The stick table is pushed to the new HAProxy process by connection, the old HAProxy process.
The disclosure also provides a kind of electronic equipment of server node upgrading based on HAProxy, comprising: processor；It deposits
Reservoir is stored with computer executable program, and the program by the processor when being executed, so that the processor executes
The method for stating the server node upgrading based on HAProxy.
The disclosure also provides a kind of system of server node upgrading based on HAProxy, comprising: distribution module is used for
When user accesses application system, user's request is assigned to first server node by HAProxy, also, when first clothes
When business device node is upgraded, user request is re-assigned to second server node；Mould is arranged in first server node
Block is recorded for stickiness to be arranged for the first server node；Second server node setup module is used for as institute
Second server node setting stickiness is stated to record；Memory module, for storing described first in the conversation server
The stickiness transcript of server node and the setting of second server node.
The disclosure also provides a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that should
The method of the above-mentioned server node upgrading based on HAProxy is realized when program is executed by processor.
Detailed description of the invention
Fig. 1 diagrammatically illustrates the stream of the server node upgrade method based on HAProxy of embodiment of the present disclosure offer
Cheng Tu.
The electronics that Fig. 2 diagrammatically illustrates the server node upgrading based on HAProxy of embodiment of the present disclosure offer is set
Standby block diagram.
Fig. 3 diagrammatically illustrates the system of the server node upgrading based on HAProxy of embodiment of the present disclosure offer
Block diagram.
Specific embodiment
According in conjunction with attached drawing to the described in detail below of disclosure exemplary embodiment, other aspects, the advantage of the disclosure
Those skilled in the art will become obvious with prominent features.
In the disclosure, term " includes " and " containing " and its derivative mean including rather than limit；Term "or" is packet
Containing property, mean and/or.
In the present specification, following various embodiments for describing disclosure principle only illustrate, should not be with any
Mode is construed to limitation scope of disclosure.Referring to attached drawing the comprehensive understanding described below that is used to help by claim and its equivalent
The exemplary embodiment for the disclosure that object limits.Described below includes a variety of details to help to understand, but these details are answered
Think to be only exemplary.Therefore, it will be appreciated by those of ordinary skill in the art that without departing substantially from the scope of the present disclosure and spirit
In the case where, embodiment described herein can be made various changes and modifications.In addition, for clarity and brevity,
The description of known function and structure is omitted.In addition, running through attached drawing, same reference numbers are used for identity function and operation.
The server node upgrade method based on HAProxy that present disclose provides a kind of, in the present embodiment, this method packet
A conversation server and at least two server nodes are included, HAProxy has created stick table.In stick table
The mapping relations between client and server node are saved using the mode of key/value, key is the identifier of client,
The part string that source ip, cookie of client can be used and filter out from message, value are server nodes
Identifier, on the server node serviced before can directing the client to by key/value for it, realize most base
This viscosity, i.e. realization session keep function.In addition to this, each stickiness record of stick table extra storage
Corresponding statistic data, such as stickiness record establish how many and client connection, the average company of foundation at present
The speed that connects, the inflow and outflow data of how many byte, the quantity for establishing session etc..
Stick table can be replicated under " double master casts ", as long as setting opposite end HAProxy node,
Record being newly inserted into, just updating will be pushed on peer node by HAProxy by TCP connection, and viscosity record is avoided to lose
It loses.Also, when HAProxy updates, old HAProxy process can establish TCP connection with new HAProxy process, be safeguarded
Stick table is pushed to new process, and process new in this way, which will not lose viscosity information and other nodes, also can farthest protect
Synchronization is held, so that other nodes only need to push the stickiness record newly increased during the node updates and can protect completely
Hold synchronization.
Fig. 1 diagrammatically illustrates the stream of the server node upgrade method based on HAProxy of embodiment of the present disclosure offer
Cheng Tu.Below with reference to Fig. 1, the disclosure is done based on the server node upgrade method of HAProxy into one in conjunction with specific embodiments
Walk explanation.
As shown in Figure 1, method includes following operation:
S1, receives user Y request, and distributing user request to server node A is arranged stickiness record-Y (A).
In operation S1, when user accesses system, user's request is assigned to some server node by HAProxy, at this
Server node A is denoted as in embodiment, the system of user's access is distributed in server node A.
Further, server node A first checks for whether server node A preserves stickiness record-Y (A),
If server node A preserves stickiness record-Y (A), operation S2 is directly executed；If server node A does not have
Stickiness record-Y (A), server node A whether there is stickiness record-Y (n) to conversation server inquiry, such as
Fruit stickiness record-Y (n) exists, and n is revised as A, fetches server node A, and server node A is saved
Stickiness record-Y (A) then executes operation S2, and wherein stickiness record-Y (n) indicates that user Y distributes to service
Device node n, wherein n is some server node that can handle user Y request；If server node A does not have
Stickiness record-Y (A), and conversation server does not have stickiness record-Y (n), then may determine that user Y for the first time
Access system establishes new stickiness record-Y (A) on server node A for user Y, saves the related letter of user Y
Breath, and conversation server is sent by the copy of newly-established stickiness record-Y (A), then, execute operation S2.
S2, more new session, conversation server save stickiness record-Y (A1).
In operation S2, after user Y is distributed to server node A by conversation server, registered at conversation server end
It saves stickiness record-Y (A1), hereafter, all requests of user Y will all be assigned to server node A processing.
User Y continues access system, and the request submitted all is assigned to server node A processing, and system can be direct
Stickiness record-Y (A) is read from server node A to obtain the session information of user Y.
Further, if necessary to update session data, server node A directly changes the stickiness note of its preservation
The data of record-Y (A), and the copy of the stickiness record-Y (A) after change is sent to server node, server section
Point updates stickiness record-Y (A1) and saves, and makes stickiness record-Y (A1) and the server on conversation server
Stickiness record-Y (A) on node A is always consistent.
When S3, server node A update, stickiness record-Y is arranged in distributing user request to server node B
(B)。
In operation S3, when server node A is upgraded, user Y accesses system, the request that user Y is submitted at this time
It being reassigned to new server node processing, server node new in the present embodiment is designated as server node B,
The system of user's access is distributed in server node B.
Further, server node B first checks for whether server node B preserves stickiness record-Y (B),
If server node B preserves stickiness record-Y (B), do not have to again to conversation server inquiry stickiness note
Record-Y (n) whether there is；If server node B does not have a stickiness record-Y (B), server node B is to conversational services
Device inquiry stickiness record-Y (n) whether there is, and conversation server inquires after stickiness record-Y (A1) exists,
Stickiness record-Y (A1) is revised as stickiness record-Y (B1), and server node B is allowed to fetch, in server
Stickiness record-Y (B) is saved as in node B.
S4, conversation server are revised as stickiness record-Y (B1).
In operation S4, when server node A is upgraded, when user Y access system is assigned to server node B,
Stickiness record-the Y (A1) that conversation server can be saved is revised as stickiness record-Y (B1), and is protected
It deposits.
According to this operating process, user Y accesses system, and user's request is just transferred to server node B from server node A
On.
The another aspect of the embodiment of the present disclosure additionally provides a kind of electronics of server node upgrading based on HAProxy
Equipment, Fig. 2 diagrammatically illustrate the server node liter based on HAProxy that is adapted for carrying out the disclosure according to the embodiment of the present disclosure
The block diagram of the electronic equipment of grade.Fig. 2 shows electronic device block diagram be only an example, should not be to the function of the embodiment of the present disclosure
Any restrictions can be brought with use scope.
As shown in Fig. 2, electronic equipment 200 includes processor 210 and computer readable storage medium 220.The electronic equipment
200 can execute the method described above with reference to Fig. 1, to carry out Message Processing.
Specifically, processor 210 for example may include general purpose microprocessor, instruction set processor and/or related chip group
And/or special microprocessor (for example, specific integrated circuit (ASIC)), etc..Processor 210 can also include using for caching
The onboard storage device on way.Processor 310 can be for executing the method flow according to the embodiment of the present disclosure for referring to Fig. 1 description
Different movements single treatment units either multiple processing units.
Computer readable storage medium 220, such as can be times can include, store, transmitting, propagating or transmitting instruction
Meaning medium.For example, readable storage medium storing program for executing can include but is not limited to electricity, magnetic, optical, electromagnetic, infrared or semiconductor system, device,
Device or propagation medium.The specific example of readable storage medium storing program for executing includes: magnetic memory apparatus, such as tape or hard disk (HDD)；Optical storage
Device, such as CD (CD-ROM)；Memory, such as random access memory (RAM) or flash memory；And/or wire/wireless communication chain
Road.
Computer readable storage medium 220 may include computer program 221, which may include generation
Code/computer executable instructions retouch the execution of processor 210 for example above in conjunction with Fig. 1
The method flow stated and its any deformation.
Computer program 221 can be configured to have the computer program code for example including computer program module.Example
Such as, in the exemplary embodiment, the code in computer program 221 may include one or more program modules, for example including
221A, module 221B ....It should be noted that the division mode and number of module are not fixation, those skilled in the art can
To be combined according to the actual situation using suitable program module or program module, when these program modules are combined by processor 210
When execution, processor 210 is executed for example above in conjunction with method flow described in Fig. 1 and its any deformation.
Fig. 3 diagrammatically illustrates the frame of the system upgraded according to the embodiment of the present disclosure based on the server node of HAProxy
Figure.
As shown in figure 3, computer system 300 includes distribution module 310, first server node setup module 320, second
Server node setup module 330, memory module 340.The computer system 300 can execute the side described above with reference to Fig. 1
Method, to realize the communication between multiple electronic equipments.
Specifically, distribution module 310, for when user accesses application system, user's request to be assigned to the by HAProxy
One server node, also, when the first server node is upgraded, user request is re-assigned to the second clothes
Business device node.In the present embodiment, when user Y accesses system, user's request is assigned in server node A by distribution module；
When server node A is upgraded, user Y accesses system, and user's request is assigned in server node B by distribution module.
First server node setup module 320, for stickiness record-Y to be arranged in first server node
(A), in the present embodiment, first server node is server node A.When user Y accesses system for the first time, first server
Node setup module 320 is that user Y establishes new stickiness record-Y (A), saves user Y for information about；User Y is not
It is when accessing system for the first time, first server node setup module 320 inquires stickiness record-Y to conversation server
(n), n is revised as A, fetches server node A, saved stickiness record-Y (A).
Second server node setup module 330, for stickiness record-Y to be arranged in second server node
(B), in the present embodiment, second server node is server node B.When user's request is assigned to server node B, the
Two server node setup modules 320 inquire stickiness record-Y (A1) to conversation server, and A1 is revised as B1, is fetched
Server node B is saved stickiness record-Y (B).
Memory module 340, for storing the first server node and second server section in the conversation server
The stickiness transcript of point setting.In the present embodiment, for saving stickiness note in conversation server
Record-Y (A1) and stickiness record-Y (B1).
It is understood that distribution module 310, first server node setup module 320, second server node are arranged
Module 330, memory module 340, which may be incorporated in a module, to be realized or any one module therein can be split
At multiple modules.Alternatively, at least partly function of one or more modules in these modules can be with other modules at least
Partial function combines, and realizes in a module.According to an embodiment of the invention, distribution module 310, first server section
At least one of point setup module 320, second server node setup module 330, memory module 340 can be at least by parts
Ground is embodied as hardware circuit, such as field programmable gate array (FPGA), programmable logic array (PLA), system on chip, substrate
On system, the system in encapsulation, specific integrated circuit (ASIC), can with to circuit carry out it is integrated or encapsulate it is any its
The hardware such as his rational method or firmware realize, or with software, three kinds of implementations of hardware and firmware it is appropriately combined come
It realizes.Alternatively, distribution module 310, first server node setup module 320, second server node setup module 330, depositing
At least one of storage module 340 can at least be implemented partly as computer program module, when the program is transported by computer
When row, the function of corresponding module can be executed.
Flow chart and block diagram in attached drawing are illustrated according to the system of the various embodiments of the disclosure, method and computer journey
The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation
A part of one module, program segment or code of table, a part of above-mentioned module, program segment or code include one or more
Executable instruction for implementing the specified logical function.It should also be noted that in some implementations as replacements, institute in box
The function of mark can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are practical
On can be basically executed in parallel, they can also be executed in the opposite order sometimes, and this depends on the function involved.Also it wants
It is noted that the combination of each box in block diagram or flow chart and the box in block diagram or flow chart, can use and execute rule
The dedicated hardware based systems of fixed functions or operations is realized, or can use the group of specialized hardware and computer instruction
It closes to realize.
It will be understood by those skilled in the art that the feature recorded in each embodiment and/or claim of the disclosure can
To carry out multiple combinations or/or combination, even if such combination or combination are not expressly recited in the disclosure.Particularly, exist
In the case where not departing from disclosure spirit or teaching, the feature recorded in each embodiment and/or claim of the disclosure can
To carry out multiple combinations and/or combination.All these combinations and/or combination each fall within the scope of the present disclosure.
Although the disclosure, art technology has shown and described referring to the certain exemplary embodiments of the disclosure
Personnel it should be understood that in the case where the spirit and scope of the present disclosure limited without departing substantially from the following claims and their equivalents,
A variety of changes in form and details can be carried out to the disclosure.Therefore, the scope of the present disclosure should not necessarily be limited by above-described embodiment,
But should be not only determined by appended claims, also it is defined by the equivalent of appended claims.
Claims (10)
1. a kind of server node upgrade method based on HAProxy, wherein application system is distributed in multiple server nodes
In, method includes:
When user accesses application system, user's request is assigned to first server node by HAProxy；
The first server node is arranged the first stickiness and records, and the first stickiness transcript is sent out
It send to conversation server, which saves as the 2nd stickiness for the copy and record, wherein this first
Stickiness record and the 2nd stickiness record indicate that subsequent user's request is assigned to the first server section
Point in；
When the first server node is upgraded, user request is re-assigned to second server node；
The second server node inquires the 2nd stickiness record to conversation server, fetches and saves as third
Stickiness record, the 3rd stickiness record indicate that subsequent user's request is assigned to the second server
In node.
2. the server node upgrade method according to claim 1 based on HAProxy, wherein the first server
Node is arranged the first stickiness and records, and the first stickiness transcript is sent to conversation server, should
The copy is saved as the 2nd stickiness record by conversation server, further includes:
If the user is to access the first server node for the first time, the first server node is that the user establishes newly
Stickiness record, that is, the first stickiness record is set；
If the user is not to access the first server node for the first time, the first server node is from the conversational services
Device fetches the stickiness record of conversation server storage, and is set as the first stickiness record.
3. the server node upgrade method according to claim 1 based on HAProxy, wherein further include:
When session data needs to update, the first stickiness record is changed in the first server node, and will more
The first stickiness transcript after changing is sent to conversation server, conversation server it is saved second
Stickiness record is updated and saves.
4. the server node upgrade method according to claim 1 based on HAProxy, wherein the second server
Node inquires the 2nd stickiness record to conversation server, fetches and saves as the 3rd stickiness record, also
Include:
The conversation server is modified and is saved to the 2nd stickiness record；
The second server node fetches modified 2nd stickiness record, and saves as the 3rd stickiness note
Record.
5. the server node upgrade method according to claim 1 based on HAProxy, wherein HAProxy has been created
Stick table, the stick table are stored with stickiness and record corresponding statistic data, the statistic number
The state of connection is established according to the expression first server node and second server node and user.
6. the server node upgrade method according to claim 5 based on HAProxy, wherein the stick table
It further include the mapping relations of the user and the first server node and second server node.
7. the server node upgrade method according to claim 5 based on HAProxy, wherein further include: when described
When HAProxy updates, old HAProxy process can and new HAProxy process establish TCP connection, the old HAProxy into
The stick table is pushed to the new HAProxy process by journey.
8. a kind of electronic equipment of the server node upgrading based on HAProxy, comprising:
Processor；
Memory is stored with computer executable program, and the program by the processor when being executed, so that the processor
Execute the method such as the server node upgrading in claim 1-7 based on HAProxy.
9. a kind of system of the server node upgrading based on HAProxy, comprising:
Distribution module is used for when user accesses application system, and user's request is assigned to first server node by HAProxy,
Also, when the first server node is upgraded, user request is re-assigned to second server node；
First server node setup module is recorded for stickiness to be arranged for the first server node；
Second server node setup module is recorded for stickiness to be arranged for the second server node；
Memory module, for the conversation server store the first server node and second server node setting
Stickiness transcript.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the program is by processor
The method such as the server node upgrading in claim 1-7 based on HAProxy is realized when execution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810813266.6A CN109101337A (en) | 2018-07-23 | 2018-07-23 | A kind of server node upgrade method and electronic equipment based on HAProxy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810813266.6A CN109101337A (en) | 2018-07-23 | 2018-07-23 | A kind of server node upgrade method and electronic equipment based on HAProxy |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109101337A true CN109101337A (en) | 2018-12-28 |
Family
ID=64847296
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810813266.6A Pending CN109101337A (en) | 2018-07-23 | 2018-07-23 | A kind of server node upgrade method and electronic equipment based on HAProxy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109101337A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113973130A (en) * | 2021-11-19 | 2022-01-25 | 杭州安恒信息技术股份有限公司 | Smooth service publishing method based on haproxy and related device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030014480A1 (en) * | 2001-07-16 | 2003-01-16 | Sam Pullara | Method and apparatus for session replication and failover |
| CN101272389A (en) * | 2008-05-27 | 2008-09-24 | 华为技术有限公司 | CS communication method, system and device |
| CN101588390A (en) * | 2009-06-24 | 2009-11-25 | 杭州华三通信技术有限公司 | Improve the method and the load-balancing device of Collective qualification service system service viscosity |
| CN103004172A (en) * | 2012-09-14 | 2013-03-27 | 华为技术有限公司 | Information processing method and load balancing equipment |
| CN103457869A (en) * | 2013-08-28 | 2013-12-18 | 北京星网锐捷网络技术有限公司 | Conversation maintaining method and device |
| CN105338095A (en) * | 2015-11-17 | 2016-02-17 | 中国建设银行股份有限公司 | Conversation data processing method and device |
-
2018
- 2018-07-23 CN CN201810813266.6A patent/CN109101337A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030014480A1 (en) * | 2001-07-16 | 2003-01-16 | Sam Pullara | Method and apparatus for session replication and failover |
| CN101272389A (en) * | 2008-05-27 | 2008-09-24 | 华为技术有限公司 | CS communication method, system and device |
| CN101588390A (en) * | 2009-06-24 | 2009-11-25 | 杭州华三通信技术有限公司 | Improve the method and the load-balancing device of Collective qualification service system service viscosity |
| CN103004172A (en) * | 2012-09-14 | 2013-03-27 | 华为技术有限公司 | Information processing method and load balancing equipment |
| CN103457869A (en) * | 2013-08-28 | 2013-12-18 | 北京星网锐捷网络技术有限公司 | Conversation maintaining method and device |
| CN105338095A (en) * | 2015-11-17 | 2016-02-17 | 中国建设银行股份有限公司 | Conversation data processing method and device |
Non-Patent Citations (1)
| Title |
|---|
| 赵艳芳 等: ""Web服务器负载均衡会话保持的研究"", 《云南民族大学学报（自然科学版）》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113973130A (en) * | 2021-11-19 | 2022-01-25 | 杭州安恒信息技术股份有限公司 | Smooth service publishing method based on haproxy and related device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108028853B (en) | System, method, and medium for customizable event-triggered computation at edge locations | |
| US20200328984A1 (en) | Method and apparatus for allocating resource | |
| CN103209223B (en) | distributed application session information sharing method, system and application server | |
| CN103390041B (en) | A kind of method and system that data, services is provided based on middleware | |
| US11716264B2 (en) | In situ triggered function as a service within a service mesh | |
| KR102341809B1 (en) | System and method for supporting a bypass-domain model and a proxy model and updating service information for across-domain messaging in a transactional middleware machine environment | |
| CN110417842A (en) | Fault handling method and device for gateway server | |
| CN104503745B (en) | A kind of method and apparatus generated using channel packet | |
| CN108874506A (en) | Virtual machine leads directly to the thermomigration process and device of equipment | |
| GB2413407A (en) | Software distribution from a computer on which the software is installed | |
| CN107133234A (en) | The method of data cached renewal, apparatus and system | |
| CN107483538A (en) | A kind of method and apparatus that access request bag is handled on the node of micro services cluster | |
| CN107623729A (en) | A kind of caching method, equipment and cache service system | |
| CN108322502A (en) | Method, gateway system and storage medium for equalization server load | |
| CN104714965A (en) | Static resource weight removing method, and static resource management method and device | |
| CN110381077A (en) | For the treating method and apparatus of digital certificate | |
| CN106790601A (en) | The reading device of address of service, system and method | |
| CN106537375A (en) | Memcached systems having local caches | |
| CN109104368B (en) | Connection request method, device, server and computer readable storage medium | |
| CN103246997A (en) | Transmission method and system of application store channel mark | |
| US9128886B2 (en) | Computer implemented method, computer system, electronic interface, mobile computing device and computer readable medium | |
| CN108880896A (en) | A kind of program gray scale dissemination method and device based on mainframe | |
| CN103248636B (en) | The system and method downloaded offline | |
| CN107844488A (en) | Data query method and apparatus | |
| CN110267077A (en) | Offline cache method, apparatus, terminal and readable storage medium storing program for executing |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181228 |