GSLB availability state change event transfer method realized based on priority queue

Abstract

The invention discloses a GSLB availability state change event transmission method based on a priority queue, and aims to solve the problems that an existing availability state change event (hereinafter referred to as a change event) transmission mode is lengthy in calling chain, delayed in change event transmission and the like, and cannot efficiently cope with a complex hierarchical relationship. Priorities are allocated to change events based on resource levels according to a resource dependency relationship, the change events of different resource types enter a priority queue according to the priorities, and it is ensured that high-priority events are firstly processed; the change events are taken out from the priority queue in batches according to the priority sequence, the resource availability states of the change events are calculated and updated, and if the resource availability states change, the associated upper layer resource events are added into the priority queue. The priority is set for the availability state change events of different resources, and the change events are transmitted layer by layer, so that the transmission efficiency is greatly improved, and meanwhile, the maintainability and the expandability of the system are enhanced.

Description

Technical Field

[0001] The present application relates to the technical field of global server load balancing, and in particular to a method for transmitting GSLB availability status events (hereinafter referred to as change events). Background Art

[0002] With the rapid development of the Internet, the global user demand for access to websites and applications continues to grow. In order to ensure that users in different regions can quickly access services, Global Server Load Balancing (GSLB) technology is widely used in large network systems. It achieves load balancing and high availability of services by dynamically adjusting the request distribution strategy through health detection of the availability status of service members.

[0003] In the GSLB system, the availability status of resources (such as available, unavailable, or partially available) has hierarchical dependencies. Changes in the availability status of underlying resources affect the availability status of upper-level resources. For example, changes in the availability status of service members affect the availability status of the global address pool, and changes in the address pool affect the availability status of domain name records.

[0004] The traditional method of delivering availability status change events (hereinafter referred to as change events) usually relies on hard-coded chain calls. This method has problems such as long call chains and delayed change event delivery, and cannot efficiently handle complex hierarchical relationships. Summary of the invention

[0005] The present application provides a GSLB availability status change event delivery method, device and product based on priority queue, aiming to solve the problems of the existing event delivery method such as lengthy call chain, event delivery delay, and inability to efficiently deal with complex hierarchical relationships.

[0006] In a first aspect, a GSLB availability status change event delivery method is implemented based on a priority queue. The method is applied to a global server load balancing GSLB system, and the method includes the following steps S1-S4.

[0007] Step S1, according to resource dependencies, assign priorities to availability status change events (hereinafter referred to as change events) based on resource levels. The priority of underlying resources is higher than that of upper-level resources. If the priorities are the same, they are sorted by the ASCII code value of the resource name; the change events include events input from outside the system and events generated from within the system.

[0008] Step S2, change events of different resource types enter the priority queue according to priority to ensure that high-priority change events are processed first; the priority queue is implemented using a heap structure, which is responsible for managing the input and output of change events and maintaining the heap characteristics of the queue during the input and output process of change events.

[0009] Step S3, divide multiple change events into the same batch of change events according to the same priority, take out the change events from the priority queue in batches according to the priority order, calculate and update the resource availability status of the change events, if the resource availability status changes, add the associated upper-level resource event to the priority queue, if the associated upper-level resource event already exists in the priority queue, there is no need to add it again.

[0010] Step S4, repeat the above steps S2-S3 until the priority queue is empty, completing the whole process of this change event transmission.

[0011] The above scheme may optionally include: taking out change events from the priority queue in batches, calculating and updating the resource availability status, determining whether the resource is referenced, and when the resource is referenced, searching for the referenced resource, putting the referenced resource change event into the priority queue, and repeating the above steps; when the resource is not referenced, ending the process.

[0012] The above solution may optionally include: when the availability status of a resource changes, the associated upper-layer resource event is automatically triggered and added to the priority queue.

[0013] The above scheme may optionally include: caching multiple change events in a priority queue, and when the resource reference relationship and the required data are stored in the same table of the database, using a single I / O operation to complete the search or update, batch extraction and processing.

[0014] In the second aspect, a GSLB availability status change event delivery device is implemented based on a priority queue, and the device includes: a priority setting module, a change event enqueue module, a change event dequeue module and a global event management module.

[0015] The priority setting module is used to assign priorities to change events based on resource dependencies and resource levels. The priority of bottom-level resources is higher than that of upper-level resources. If the priorities are the same, they are sorted by the ASCII code value of the resource name. The change events include events input from outside the system and events generated from within the system.

[0016] The change event enqueue module is used to enter the change events of different resource types into the priority queue according to priority, ensuring that the high-priority change events are processed first; the priority queue is implemented using a heap structure, which is responsible for managing the input and output of change events and maintaining the heap characteristics of the queue during the input and output process of change events.

[0017] The change event dequeue module is used to take out change events from the priority queue in batches according to the priority order, calculate the resource availability status of the change event and update it. If the resource availability status changes, the associated upper-level resource event is added to the priority queue. When the associated upper-level resource event already exists in the priority queue, there is no need to add it again.

[0018] The global event management module is used to manage the priority queue and repeatedly execute the change event enqueue module and the change event dequeue module in sequence until the priority queue is empty, completing the whole process of this change event transmission.

[0019] According to a third aspect, a computer device comprises a memory, a processor and a computer program stored in the memory, wherein the processor executes the computer program to implement the steps of the method described above.

[0020] In a fourth aspect, a computer-readable storage medium stores a computer program, which implements the steps of the above method when executed by a processor.

[0021] In a fifth aspect, a computer program product comprises a computer program / instruction, which implements the steps of the method described above when executed by a processor.

[0022] Compared with the prior art, this application has at least the following beneficial effects:

[0023] Based on further analysis and research on existing technical problems, this application recognizes that traditional change event transmission methods usually rely on hard-coded chain calls. This method has problems such as long call chains and delayed change event transmission, and cannot efficiently cope with complex hierarchical relationships. This application introduces a priority queue mechanism to set priorities for change events of different resources, and transmits change events layer by layer, which greatly improves the transmission efficiency, realizes efficient and reliable change event transmission between multi-level resources, and enhances the maintainability and scalability of the system.

[0024] This application reduces the number of database accesses by batch processing to merge the database I / O operations required for change event processing, thereby saving time and resources. Traditional solutions require multiple searches and updates for each change event, while this application uses a priority queue to centrally process multiple change events, significantly reducing the number of I / O operations and fixing it at a constant level.

[0025] The present application reduces the generation of repeated change events of multiple child nodes to the same parent node by changing the change event delivery strategy from depth-first to breadth-first, thereby improving the overall efficiency of change event delivery. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] Figure 1 A flowchart of a GSLB availability status change event delivery method based on a priority queue is provided as an embodiment of the present application.

[0027] Figure 2 A diagram of a priority queue structure provided for one embodiment of the present application.

[0028] Figure 3 A schematic diagram of multi-level resource availability status changes provided by an embodiment of the present application.

[0029] Figure 4 A flow chart of change event delivery provided for one embodiment of the present application.

[0030] Figure 5 A change event delivery scene graph is provided for one embodiment of the present application.

[0031] Figure 6 A schematic diagram of a traditional event delivery scheme provided for one embodiment of the present application.

[0032] Figure 7 A schematic diagram of change event delivery of a GSLB availability status change event delivery method based on a priority queue provided in one embodiment of the present application.

[0033] Figure 8 A block diagram of the module architecture of a GSLB availability status change event delivery device based on a priority queue provided in one embodiment of the present application;

[0034] Fig. 9 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0035] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0036] In the description of this application: unless otherwise specified, "plurality" means two or more. "Including", "comprising", "having" and other expressions also mean "not limited to" (certain units, components, materials, steps, etc.).

[0037] In one embodiment, Figure 1 As shown, a GSLB availability status change event transmission method based on a priority queue is provided. The method is applied to a global server load balancing GSLB system and includes steps S1-S4.

[0038] Step S1, according to resource dependencies, priority is assigned to availability status change events (hereinafter referred to as change events) based on resource levels. The priority of bottom-level resources is higher than that of upper-level resources. If the priorities are the same, they are sorted by the ASCII code value of the resource name. Change events include events input from outside the system and events generated inside the system.

[0039] Step S2, the change events of different resource types enter the priority queue according to their priorities, ensuring that the high-priority change events are processed first; the priority queue is implemented using a heap structure, responsible for managing the input and output of change events, and maintaining the heap characteristics of the queue during the input and output process of the change events;

[0040] Step S3, divide multiple change events into the same batch of change events according to the same priority, and take out the change events in batches from the priority queue according to the priority order, that is, take out multiple availability status change events of the same priority from the priority queue according to the priority order, calculate the resource availability status of the change event and update it, if the resource availability status changes, add the associated upper-layer resource event to the priority queue, if the associated upper-layer resource event already exists in the priority queue, there is no need to add it again;

[0041] Step S4, repeat the above steps S2-S3 until the priority queue is empty, completing the whole process of this change event transmission.

[0042] This embodiment significantly optimizes the change event delivery process in the GSLB system through the priority queue mechanism, solves the problem of delivery delay in the traditional chain call method, not only improves the efficiency of change event delivery, but also enhances the scalability of the system, and can adapt to complex multi-level resource dependency structures, ensuring the timeliness and accuracy of change event delivery, thereby improving the user's service experience.

[0043] In this embodiment, there are two types of change events, namely, event producers include: events input from outside the system, such as availability status change results returned by the service member detection program; events generated from within the system, such as upper-level resource availability status update events triggered by changes in low-level resource availability status, that is, associated upper-level resource events.

[0044] The priority queue is implemented using a heap structure. It sets the priority of events based on the resource level. If the priority is the same, it is sorted by the ASCII code value of the resource name. This queue is responsible for managing the input and output of events.

[0045] The event consumer takes the highest priority change event from the queue and calculates the availability status. If the resource availability status changes, update its availability status and add the associated upper-level resource availability status change event to the queue.

[0046] The specific steps of the GSLB availability status change event transmission method based on priority queue are as follows: Steps A1-A4.

[0047] Step A1, priority setting: assign priorities to change events based on resource dependencies, with bottom-level resources having higher priorities than upper-level resources.

[0048] Step A2, queueing change events: resource events of different types are queued according to their priority, ensuring that high-priority events are processed first.

[0049] Step A3, dequeueing change events: Take events from the queue in order of priority, calculate and update the resource availability status. If the resource availability status changes, add the associated upper-layer resource event to the queue.

[0050] Step A4, change event delivery: repeat the above steps A2-A3 until the queue is empty, completing the whole process of this change event delivery.

[0051] Among them, enqueue: insert an element into the priority queue and maintain the heap characteristics of the queue. Dequeue: remove and return the top element (the smallest element) from the priority queue while maintaining the heap characteristics.

[0052] In this embodiment, Figure 2 The structure diagram of the priority queue is shown, showing the internal structure of the priority queue and the change event scheduling mechanism. The priority queue is implemented using a minimum heap. Its main interfaces are as follows:

[0053] refer to Figure 2 ,Assume a scenario where there are change events of 3 service members (named 1.1.1.1, 2.2.2.2, and 3.3.3.3), change events of 2 global address pools (named pool1 and pool2), and a change event of a domain name record named example1.cn. The priority is service member>global address pool>domain name record. The events are arranged in the minimum heap according to the above figure.

[0054] Combination Figure 3, a diagram of the change of multi-level resource availability status, showing how the availability status is transmitted layer by layer from bottom to top. Assume a scenario where a domain name record named example1.cn has two global address pools pool1 and pool2, pool1 has two service members 1.1.1.1 and 2.2.2.2, and pool2 has a service member 3.3.3.3; all resources are available. If the availability status of service member 1.1.1.1 changes from available to unavailable due to service anomalies or shutdown, the availability status is transmitted according to the following steps:

[0055] 1. The availability status of service member 1.1.1.1 changes from available (green) to unavailable (red).

[0056] 2. The availability status of the global address pool pool1 changes to partially available (yellow).

[0057] 3. The availability status of the domain name record example1.cn changes to partially available (yellow).

[0058] In one embodiment, reference Figure 4 , Figure 4 This is a flow chart of the change event transmission of this embodiment, which illustrates the whole process from change event generation, queuing to change event processing. It includes: taking change events from the priority queue in batches, calculating and updating the resource availability status, judging whether the resource is referenced, and when the resource is referenced, searching for the referenced resource, putting the referenced resource change event into the priority queue, and repeating the above steps; when the resource is not referenced, the process ends.

[0059] In one embodiment, it includes: when the availability status of a certain resource changes, the associated upper-layer resource event is automatically triggered and added to the priority queue.

[0060] In one embodiment, it includes: caching multiple change events in a priority queue, and when the resource reference relationship and the required data are stored in the same table of the database, using a single I / O operation to complete the search or update, batch extraction and processing.

[0061] In one embodiment, the GSLB availability status change event delivery method based on the priority queue can also be applied to the following scenarios:

[0062] Multi-level event delivery: When the availability status of underlying resources changes, they are processed first and delivered to upper-level resources layer by layer.

[0063] Efficient event processing: events of the same level are taken out from the queue in batches, reducing I / O operations and improving event processing efficiency.

[0064] System optimization and expansion: Decouple the state transfer logic of different resource levels through the priority queue mechanism to avoid inefficient transfer caused by chain calls. When maintaining the system, the hierarchical relationship and event priority can be flexibly adjusted without modifying the transfer code.

[0065] In one embodiment, compared with the existing solution, this embodiment mainly improves the change event transmission efficiency in the GSLB system through two aspects: I / O merging and change event transmission strategy optimization. The following will be described in detail.

[0066] 1. I / O coalescing

[0067] The traditional method requires multiple I / O operations for each change in the availability status of a resource. I / O operations are time-consuming, resulting in low processing efficiency. If a single change event takes 1 second, 1,000 change events will take 1,000 seconds.

[0068] In this embodiment, multiple change events are cached through a priority queue. When the resource reference relationship and the required data are stored in the same table of the database, a single I / O operation can be used to complete the search or update, batch extraction and processing. This method significantly reduces the number of I / O operations and the processing time. If there are 1,000 change events of the same type, a batch extraction calculation takes less than 10 seconds, which is 2 orders of magnitude less time.

[0069] 2. Optimize the change event delivery strategy

[0070] In the traditional solution, a single change event is passed upward layer by layer. If multiple change events have the same parent node, its parent node will receive multiple change events. This solution de-duplicates the change events passed by the parent node and puts them into the queue to avoid multiple change events for the same parent node.

[0071] refer to Figure 5 , Assume a scenario where a domain name record named example1.cn has two global address pools pool1 and pool2, pool1 has two service members 1.1.1.1 and 2.2.2.2, and pool2 has one service member 3.3.3.3; all resources are available. If at this time service members 1.1.1.1, 2.2.2.2, and 3.3.3.3 have service anomalies or shutdowns, the availability status changes from available to unavailable.

[0072] The delivery steps and times of the traditional scheme and this scheme are as follows.

[0073] The traditional solution delivery steps are as follows: Steps Q1-Q3, combined with the attached Figure 6 .

[0074] Step Q1, the availability status of service member 1.1.1.1 changes from available (green) to unavailable (red); the availability status of global address pool pool1 changes to partially available (yellow); the availability status of domain name record example1.cn changes to partially available (yellow). The number of change events is 3.

[0075] In step Q2, the availability status of service member 2.2.2.2 changes from available (green) to unavailable (red); the availability status of global address pool pool1 changes to unavailable (red); the availability status of domain name record example1.cn is recalculated and remains partially available (yellow). The number of change events is 3.

[0076] In step Q3, the availability status of service member 3.3.3.3 changes from available (green) to unavailable (red); the availability status of global address pool pool1 changes to partially available (red); and the availability status of domain name record example1.cn changes to partially available (red). The number of change events is 3.

[0077] In summary, the number of availability status calculation change events of the traditional change event delivery solution is 9 times.

[0078] The change event transmission steps in this embodiment are as follows: Steps D1-D5. Figure 7 .

[0079] Step D1, the availability status of service member 1.1.1.1 changes from available (green) to unavailable (red), and the pool1 availability status change event is put into the queue. The number of change events is 1.

[0080] In step D2, the availability status of service member 2.2.2.2 changes from available (green) to unavailable (red). Since pool1 already exists in the queue, there is no need to put the pool1 availability status change event into the queue. The number of change events is 1.

[0081] In step D3, the availability status of service member 3.3.3.3 changes from available (green) to unavailable (red), and the pool2 availability status change event is put into the queue. The number of change events is 1.

[0082] Step D4, batch extract the availability status change events of global address pools pool1 and pool2 from the queue, the availability status of pool1 and pool2 changes from available (green) to unavailable (red), and put the availability status change event of the domain name record examle1.cn into the queue. The number of change events is 2.

[0083] Step D5, taking out the change event recording example1.cn from the queue, recording that the availability status of example1.cn changes from available (green) to unavailable (red). The number of change events is 1.

[0084] In summary, the number of availability status calculation events of the event delivery solution in this embodiment is 6 times.

[0085] It can be seen from this that, from the initial state to state 4, the solution provided by this embodiment reduces the number of calculations by 3 times compared with the traditional solution.

[0086] In this embodiment, a change event refers to a change in the availability status of a service member or a global address pool. Each change in the availability status (such as from available to unavailable, or from unavailable to available) is considered an independent change event. A change in the availability status of a service member triggers a change event. When a change in the availability status of a service member causes the overall availability status of the global address pool or domain name record to change, it is also considered an independent change event. Each change in the availability status is recorded as a change event. The counting of change events is based on independent change points, not on the objects that have changed (that is, even if the availability status of the same object changes, if it occurs at independent time points, it will be counted separately).

[0087] In this embodiment, by optimizing the change event transmission strategy and I / O operations, the new solution shows obvious advantages in processing efficiency, reduces the number of change event transmissions, reduces the system burden, and improves the overall user experience. This makes the GSLB system more efficient and reliable when facing complex resource dependencies.

[0088] In one embodiment, reference Figure 8 , provides a GSLB availability status change event transmission device based on priority queue, the device includes: a priority setting module, a change event enqueue module, a change event dequeue module and a global event management module.

[0089] The priority setting module is used to assign priorities to change events based on resource dependencies and resource levels. The priority of bottom-level resources is higher than that of upper-level resources. If the priorities are the same, they are sorted by the ASCII code value of the resource name. Change events include events input from outside the system and events generated from within the system.

[0090] The change event enqueue module is used to enter the change events of different resource types into the priority queue according to their priorities, ensuring that the high-priority change events are processed first; the priority queue is implemented using a heap structure, which is responsible for managing the input and output of change events and maintaining the heap characteristics of the queue during the input and output process of change events;

[0091] The change event dequeue module is used to take out the change events from the priority queue in batches according to the priority order, calculate the resource availability status of the change event and update it. If the resource availability status changes, the associated upper-level resource event is added to the priority queue. If the associated upper-level resource event already exists in the priority queue, there is no need to add it again;

[0092] The global event management module is used to manage the priority queue and repeatedly execute the change event enqueue module and the change event dequeue module in sequence until the priority queue is empty, completing the whole process of this change event transmission.

[0093] The specific implementation content of each module can be found in the above-mentioned limitation on the GSLB availability status change event transmission method based on priority queue, which will not be repeated here.

[0094] In one embodiment, a computer device is provided. The computer device may be a terminal, and its internal structure diagram may be as follows: Fig. 9 As shown. The computer device includes a processor, a memory, a communication interface, and a human-computer interaction interface (such as a combination of a display, a keyboard, and a mouse, and a touch screen, etc.) connected via a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities, and the communication interface is used to communicate with an external terminal in a wired or wireless manner. The wireless method can be implemented through WIFI, an operator network, NFC (near field communication) or other technologies. The computer device loads and runs a computer program to implement the above-mentioned GSLB availability status change event transmission method based on a priority queue.

[0095] Those skilled in the art will understand that Fig. 9 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0096] In one embodiment, a computer-readable storage medium is further provided, on which a computer program is stored. When the computer program is executed by a processor, the steps of the method in the above embodiment are implemented.

[0097] In one embodiment, a computer program product is also provided, including a computer program / instruction, which implements the steps of the above-mentioned embodiment method when executed by a processor.

[0098] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

Claims

1. A GSLB availability status change event delivery method based on a priority queue, characterized in that: The method is applied to a global server load balancing GSLB system, comprising: Step S1, according to resource dependencies, based on resource levels, assigning priorities to availability status change events (hereinafter referred to as change events), with bottom-level resources having higher priorities than upper-level resources, and if the priorities are the same, they are sorted by ASCII code values ​​of resource names; the change events include events input from outside the system and events generated from within the system; Step S2, the change events of different resource types enter the priority queue according to the priority, ensuring that the high-priority change events are processed first; the priority queue is implemented using a heap structure, responsible for managing the input and output of the change events, and maintaining the heap characteristics of the queue during the input and output process of the change events; Step S3, divide multiple change events into the same batch of change events according to the same priority, take out the change events from the priority queue in batches according to the priority order, calculate and update the resource availability status of the change events, and if the resource availability status changes, add the associated upper-layer resource event to the priority queue. If the associated upper-layer resource event already exists in the priority queue, there is no need to add it again; Step S4, repeat the above steps S2-S3 until the priority queue is empty, completing the whole process of this change event transmission.

2. The GSLB availability status change event transmission method based on priority queue according to claim 1 is characterized in that: include: Take out change events from the priority queue in batches, calculate and update the resource availability status, determine whether the resource is referenced, and when the resource is referenced, find the referenced resource, put the referenced resource change event into the priority queue, and repeat the above steps; when the resource is not referenced, end the process.

3. The GSLB availability status change event transmission method based on priority queue according to claim 1 is characterized in that: include: When the availability status of a resource changes, the associated upper-level resource event is automatically triggered and added to the priority queue.

4. The GSLB availability status change event transmission method based on priority queue according to claim 1 is characterized in that: include: Multiple change events are cached in the priority queue. When the resource reference relationship and the required data are stored in the same table of the database, a single I / O operation is used to complete the search or update, and batch extraction and processing are performed.

5. A GSLB availability status change event delivery device based on a priority queue, characterized in that: include: The priority setting module is used to assign priorities to change events based on resource levels according to resource dependencies. The priority of bottom-level resources is higher than that of upper-level resources. If the priorities are the same, they are sorted according to the ASCII code values ​​of the resource names. The change events include events input from outside the system and events generated from within the system. The change event enqueue module is used to enter the change events of different resource types into the priority queue according to the priority, so as to ensure that the high-priority change events are processed first; the priority queue is implemented using a heap structure, which is responsible for managing the input and output of the change events and maintaining the heap characteristics of the queue during the input and output process of the change events; The change event dequeue module is used to take out the change events from the priority queue in batches according to the priority order, calculate the resource availability status of the change event and update it. If the resource availability status changes, the associated upper-layer resource event is added to the priority queue. If the associated upper-layer resource event already exists in the priority queue, there is no need to add it again; The global event management module is used to manage the priority queue and repeatedly execute the change event enqueue module and the change event dequeue module in sequence until the priority queue is empty, completing the whole process of this change event transmission.

6. A computer device comprising a memory, a processor and a computer program stored in the memory, characterized in that: The processor executes the computer program to implement the steps of the method of claim 1.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to claim 1 are implemented.

8. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instructions are executed by a processor, the steps of the method according to claim 1 are implemented.

Images