CN111711675B - Solution for concurrent message transmission in local area network - Google Patents
Solution for concurrent message transmission in local area network Download PDFInfo
- Publication number
- CN111711675B CN111711675B CN202010509331.3A CN202010509331A CN111711675B CN 111711675 B CN111711675 B CN 111711675B CN 202010509331 A CN202010509331 A CN 202010509331A CN 111711675 B CN111711675 B CN 111711675B
- Authority
- CN
- China
- Prior art keywords
- client
- server
- message
- node
- queue
- 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
Images
Classifications
-
- 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/14—Session management
- H04L67/141—Setup of application sessions
-
- 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/01—Protocols
- H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
-
- 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/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
-
- 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)
- Computer And Data Communications (AREA)
Abstract
The invention relates to the technical field of data processing, in particular to a solution for concurrent message transmission in a local area network, which comprises the following steps: constructing a message queue server cluster and establishing MQ node number; numbering the client, associating with a client machine IP, and establishing a relation logic of the client number and the MQ node number by adopting a modular algorithm; the server side pushes the message into a corresponding MQ node server; the client acquires queue service information for starting the link queue service; establishing a link between the client and the MQ node with the serial number, and monitoring queue messages; the client obtains the message. The invention relates to a solution for the transmission of concurrent messages in a local area network.A message queue is adopted as a main technical medium in an intermediate layer, and a server side and a client side are interrupted to achieve an asynchronous effect of each client side, thereby solving the problem of high message concurrency bottleneck; the effect of high-speed message distribution from a single server to multiple servers is optimized.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a solution for concurrent message transmission in a local area network.
Background
In the field of internet and communications, a large amount of information needs to be frequently transferred, wherein in a network environment, data is transferred between systems, which is the most common technical application scenario. In a network environment, data is transmitted among systems generally by using a TCP protocol, the most common mode is http, namely, data of a server end is requested from a client, and under the condition of no manual operation, data acquisition is carried out by using a program circular polling mode; another common method is to use a method called long link to maintain communication between the client and the server, but this method consumes huge resources on the server, and is not suitable for communication in a type of scenario that the number of clients and the server exceeds hundreds to thousands, or the cost to be implemented is relatively high, so it is not suitable for use in a common application scenario.
Although the service flow of message delivery is simple, for example, in some specific scenarios, often a simple message instruction delivery can solve an important link of the service flow, when a scenario in which more than 2000, 4000 or even ten thousand clients need to receive such a message is encountered, multi-user concurrent operation data may generate a high concurrent event, which may cause that processing and response of a server may be slower and slower, even may discard part of requests and may cause that the server may crash more seriously. In order to solve the problem of high-concurrency message transmission in the local area network, a solution which is stable, efficient and economical in cost is urgently needed.
Therefore, there is a need for improvement of the prior art to solve the above technical problems.
Disclosure of Invention
In view of this, an object of the present invention is to provide a solution for transmitting concurrent messages in a local area network, which solves the technical problems of low efficiency, high resource consumption, and high cost of high concurrent messages in the local area network in the prior art, and specifically, is implemented by the following technical solutions:
a solution for concurrent message transmission in a local area network is designed, which comprises the following steps:
s1, constructing a message queue server cluster and establishing MQ node numbers;
s2, numbering the client, associating a client machine IP (Internet protocol), storing the client machine IP in a server database, and storing a corresponding mapping relation between the message and the numbering information of the client by the server; adopting a modular algorithm to establish the relation logic of the client side number and the MQ node number;
s3, pushing the message into a corresponding MQ node server by the server according to the relation logic of the client number and the MQ node number determined in the step S2, and providing the logic for the client to call through a web interface API;
s4, the client side obtains queue service information and is used for starting the link queue service;
s5, establishing a link between the client and the MQ node and monitoring queue messages;
and S6, the client acquires the message and provides a corresponding interface operation function.
Further, the step S1 of constructing the message queue server cluster is to construct enough queue service nodes according to the number and the use frequency of the clients, for example, the queue service nodes are divided according to the configurable connection number value of the message queue MQ nodes, each 1 node can be connected to 1000 clients, and then 4000 clients need 4 to 5 nodes.
In order to optimize the effect of issuing messages to multiple servers at high speed by a single server, the intermediate layer of the invention adopts the technology of Message Queue (MQ) as the main 'intermediary' technical medium, and the server end and the client end are 'interrupted', so as to achieve the 'asynchronous' effect of each client, thereby solving the bottleneck problem of high Message concurrency in the local area network; the server S only manages the logic of the client and the message and pushes the message queue service; the client Cn monitors the message queue to obtain the message content in the queue; since queue service is a service protocol specifically designed for a high-concurrency message mechanism, it has great advantages in terms of efficiency and cost.
Further, the step S2 specifically includes:
and S21, numbering the client, and arranging the number according to the IP address, wherein the numbering can be arranged according to a serial number sequence. Each client needing to be transmitted with a message needs to register a digital number at the server, and the server stores the corresponding mapping relation between the message and the number information of the client; when a message needs to be sent out in the processing process of the server side, pushing is carried out according to the mapping relation logic;
in a real scene, the number of messages required to be received by the client is different, so that the load of the MQ nodes is more balanced, the method further comprises a step S22 of distributing by using a modulo algorithm, namely, the relationship between the client and the MQ nodes is modulo according to the client number and the number of the MQ nodes, and the obtained value is the number of the MQ nodes connectable to the client. For example: MQ nodes are 5, the number 991 Mod 5 is equal to 1, then the message of the 991 client is put into the MQ node No. 1, and the logic provides client call through a web interface (API, API-01); adopting a modular algorithm to establish the relation logic of the client number and the MQ node number:
/*
computing to obtain MQ node server information and establishing service
*/
// MQ number of nodes
$server_count = count($mq_servers);
V/get module to get MQ node number
$server_no = $client_no % $server_count;
// obtaining MQ node Server information
$mq_server = $mqservers[$server_no];
// establishing a Link
$connect = new \FuseSource\Stomp\Stomp('tcp://'.$mq_server['ip'].'/:'.$mq_server['port']);
$connect->connect();
/*
Pushing MQ messages
*/
// push message and persistence
$result = $connect->send('ms991',json_encode($data),array('persistent'=>'true'));
Further, step S4 is specifically that when the client is started, the MQ node server information corresponding to the current client number is first obtained from the web interface API-01 of the server, and is used for establishing a link between the client and the MQ in the next step. The step can be realized by acquiring the IP address of the client when the client is started, calling API-01, finding the serial number of the client through the binding mapping relation of the server, and then performing modular acquisition.
Further, the step S4 is specifically to obtain an IP address of the client when the client is started, call a web interface API, find a number of the client through a binding mapping relationship of the server, and then obtain a module; inputting: when the slave client is started, a local IP address is obtained and used as an input parameter; logic: and inquiring a corresponding client number in a server data table through the IP address, calculating and outputting: MQ server information;
// obtaining parameters from the request
$ip = get_request('ip');
// algorithm obtaining MQ server information
$mq_server = get_mq_server($ip);
// convert to json return
return json_encode($mq_server);
Further, step S5 is specifically that the client acquires MQ information from the interface, establishes a link, starts monitoring the queue message, and processes the queue message:
/*
obtaining MQ server information and establishing link, monitoring message
*/
Obtaining Server information, creating links
var MqServer = GetMqServer(MyIp);
var factory = new ConnectionFactory();
factory.HostName = MqServer.host;
factory.UserName = MqServer.user;
factory.Password = MqServer.psw;
using (var connection = factory.CreateConnection())
{
using (var channel = connection.CreateModel())
{
channel.QueueDeclare("ms991", false, false, false, null);
var consumer = new EventingBasicConsumer(channel);
channel.BasicConsume("ms991", false, consumer);
consumer.Received += (model, ea) =>
{
var body = ea.Body;
var message = Encoding.UTF8.GetString(body);
Console. WriteLine ("get message: {0}", message);
};
Console.ReadLine();
}
}
furthermore, the invention also provides a supplementary function of the client, which processes the function of automatically switching the MQ node by detecting for a long time polling, such as one day, and finding whether the server changes the server link information of the client and the MQ node; the step is necessary in a large-scale service scene, the server terminal expands the MQ nodes under the condition of service increase, and when the MQ nodes increase, the algorithm of taking the modulus of the Cn number and the MQ node number is updated, and the relation between the client terminal and the MQ nodes is redistributed. If the client needs to take effect in time, the client needs to be restarted, and the execution is started from the step S4 again.
Compared with the closest prior art, the technical scheme provided by the invention has the following excellent effects:
(1) The invention relates to a solution for concurrent message transmission in a local area network, which adopts a message queue as a main technical medium in a middle layer through innovative design, interrupts a server side and a client side, and achieves an asynchronous effect of each task, thereby solving the bottleneck problem of high message concurrency; the server S only manages the logic of the client and the message, and pushes the message queue service; the client Cn monitors the message queue to obtain the message content in the queue, and the effect of issuing messages to multiple servers at high speed by a single server is optimized.
(2) The invention also provides a complementary function of the client, which discovers whether the server end changes the server link information of the client and the MQ node or not through a long-time polling detection to process the function of automatically switching the MQ node. This step is very necessary in large business scenarios.
Other advantageous effects of the present invention will be further described with reference to the following specific examples.
Drawings
The invention is further described below with reference to the following figures and examples:
FIG. 1 is a general flowchart of example 1 of the present invention;
FIG. 2 is a flowchart of step S2 in embodiment 1 of the present invention.
Detailed Description
Example 1
A solution for concurrent message transmission in a local area network is disclosed, wherein a system S is a main server system, receives data generated by a multi-party channel system, needs to generate an instruction, carries the data and transmits the data to a client system such as a C1, a C2 and a Cn …, and further performs data presentation and manual operation of the next step. In order to optimize the effect that a single server issues messages to multiple servers at a high speed, the invention adopts the technology of Message Queue (MQ) as a main intermediary technology medium in the middle layer, and the server end and the client end are interrupted to achieve the asynchronous effect of each part, thereby solving the problem of high Message concurrency bottleneck; the server S only manages the logic of the client and the message and pushes the message queue service; a client Cn monitors a message queue to obtain message contents in the queue; the queue service is a service protocol specially designed for a high-concurrency message mechanism, and has great advantages in efficiency and cost, the specific flow of the solution method for concurrent message transmission in a local area network is shown in fig. 1, steps S1 to S3 are server-side processing steps, and steps S4 to S7 are client-side processing steps.
S1, constructing a message queue server cluster
Constructing enough queue service nodes according to the number and the use frequency of the clients, for example, dividing according to the configurable connection number value of the message queue MQ nodes, if every 1 node can be connected with 1000 clients, then 4000 clients need 4 to 5 nodes; the Message Queue (MQ) is a communication mode between application programs, the Message can be returned immediately after being sent, a Message system ensures reliable transmission of the Message, a Message publisher only takes charge of publishing the Message to the MQ and does not take charge of the Message, and a Message user only takes charge of fetching the Message from the MQ no matter who publishes the Message;
s2, numbering the clients, and comprising the following steps:
the client arranges the number according to the IP address, the number is generally arranged according to the serial number sequence, each client needing to be transmitted with the message needs to register a number at the server, the client numbers according to the serial number, associates the client machine IP and stores the client machine IP in the server database, and the server stores the corresponding mapping relation between the message and the number information of the client as shown in the table 1; when the server needs to send out the message in the processing process, pushing is carried out according to the mapping relation logic.
Table 1 correspondence table between client numbers and IP addresses
In a real scene, the number of messages that the client needs to receive is different, and in order to make the load of the MQ nodes more balanced, a modular algorithm may be used for allocation, that is, the relationship between the client and the MQ nodes, the server needs to send a message to the client, and then modular budgeting is performed according to the client number and the number of MQ nodes owned by the planning, the obtained modular value is the MQ node number, and the corresponding message is put into the MQ node server, as shown in fig. 2: for example: MQ nodes are 5, the number 991 Mod 5 is equal to 1, the message of the client 991 is put into the MQ node No. 1, and the logic provides client call through a web interface API (API-01);
s3, the server side pushes the message into the corresponding MQ node server
According to the relation logic of the client side number and the MQ node number determined in the S2, the server side pushes the message into the corresponding MQ node server, and the server side finishes the step; the server side pushes the message into the corresponding MQ node server specifically as follows:
/*
computing to obtain MQ node server information and establishing service
*/
// MQ number of nodes
$server_count = count($mq_servers);
V/get module to get MQ node number
$server_no = $client_no % $server_count;
// obtaining MQ node Server information
$mq_server = $mqservers[$server_no];
// establishing a Link
$connect = new \FuseSource\Stomp\Stomp('tcp://'.$mq_server['ip'].'/:'.$mq_server['port']);
$connect->connect();
/*
Pushing MQ messages
*/
// push message and persistence
$result = $connect->send('ms991',json_encode($data),array('persistent'=>'true'));
S4, the client acquires the corresponding MQ node server information
When a client is started, firstly, acquiring MQ node server information corresponding to the current client number from a web interface API-01 of a server end for establishing a link between the client and an MQ, calling the API-01 by acquiring an IP address of the client when the client is started, finding the client number through a binding mapping relation of a server, and then obtaining a module; specifically, the method comprises the following steps: when the client is started, a local IP address is obtained and used as an input parameter; logic: and inquiring a corresponding client number in a server data table through the IP address, calculating and outputting: the specific data structure of the MQ server information is as follows:
// obtaining parameters from the request
$ip = get_request('ip')；
v/Algorithm obtaining MQ Server information
$mq_server = get_mq_server($ip)；
// convert to json return
return json_encode($mq_server)；
S5, the client starts to establish a link with the MQ and starts to monitor the message of the MQ;
the client acquires MQ information from the interface and establishes a link; monitoring queue information and processing the queue information; the message queue linking and consuming algorithm is specifically as follows:
/*
obtaining MQ server information and establishing link, monitoring message
*/
Obtaining Server information, creating links
var MqServer = GetMqServer(MyIp);
var factory = new ConnectionFactory();
factory.HostName = MqServer.host;
factory.UserName = MqServer.user;
factory.Password = MqServer.psw;
using (var connection = factory.CreateConnection())
{
using (var channel = connection.CreateModel())
{
channel.QueueDeclare("ms991", false, false, false, null);
var consumer = new EventingBasicConsumer(channel);
channel.BasicConsume("ms991", false, consumer);
consumer.Received += (model, ea) =>
{
var body = ea.Body;
var message = Encoding.UTF8.GetString(body);
Console. WriteLine ("get message: {0}", message);
};
Console.ReadLine();
}
}
s6, acquiring corresponding data according to message formats formulated by the server and the client, presenting the data at the client, and performing corresponding interface operation functions;
the invention also provides a supplementary function of the client aiming at the solution of concurrent message transmission in the local area network, and the function of automatically switching the MQ node is processed by detecting whether the server end changes the server link information of the client and the MQ node or not by polling for a longer time, such as one day; the step is very necessary in a large-scale service scene, the server terminal expands the MQ nodes under the condition of service increase, when the MQ nodes are increased, the algorithm of Cn number and MQ node quantity module is updated, the relation between the client terminal and the MQ nodes is redistributed, if the effect is needed in time, the client terminal needs to be restarted, and the step S4 is executed again.
Finally, the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting, 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 or equivalent substitutions may be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention, and all of them should be covered in the claims of the present invention.
Claims (5)
1. A solution for concurrent message delivery in a local area network, comprising the steps of: s1, constructing a message queue server cluster and establishing MQ node numbers;
s2, numbering the client, associating a client machine IP (Internet protocol), storing the client machine IP in a server database, and storing a corresponding mapping relation between the message and the numbering information of the client by the server;
s3, pushing the message into a corresponding MQ node server by the server according to the relation logic of the client number and the MQ node number determined in the step S2, and providing the logic for the client to call through a web interface API; the server side pushes the message into the corresponding MQ node server specifically as follows: computing to obtain MQ node server information and establishing service; acquiring the number of MQ nodes; modulus is taken to obtain MQ node number; obtaining MQ node server information; establishing a link;
s4, the client side obtains queue service information and is used for starting the link queue service;
s5, establishing a link between the client and the MQ node and monitoring queue messages;
s6, the client acquires the message and provides a corresponding interface operation function;
the client performs polling detection to detect whether the server changes the server link information of the client and the MQ node or not so as to process the function of automatically switching the MQ node; the polling detection step is that the server terminal expands the MQ node under the condition of service increase, and when the MQ node is increased, the algorithm of taking the modulus of the Cn number and the MQ node number is updated to redistribute the relationship between the client terminal and the MQ node; if the client needs to take effect in time, the client is restarted and the execution is started again from the fourth step; step S2, establishing the relation logic of the client terminal number and the MQ node number by adopting a modular algorithm;
the step S2 specifically includes: s21, the client is numbered according to the serial number and is associated with the IP of the client machine, and the server stores the corresponding mapping relation between the message and the number information of the client;
and S22, performing modular budgeting according to the client number and the quantity of MQ nodes owned by the planning, wherein the obtained modular value is the MQ node.
2. The method according to claim 1, wherein step S4 is specifically to obtain the IP address of the client when the client is started, call a web interface API, find the number of the client through the binding mapping relationship of the server, and then perform the modulo obtaining.
3. The solution for the concurrent messaging in the lan as claimed in claim 1, wherein the step S5 is specifically for the client to obtain the MQ message from the interface, establish a link, start to monitor the queue message, and process the queue message.
4. The solution for concurrent messaging within a local area network as claimed in claim 1, wherein: the polling detection time of the client is 1 day.
5. The solution for concurrent messaging in a local area network as claimed in claim 1, wherein step S1 can construct enough queue service nodes according to the number of clients and the frequency of use, and the queue service nodes are divided according to the configurable connection number value of the message queue MQ nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010509331.3A CN111711675B (en) | 2020-06-08 | 2020-06-08 | Solution for concurrent message transmission in local area network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010509331.3A CN111711675B (en) | 2020-06-08 | 2020-06-08 | Solution for concurrent message transmission in local area network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111711675A CN111711675A (en) | 2020-09-25 |
| CN111711675B true CN111711675B (en) | 2023-04-07 |
Family
ID=72539045
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010509331.3A Active CN111711675B (en) | 2020-06-08 | 2020-06-08 | Solution for concurrent message transmission in local area network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111711675B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022229672A1 (en) * | 2021-04-27 | 2022-11-03 | Ip Ying Hoi Robert | Networked messaging systems and methods of allowing multiple companies operating on a value chain to serve a customer simultaneously |
| CN114039987A (en) * | 2021-11-05 | 2022-02-11 | 光大科技有限公司 | Address book synchronization method and device, computer storage medium and electronic device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9436532B1 (en) * | 2011-12-20 | 2016-09-06 | Emc Corporation | Method and system for implementing independent message queues by specific applications |
| CN107395729A (en) * | 2017-07-27 | 2017-11-24 | 深圳乐信软件技术有限公司 | A kind of consumption system of message queue, method and device |
| CN110300050A (en) * | 2019-05-23 | 2019-10-01 | 中国平安人寿保险股份有限公司 | Information push method, device, computer equipment and storage medium |
-
2020
- 2020-06-08 CN CN202010509331.3A patent/CN111711675B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9436532B1 (en) * | 2011-12-20 | 2016-09-06 | Emc Corporation | Method and system for implementing independent message queues by specific applications |
| CN107395729A (en) * | 2017-07-27 | 2017-11-24 | 深圳乐信软件技术有限公司 | A kind of consumption system of message queue, method and device |
| CN110300050A (en) * | 2019-05-23 | 2019-10-01 | 中国平安人寿保险股份有限公司 | Information push method, device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111711675A (en) | 2020-09-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10367852B2 (en) | Multiplexed demand signaled distributed messaging | |
| US11411897B2 (en) | Communication method and communication apparatus for message queue telemetry transport | |
| US20170149715A1 (en) | System and method for providing an actively invalidated client-side network resource cache | |
| US20070061282A1 (en) | Data network information distribution | |
| EP2321937B1 (en) | Load balancing for services | |
| US20120198004A1 (en) | System and method for managing multiple queues of non-persistent messages in a networked environment | |
| US10795744B2 (en) | Identifying failed customer experience in distributed computer systems | |
| CN111711675B (en) | Solution for concurrent message transmission in local area network | |
| CN107528891B (en) | Websocket-based automatic clustering method and system | |
| CN112751748B (en) | Session message management method, device, server and readable storage medium | |
| CN110601994B (en) | Load balancing method for micro-service chain perception in cloud environment | |
| CN102571947A (en) | Processing method proxy method, device and system | |
| CN106330610A (en) | Load balance processing system and method | |
| CN110247971B (en) | Method and system for reducing number of message middleware connections | |
| CN209805866U (en) | Conversation maintaining system | |
| JP6402077B2 (en) | Relay system, relay method, and program | |
| CN102023997B (en) | Data query system, construction method thereof and corresponding data query method | |
| US20150127799A1 (en) | Hierarchical distribution of control information in a massively scalable network server | |
| CN116743836A (en) | Long connection communication link establishment method and device, electronic equipment and storage medium | |
| CN111427703A (en) | Industrial data real-time display method and system | |
| CN115952003A (en) | Method, device, equipment and storage medium for cluster server load balancing | |
| CN114390056A (en) | Load balancing method and device, electronic equipment and storage medium | |
| CN114024968A (en) | Message sending method and device based on intermediate equipment and electronic equipment | |
| CN111541667A (en) | Method, equipment and storage medium for intersystem message communication | |
| CN116361038B (en) | Acceleration computing management method, system, equipment 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 |