Business processing method and device, equipment, medium and program product
Through dynamic sorting and selection of takeover nodes, the long business interruption time and resource waste caused by single-node remote disaster recovery are solved, and the rapid recovery of the business system and efficient utilization of resources are achieved, and the user experience is improved.
Patent Information
- Application Number
- CN202411320741.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-20
- Publication Date
- 2024-12-03
AI Technical Summary
In the prior art, the single node off-site disaster recovery treatment method causes a long interruption of business operations, affecting user experience, and the resource utilization rate of standby nodes is low in non-failure situations, resulting in waste of resources.
When a failed node is detected, the takeover node is dynamically sorted and selected based on the node location information and actual carrying traffic volume, and quickly switched services to ensure business continuity and effective resource utilization.
It shortens the service interruption time, improves system reliability and availability, rationally allocates system resources, reduces network delays, and improves user experience.
Smart Images

Figure CN119071143A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of computer technology, and in particular to a business processing method, device, equipment, medium and program product. Background Art
[0002] In order to prevent the interruption of business platforms such as the digital SMS capability platform in the event of technical failures, human errors or other emergencies, which would affect the continuity and data integrity of communication-related businesses, business disaster recovery is required to ensure that business operations can be quickly restored and continued.
[0003] Currently, business disaster recovery is usually handled through single-node off-site disaster recovery backup, that is, by establishing backup data centers in different locations and manually switching business nodes to prevent a disaster in a single location from affecting the entire business.
[0004] However, single-node off-site disaster recovery requires regular testing and drills to ensure its effectiveness, and the manual switching of business nodes during the testing process is time-consuming and complex, which will cause long interruptions to normal business operations and affect user experience. Summary of the invention
[0005] The present application provides a business processing method, device, equipment, medium and program product to solve the technical problem that the normal business operation is interrupted for a long time and the user experience is affected by the single-node remote disaster recovery processing method in the prior art.
[0006] In a first aspect, the present application provides a business processing method, including:
[0007] When it is detected that the first node is in a fault state, at least one second node is sorted to obtain a takeover sequence, the takeover sequence comprising: at least one second node arranged in descending order of priority determined based on location information of each node;
[0008] Determine at least one third node in the takeover sequence according to the actual traffic carried by the first node;
[0009] The service on the first node is switched to at least one third node for taking over.
[0010] Optionally, sorting the at least one second node to obtain a takeover sequence includes:
[0011] According to the location information of each node, determine, at at least one second node, N fourth nodes that belong to the same area as the first node and M fifth nodes that do not belong to the same area as the first node, where N and M are integers;
[0012] For each fourth node and each fifth node, respectively determine the distance between the node and the first node;
[0013] Arrange the fourth nodes in ascending order according to the distance to obtain a first sequence, and arrange the fifth nodes in ascending order according to the distance to obtain a second sequence;
[0014] The second sequence is connected to the first sequence to obtain a takeover sequence.
[0015] Optionally, determining at least one third node in the takeover sequence according to the actual traffic carried by the first node includes:
[0016] According to the actual bearer traffic volume of the first node, the available bearer traffic volume of at least one second node is determined in sequence from the front to the back in the takeover sequence, and the determination is stopped when the sum of the determined available bearer traffic volumes is greater than or equal to the actual bearer traffic volume of the first node, and for each second node, the available bearer traffic volume of the second node is determined based on the preset service capacity of the second node and the actual bearer traffic volume of the second node;
[0017] At least one second node corresponding to which the sum of available bearer traffic is greater than or equal to the actual bearer traffic of the first node is determined as at least one third node.
[0018] Optionally, before sorting the at least one second node to obtain the takeover sequence, the method further includes:
[0019] detecting a state of each second node;
[0020] A second node in a normal state is used as at least one second node.
[0021] Optionally, switching the service on the first node to at least one third node for taking over includes:
[0022] In response to a user's service demand, at least one third node is controlled to perform service processing according to an IP address corresponding to the service demand.
[0023] Optionally, after switching the service on the first node to at least one third node for taking over, the method further includes:
[0024] When it is detected that the first node is in a normal state, the service on the at least one third node is switched back to the first node.
[0025] In a second aspect, the present application provides a service processing device, including:
[0026] A sorting module is used to sort at least one second node to obtain a takeover sequence when it is detected that the first node is in a fault state, wherein the takeover sequence includes: at least one second node arranged in descending order of priority determined based on the position information of each node;
[0027] A determination module, configured to determine at least one third node in a takeover sequence according to an actual traffic volume carried by the first node;
[0028] The switching module is used to switch the service on the first node to at least one third node for taking over.
[0029] Optionally, the sorting module is specifically used to:
[0030] According to the location information of each node, determine, at at least one second node, N fourth nodes that belong to the same area as the first node and M fifth nodes that do not belong to the same area as the first node, where N and M are integers;
[0031] For each fourth node and each fifth node, respectively determine the distance between the node and the first node;
[0032] Arrange the fourth nodes in ascending order according to the distance to obtain a first sequence, and arrange the fifth nodes in ascending order according to the distance to obtain a second sequence;
[0033] The second sequence is connected to the first sequence to obtain a takeover sequence.
[0034] Optionally, a module is determined, specifically for:
[0035] According to the actual bearer traffic volume of the first node, the available bearer traffic volume of at least one second node is determined in sequence from the front to the back in the takeover sequence, and the determination is stopped when the sum of the determined available bearer traffic volumes is greater than or equal to the actual bearer traffic volume of the first node, and for each second node, the available bearer traffic volume of the second node is determined based on the preset service capacity of the second node and the actual bearer traffic volume of the second node;
[0036] At least one second node corresponding to which the sum of available bearer traffic is greater than or equal to the actual bearer traffic of the first node is determined as at least one third node.
[0037] Optionally, it also includes:
[0038] A detection module, used to detect the status of each second node;
[0039] A second node in a normal state is used as at least one second node.
[0040] Optionally, the switching module is specifically used to:
[0041] In response to a user's service demand, at least one third node is controlled to perform service processing according to an IP address corresponding to the service demand.
[0042] Optionally, the switching module is further configured to:
[0043] When it is detected that the first node is in a normal state, the service on the at least one third node is switched back to the first node.
[0044] In a third aspect, the present application provides an electronic device, comprising: a processor, and a memory communicatively connected to the processor;
[0045] Memory stores computer-executable instructions;
[0046] The processor executes the computer-executable instructions stored in the memory to implement the business processing method as described in the first aspect and various possible implementations of the first aspect.
[0047] In a fourth aspect, the present application provides a computer-readable storage medium, comprising computer execution instructions. When a processor executes the computer execution instructions, it executes the business processing method as described in the first aspect and various possible implementations of the first aspect.
[0048] In a fifth aspect, the present application provides a program product, which includes a computer program, and the computer program is executed by a processor to implement the business processing method as described in the first aspect and various possible implementations of the first aspect.
[0049] The business processing method, device, equipment, medium and program product provided by the present application, when the first node is detected to be in a faulty state, based on the location information of at least one second node, the corresponding priority is determined, and it is sorted from large to small according to the priority to obtain a takeover sequence, and further according to the actual carrying business volume of the first node, at least one third node is screened out from the takeover sequence, thereby switching the business on the first node to at least one third node for takeover. This method can quickly sort other nodes and determine the takeover node when the first node fails, and can dynamically adjust the selection and sorting of the takeover node, so it has flexibility and scalability, can adapt to different business needs, thereby shortening the business interruption time, and improving the reliability and availability of the business system. At the same time, the takeover node is determined based on the location information and the actual carrying business volume, which can achieve a more reasonable allocation of system resources, thereby avoiding resource waste or overload, reducing network delays, and improving user experience. BRIEF DESCRIPTION OF THE DRAWINGS
[0050] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.
[0051] Figure 1 A schematic diagram of the architecture of the business system provided in the embodiment of the present application;
[0052] Figure 2 Schematic diagram of the process of the business processing method provided in the embodiment of the present application Figure 1 ;
[0053] Figure 3 Schematic diagram of the process of the business processing method provided in the embodiment of the present application Figure 2 ;
[0054] Figure 4 Schematic diagram of the process of the business processing method provided in the embodiment of the present application Figure 3 ;
[0055] Figure 5 Schematic diagram of the business processing method provided in the embodiment of the present application Figure 1 ;
[0056] Figure 6 An interactive diagram of a business processing method provided in an embodiment of the present application;
[0057] Figure 7 Schematic diagram of the business processing method provided in the embodiment of the present application Figure 2 ;
[0058] Figure 8 A schematic diagram of each node provided in an embodiment of the present application;
[0059] Fig. 9 A schematic diagram of the structure of a service processing device provided in an embodiment of the present application;
[0060] Fig.10 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application.
[0061] The above drawings have shown clear embodiments of the present application, which will be described in more detail later. These drawings and text descriptions are not intended to limit the scope of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION
[0062] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.
[0063] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant laws, regulations and standards, and provide corresponding operation entrances for users to choose to authorize or refuse.
[0064] In the prior art, in communication systems, in order to cope with business interruptions caused by various emergencies (such as natural disasters, equipment failures, network attacks, etc.), business disaster recovery is generally performed through a single-node off-site disaster recovery backup method, and the backup system or data is stored in different cities or regions. When a local system fails, the service is continued by manually switching to the off-site system, ensuring that the communication service can be quickly restored and continuously operated.
[0065] However, single-node off-site disaster recovery requires regular testing and drills to ensure its effectiveness, which will interrupt normal business operations. At the same time, the process of simulating real fault scenarios for drills is relatively complex and time-consuming, and business nodes need to be switched manually, involving multiple steps such as confirming the fault, starting the backup node, switching traffic, etc. These operations are time-consuming, resulting in long business interruptions. In addition, single-node off-site disaster recovery usually relies on a backup node, which is idle in non-fault conditions and has low resource utilization. In order to ensure the availability of the backup node, a large amount of resources may need to be invested in maintenance and monitoring, but these resources are not fully utilized under normal circumstances, resulting in resource waste. At the same time, the geographical location of the backup node may be far away from the primary node, and switching may increase network latency, affecting user experience.
[0066] Based on this, the business processing method, device, equipment, medium and program product provided by the present application are intended to solve the above technical problems of the prior art. The method can greatly shorten the business interruption time and improve the reliability and availability of the system by quickly sorting other nodes and determining the takeover node when the failure of the first node is detected. At the same time, by determining the takeover node based on location information and the actual business volume carried, the system resources can be allocated more reasonably to avoid resource waste or overload. By considering the actual business volume carried, better load balancing can be achieved to prevent some nodes from being overloaded, while ensuring that the resources of other nodes are effectively utilized. Furthermore, by sorting based on location information, a node with a more suitable geographical location can be selected to take over, thereby reducing delays and improving user experience.
[0067] The technical solution of the present application and how the technical solution of the present application solves the above-mentioned technical problems are described in detail below with specific embodiments. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below in conjunction with the accompanying drawings.
[0068] Figure 1 This is a schematic diagram of the architecture of the business system provided in the embodiment of the present application. Figure 1 As shown, the system includes: business components, computer networks, nodes, network elements, and users. Among them:
[0069] Business components can refer to various components in the mobile communication network, including Internet services, national / provincial MMS exchange centers (EC), MMS intercommunication gateways, digital SMS platforms, MMS electronic number mapping domain name system (Enum Domain Name System, EnumDNS), support systems, etc. Among them, Internet services are used to provide Internet access and related services, such as web browsing, email, online chat, video conferencing, etc.; national / provincial MMS EC is used to process and exchange MMS (Multimedia Messaging Service, MMS) within the country or province, ensuring the transmission and routing of MMS between different networks; MMS intercommunication gateways serve as a bridge between different mobile operators or networks to ensure that MMS can be interconnected and transmitted between different networks; digital SMS platforms are used to process and manage the sending and receiving of SMS and provide the infrastructure for SMS services; MMS EnumDNS is used to map phone numbers to corresponding domain names for routing and addressing in MMS services to ensure that messages can be accurately delivered; support systems are used to provide background support and management functions, such as billing systems, customer relationship management systems, network management systems, etc., to ensure the stable operation and efficient management of the entire communication system.
[0070] Computer networks include public networks and private networks. The public network, also known as the public network, refers to a network that can be accessed through the Internet. The public IP address is a globally unique identifier (Internet Protocol, IP) address assigned by the Internet Assigned Numbers Authority (IANA) and the Regional Internet Registry (RIR). Any device using a public IP address can be accessed by other devices worldwide; the private network, also known as the private network or intranet, refers to a network used only in a local area network (LAN) or an internal enterprise network. The private IP address is a specific IP address range reserved by IANA. These addresses are not routable in the Internet and cannot be accessed directly through the Internet.
[0071] Furthermore, the public network is connected to a Domain Name System (DNS) server, which resolves domain names into IP addresses, allowing users to access network resources through domain names. Therefore, in this embodiment, business components need to select corresponding servers or websites according to their business types so that each business component can provide services to the outside world.
[0072] A node may refer to a data center (DC), which usually includes a large number of servers, storage devices, and network devices for storing, managing, and distributing data. In this embodiment, a node may specifically refer to a centralized Wireless Application Protocol (WAP) gateway or a centralized Multimedia Messaging Service Center (MMSC), wherein the WAP gateway is used to convert the WAP protocol used by mobile devices and the Hypertext Transfer Protocol (HTTP) and Hypertext Transfer Protocol Secure (HTTPS) protocols used by the Internet, thereby enabling mobile devices to access Internet content and services; the MMSC is used to process and transmit multimedia messages.
[0073] Furthermore, two nodes are deployed at each of the two locations in Area A and Area B. Specifically, node 1A is deployed at Area A, node 1B is deployed at Area B, node 2A is deployed at Area B, and node 2B is deployed at Area B, to form a mutual backup disaster recovery form. Specifically, 1A and 1B backup each other locally, 2A and 2B backup each other locally, 1A and 2A backup each other remotely, and 1B and 2B backup each other remotely, so that each node has 1 active and 2 standby disaster recovery capabilities.
[0074] A network element may refer to a basic device or functional unit in a network, which is responsible for a specific network function. In this embodiment, the network element may specifically include a Gateway GPRS Support Node (GGSN), which is used to connect a mobile network and an external data network, a System Architecture Evolution Gateway (SAE-GW), which includes a Serving Gateway (SGW) and a Packet Data Network Gateway (PGW), where SGW is used for routing and forwarding user data, and PGW is responsible for connecting to an external data network and executing policy control, a Session Management Function (SMF), which is used for session management and control, and a User Plane Function (UPF), which is used for forwarding and processing user data.
[0075] Users may refer to all users' communication mobile devices, specifically, users in provinces 1-8 in area 1, users in provinces 9-16 in area 2, users in provinces 17-24 in area 3, and users in provinces 25-31 in area 4.
[0076] In this embodiment, there is a corresponding relationship between users, network elements, and nodes in each area. Specifically, when disaster recovery switching is not performed, users in area 1 corresponding to location A in the northern area are processed by node 1A, users in area 2 corresponding to location B in the northern area are processed by node 1B, users in area 3 corresponding to location A in the southern area are processed by node 2A, and users in area 4 corresponding to location B in the southern area are processed by node 2B.
[0077] The business system provided in the embodiment of the present application is deployed on the cloud resource pools in Area A and Area B. By deploying and setting up equipment at different levels such as business components, computer networks, nodes, network elements, and users, and further deploying multiple nodes, each node has a disaster recovery capability of 1 master and 2 backups, thereby forming a complete business system, ensuring that the business processing process can proceed normally and quickly switching nodes when a node fails.
[0078] Figure 2 Schematic diagram of the process of the business processing method provided in the embodiment of the present application Figure 1 .like Figure 1 As shown, the method includes:
[0079] S101, when it is detected that a first node is in a fault state, sort at least one second node to obtain a takeover sequence;
[0080] The takeover sequence includes: at least one second node whose priority is determined from large to small based on the position information of each node.
[0081] The first node may refer to a node that is currently performing business processing, for example, a node that processes a user request and returns a computer network response.
[0082] The fault state may refer to situations where the first node itself is abnormal or severely delayed, or may refer to situations where the connection relationship between the first node and each network element fails. Exemplarily, whether a node is in a faulty state may be detected through a heartbeat mechanism, that is, the node periodically sends a heartbeat signal to a central monitoring server to report the node's own health status. If the central monitoring server does not receive a heartbeat signal from a node within a specified time, the node is considered to have failed. In another case, a keep alive mechanism may be used. In the transport layer, such as a Transmission Control Protocol (TCP) connection, the node periodically sends signals or data packets to the network element to ensure the active state of the connection and prevent the connection from being closed due to a long period of no data transmission.
[0083] In some embodiments, detecting whether a node is in a fault state may also be achieved through methods such as network monitoring tools or log analysis.
[0084] The second node may refer to a node in the business system other than the first node currently processing the business of a certain area, and when the first node is in a faulty state, at least one second node is in a normal state and can normally process business and take over the business load.
[0085] Therefore, in this embodiment, before sorting the at least one second node to obtain the takeover sequence, the method further includes:
[0086] The status of each second node is detected first, and then a second node in a normal state is used as at least one second node.
[0087] If a second node in a faulty state is detected, it will be excluded, and the second node will not be sorted regardless of the distance between the second node and the first node.
[0088] It should be noted that in order to prevent the problem of increased network delay after node switching, the priority of at least one second node is sorted from large to small according to the distance between at least one second node and the first node from near to far, and a takeover sequence is obtained. As a result, a second node with a higher priority can be preferentially selected in the takeover sequence, that is, at least one second node that is closer to the first node.
[0089] It is understandable that by sorting based on the location information and obtaining the takeover sequence, at least one second node whose location information meets the preset distance requirement can be preliminarily determined. By considering the location information of each node, network delay can be reduced and user experience can be improved.
[0090] S102: Determine at least one third node in a takeover sequence according to the actual traffic carried by the first node.
[0091] Among them, the actual carried business volume can refer to the business volume processed or transmitted by the first node in actual operation. In this embodiment, the actual carried business volume can specifically refer to the load, that is, the workload of the node at a certain moment, which can be memory utilization or central processing unit (CPU) utilization, etc.
[0092] The third node may refer to a node that is determined by screening all second nodes in the takeover sequence and that can take over the actual traffic carried by the first node. At least one third node is a node that can independently carry the sum of its own traffic and the actual traffic carried by the first node.
[0093] It should be noted that when there is at least one second node in the takeover sequence, the actual business load of at least one second node is determined in turn according to the priority relationship, and then the current available business load of the node is determined to ensure that the node can take over the business of the first node and does not exceed the maximum processing capacity of the node.
[0094] Exemplarily, when there is a second node in the takeover sequence, the actual business volume carried by the second node is calculated based on the actual business volume carried by the second node itself and the sum of the actual business volume carried by the first node. If it does not exceed the maximum carrying capacity of the node, the second node is used as the third node to take over the business of the first node.
[0095] In another example, when there are two or more second nodes in the takeover sequence, the sum of their remaining carrying capacities, that is, the sum of the current available carrying capacity, is calculated based on the actual carrying capacity of these second nodes themselves. When the sum of the available carrying capacity is greater than or equal to the actual carrying capacity of the first node, these second nodes are used as third nodes, and according to the available carrying capacity of each third node, the actual carrying capacity of the first node is distributed to each third node for business processing.
[0096] It is understandable that, based on the location information, further considering the size of the actual business volume carried by the first node to determine at least one third node to take over the business, better load balancing can be achieved, preventing at least one third node from being overloaded, and ensuring that the resources of each node are effectively utilized. On the other hand, at least one second node in the takeover sequence is also in a business processing state like the first node, and normally carries the business volume, so it can improve resource utilization and avoid nodes other than the first node being used only as backup nodes and being idle on a daily basis, which causes resource waste.
[0097] S103: Switch the service on the first node to at least one third node for taking over.
[0098] Among them, since each node has the same application and services, the configuration of the first node and at least one third node can be guaranteed to be consistent. Therefore, through the DNS server or load balancer, its configuration is updated to point to at least one third node, and the relevant services are stopped on the first node to ensure that the user and network element data will not continue to be written to the first node, and then the corresponding service is started on at least one third node to start taking over the business for business processing.
[0099] It should be noted that, since the at least one third node is determined based on the location information and the actual traffic volume, the network delay is small, the switching process is fast, and the user's service will not be greatly affected.
[0100] It is understandable that various nodes are deployed in different areas and perform the same type of business processing. Therefore, when performing node switching, there is no need to perform performance testing on the node that takes over the business, which greatly shortens the business interruption time and ensures that at least one third node can handle the expected business, thereby improving the continuity and stability of business processing.
[0101] In one achievable manner, S103 is specifically implemented through the following steps:
[0102] In response to a user's service demand, at least one third node is controlled to perform service processing according to an IP address corresponding to the service demand.
[0103] Specifically, the user initiates a service request to at least one third node through the network element corresponding to his / her business needs. At least one third node queries the DNS server in the computer network based on the service request, thereby determining the IP address of the business component corresponding to the service request. Furthermore, at least one third node acts as a service agent to communicate with the target server on behalf of the user device, forwards the user's request to the target server, and returns the server's response to the user device, thereby completing the user's business needs.
[0104] It can be understood that when the service on the first node is switched to at least one third node, each network element connected to the first node is also switched to be connected to at least one third node. Through the routing configuration between the network element and the node and the IP address corresponding to the service demand, it is ensured that the data packet can be correctly transmitted and processed, thereby improving the accuracy of service processing.
[0105] Furthermore, in this embodiment, after switching the service on the first node to at least one third node for taking over, the method further includes:
[0106] When it is detected that the first node is in a normal state, the service on the at least one third node is switched back to the first node.
[0107] It can be understood that since each node carries the business of the area where the node is located, when it is detected that the first node is in a normal state, the business on at least one third node is switched back to the first node. This can ensure that under normal conditions, each node carries a certain amount of business, so that the resources of each node are effectively utilized, ensuring load balancing within the business system.
[0108] The business processing method provided in the embodiment of the present application, when it is detected that the first node is in a faulty state, detects the state of each second node, screens at least one second node in a normal state, and determines the priority based on the location information, thereby obtaining a takeover sequence, which can reduce delays and switching time. Furthermore, at least one third node is determined from the takeover sequence according to the actual business volume carried by the first node to take over the business of the first node and process it, which can prevent node overload and ensure that the resources of each node are effectively utilized. By sorting and selecting nodes for takeover, it has higher flexibility and scalability, can adapt to different business scenarios, and at the same time provides higher redundancy and reliability, so as to restore business more quickly, reduce downtime, and improve user experience.
[0109] Based on the above embodiments, Figure 3 Schematic diagram of the process of the business processing method provided in the embodiment of the present application Figure 2 .like Figure 3 As shown, a possible implementation of the above step S101 includes the following steps:
[0110] S201, determining, at at least one second node, N fourth nodes that belong to the same area as the first node and M fifth nodes that do not belong to the same area as the first node according to location information of each node;
[0111] Wherein, N and M are integers, and N and M can be 0.
[0112] The area may be a certain range of regions determined according to the relationship between the node service switching time and the distance. In this embodiment, the area may refer to area A or area B, and each node is located at a different location in area A or area B.
[0113] It should be noted that nodes belonging to the same area, such as the first node and the fourth node, are local disaster recovery, and nodes not belonging to the same area, such as the first node and the fifth node, are remote disaster recovery. Furthermore, the priority of local disaster recovery is greater than the priority of remote disaster recovery.
[0114] It can be understood that by first determining the fourth node and the fifth node in at least one second node, the location of the takeover node can be preliminarily determined. Since nodes in the same area usually share a higher bandwidth and have higher data transmission efficiency, the fourth node has a higher priority than the fifth node. Therefore, the fourth node in the same area can be selected as a redundant node to quickly take over the business when the first node fails, thereby reducing service interruption time.
[0115] S202: For each fourth node and each fifth node, respectively determine the distance between the node and the first node.
[0116] Among them, the geographical location of the node can be obtained through the IP address of the node, so as to get the distance between two nodes, so as to make more effective node selection and optimization.
[0117] In some embodiments, the network delay and bandwidth utilization between nodes may be continuously monitored by a network monitoring tool to calculate the distance, or the distance may be calculated by a geographic information system tool, etc. This embodiment is not limited here.
[0118] S203, arranging the fourth nodes from small to large distances to obtain a first sequence, and arranging the fifth nodes from small to large distances to obtain a second sequence.
[0119] It can be understood that by sorting the fourth nodes and the fifth nodes separately, intra-regional redundancy or cross-regional redundancy can be selected at will, and the selection and sorting of takeover nodes can be dynamically adjusted, which has higher flexibility and scalability.
[0120] S204: Connect the second sequence to the first sequence to obtain a takeover sequence.
[0121] In this embodiment, based on business continuity, the second sequence is connected to the first sequence to obtain a takeover sequence, and the fourth node is preferentially selected as the takeover node to synchronize data in the same area, which is faster and has lower latency, and helps to improve data consistency. However, the fifth node is also used as a backup takeover node, which can distribute the load between different areas, better disperse the traffic, and avoid network bottlenecks in a certain area.
[0122] Exemplarily, when the number of nodes is four and the node located at location A in the north district is the first node, the fourth node located at location B in the north district is the node with the highest priority in the takeover sequence, and for the fifth node located at location A in the south district and the fifth node located at location B in the south district, their distances from the first node are compared, and the fifth node with a closer distance is taken as the node with the next priority, thereby obtaining the takeover sequence according to this order.
[0123] The business processing method provided by the embodiment of the present application, by sorting the fourth node belonging to the same area as the first node and the fifth node not belonging to the same area as the first node according to their distance size, obtains a first sequence and a second sequence, can select the takeover node in the corresponding sequence according to the actual business needs, and by connecting the second sequence to the first sequence to obtain the takeover sequence, can improve the speed of determining the takeover node, thereby reducing network delay and service interruption time, and further reducing data transmission costs. On the other hand, by reasonably selecting and configuring the fourth node and the fifth node, when a failure occurs in the entire area (such as a natural disaster, a regional network interruption), the continuity of the business can still be guaranteed, thereby significantly improving the performance, reliability and cost-effectiveness of the system, and meeting the needs of different business scenarios.
[0124] Based on the above embodiments, Figure 4 Schematic diagram of the process of the business processing method provided in the embodiment of the present application Figure 3 .like Figure 4 As shown, a possible implementation of the above step S102 includes the following steps:
[0125] S301, according to the actual bearer traffic volume of the first node, determine the available bearer traffic volume of at least one second node in sequence from front to back in the takeover sequence, and stop determining when the sum of the determined available bearer traffic volumes is greater than or equal to the actual bearer traffic volume of the first node;
[0126] For each second node, the available bearer traffic volume of the second node is determined based on the preset traffic capacity of the second node and the actual bearer traffic volume of the second node.
[0127] Available traffic refers to the maximum traffic that a node can handle without affecting performance and stability. Capacity planning can be performed based on the node's hardware configuration (such as CPU, memory, storage, network bandwidth) and application requirements to estimate the node's maximum traffic capacity.
[0128] Exemplarily, if the sum of the available bearer traffic of at least one determined second node is greater than the actual bearer traffic of the first node, for example, the actual bearer traffic of the first node is 100 units. In the takeover sequence, the available bearer traffic of the second node is determined from front to back, assuming that the available bearer traffic of the second node A is 60 units and the available bearer traffic of the second node B is 50 units. Then, when the second node B is determined, the total available bearer traffic is 110 units, which is greater than the actual bearer traffic of the first node of 100 units. The actual bearer traffic of the first node is flexibly allocated according to the available bearer traffic of the second node A and the second node B, for example, the second node A takes over 55 units and the second node B takes over 45 units. In this way, it is ensured that there is sufficient redundancy to cope with sudden increases in traffic or other unforeseen situations, to avoid overloading of a certain node, and even if a problem occurs in a certain second node during the takeover process (such as failure or performance degradation), other nodes still have sufficient capacity to carry traffic and improve the reliability of the system.
[0129] In another example, if the sum of the available bearer traffic of at least one determined second node is equal to the actual bearer traffic of the first node, as in the above example, the difference is that the available bearer traffic of the second node B is 40 units. Then, when the second node B is determined, the total available bearer traffic is 100 units, which is equal to the actual bearer traffic of the first node, 100 units. Then, the actual bearer traffic of the first node is directly fully loaded according to the available bearer traffic of each second node, that is, the second node A takes over 60 units and the second node B takes over 40 units. In this way, it is ensured that the resources of all nodes are fully utilized to avoid resource waste.
[0130] It can be understood that when the sum of the determined available bearer traffic is greater than or equal to the actual bearer traffic of the first node, it means that these second nodes can combine and take over the traffic of the first node. By gradually determining the available bearer traffic of the second node, it is possible to avoid waste of resources and ensure that the resources of each node can be fully utilized, thereby ensuring the maximum utilization of network resources. At the same time, since the determination is stopped immediately after determining sufficient available bearer traffic, unnecessary calculations and resource consumption can be reduced, thereby improving the response speed and efficiency of the system.
[0131] S302: Determine at least one second node corresponding to which the sum of available bearer traffic is greater than or equal to the actual bearer traffic of the first node as at least one third node.
[0132] Among them, determining at least one second node as at least one third node can quickly transfer the business volume of the first node to at least one third node, ensure the continuity and reliability of the business, and improve the disaster recovery capability of the system.
[0133] It is understandable that by dynamically adjusting the traffic distribution of at least one third node, the load in the network can be effectively balanced to avoid the situation where some nodes are overloaded while other nodes are idle, thereby improving the efficiency and stability of the overall system.
[0134] The business processing method provided in the embodiment of the present application gradually determines the available bearer business volume of the second node according to the takeover sequence, and determines at least one second node corresponding to the actual bearer business volume of the first node whose sum of available bearer business volume is greater than or equal to that of the first node as at least one third node to take over the business of the first node. The business volume distribution between nodes can be dynamically adjusted according to actual conditions to adapt to different network topologies and business requirements, and has good scalability. At the same time, it ensures the maximum utilization of network resources and improves the efficiency and stability of the overall system.
[0135] Figure 5 Schematic diagram of the business processing method provided in the embodiment of the present application Figure 1 .like Figure 5 As shown, the service processing method of the WAP gateway is described, including:
[0136] The WAP gateway establishes a Generic Routing Encapsulation (GRE) tunnel with the corresponding GGSN, SAE-GW, SMF, UPF and other network elements. The GRE tunnel is a network protocol used to create a virtual point-to-point connection between two network nodes, encapsulating multiple different network layer protocols so that they can transmit data through a single tunnel.
[0137] The main WAP gateway, that is, node 1A, performs local disaster recovery with node 1B, and node 1A performs remote disaster recovery with node 2A. Therefore, GRE tunnels are configured between network elements in the local disaster recovery area and the remote disaster recovery area. In addition, each network element establishes GRE tunnels with three WAP gateway nodes respectively. Therefore, according to the priority relationship of the nodes, the main tunnel is between node 1A and the network element, the backup 1 tunnel is between node 1B and the network element, and the backup 2 tunnel is between node 2A and the network element. The priority of the GRE tunnel of each network element is set in the order of main>backup 1>backup 2.
[0138] When node 1A is in a normal state, the network element corresponding to the mobile phone user exchanges data with node 1A through the main tunnel. When node 1A is in a faulty state, it switches to the backup 1 tunnel according to the priority relationship of the GRE tunnel to continue data transmission.
[0139] The service processing method provided in the embodiment of the present application determines the priority of the node according to its location information, and sets the priority of the GRE tunnel at the same time, so that when data is exchanged between the network element and the node through the tunnel, it can prevent the failure of the main node and improve the reliability and availability of the system.
[0140] Based on the above embodiments, Figure 6 The interactive diagram of the business processing method provided in the embodiment of the present application. Figure 6 As shown, the process of interaction between the WAP gateway and other components of the business system includes:
[0141] During normal Internet access, the primary WAP gateway is in normal status. Mobile phone users initiate mobile Internet access requests to the primary WAP gateway through network elements such as GGSN / SAE-GW / SMF / UPF. The primary WAP gateway queries the DNS server or EnumDNS server, which returns the website or MMS center IP address. As a result, the primary WAP gateway acts as a service agent, and business traffic interacts between the mobile phone user and the primary WAP gateway. At the same time, business traffic interacts between the primary WAP gateway and business components such as Internet services, MMS services, and digital text messages to complete the mobile phone user's Internet access services.
[0142] When the active WAP gateway fails, the network element senses that the availability of the active WAP gateway tunnel (active tunnel) is in a failed state, thereby enabling the standby WAP gateway tunnel (standby 1 tunnel) to connect. After the switch is completed, the standby WAP gateway performs service processing. The interaction process is as above, and this embodiment will not be repeated here. In extreme cases, when two node WAP gateways in the same area fail, the network element actively discovers the failure and automatically switches to the standby 2 tunnel.
[0143] The service processing method provided in the embodiment of the present application completes the required service interaction through the collaborative work between mobile phone users, network elements such as GGSN / SAE-GW / SMF / UPF, active WAP gateways, backup WAP gateways, DNS servers or EnumDNS servers, Internet services, MMS services, digital text messages and other service components, and takes over the services of the active WAP gateway through the backup WAP gateway, ensuring that data packets can be correctly transmitted and processed to meet the user's service needs.
[0144] Based on the above embodiments, Figure 7Schematic diagram of the business processing method provided in the embodiment of the present application Figure 2 .like Figure 7 As shown in the figure, the business processing method for actively offline and point-by-point upgrade of a single node is described, including:
[0145] When node 1A needs to be upgraded, the relevant links of node 1B are manually activated, and node 1A is shut down to automatically switch the services of node 1A to the backup node 1B. Furthermore, if node 1B fails, the services are switched to node 2A. After the upgrade test is completed, the corresponding external service links of node 1A are manually activated, and the services of the original node can be automatically switched back to the node. Accordingly, when the four nodes are upgraded, they can be cut over in sequence: the first cutover (node 1A); the second cutover (node 1B); the third cutover (node 2A); the fourth cutover (node 2B), and the external IP addresses and connections of each node remain unchanged.
[0146] It is understandable that when node 1A is out of service, the remaining nodes perform disaster recovery switching according to a preset takeover sequence, so that the tester has enough time to repair or upgrade the node.
[0147] The business processing method provided in the embodiment of the present application switches between nodes according to a preset takeover sequence, thereby upgrading nodes in sequence, which can improve the efficiency of node upgrades, reduce network delays during node upgrades, and reduce business interruption time.
[0148] Based on the above embodiments, Figure 8 Schematic diagram of each node provided in the embodiment of the present application. Figure 8 As shown, including:
[0149] Centralized 1A nodes, centralized 1B nodes, centralized 2A nodes, and centralized 2B nodes, among which the design capacity of each node is to carry 50% of the load of the entire network, and the actual daily business volume is 25% of the load of the entire network. Centralized 1A nodes and centralized 1B nodes, centralized 2A nodes, and centralized 2B nodes perform local disaster recovery, and centralized 1A nodes and centralized 2A nodes, centralized 1B nodes and centralized 2B nodes perform remote disaster recovery.
[0150] It can be understood that when a node fails, its load is automatically switched to the local disaster recovery node of the node. The other two nodes are not affected and each carries 25% of the load of the entire network. The local disaster recovery node carries 50% of the load of the entire network. When any two nodes fail at the same time, the other two nodes take over the business and each carries 50% of the load of the entire network.
[0151] Each node provided in the embodiment of the present application forms a dual disaster recovery protection mechanism through local disaster recovery and remote disaster recovery, which reduces the impact of single point failures and regional disasters on the system and improves the overall risk resistance of the system. At the same time, the design capacity of each node is 50% of the load of the entire network, while the actual business volume carried is only 25%, which means that even if a node fails completely, the remaining nodes can still carry the business load of the entire network, ensuring the continuity and reliability of the business. The surplus capacity design of each node also provides sufficient room for load balancing, so that the load distribution can be dynamically adjusted according to actual business needs to optimize resource utilization.
[0152] Fig. 9 This is a schematic diagram of the structure of the service processing device provided in the embodiment of the present application. Fig. 9 As shown, the service processing device 40 includes:
[0153] The sorting module 401 is used to sort at least one second node to obtain a takeover sequence when it is detected that the first node is in a fault state, wherein the takeover sequence includes: at least one second node arranged in descending order of priority determined based on the position information of each node;
[0154] A determination module 402, configured to determine at least one third node in a takeover sequence according to the actual traffic carried by the first node;
[0155] The switching module 403 is used to switch the service on the first node to at least one third node for taking over.
[0156] Optionally, the sorting module 401 is specifically configured to:
[0157] According to the location information of each node, determine, at at least one second node, N fourth nodes that belong to the same area as the first node and M fifth nodes that do not belong to the same area as the first node, where N and M are integers;
[0158] For each fourth node and each fifth node, respectively determine the distance between the node and the first node;
[0159] Arrange the fourth nodes in ascending order according to the distance to obtain a first sequence, and arrange the fifth nodes in ascending order according to the distance to obtain a second sequence;
[0160] The second sequence is connected to the first sequence to obtain a takeover sequence.
[0161] Optionally, the determination module 402 is specifically configured to:
[0162] According to the actual bearer traffic volume of the first node, the available bearer traffic volume of at least one second node is determined in sequence from the front to the back in the takeover sequence, and the determination is stopped when the sum of the determined available bearer traffic volumes is greater than or equal to the actual bearer traffic volume of the first node, and for each second node, the available bearer traffic volume of the second node is determined based on the preset service capacity of the second node and the actual bearer traffic volume of the second node;
[0163] At least one second node corresponding to which the sum of available bearer traffic is greater than or equal to the actual bearer traffic of the first node is determined as at least one third node.
[0164] Optionally, it also includes:
[0165] A detection module, used to detect the status of each second node;
[0166] A second node in a normal state is used as at least one second node.
[0167] Optionally, the switching module 403 is specifically configured to:
[0168] In response to a user's service demand, at least one third node is controlled to perform service processing according to an IP address corresponding to the service demand.
[0169] Optionally, the switching module 403 is further configured to:
[0170] When it is detected that the first node is in a normal state, the service on the at least one third node is switched back to the first node.
[0171] The service processing device provided in this embodiment can execute the method provided in the above method embodiment. Its implementation principle and technical effect are similar, and this embodiment will not be described in detail here.
[0172] Fig.10 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. Fig.10 As shown, the electronic device 50 provided in the embodiment of the present application includes: at least one processor 501 and a memory 502. The electronic device 50 also includes a communication component 503. The processor 501, the memory 502 and the communication component 503 are connected via a bus 504.
[0173] In a specific implementation process, at least one processor 501 executes the computer execution instructions stored in the memory 502, so that at least one processor 501 executes the above-mentioned business processing method.
[0174] The specific implementation process of the processor 501 can be found in the above-mentioned method embodiment, and its implementation principle and technical effect are similar, so the embodiments of the present application will not be repeated here.
[0175] In the above embodiments, it should be understood that the processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), etc. A general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc. The steps of the method disclosed in the present application may be directly embodied as being executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor.
[0176] The memory may include a high-speed memory (Random Access Memory, RAM), and may also include a non-volatile memory (Non-volatile Memory, NVM), such as at least one disk memory.
[0177] The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, the bus in the drawings of the present application is not limited to only one bus or one type of bus.
[0178] The present application also provides a computer program product, including a computer program, which implements the above-mentioned business processing method when executed by a processor.
[0179] The present application also provides a computer-readable storage medium, in which computer-executable instructions are stored. When a processor executes the computer-executable instructions, the above-mentioned business processing method is implemented.
[0180] The specific implementation of the above operations can be found in the previous embodiments, which will not be described in detail here.
[0181] A person of ordinary skill in the art will appreciate that all or part of the steps in the various methods of the above embodiments may be completed by instructions, or by controlling related hardware through instructions. The instructions may be stored in a computer-readable storage medium and loaded and executed by a processor.
[0182] To this end, an embodiment of the present application provides a computer-readable storage medium, in which multiple instructions are stored. The instructions can be loaded by a processor to execute the steps in any business processing method provided in the embodiment of the present application.
[0183] The storage medium may include: a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.
[0184] According to one aspect of the present application, a computer program product or a computer program is provided. The computer program product or the computer program comprises computer instructions stored in a computer-readable storage medium.
[0185] Since the instructions stored in the storage medium can execute the steps in any business processing method provided in the embodiments of the present application, the beneficial effects that can be achieved by any business processing method provided in the embodiments of the present application can be achieved. Please refer to the previous embodiments for details and will not be repeated here.
[0186] It should be noted that, for the aforementioned method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that the present application is not limited by the described order of actions, because according to the present application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all optional embodiments, and the actions and modules involved are not necessarily required by the present application.
[0187] It should be further noted that, although the various steps in the flowchart are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless there is a clear description in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the flowchart may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these sub-steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
[0188] It should be understood that the above-mentioned device embodiments are only illustrative, and the device of the present application can also be implemented in other ways. For example, the division of units / modules in the above-mentioned embodiments is only a logical function division, and there may be other division methods in actual implementation. For example, multiple units, modules or components can be combined, or can be integrated into another system, or some features can be ignored or not executed.
[0189] In addition, unless otherwise specified, each functional unit / module in each embodiment of the present application may be integrated into one unit / module, each unit / module may exist physically separately, or two or more units / modules may be integrated together. The above-mentioned integrated unit / module may be implemented in the form of hardware or in the form of a software program module.
[0190] If the integrated unit / module is implemented in the form of hardware, the hardware may be a digital circuit, an analog circuit, etc. The physical implementation of the hardware structure includes but is not limited to transistors, memristors, etc. If not specifically stated, the processor may be any appropriate hardware processor, such as a CPU, a GPU, an FPGA, a DSP, and an ASIC, etc. If not specifically stated, the storage unit may be any appropriate magnetic storage medium or magneto-optical storage medium, such as Resistive Random Access Memory (RRAM), Dynamic Random Access Memory (DRAM), Static Random-Access Memory (SRAM), Enhanced Dynamic Random Access Memory (EDRAM), High-Bandwidth Memory (HBM), Hybrid Memory Cube (HMC), etc.
[0191] If the integrated unit / module is implemented in the form of a software program module and sold or used as an independent product, it can be stored in a computer-readable memory. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, which is stored in a memory and includes several instructions for a computer device (which can be a personal computer, server or network device, etc.) to execute all or part of the steps of the methods of each embodiment of the present application.
[0192] In the above embodiments, the description of each embodiment has its own emphasis. For parts not described in detail in a certain embodiment, please refer to the relevant description of other embodiments. The technical features of the above embodiments can be combined arbitrarily. In order to make the description concise, all possible combinations of the technical features in the above embodiments are not 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.
[0193] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the invention disclosed herein. The present application is intended to cover any modification, use or adaptation of the present application, which follows the general principles of the present application and includes common knowledge or customary techniques in the art that are not disclosed in the present application. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present application are indicated by the following claims.
[0194] It should be understood that the present application is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.
Claims
1. A business processing method, characterized in that: include: When it is detected that the first node is in a fault state, at least one second node is sorted to obtain a takeover sequence, wherein the takeover sequence includes: at least one second node arranged in descending order of priority determined based on position information of each node; Determining at least one third node in the takeover sequence according to the actual traffic carried by the first node; The service on the first node is switched to the at least one third node for taking over.
2. The method according to claim 1, characterized in that The step of sorting at least one second node to obtain a takeover sequence includes: According to the location information of each node, determine, at the at least one second node, N fourth nodes that belong to the same area as the first node and M fifth nodes that do not belong to the same area as the first node, where N and M are integers; For each fourth node and each fifth node, respectively determine the distance between the fourth node and the first node; Arrange the fourth nodes in ascending order according to the distance to obtain a first sequence, and arrange the fifth nodes in ascending order according to the distance to obtain a second sequence; The second sequence is connected to the first sequence to obtain the takeover sequence.
3. The method according to claim 1 or 2, characterized in that: The determining, according to the actual traffic carried by the first node, at least one third node in the takeover sequence comprises: According to the actual bearer traffic volume of the first node, the available bearer traffic volume of at least one second node is determined in sequence from the front to the back in the takeover sequence, and the determination is stopped when the sum of the determined available bearer traffic volumes is greater than or equal to the actual bearer traffic volume of the first node, and for each second node, the available bearer traffic volume of the second node is determined based on the preset service capacity of the second node and the actual bearer traffic volume of the second node; At least one second node corresponding to which the sum of the available bearer traffic is greater than or equal to the actual bearer traffic of the first node is determined as the at least one third node.
4. The method according to claim 1, characterized in that Before sorting the at least one second node to obtain a takeover sequence, the method further includes: detecting a state of each second node; A second node in a normal state is used as the at least one second node.
5. The method according to claim 1, characterized in that The switching the service on the first node to the at least one third node for taking over includes: In response to a service demand of a user, the at least one third node is controlled to perform service processing according to an IP address corresponding to the service demand.
6. The method according to claim 1 or 5, characterized in that: After switching the service on the first node to the at least one third node for taking over, the method further includes: When it is detected that the first node is in a normal state, the service on the at least one third node is switched back to the first node.
7. A service processing device, characterized in that: include: A sorting module, configured to sort at least one second node to obtain a takeover sequence when detecting that the first node is in a fault state, wherein the takeover sequence includes: at least one second node arranged in descending order of priority determined based on location information of each node; A determination module, configured to determine at least one third node in the takeover sequence according to the actual traffic carried by the first node; The switching module is used to switch the service on the first node to the at least one third node for taking over.
8. An electronic device, characterized in that: include: A processor, and a memory communicatively connected to the processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory to implement the business processing method according to any one of claims 1 to 6.
9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are executed by a processor, they are used to implement the business processing method according to any one of claims 1 to 6.
10. A computer program product, characterized in that It comprises a computer program, which is used to implement the business processing method according to any one of claims 1 to 6 when executed by a processor.
