CN116723154B - Route distribution method and system based on load balancing - Google Patents
Route distribution method and system based on load balancing Download PDFInfo
- Publication number
- CN116723154B CN116723154B CN202310811120.9A CN202310811120A CN116723154B CN 116723154 B CN116723154 B CN 116723154B CN 202310811120 A CN202310811120 A CN 202310811120A CN 116723154 B CN116723154 B CN 116723154B
- Authority
- CN
- China
- Prior art keywords
- data
- service
- thread
- route
- preset
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 57
- 238000012544 monitoring process Methods 0.000 claims abstract description 37
- 238000004891 communication Methods 0.000 claims abstract description 19
- 238000004422 calculation algorithm Methods 0.000 claims description 49
- 230000008569 process Effects 0.000 claims description 25
- 238000012545 processing Methods 0.000 claims description 12
- 238000013507 mapping Methods 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 8
- 238000012550 audit Methods 0.000 claims description 4
- 230000004927 fusion Effects 0.000 claims description 4
- 230000006870 function Effects 0.000 description 11
- 230000007246 mechanism Effects 0.000 description 9
- 230000005540 biological transmission Effects 0.000 description 5
- 238000013473 artificial intelligence Methods 0.000 description 4
- 238000001514 detection method Methods 0.000 description 4
- 238000007726 management method Methods 0.000 description 4
- 230000002159 abnormal effect Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 239000011159 matrix material Substances 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 238000012384 transportation and delivery Methods 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000009792 diffusion process Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/30—Routing of multiclass traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/2866—Architectures; Arrangements
- H04L67/30—Profiles
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to the technical field of network communication, and discloses a route distribution method and a system based on load balancing, wherein the method comprises the following steps: classifying the service of the service message data content, and configuring the service parameters according to the type of the service message data content to obtain a service parameter configuration file; calling a resource scheduling thread group according to a service identification code in a service parameter configuration file, and monitoring thread state data of working threads in the resource scheduling thread group; carrying out data sharing on the thread state data to obtain shared thread state data, and extracting thread flow data in the shared thread state data; selecting an optimal route according to the service message data content type and the thread flow data, and carrying out service classification on the service message data content to obtain a service message data content level; generating a route distribution path according to the optimal route, and carrying out route distribution according to the route distribution path and the data content level of the service message. The invention can improve the flow distribution balance degree during route distribution.
Description
Technical Field
The present invention relates to the field of network communications technologies, and in particular, to a method and a system for distributing routes based on load balancing.
Background
At present, IT systems of domestic enterprises mostly adopt micro-service and distributed system architecture, and remote services or resources are usually required to be called or operated, and the remote services or resources are required to be analyzed for load-balanced route distribution due to uncontrollable reasons of callers, such as failure of remote resource call caused by slow network connection and occupied resources.
The existing route distribution technology realizes the control of the concurrent quantity through a process pool or a thread pool which is fixedly or dynamically created, thereby realizing the route distribution. However, in practical application, flow control can be realized according to customized data content and flow balance distribution, so that route distribution is performed, flow control is performed only through a single process pool, a realization mechanism is simple, and the flow distribution balance degree in the process of route distribution is low.
Disclosure of Invention
The invention provides a route distribution method and a system based on load balancing, which mainly aim to solve the problem of low flow distribution balance degree during route distribution.
In order to achieve the above object, the present invention provides a route distribution method based on load balancing, including:
s1, acquiring service message data content, classifying the service message data content to obtain a service message data content type, and configuring service parameters according to the service message data content type to obtain a service parameter configuration file;
S2, calling a resource scheduling thread group according to the service identification code in the service parameter configuration file, and monitoring thread state data of working threads in the resource scheduling thread group by using a preset state monitoring algorithm;
S3, carrying out data sharing on the thread state data through a preset shared data area to obtain shared thread state data, and extracting thread flow data in the shared thread state data;
S4, selecting an optimal route according to the service message data content type and the thread flow data by utilizing a preset intelligent routing algorithm, and carrying out service classification on the service message data content to obtain a service message data content level;
S5, generating a route distribution path according to the optimal route, and carrying out route distribution according to the route distribution path and the service message data content level, wherein the route distribution according to the route distribution path and the service message data content level comprises the following steps:
S51, determining service priority according to the content level of the service message data;
S52, forwarding the data content of the service message corresponding to the data content level of the service message according to the service priority to obtain a data route distribution path in the route distribution paths;
S53, calculating the data packet distribution flow in the data route distribution path by using the following data packet flow calculation formula:
wherein q is the flow allocated to the data packet, For the packet size in the data route distribution path, R p is the minimum bandwidth remaining in the data route distribution path p, T p is the delay in the data route distribution path p,E p is the used bandwidth in the data route distribution path p, and E is a link bandwidth threshold;
And S54, carrying out route distribution according to the data route distribution path according to the data packet distribution flow.
Optionally, the classifying the service message data content to obtain a service message data content type includes:
Carrying out standardized processing on the service message data content to obtain standard service message data content;
extracting service attribute fields in the data content of the standard service message;
And classifying the service attribute of the service attribute field according to a preset service classification requirement to obtain the content type of the service message data.
Optionally, the configuring the service parameters according to the content type of the service message data to obtain a service parameter configuration file includes:
determining a service identification code according to the content type of the service message data;
Generating a service parameter field according to the service identification code and a preset service requirement;
acquiring service logic corresponding to the service parameter field, and generating a service parameter mapping rule according to the service parameter field and the service logic;
And configuring a parameter file according to the service parameter mapping rule to obtain the service parameter configuration file.
Optionally, the calling the resource scheduling thread group according to the service identification code in the service parameter configuration file includes:
Acquiring a business service thread identifier in the resource scheduling thread group;
Calculating the editing distance between the business identification code and the business service thread identifier by using a preset full matching algorithm, wherein the full matching algorithm is as follows:
D(i,j)＝min(D(i-1,j)+1,D(i,j-1)+1,D(i-1,j-1)+c(i,j)
Wherein D (i, j) is the edit distance between the ith character of the service identification code and the jth character of the service thread identification, D (i-1, j) is the edit distance between the ith character of the service identification code and the jth character of the service thread identification, D (i, j-1) is the edit distance between the ith character of the service identification code and the jth-1 character of the service thread identification, D (i-1, j-1) is the edit distance between the ith-1 character of the service identification code and the jth-1 character of the service thread identification, and c (i, j) is the consistent value between the ith character of the service identification code and the jth character of the service thread identification;
Performing iterative computation according to the editing distance to obtain a service identifier editing distance;
selecting the business service thread identifier with zero business identifier editing distance as a resource scheduling thread group;
And calling the resource scheduling thread group through a preset thread interface.
Optionally, the monitoring the thread status data of the working threads in the resource scheduling thread group by using a preset status monitoring algorithm includes:
extracting the resource occupation state data of the working thread through a preset resource occupation interface;
extracting service log state data of the working thread through a preset audit log;
monitoring information flow state data of the working thread by using a preset network protocol;
And carrying out state fusion on the resource occupation state data, the service log state data and the information flow state data by using a state monitoring algorithm as follows to obtain thread state data:
P＝{P1,P2,P3}
Wherein, P is the thread state data, P 1 is the resource occupancy state data, P 2 is the service log state data, and P 3 is the information flow state data.
Optionally, the data sharing the thread state data through a preset shared data area to obtain shared thread state data includes:
Storing the thread state data to the shared data area;
Accessing the thread state data of the shared data area through a preset pointer to obtain thread access data;
And carrying out data synchronization on the thread access data and the thread state data to obtain the shared thread state data.
Optionally, the extracting thread flow data in the shared thread state data includes:
Acquiring a data packet in the shared thread state data;
Extracting the data packet size and the data packet number in the data packet;
calculating the thread flow data according to the data packet size, the data packet number and a preset data protocol attribute, wherein a calculation formula of the thread flow data is as follows:
U＝A×S+γ+(B1×S1)+(B2×S2)
Wherein U is the thread flow data, a is the protocol overhead in the data protocol attribute, S is the number of data packets, γ is the data packet payload size, B 1 is the data packet size, S 1 is the number of successfully transmitted data packets, B 2 is the retransmission data packet size, and S 2 is the retransmission data packet number.
Optionally, the selecting, by using a preset intelligent routing algorithm, an optimal route according to the content type of the service packet data and the thread flow data includes:
Inquiring whether a preset idle service process exists or not according to the data content type of the service message;
When the idle service process exists, inquiring whether a preset working thread exists in a preset working thread pool or not through the intelligent routing algorithm;
when the working thread exists, an optimal route is selected according to the thread flow data and preset route parameters.
Optionally, the selecting the optimal route according to the thread flow data and the preset route parameter includes:
Generating a routing attribute table according to the thread flow data and the routing parameters, wherein the routing attribute in the routing attribute table is as follows:
V＝{v1,v2,v3,v4,v5}
Wherein V is the routing attribute, V 1 is the reliability in the routing attribute, V 2 is the delay in the routing attribute, V 3 is the bandwidth in the routing attribute, V 4 is the communication quality in the routing attribute, and V 5 is the routing distance in the routing attribute;
Determining a target route in the route attribute table according to a preset route attribute of the source route;
And selecting the route with the highest route attribute in the target routes as the optimal route.
In order to solve the above problems, the present invention further provides a route distribution system based on load balancing, the system comprising:
The service parameter configuration file generation module is used for acquiring service message data contents, classifying the service message data contents to obtain service message data content types, and carrying out service parameter configuration according to the service message data content types to obtain service parameter configuration files;
The thread state data monitoring module is used for calling a resource scheduling thread group according to the service identification code in the service parameter configuration file and monitoring thread state data of working threads in the resource scheduling thread group by using a preset state monitoring algorithm;
the thread state data sharing module is used for carrying out data sharing on the thread state data through a preset shared data area to obtain shared thread state data, and extracting thread flow data in the shared thread state data;
The optimal route selection module is used for selecting an optimal route according to the service message data content type and the thread flow data by utilizing a preset intelligent route algorithm, and carrying out service classification on the service message data content to obtain a service message data content level;
And the route distribution module is used for generating a route distribution path according to the optimal route and carrying out route distribution according to the route distribution path and the service message data content level.
The embodiment of the invention carries out transaction-level parameter configuration through the data content type of the service message, which is beneficial to providing customized data flow control; service processes can be started for different transactions according to the service parameter configuration file, so that thread state data of a working thread are obtained; the CDA shared data area realizes the functions of data driving and synchronization, and intervenes in time; the optimal route for transmitting the data content of the service message is selected through the intelligent routing algorithm, a route distribution path is generated according to the optimal route, and the route distribution of load balance is realized according to the route distribution path, so that the transaction-level route selection and flow control are realized, and the method has the characteristics of stability, high efficiency and heat deployment. Therefore, the route distribution method and system based on the load balancing can solve the problem of low flow distribution balance degree when route distribution is carried out.
Drawings
Fig. 1 is a flow chart of a route distribution method based on load balancing according to an embodiment of the present invention;
FIG. 2 is a flow chart of monitoring thread status data according to an embodiment of the present invention;
FIG. 3 is a flow chart illustrating sharing thread status data according to an embodiment of the present invention;
Fig. 4 is a functional block diagram of a load balancing-based route distribution system according to an embodiment of the present invention.
The achievement of the objects, functional features and advantages of the present invention will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
The embodiment of the application provides a route distribution method based on load balancing. The execution body of the route distribution method based on load balancing includes, but is not limited to, at least one of a server, a terminal and the like which can be configured to execute the method provided by the embodiment of the application. In other words, the load balancing-based route distribution method may be performed by software or hardware installed in a terminal device or a server device, and the software may be a blockchain platform. The service end includes but is not limited to: a single server, a server cluster, a cloud server or a cloud server cluster, and the like. The server may be an independent server, or may be a cloud server that provides cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (Content Delivery Network, CDN), and basic cloud computing services such as big data and artificial intelligence platforms.
Referring to fig. 1, a flow chart of a route distribution method based on load balancing according to an embodiment of the present invention is shown. In this embodiment, the route distribution method based on load balancing includes:
s1, acquiring service message data content, classifying the service message data content to obtain a service message data content type, and configuring service parameters according to the service message data content type to obtain a service parameter configuration file.
In the embodiment of the invention, the data content of the service message mainly refers to the data content of a transaction message, wherein the data content of the transaction message is a message used when a transaction is carried out in a computer, and comprises various information which needs to be exchanged by both transaction parties, including a message header, transaction data, transaction verification information, transaction state and additional information, wherein the message header provides some meta information about data for a receiver so as to help the receiver to correctly analyze the message, such as transaction type, transaction number, message length, timestamp, encryption information and the like; the transaction data is mainly used for describing information of both sides of the transaction, such as transaction amount, transaction time and product information; the transaction verification information is used for verifying the validity of the transaction; the transaction state is used for recording the state of the current transaction; the additional information is other information in the transaction message, such as request approval, transaction details, order information, etc.
In detail, the service message data content may be obtained from a pre-stored storage area including, but not limited to, a database, a blockchain, by a computer sentence having a data grabbing function (e.g., java sentence, python sentence, etc.).
Further, in order to initiate a service process for different transactions, the service type of the data content of the service message needs to be analyzed.
In the embodiment of the invention, the service message data content types comprise financial transactions, electronic commerce transactions, real-time transactions, internet advertisement transactions, subscription transactions, telecommunication transactions and internet of things transactions, and service classification is performed according to key attribute fields in each service message data content.
In the embodiment of the present invention, the classifying the service message data content to obtain the service message data content type includes:
Carrying out standardized processing on the service message data content to obtain standard service message data content;
extracting service attribute fields in the data content of the standard service message;
And classifying the service attribute of the service attribute field according to a preset service classification requirement to obtain the content type of the service message data.
In detail, the standardized data element refers to that a universal identifier and definition are adopted to perform standard definition and description on data elements commonly used in different transaction message data contents, so that the comparability and consistency of transaction data can be promoted, the data quality and accuracy are improved, and therefore, the standardized processing is required to be performed on the service message data contents to obtain standard service message data contents with unique identifiers, so that service attribute fields in the standard service message data contents are extracted, and if the service message data contents relate to financial transactions, the service attribute fields are SWT.
Specifically, the business category corresponding to the business message data content is classified according to the business attribute field according to the business classification rule requirement, wherein the business classification rule requirement is to match the business attribute field in each business message data content with a preset business transaction identification code by adopting a matching rule so as to realize business classification in each business message data content, thereby obtaining the business message data content type.
Further, in order to achieve customized flow control, it is necessary to achieve flow control in a transaction-level, high concurrency scenario through transaction parameter customization, and therefore, it is necessary to configure service parameters.
In the embodiment of the invention, the service parameter configuration file comprises transaction message data content and corresponding transaction parameter configuration so as to ensure that a network can support different types of transactions.
In the embodiment of the present invention, the configuring the service parameters according to the content type of the service message data to obtain a service parameter configuration file includes:
determining a service identification code according to the content type of the service message data;
Generating a service parameter field according to the service identification code and a preset service requirement;
acquiring service logic corresponding to the service parameter field, and generating a service parameter mapping rule according to the service parameter field and the service logic;
And configuring a parameter file according to the service parameter mapping rule to obtain the service parameter configuration file.
In detail, the service identifier is an identifier for uniquely determining the data content type of the service message, that is, each data content type of the service message corresponds to one service identifier, and further different service parameter fields can be generated according to the service identifier, that is, a preset service requirement, so as to perform parameter configuration, wherein the service parameter fields comprise transaction flow control parameter configuration, communication control parameter setting, fault processing and automatic recovery mechanisms, automatic response setting, heartbeat detection mechanism, link resource scheduling mechanism, error code automatic matching list, intelligent routing algorithm selection, monitoring mechanism setting and the like; the system also comprises a parameter detection and correction program, a parameter loading and unloading program, a service start-stop program and the like which are matched with the system, wherein the transaction flow control parameter is configured to limit the number of requests of the service in a period of time so as to ensure that the service can stably run in a certain period of time; the communication control parameter is set for setting a communication protocol and related parameters thereof, so that data can be transmitted on a network; the fault processing and automatic recovery mechanism detects system faults and rapidly recovers fault paths to ensure the conventional use of the system; the automatic response arrangement is used to automatically respond to certain specific requests to alleviate the workload of the operator; the heartbeat detection mechanism is used for monitoring the state of the system in real time, and sending out an abnormal alarm when the system is abnormal and exceeds a certain time period; the link resource scheduling mechanism is used for centrally managing the service conditions of each service link and providing scheduling management of priority; the error code automatic matching list is used for automatically judging and processing various common error code types so as to quickly respond to fault conditions; the intelligent routing algorithm is selected to automatically realize the optimal routing of the server according to different service requirements; the monitoring mechanism is set for monitoring the running condition of each service and the resource use condition of different machines in real time so as to ensure the normal operation of the system.
Specifically, the service logic refers to the parameter content corresponding to each service parameter field, for example, the parameter content in the transaction flow control parameter configuration is the transaction request quantity; the parameter content in the communication control parameter configuration is a communication protocol, and further a service parameter mapping rule is generated according to the service parameter field and the service parameter content, wherein the service parameter mapping rule comprises transaction flow control parameters-transaction request quantity; and configuring a service parameter file according to the service parameter mapping rule by using a communication control parameter-communication protocol and the like, thereby obtaining the service parameter configuration file.
Further, in a high concurrency state, resource scheduling management is a very critical function, and different service processes can be called by different service identification codes so as to realize transaction-level flow control.
S2, calling a resource scheduling thread group according to the service identification code in the service parameter configuration file, and monitoring thread state data of working threads in the resource scheduling thread group by using a preset state monitoring algorithm.
In the embodiment of the invention, the resource scheduling thread group comprises a resource initializing thread, a message queue resource management thread, a working state statistics and data synchronization thread, a remote service resource detection thread and the like, and can control and collect the state data of the working thread in real time according to embedded resource scheduling.
In the embodiment of the present invention, the calling the resource scheduling thread group according to the service identifier in the service parameter configuration file includes:
Acquiring a business service thread identifier in the resource scheduling thread group;
Calculating the editing distance between the business identification code and the business service thread identifier by using a preset full matching algorithm, wherein the full matching algorithm is as follows:
D(i,j)＝min(D(i-1,j)+1,D(i,j-1)+1,D(i-1,j-1)+c(i,j)
Wherein D (i, j) is the edit distance between the ith character of the service identification code and the jth character of the service thread identification, D (i-1, j) is the edit distance between the ith character of the service identification code and the jth character of the service thread identification, D (i, j-1) is the edit distance between the ith character of the service identification code and the jth-1 character of the service thread identification, D (i-1, j-1) is the edit distance between the ith-1 character of the service identification code and the jth-1 character of the service thread identification, and c (i, j) is the consistent value between the ith character of the service identification code and the jth character of the service thread identification;
Performing iterative computation according to the editing distance to obtain a service identifier editing distance;
selecting the business service thread identifier with zero business identifier editing distance as a resource scheduling thread group;
And calling the resource scheduling thread group through a preset thread interface.
In detail, the service thread identifier refers to a service transaction identifier corresponding to each thread group in the resource scheduling thread group, and the service identifier in the resource scheduling thread group can be grabbed from preset resource scheduling parameters, so that the service identifier in the service parameter configuration file and the service thread identifier are subjected to character matching, wherein the full matching algorithm refers to an edit distance algorithm, an algorithm for comparing the similarity of two character strings is adopted, and the distance between the two character strings is measured by calculating the minimum edit operation (replacement, deletion and insertion) times required by programming one character string into the other character string.
Specifically, a two-dimensional matrix is generated by the service identification code and the service thread identification, element values in the two-dimensional matrix are iterated continuously through a full matching algorithm until the last element value in the two-dimensional matrix is obtained, when the service identification editing distance of the last element is zero, the service identification code is completely matched with the service thread identification, the service thread identification is used as a resource scheduling thread group, and the resource scheduling thread group is called through the port number of the resource scheduling thread group.
Further, the thread working state can be monitored in real time through the working state statistics and data synchronization threads in the resource scheduling thread group, so that corresponding measures can be taken in time.
In the embodiment of the invention, the thread state data comprises the running state of the service, the processing capacity, the resource use condition, the error information, the log information and the like.
In an embodiment of the present invention, referring to fig. 2, the monitoring, by using a preset state monitoring algorithm, of thread state data of a working thread in the resource scheduling thread group includes:
S21, extracting the resource occupation state data of the working thread through a preset resource occupation interface;
s22, extracting service log state data of the working thread through a preset audit log;
S23, monitoring information flow state data of the working thread by using a preset network protocol;
s24, carrying out state fusion on the resource occupation state data, the service log state data and the information flow state data by using a state monitoring algorithm as described below to obtain thread state data:
P＝{P1,P2,P3}
Wherein, P is the thread state data, P 1 is the resource occupancy state data, P 2 is the service log state data, and P 3 is the information flow state data.
In detail, the resource occupation interface includes system command or API interface extracting network bandwidth, memory, disk and CPU resource occupation state data of working thread; the audit log is a log which can collect different types of logs such as a system log, an application program log, a security log and the like on a server and can extract various error log information and abnormal information in a working thread; the network monitoring protocol (SNMP) may be used to monitor information flows between network devices, applications, and servers and to generate and report network conditions and event information, such as performance metrics, network traffic, connection status, etc., in real-time.
Specifically, the monitored resource occupation state data, service log state data and information flow state data are subjected to data fusion by using a state monitoring algorithm, namely, the resource occupation state data, the service log state data and the information flow state data are subjected to data splicing to obtain thread state data.
Furthermore, each service is embedded with an independent resource scheduling module, various states can be actively collected and written into the CDA, the monitoring program can detect the service state in real time through the CDA and intervene, and the CDA shares a data area, so that the real-time and non-invasive service and resource monitoring functions are realized.
S3, carrying out data sharing on the thread state data through a preset shared data area to obtain shared thread state data, and extracting thread flow data in the shared thread state data.
In the embodiment of the invention, the shared data area (CAD) can realize the functions of data driving and synchronization, and after the configuration parameters are changed, the hot deployment can be completed through the CDA data area without restarting. Sharing data between different threads can be achieved by sharing the data region.
In the embodiment of the present invention, referring to fig. 3, the data sharing of the thread state data through a preset shared data area to obtain shared thread state data includes:
S31, storing the thread state data into the shared data area;
s32, accessing the thread state data of the shared data area through a preset pointer to obtain thread access data;
and S33, carrying out data synchronization on the thread access data and the thread state data to obtain the shared thread state data.
In detail, the thread state data is stored into the shared data area through the storage interface of the shared data area, and other threads are disclosed, so that the other threads can read the thread state data from the shared data area, and use the shared data area for thread coordination and scheduling. The shared memory area is accessed in a pointer mode, and because the shared memory area can be accessed by a plurality of processes at the same time, the data access is required to be synchronized, the read-write operation of the threads is ensured not to be interfered with each other, and therefore the stability and the correctness of the program are ensured. The thread access data needs to be data synchronized with the thread state data to obtain shared thread state data.
Further, to implement load-balanced route distribution, traffic needs to be acquired for the service states collected by the shared data area to implement load balancing.
In the embodiment of the present invention, the thread flow data refers to a flow value in each resource scheduling thread group in resource scheduling management, so that a flow control service can be embedded into various systems with high concurrency processing, various communication protocols such as HTTP, TCP/IP and the like can be supported, various data formats such as byte streams, XML, JSON, 8583 and the like can be identified, and an automatic response is performed by adopting a specified message format. The traffic control service can complete transaction-level data forwarding and traffic control in a high concurrency state through an intelligent routing algorithm.
In the embodiment of the present invention, the extracting thread flow data in the shared thread state data includes:
Acquiring a data packet in the shared thread state data;
Extracting the data packet size and the data packet number in the data packet;
calculating the thread flow data according to the data packet size, the data packet number and a preset data protocol attribute, wherein a calculation formula of the thread flow data is as follows:
U＝A×S+γ+(B1×S1)+(B2×S2)
Wherein U is the thread flow data, a is the protocol overhead in the data protocol attribute, S is the number of data packets, γ is the data packet payload size, B 1 is the data packet size, S 1 is the number of successfully transmitted data packets, B 2 is the retransmission data packet size, and S 2 is the retransmission data packet number.
In detail, counting the number of data packets and the size of the data packets in the shared thread state data through a network monitoring protocol (SNMP), calculating thread flow data according to the size of the data packets, the number of the data packets and the attribute of a data protocol, and considering the protocol type and data retransmission of network transmission when calculating the thread flow data, wherein the protocol overhead refers to the length of a header and a trailer (footer) of a specific protocol in each data packet, and is generally determined by the definition of a data structure of the protocol; the number of data packets refers to the number of data packets transmitted in a specific time period; the load size refers to the actual transmitted data size in each data packet, the data packet size refers to the transmitted data size of each data packet, the successfully transmitted data packet number is the successfully transmitted data packet number without retransmission, the retransmitted data packet number is the retransmitted data packet number after the data packet is lost, and when calculating the network traffic, the influence of a plurality of factors needs to be considered to obtain an accurate and comprehensive result.
Further, in order to achieve route distribution with load balancing, an optimal data transmission route needs to be selected based on an intelligent oil leakage algorithm in flow control.
S4, selecting an optimal route according to the service message data content type and the thread flow data by utilizing a preset intelligent routing algorithm, and carrying out service classification on the service message data content to obtain a service message data content level.
In the embodiment of the invention, the intelligent routing algorithm is an algorithm for adaptively selecting an optimal route for traffic in a network by analyzing a network topology structure and a network performance condition, and comprises, but is not limited to, a Dijkstra algorithm, a Bellman-Ford algorithm, a mobile agent intelligent routing algorithm and a diffusion algorithm.
In the embodiment of the present invention, the selecting an optimal route according to the content type of the service message data and the thread flow data by using a preset intelligent routing algorithm includes:
Inquiring whether a preset idle service process exists or not according to the data content type of the service message;
When the idle service process exists, inquiring whether a preset working thread exists in a preset working thread pool or not through the intelligent routing algorithm;
when the working thread exists, an optimal route is selected according to the thread flow data and preset route parameters.
In detail, searching an idle service process according to the data content type of the service message for processing, and if the idle service process does not exist, immediately returning an error; if an idle service process exists, after the service process transmits service data to the service process, the service process needs to find a working thread to process the service data by adopting an intelligent routing algorithm after receiving the service data, and if the working thread cannot be found, the service process needs to respond to the service message data and returns to a requesting party; if the working thread exists, the service data is transmitted to the working thread, after the working thread receives the service data, the service data is required to be forwarded to the most suitable receiver according to the pre-configured service parameters, and if the communication fault exists, an error is required to be immediately returned to the requesting party.
Further, the optimal next route is selected according to the thread flow data, so that the route distribution of load balancing is realized, and the purposes of improving the network service capacity and the processing efficiency are achieved.
In the embodiment of the present invention, the selecting the optimal route according to the thread flow data and the preset route parameter includes:
Generating a routing attribute table according to the thread flow data and the routing parameters, wherein the routing attribute in the routing attribute table is as follows:
V＝{v1,v2,v3,v4,v5}
Wherein V is the routing attribute, V 1 is the reliability in the routing attribute, V 2 is the delay in the routing attribute, V 3 is the bandwidth in the routing attribute, V 4 is the communication quality in the routing attribute, and V 5 is the routing distance in the routing attribute;
Determining a target route in the route attribute table according to a preset route attribute of the source route;
And selecting the route with the highest route attribute in the target routes as the optimal route.
In detail, the routing attribute table refers to each routing attribute and routing label, wherein the routing attributes include reliability, delay, bandwidth, communication quality and routing distance, and the reliability refers to the reliability of network communication, and some routers may be more reliable than other routers; delay is the time required for a data packet to travel from the departure point to the destination point; the bandwidth refers to the maximum bandwidth size and communication quality which can be provided by the router to measure the communication quality of the link, including packet loss rate, collision times and the like; the routing distance is determined by calculating the number of hops or distance to reach the target network; the routers may distribute thread traffic data evenly across multiple paths according to a load balancing algorithm to increase throughput, reduce latency, and reduce the likelihood of network congestion.
Specifically, a target route is selected according to the address of the next hop route in the route attributes of the source route, and the route with the highest route attribute in the target route is determined to be the best route of the next hop. If the address of the source route ① is a, the next-hop route address is B, and two routes with the next-hop route address of B are queried in the routing table, namely ② and ③, the route attributes in ② and ③ need to be compared one by one, and if the route attribute ② is { v 21,v22,v23,v24,v25},③ route attribute { v 31,v32,v33,v34,v35 }, the route v21>v31,v22>v32,v23<v33,v24<v34,v25>v35, with larger value in the attribute values is selected, namely the route ② is selected as the best route.
Further, by classifying the transactions, when the bottleneck occurs in the system resource, important transactions can be ensured to be processed preferentially, and the user experience of the whole system is improved, so that service classification is required to be performed on the service message data content according to the importance of the service data to obtain the service message data content level, and the service message data content level is higher as the service transaction data importance is higher, wherein the service transaction data importance is determined through the service flow relevance and the data application value of the service transaction.
And S5, generating a route distribution path according to the optimal route, and carrying out route distribution according to the route distribution path and the service message data content level.
In the embodiment of the invention, the route hop number between the source route and the termination route can be determined according to the route attribute table, the intermediate optimal route is selected, the route distribution path can be obtained by the selected route connection, and if the routes of the intermediate layer possibly have a plurality of identical routes, the route distribution path also has a plurality of route distribution paths.
Further, route distribution is performed according to the route distribution path, so that accurate load balancing and data security can be realized.
In the embodiment of the present invention, the routing distribution according to the routing distribution path and the service packet data content level includes:
determining service priority according to the service message data content level;
Forwarding data of the service message data content corresponding to the service message data content level according to the service priority to obtain a data route distribution path in the route distribution path;
calculating the data packet distribution flow in the data routing distribution path by using the following data packet flow calculation formula:
wherein q is the flow allocated to the data packet, For the packet size in the data route distribution path, R p is the minimum bandwidth remaining in the data route distribution path p, T p is the delay in the data route distribution path p,E p is the used bandwidth in the data route distribution path p, and E is a link bandwidth threshold;
And carrying out route distribution according to the data route distribution path according to the data packet distribution flow.
In detail, the higher the content level of the service message data is, the higher the service priority is, and if the content level of the service message data is high, the service priority is high; if the content level of the service message is low, the service priority is low. Therefore, according to the service priority, which service message data content is preferentially transmitted first, namely, a route distribution path is firstly distributed, and the data route distribution path for data transmission can be obtained.
Specifically, in order to realize load balancing, the traffic on the link needs to be reasonably distributed, so that the data packet distribution traffic on the link needs to be calculated according to a data packet traffic formula, the data packet traffic needs to be distributed to a plurality of paths if the topology structure based on the routing distribution path possibly has a plurality of paths, and when the link bandwidth in any one routing distribution path in the data packet traffic calculation formula is smaller than the link bandwidth threshold, the data maximum transmission rate, namely the throughput, of the data routing distribution path needs to be calculated according to the bandwidth and the time delay, and then the data packet distribution traffic of the data routing distribution path is obtained according to the data packet size; when the bandwidth of the link in one route distribution path is larger than the threshold value of the bandwidth of the link, the utilization rate of the link is calculated according to the congestion value, the bandwidth and the time delay, and the quantity of data packets which can be transmitted is calculated according to the size of the data packets, so that the distribution flow of the data packets can be obtained. In addition, when there is only one path in the data route distribution path, the utilization rate of the link is calculated, and the data packet distribution flow is further calculated according to the data packet size, wherein if the bandwidth and time delay of the network remain unchanged, but the congestion situation becomes more serious, the congestion value increases to 1, and then the utilization rate of the network connection is reduced to 0. As full congestion means that no data packets can be transmitted.
Further, the traffic is distributed to different data flows according to the data packet distribution traffic, and when the data packet on the data flow arrives at the router according to the data route distribution path, the data packet is forwarded to the optimal next router by using the route control protocol and the route table until the data packet on the data flow arrives at the destination, so that the transmission path of the data packet in the network can be dynamically adjusted to effectively utilize network resources, and the problems of congestion, route failure and the like are avoided.
The embodiment of the invention carries out transaction-level parameter configuration through the data content type of the service message, which is beneficial to providing customized data flow control; service processes can be started for different transactions according to the service parameter configuration file, so that thread state data of a working thread are obtained; the CDA shared data area realizes the functions of data driving and synchronization, and intervenes in time; the optimal route for transmitting the data content of the service message is selected through the intelligent routing algorithm, a route distribution path is generated according to the optimal route, and the route distribution of load balance is realized according to the route distribution path, so that the transaction-level route selection and flow control are realized, and the method has the characteristics of stability, high efficiency and heat deployment. Therefore, the route distribution method and system based on the load balancing can solve the problem of low flow distribution balance degree when route distribution is carried out.
Fig. 4 is a functional block diagram of a load balancing-based route distribution system according to an embodiment of the present invention.
The load balancing-based route distribution system 100 of the present invention may be installed in an electronic device. Depending on the functions implemented, the load balancing-based route distribution system 100 may include a traffic parameter profile generation module 101, a thread state data monitoring module 102, a thread state data sharing module 103, an optimal route selection module 104, and a route distribution module 105. The module of the invention, which may also be referred to as a unit, refers to a series of computer program segments, which are stored in the memory of the electronic device, capable of being executed by the processor of the electronic device and of performing a fixed function.
In the present embodiment, the functions concerning the respective modules/units are as follows:
The service parameter configuration file generating module 101 is configured to obtain service message data content, classify the service message data content to obtain a service message data content type, and perform service parameter configuration according to the service message data content type to obtain a service parameter configuration file;
the thread state data monitoring module 102 is configured to invoke a resource scheduling thread group according to a service identifier in the service parameter configuration file, and monitor thread state data of a working thread in the resource scheduling thread group by using a preset state monitoring algorithm;
The thread state data sharing module 103 is configured to perform data sharing on the thread state data through a preset shared data area to obtain shared thread state data, and extract thread flow data in the shared thread state data;
the optimal route selection module 104 is configured to select an optimal route according to the service message data content type and the thread flow data by using a preset intelligent routing algorithm, and perform service classification on the service message data content to obtain a service message data content level;
The route distribution module 105 is configured to generate a route distribution path according to the optimal route, and perform route distribution according to the route distribution path and the service packet data content level.
In detail, each module in the load balancing-based route distribution system 100 in the embodiment of the present invention adopts the same technical means as the load balancing-based route distribution method described in fig. 1 to 3, and can produce the same technical effects, which are not described herein.
In the several embodiments provided in the present invention, it should be understood that the disclosed system and method may be implemented in other manners. For example, the system embodiments described above are merely illustrative, e.g., the division of the modules is merely a logical function division, and other manners of division may be implemented in practice.
The modules described as separate components may or may not be physically separate, and components shown as modules may or may not be physical units, may be located in one place, or may be distributed over multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional module in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units can be realized in a form of hardware or a form of hardware and a form of software functional modules.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof.
The present embodiments are, therefore, to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference signs in the claims shall not be construed as limiting the claim concerned.
The embodiment of the application can acquire and process the related data based on the artificial intelligence technology. Wherein artificial intelligence (ARTIFICIAL INTELLIGENCE, AI) is the theory, method, technique, and application system that uses a digital computer or a digital computer-controlled machine to simulate, extend, and expand human intelligence, sense the environment, acquire knowledge, and use knowledge to obtain optimal results.
Furthermore, it is evident that the word "comprising" does not exclude other elements or steps, and that the singular does not exclude a plurality. Multiple units or systems as set forth in the system claims may also be implemented by means of one unit or system in software or hardware. The terms first, second, etc. are used to denote a name, but not any particular order.
Finally, it should be noted that the above-mentioned embodiments are merely for illustrating the technical solution of the present invention and not for limiting the same, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications and equivalents may be made to the technical solution of the present invention without departing from the spirit and scope of the technical solution of the present invention.
Claims (9)
1. A method for route distribution based on load balancing, the method comprising:
s1, acquiring service message data content, classifying the service message data content to obtain a service message data content type, and configuring service parameters according to the service message data content type to obtain a service parameter configuration file;
S2, calling a resource scheduling thread group according to the service identification code in the service parameter configuration file, and monitoring thread state data of working threads in the resource scheduling thread group by using a preset state monitoring algorithm;
S3, carrying out data sharing on the thread state data through a preset shared data area to obtain shared thread state data, and extracting thread flow data in the shared thread state data;
S4, selecting an optimal route according to the content type of the service message data and the thread flow data by utilizing a preset intelligent routing algorithm, wherein the method comprises the following steps: inquiring whether a preset idle service process exists or not according to the data content type of the service message; when the idle service process exists, inquiring whether a preset working thread exists in a preset working thread pool or not through the intelligent routing algorithm; when the working thread exists, selecting an optimal route according to the thread flow data and a preset route parameter, and carrying out service classification on the service message data content to obtain a service message data content level;
S5, generating a route distribution path according to the optimal route, and carrying out route distribution according to the route distribution path and the service message data content level, wherein the route distribution according to the route distribution path and the service message data content level comprises the following steps:
s51, determining service priority according to the content level of the service message data;
S52, forwarding the data content of the service message corresponding to the data content level of the service message according to the service priority to obtain a data route distribution path in the route distribution paths;
S53, calculating the data packet distribution flow in the data route distribution path by using the following data packet flow calculation formula:
wherein q is the flow allocated to the data packet, For the data packet size in the data route distribution path p, R p is the minimum bandwidth remaining in the data route distribution path p, T p is the delay in the data route distribution path p,E p is the used bandwidth in the data route distribution path p, and E is a link bandwidth threshold;
And S54, carrying out route distribution according to the data route distribution path according to the data packet distribution flow.
2. The route distribution method based on load balancing according to claim 1, wherein said classifying the service message data content to obtain a service message data content type includes:
Carrying out standardized processing on the service message data content to obtain standard service message data content;
extracting service attribute fields in the data content of the standard service message;
And classifying the service attribute of the service attribute field according to a preset service classification requirement to obtain the content type of the service message data.
3. The route distribution method based on load balancing according to claim 1, wherein the performing service parameter configuration according to the service message data content type to obtain a service parameter configuration file includes:
determining a service identification code according to the content type of the service message data;
Generating a service parameter field according to the service identification code and a preset service requirement;
acquiring service logic corresponding to the service parameter field, and generating a service parameter mapping rule according to the service parameter field and the service logic;
And configuring a parameter file according to the service parameter mapping rule to obtain the service parameter configuration file.
4. The load balancing-based route distribution method according to claim 1, wherein the calling a resource scheduling thread group according to the service identification code in the service parameter configuration file comprises:
Acquiring a business service thread identifier in the resource scheduling thread group;
Calculating the editing distance between the business identification code and the business service thread identifier by using a preset full matching algorithm, wherein the full matching algorithm is as follows:
D(i,j)＝min(D(i-1,j)+1,D(i,j-1)+1,D(i-1,j-1)+c(i,j))
Wherein D (i, j) is the edit distance between the ith character of the service identification code and the jth character of the service thread identification, D (i-1, j) is the edit distance between the ith character of the service identification code and the jth character of the service thread identification, D (i, j-1) is the edit distance between the ith character of the service identification code and the jth-1 character of the service thread identification, D (i-1, j-1) is the edit distance between the ith-1 character of the service identification code and the jth-1 character of the service thread identification, and c (i, j) is the consistent value between the ith character of the service identification code and the jth character of the service thread identification;
Performing iterative computation according to the editing distance between the service identification code and the service thread identifier to obtain a service identifier editing distance;
selecting the business service thread identifier with zero business identifier editing distance as a resource scheduling thread group;
And calling the resource scheduling thread group through a preset thread interface.
5. The load balancing-based route distribution method according to claim 1, wherein the monitoring the thread status data of the working threads in the resource scheduling thread group by using a preset status monitoring algorithm includes:
extracting the resource occupation state data of the working thread through a preset resource occupation interface;
extracting service log state data of the working thread through a preset audit log;
monitoring information flow state data of the working thread by using a preset network protocol;
And carrying out state fusion on the resource occupation state data, the service log state data and the information flow state data by using a state monitoring algorithm as follows to obtain thread state data:
P＝{P1,P2,P3}
Wherein, P is the thread state data, P 1 is the resource occupancy state data, P 2 is the service log state data, and P 3 is the information flow state data.
6. The method for distributing the route based on the load balancing as claimed in claim 1, wherein said data sharing the thread state data through a preset shared data area to obtain shared thread state data comprises:
Storing the thread state data to the shared data area;
Accessing the thread state data of the shared data area through a preset pointer to obtain thread access data;
And carrying out data synchronization on the thread access data and the thread state data to obtain the shared thread state data.
7. The load balancing-based route distribution method according to claim 1, wherein the extracting the thread traffic data in the shared thread state data includes:
Acquiring a data packet in the shared thread state data;
Extracting the data packet size and the data packet number in the data packet;
calculating the thread flow data according to the data packet size, the data packet number and a preset data protocol attribute, wherein a calculation formula of the thread flow data is as follows:
U＝A×S+γ+(B1×S1)+(B2×S2)
Wherein U is the thread flow data, a is the protocol overhead in the data protocol attribute, S is the number of data packets, γ is the data packet payload size, B 1 is the data packet size, S 1 is the number of successfully transmitted data packets, B 2 is the retransmission data packet size, and S 2 is the retransmission data packet number.
8. The load balancing-based route distribution method according to claim 1, wherein selecting the best route according to the thread traffic data and a preset route parameter comprises:
Generating a routing attribute table according to the thread flow data and the routing parameters, wherein the routing attribute in the routing attribute table is as follows:
V＝{v1,v2,v3,v4,v5}
Wherein V is the routing attribute, V 1 is the reliability in the routing attribute, V 2 is the delay in the routing attribute, V 3 is the bandwidth in the routing attribute, V 4 is the communication quality in the routing attribute, and V 5 is the routing distance in the routing attribute;
Determining a target route in the route attribute table according to a preset route attribute of the source route;
And selecting the route with the highest route attribute in the target routes as the optimal route.
9. A load balancing based route distribution system, the system comprising:
The service parameter configuration file generation module is used for acquiring service message data contents, classifying the service message data contents to obtain service message data content types, and carrying out service parameter configuration according to the service message data content types to obtain service parameter configuration files;
The thread state data monitoring module is used for calling a resource scheduling thread group according to the service identification code in the service parameter configuration file and monitoring thread state data of working threads in the resource scheduling thread group by using a preset state monitoring algorithm;
the thread state data sharing module is used for carrying out data sharing on the thread state data through a preset shared data area to obtain shared thread state data, and extracting thread flow data in the shared thread state data;
The optimal route selection module is used for selecting an optimal route according to the content type of the service message data and the thread flow data by utilizing a preset intelligent route algorithm, and comprises the following steps: inquiring whether a preset idle service process exists or not according to the data content type of the service message; when the idle service process exists, inquiring whether a preset working thread exists in a preset working thread pool or not through the intelligent routing algorithm; when the working thread exists, selecting an optimal route according to the thread flow data and a preset route parameter, and carrying out service classification on the service message data content to obtain a service message data content level;
the route distribution module is configured to generate a route distribution path according to the optimal route, and perform route distribution according to the route distribution path and the service message data content level, where the performing route distribution according to the route distribution path and the service message data content level includes:
determining service priority according to the service message data content level;
Forwarding data of the service message data content corresponding to the service message data content level according to the service priority to obtain a data route distribution path in the route distribution path;
calculating the data packet distribution flow in the data routing distribution path by using the following data packet flow calculation formula:
wherein q is the flow allocated to the data packet, For the data packet size in the data route distribution path p, R p is the minimum bandwidth remaining in the data route distribution path p, T p is the delay in the data route distribution path p,E p is the used bandwidth in the data route distribution path p, and E is a link bandwidth threshold;
And carrying out route distribution according to the data route distribution path according to the data packet distribution flow.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310811120.9A CN116723154B (en) | 2023-07-03 | 2023-07-03 | Route distribution method and system based on load balancing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310811120.9A CN116723154B (en) | 2023-07-03 | 2023-07-03 | Route distribution method and system based on load balancing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116723154A CN116723154A (en) | 2023-09-08 |
| CN116723154B true CN116723154B (en) | 2024-08-30 |
Family
ID=87869744
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310811120.9A Active CN116723154B (en) | 2023-07-03 | 2023-07-03 | Route distribution method and system based on load balancing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116723154B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117579959B (en) * | 2023-10-31 | 2024-06-07 | 三峡智控科技有限公司 | Sensor data distribution method and device based on chip |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111782395A (en) * | 2020-06-30 | 2020-10-16 | 北京思特奇信息技术股份有限公司 | Message processing shunt control method and system |
| CN115550456A (en) * | 2022-09-13 | 2022-12-30 | 中国联合网络通信集团有限公司 | Service scheduling method and device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| RU2675212C1 (en) * | 2015-04-07 | 2018-12-17 | Телефонактиеболагет Лм Эрикссон (Пабл) | Adaptive load balancing during package processing |
| CN112134791A (en) * | 2020-09-15 | 2020-12-25 | 青岛科技大学 | An integrated routing gateway for intelligent network link monitoring and switching |
| CN116192857A (en) * | 2022-12-07 | 2023-05-30 | 南京邮电大学 | A Load Balancing Method for Encrypted Traffic Based on Multilayer Perceptron |
-
2023
- 2023-07-03 CN CN202310811120.9A patent/CN116723154B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111782395A (en) * | 2020-06-30 | 2020-10-16 | 北京思特奇信息技术股份有限公司 | Message processing shunt control method and system |
| CN115550456A (en) * | 2022-09-13 | 2022-12-30 | 中国联合网络通信集团有限公司 | Service scheduling method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116723154A (en) | 2023-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11411897B2 (en) | Communication method and communication apparatus for message queue telemetry transport | |
| USRE45806E1 (en) | System and method for the optimization of database access in data base networks | |
| CN110505101A (en) | A network slicing orchestration method and device | |
| CN101124565A (en) | Data traffic load balancing based on application layer messages | |
| US20090316600A1 (en) | Telecommunications system and server apparatus | |
| CN116760655B (en) | POP point method for providing CPE optimal access in SD-WAN application | |
| CN115037700A (en) | Complex network data packet transmission method, system, terminal and storage medium | |
| CN116723154B (en) | Route distribution method and system based on load balancing | |
| CN119012146A (en) | CMPP protocol short message adaptation method, device, equipment and storage medium | |
| WO2025185453A1 (en) | Data transmission method and apparatus, and computer-readable medium and electronic device | |
| KR20220029142A (en) | Sdn controller server and method for analysing sdn based network traffic usage thereof | |
| CN110071843B (en) | Fault positioning method and device based on flow path analysis | |
| CN113472670A (en) | Route consistency checker for network device | |
| WO2022152230A1 (en) | Information flow identification method, network chip, and network device | |
| CN107908560A (en) | One kind is based on multiple target cross debugging system in Software Development Platform | |
| CN117938750B (en) | Method, device, equipment, storage medium and product for processing scheduling route information | |
| WO2025082553A1 (en) | Method for adjusting traffic transmission path, and related apparatus | |
| WO2024183402A1 (en) | Log backhaul routing method and apparatus, and storage medium | |
| CN112019604A (en) | Edge data transmission method and system | |
| CN116192857A (en) | A Load Balancing Method for Encrypted Traffic Based on Multilayer Perceptron | |
| CN117768467B (en) | Data transmission method, device, computer equipment and computer readable storage medium | |
| US11997162B1 (en) | Systems and methods of exposing data from blockchain nodes | |
| CN117834956B (en) | Live video acceleration system and method for resource distribution and source return | |
| CN120675919A (en) | Route data updating method, device, equipment and storage medium | |
| CN119814632A (en) | A network communication method, device, electronic device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |