CN115801693B - Low-blocking low-delay data communication method and system and readable storage medium - Google Patents
Low-blocking low-delay data communication method and system and readable storage medium Download PDFInfo
- Publication number
- CN115801693B CN115801693B CN202310012450.1A CN202310012450A CN115801693B CN 115801693 B CN115801693 B CN 115801693B CN 202310012450 A CN202310012450 A CN 202310012450A CN 115801693 B CN115801693 B CN 115801693B
- Authority
- CN
- China
- Prior art keywords
- data
- server
- determining
- transmitted
- target
- 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
Landscapes
- Computer And Data Communications (AREA)
Abstract
The invention discloses a data communication method, a system and a readable storage medium with low obstruction and low time delay, wherein the method comprises the following steps: when a data transmission request is received, determining whether the data transmission request carries a priority identifier; if the data transmission request carries the data, controlling to add the data to be transmitted corresponding to the data transmission request to a priority transmission list corresponding to the priority identification, and determining a plurality of edge servers corresponding to the data transmission request in the data communication system; determining a target server from a plurality of edge servers according to the task parameters of each edge server and the data size identification carried in the data transmission request; and transmitting the data to be transmitted to the target server based on the transmission condition of the priority transmission list. Therefore, the data in different regions are transmitted to the server with short distance and enough resources for processing, so that the situations of high blockage and high delay easily occurring in the processing of a large amount of data are effectively avoided while the timely processing of the emergency data is ensured.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a low-blocking low-delay data communication method, a low-blocking low-delay data communication system and a readable storage medium.
Background
With the progress of science and technology, the technology of the internet of things is popularized and applied in more and more fields. For example, in the aspect of environmental monitoring, an environmental data monitoring system is built through the Internet of things, monitoring points are arranged in a plurality of different places, environmental air data, water quality data, pollutant emission data and the like are collected according to a certain sampling period and transmitted to a system server for processing, and environmental quality monitoring of each place is achieved. Moreover, the monitoring data collected by the system usually needs to be sent to a system server in real time for processing. Therefore, the system server needs to process a large amount of data, which easily causes a high blocking or high delay in data processing.
Furthermore, different data may need to be processed with different urgency for data transmission to the system server, for example in an equipment failure monitoring system where failure data may need to be processed more urgently than non-failure data, whereas for the environmental data detection system described above pollutant emission data may need to be processed more urgently than other data. However, in the current system server, when a large amount of data to be processed is faced, whether the data is urgent or not is often not distinguished, and the data is processed only according to the sequence of received data, so that the data which needs urgent processing cannot be processed in time. Especially in the case of high blocking and high latency, the latency of data requiring urgent processing is further extended.
Therefore, how to avoid the situation of high blocking and high delay in data processing and ensure that urgent data is processed preferentially is a technical problem to be solved urgently at present.
Disclosure of Invention
The invention mainly aims to provide a low-blocking low-delay data communication method, a low-blocking low-delay data communication system and a readable storage medium, and aims to solve the technical problem of how to avoid the situation of high-blocking high-delay data processing and ensure that emergency data is processed preferentially in the prior art.
In order to achieve the above object, the present invention provides a low-blocking and low-delay data communication method, which is applied to a low-blocking and low-delay data communication system, and the low-blocking and low-delay data communication method includes:
when a data transmission request is received, determining whether the data transmission request carries a priority identifier;
if the data communication system carries the priority identification, controlling to add the data to be transmitted corresponding to the data transmission request to a priority transmission list corresponding to the priority identification, and determining a plurality of edge servers corresponding to the data transmission request in the data communication system;
determining a target server from the plurality of edge servers according to the task parameters of each edge server and the data size identification carried in the data transmission request;
and transmitting the data to be transmitted to the target server based on the transmission condition of the priority transmission list.
Optionally, the step of determining a target server from the plurality of edge servers according to the task parameters of each edge server and the data size identifier carried in the data transmission request includes:
determining idle resource parameters of each edge server according to the current task data volume and a preset task coefficient in the task parameters of each edge server;
determining a reference resource parameter corresponding to the data to be transmitted according to the data size identifier;
and comparing each idle resource parameter with the reference resource parameter, determining a target idle resource parameter matched with the reference resource parameter, and determining the edge server corresponding to the target idle resource parameter as the target server.
Optionally, the step of determining the idle resource parameter of each edge server according to the current task data amount and a preset task coefficient in the task parameter of each edge server includes:
determining single processing time corresponding to each single task data volume in the current task data volume respectively for each edge server;
calculating the data volume of each single task as an average data volume, and calculating the processing time of each single task as an average processing time;
calculating the current load coefficient of each edge server according to the data volume of each single task, the processing time of each single task, the average data volume and the average processing time, wherein the calculation formula is as follows:
wherein, the first and the second end of the pipe are connected with each other,Efor the purpose of the current load factor,miin order to be able to measure the data volume of a single task,Tiin order to be a single item of processing time,αis an age factor ofα≥1，βIs a coefficient of total task amount andβ≥1，min order to average the amount of data,Tis the average treatment time;
and performing difference operation on a preset task coefficient of each edge server and the current load coefficient of each edge server to obtain an idle resource parameter of each edge server.
Optionally, the step of determining the edge server corresponding to the target idle resource parameter as the target server includes:
judging whether a plurality of target idle resource parameters exist, and if the plurality of target idle resource parameters exist, determining undetermined edge servers corresponding to the target idle resource parameters respectively;
calculating the transmission time of the data to be transmitted to each undetermined edge server, wherein the calculation formula is as follows:
wherein the content of the first and second substances,Ttin order to be the time of transmission,Hin order to transmit the straight-line distance,Bin order to be able to transmit the bandwidth,Nin order to be the power of the noise,Pin order to transmit the power, the power is transmitted,Gin order to achieve the gain of the transmission channel,T0is a transmission path historical delay factor;
and screening the shortest transmission time in the transmission times, and determining the undetermined edge server corresponding to the shortest transmission time as the target server.
Optionally, the step of comparing each idle resource parameter with the reference resource parameter, and determining a target idle resource parameter matching the reference resource parameter includes:
comparing each idle resource parameter with the reference resource parameter respectively, and judging whether the idle resource parameter larger than the reference resource parameter exists in each idle resource parameter or not;
if the idle resource parameter exists, determining the idle resource parameter larger than the reference resource parameter as the target idle resource parameter;
if the idle resource parameters larger than the reference resource parameter do not exist, combining the idle resource parameters to obtain a plurality of combined parameters;
and determining the target resource parameters according to the magnitude relation between each combination parameter and the reference resource parameters and the combination transmission time corresponding to each combination parameter.
Optionally, the step of determining the target resource parameter according to a magnitude relationship between each of the combination parameters and the reference resource parameter, and a combination transmission time corresponding to each of the combination parameters includes:
comparing each combination parameter with the reference resource parameter respectively, and determining a middle combination parameter larger than the reference resource parameter;
aiming at each intermediate combination parameter, searching a combination edge server corresponding to an idle resource parameter forming the intermediate combination parameter;
calculating the combined transmission time corresponding to each combined edge server, and determining the total transmission time corresponding to each intermediate combined parameter according to each combined transmission time;
and screening out the target total transmission time with the shortest time from all the total transmission times, and determining an intermediate combination parameter corresponding to the target total transmission time as the target resource parameter.
Optionally, the step of determining the target server from the plurality of edge servers includes
Determining a standby server corresponding to the target server from a plurality of edge servers;
the step of transmitting the data to be transmitted to the target server based on the transmission condition of the preferential transmission list comprises the following steps:
and transmitting the data to be transmitted to the standby server so as to store the data to be transmitted as standby data in the standby server, and repairing the data to be transmitted in the target server based on the standby data when the data to be transmitted in the target server is damaged.
Optionally, the step of repairing the data to be transmitted in the target server based on the backup data includes:
detecting the total quantity of the standby data, the missing data quantity of the data to be transmitted relative to the standby data and the difference data quantity between the standby data and the data to be transmitted;
determining a missing coefficient corresponding to the missing data amount and a difference coefficient corresponding to the difference data amount according to a proportional relation between the missing data amount and the difference data amount;
calculating a data restoration coefficient according to the total data amount, the missing data amount, the difference data amount, the missing coefficient and the difference coefficient, wherein the calculation formula is as follows:
according to the data restoration coefficient, transmitting the standby data to the target server, and restoring the data to be transmitted;
wherein the content of the first and second substances,win order to repair the coefficients for the data,nas the total amount of data,n1in order to have the amount of missing data,n2in order to be the amount of the difference data,k1in order to be a missing coefficient,k2is the coefficient of difference.
Further, to achieve the above object, the present invention further provides a low-blocking and low-latency data communication system, including: a memory, a processor, a communication bus, and a control program stored on the memory:
the communication bus is used for realizing connection communication between the processor and the memory;
the processor is configured to execute the control program to implement the steps of the low-blocking low-latency data communication method as described above.
Further, to achieve the above object, the present invention also provides a readable storage medium having stored thereon a control program, which when executed by a processor, implements the steps of the data communication method with low blocking and low latency as described above.
According to the data communication method, the system and the readable storage medium with low blocking and low delay, when a data transmission request is received, whether the data transmission request carries a priority identification or not is firstly identified, if the data transmission request carries the priority identification, the data to be transmitted corresponding to the data transmission request and needing to be transmitted needs to be transmitted preferentially, and then the data to be transmitted is added to a priority transmission list corresponding to the priority identification so as to be transmitted preferentially. In addition, in order to facilitate rapid processing of data in different areas, the data communication system comprises a plurality of servers arranged in different areas, a plurality of edge servers with relatively short distances are determined according to the length of a transmission path between each server and the data to be transmitted, a target server is further determined according to the task conditions currently processed by each edge server and task resources required by the data to be transmitted, and the data to be transmitted is transmitted to the target server, so that the target server has enough resources to rapidly process the data to be transmitted. Therefore, on one hand, the emergency data are timely processed through the priority, on the other hand, the data in different regions are transmitted to the server which is short in distance and has enough resources to be processed, the emergency data are further timely processed, and meanwhile the situation that a large amount of data are easy to block and delay is effectively avoided.
Drawings
FIG. 1 is a schematic flow chart diagram of a first embodiment of a low-blocking low-latency data communication method of the present invention;
FIG. 2 is a schematic flow chart diagram of a second embodiment of a low-blocking low-latency data communication method of the present invention;
FIG. 3 is a schematic flow chart diagram of a third embodiment of a low-blocking low-latency data communication method of the present invention;
FIG. 4 is a schematic flow chart diagram of a fourth embodiment of a low-blocking low-latency data communication method of the present invention;
fig. 5 is a schematic structural diagram of a hardware operating environment according to an embodiment of the low-blocking low-latency data communication system of the present invention.
The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Referring to fig. 1, fig. 1 is a schematic flow chart of a first embodiment of the low-blocking low-latency data communication method according to the present invention.
While a logical order is illustrated in the flow charts, in some cases, the steps shown or described may be performed in a different order than presented. Specifically, the data communication method with low blocking and low delay in this embodiment is applied to a data communication system with low blocking and low delay, and includes:
step S10, when a data transmission request is received, determining whether the data transmission request carries a priority identification;
the data communication method with low blocking and low delay of the embodiment is applied to a data communication system with low blocking and low delay, wherein the data communication system comprises a plurality of servers arranged in different regions and is used for receiving and processing data of the respective regions, so that blocking and delay caused by the fact that a large amount of data is collected to one server for processing are avoided, and blocking and delay caused by the fact that data processing speed is influenced by trans-regional long-distance transmission are also avoided. The plurality of servers may be all virtual servers, all physical servers, or part of virtual servers and part of physical servers, which may be specifically set according to the requirements of the application scenario, and are not limited thereto.
Further, the data communication system may be provided with a control center, and when receiving the data transmission request and indicating that the terminal device, the sensing device, or the detection device in the data communication system needs to transmit data to the server for processing, the control center may identify whether the data transmission request carries the priority identifier. The priority identification indicates that the data required to be transmitted is data requiring emergency processing.
Step S20, if carrying a priority identification, controlling to add the data to be transmitted corresponding to the data transmission request to a priority transmission list corresponding to the priority identification, and determining a plurality of edge servers corresponding to the data transmission request in the data communication system;
furthermore, at least two transmission lists are set for the data to be transmitted, one of the transmission lists is a priority transmission list, the other transmission list is a common transmission list, and the data of the priority transmission list is transmitted to the server before the data of the common transmission list. If the data transmission request is identified to carry the priority identification, the data to be transmitted is indicated, namely the data to be transmitted corresponding to the data transmission request is the data to be transmitted preferentially, so that the data to be transmitted is controlled to be added to a preferential transmission list corresponding to the priority identification.
It should be noted that the transmission list may be set to be more. For example, setting from low to high in priority includes: a common transmission list, a first-level priority transmission list, a second-level priority transmission list, a third-level priority transmission list and an emergency transmission list. Adding the data which do not correspond to the priority identification to a common transmission list; adding corresponding data with a priority identifier and the emergency level of the priority identifier is high-level data into an emergency transmission list; and determining and adding the corresponding priority transmission list according to the corresponding relation between the priority identification and the priority transmission list.
Furthermore, the data transmission request also carries an identifier representing a region where data to be transmitted comes, the region where the quantity to be transmitted comes is identified through the identifier, and then the servers in the region and the servers of a plurality of regions adjacent to the region are searched and are jointly used as a plurality of edge servers corresponding to the data transmission request.
It should be noted that, in order to further distinguish between relatively urgent and more urgent data, an urgency level may also be set for the priority flag. Specifically, if the priority identifier is carried, the step of controlling to add the data to be transmitted corresponding to the data transmission request to a priority transmission list corresponding to the priority identifier includes:
step a1, identifying the emergency grade of the priority identification, and if the emergency grade is high grade, adding the data to be transmitted into an emergency transmission list;
and a2, taking the emergency transmission list as a new priority transmission list, and executing the step of determining a plurality of edge servers corresponding to the data transmission requests in the data communication system so as to transmit and process the data in the emergency transmission list with priority.
Further, in order to prioritize more urgent data, an urgent transmission list is added on the basis of the prioritized transmission list. After the data transmission request is determined to carry the priority identification, the emergency level of the priority identification is continuously identified, whether the emergency level is high or not is judged, if the emergency level is high, the data to be transmitted are controlled to be added to an emergency transmission list, the emergency transmission list is used as a new priority transmission list, and then a plurality of edge servers corresponding to the data transmission request are determined, so that the data of the emergency transmission list is transmitted to the servers to be preferentially processed in priority mode in preference to the data of the original priority transmission list. If the emergency level of the priority identification is identified to be not high, the data to be transmitted is not added to the emergency transmission list for further emergency processing, but is added to the priority transmission list and is processed in preference to the ordinary data.
Step S30, determining a target server from the plurality of edge servers according to the task parameters of each edge server and the data size identification carried in the data transmission request;
and step S40, transmitting the data to be transmitted to the target server based on the transmission condition of the priority transmission list.
Understandably, the resources of each edge server are limited, and all the edge servers are processing the existing tasks, and a certain resource is also needed for processing the data to be processed, so that in order for the edge servers to have enough resources to process the data to be processed, the suitable target server needs to be determined from each edge server according to the task parameters of each edge server and the data size identifier carried by the data transmission request. The task parameters of the edge server represent the currently available resources of the edge server, the data size identifier represents the resources required for processing the data to be transmitted, and the edge server with available resources larger than the required resources is determined by comparing the two, namely the target server. And if a plurality of edge servers with available resources larger than the required resources exist, comparing the transmission time among the edge servers, and selecting the edge server with the shortest transmission time of the data to be transmitted as the target server.
Further, for the priority transmission list, corresponding transmission conditions, such as transmission speed, are set. And after the target server is determined, transmitting the data to be transmitted to the target server based on the transmission condition, and preferentially processing the data to be transmitted by the target server.
According to the low-blocking low-delay data communication method, when a data transmission request is received, whether the data transmission request carries a priority identification or not is firstly identified, if the data transmission request carries the priority identification, the data to be transmitted corresponding to the data transmission request and needing to be transmitted needs to be transmitted preferentially, and then the data to be transmitted is added to a preferential transmission list corresponding to the priority identification so as to be transmitted preferentially. In addition, in order to facilitate rapid processing of data in different areas, the data communication system comprises a plurality of servers arranged in different areas, a plurality of edge servers with relatively short distances are determined according to the length of a transmission path between each server and the data to be transmitted, a target server is further determined according to the task conditions currently processed by each edge server and task resources required by the data to be transmitted, and the data to be transmitted is transmitted to the target server, so that the target server has enough resources to rapidly process the data to be transmitted. Therefore, on one hand, the emergency data are timely processed through the priority, on the other hand, the data in different areas are transmitted to the server which is short in distance and has enough resources to be processed, the emergency data are further guaranteed to be timely processed, and meanwhile the situation that a large amount of data are easy to block and delay is effectively avoided.
Further, referring to fig. 2, a second embodiment of the low-blocking and low-latency data communication method according to the present invention is provided based on the first embodiment of the low-blocking and low-latency data communication method according to the present invention.
The second embodiment of the low-blocking low-latency data communication method is different from the first embodiment of the low-blocking low-latency data communication method in that the step of determining a target server from the plurality of edge servers according to the task parameters of each edge server and the size identifier of data carried in the data transmission request includes:
step S31, determining idle resource parameters of each edge server according to the current task data volume and the preset task coefficient in the task parameters of each edge server;
further, each edge server has different tasks and different amounts of resources, and each edge server may have the same or different resources. The resources of each edge server can be represented by preset set coefficients, that is, the preset task coefficients, the more the resources of each edge server are, the larger the numerical value of the preset task coefficient is, and the smaller the numerical value is otherwise. And determining the idle resource parameters of each edge server according to the current task data volume in the task parameters of each edge server and the preset task coefficients of each edge server. The idle resource parameter represents the number of resources remaining that the edge server is currently available to process the task. The step of determining the idle resource parameter of each edge server according to the current task data volume and the preset task coefficient in the task parameter of each edge server includes:
step S311, aiming at each edge server, determining single processing time corresponding to each single task data volume in the current task data volume;
step S312, calculating the data volume of each single task as an average data volume, and calculating the processing time of each single task as an average processing time;
step 313, calculating a current load coefficient of each edge server according to the data volume of each single task, the processing time of each single task, the average data volume and the average processing time;
step S314, performing a difference operation between the preset task coefficient of each edge server and the current load coefficient of each edge server, to obtain an idle resource parameter of each edge server.
Understandably, the task amount processed by each edge server at the same time has a plurality of items, i.e. the current task data amount of each edge server is composed of the data amounts of a plurality of single tasks. Moreover, the data volume of each single task is different, the processing time is different, so the time required by the processing can be determined according to the data volume of the single task, namely the single processing time corresponding to the data volume of each single task is obtained. And the determination of the time can be realized according to a pre-trained prediction model, the prediction model is obtained by training a large amount of time and data sample data, and the corresponding processing time is predicted by the prediction model according to the data volume of each single task.
Further, all the individual task data amounts within each edge server are calculated as an average data amount, and all the individual processing times are calculated as an average processing time. And then calculating the current load coefficient of each edge server according to the data volume of each single task, the processing time of each single task, the average data volume and the average processing time, and by combining the age coefficient of the service life of the edge server and the total task volume coefficient of the total processed task volume, wherein the calculation formula is as the following formula (1).
Wherein the content of the first and second substances,Efor the purpose of the current load factor,miin order to be able to measure the data volume of a single task,Tiin order to be a single item of processing time,αis an age factor ofα≥1，βIs a coefficient of total task amount andβ≥1，min order to average the amount of data,Tis the average processing time.
The longer the service life of the edge server is, the greater the number of tasks processed, the greater the cumulative effectiveness on the current load, and the relatively increased resources occupied. The age factor may be determined according to the age, and the longer the age is, the larger the age factor is, the corresponding relationship between the age and the age factor may be preset. Similarly, the total task amount coefficient may also be determined according to the total task amount to be processed, and the greater the total task amount to be processed, the greater the total task coefficient, the corresponding relationship between the total task amount and the total task amount coefficient may also be preset.
The current load coefficient is calculated by combining the data volume, the processing time, the average data volume and the average processing time of all the single tasks, the age limit coefficient and the total task volume coefficient, and all factors influencing the current load coefficient are fully considered, so that the calculation of the current load coefficient is more accurate. In addition, the single processing time is predicted by a prediction model trained by a large amount of sample data, so that the accuracy is high, and the accuracy of the current load coefficient is further improved.
After the current load coefficient of each edge server is obtained through calculation, difference value operation is carried out between the preset task coefficient of each edge server and the current load coefficient of each edge server, and the obtained operation result is the idle resource parameter of each edge server. And, because the accuracy of the current load coefficient used for calculating the idle resource parameter is high, the idle resource parameter calculated by the method also has higher accuracy correspondingly.
Step S32, determining a reference resource parameter corresponding to the data to be transmitted according to the data size identifier;
step S33, comparing each idle resource parameter with the reference resource parameter, determining a target idle resource parameter matched with the reference resource parameter, and determining an edge server corresponding to the target idle resource parameter as the target server.
Further, the data size identifier carried in the data transmission request represents resources required for processing the data to be transmitted, the required resources are determined as reference resource parameters, and then the reference resource parameters are compared with the idle resource parameters of each edge server, and the idle resource parameters larger than the reference resource parameters are screened out from the idle resource parameters. The screened idle resource parameters show that the edge server still has enough resources for processing the data to be transmitted, so the idle resource parameters are determined as target idle resource parameters matched with the reference resource parameters, and the edge server from which the target idle resource parameters are derived is searched as the target server.
The step of determining the edge server corresponding to the target idle resource parameter as the target server includes:
step S331, judging whether a plurality of target idle resource parameters exist, and if the plurality of target idle resource parameters exist, determining undetermined edge servers corresponding to the target idle resource parameters respectively;
step S332, calculating the transmission time of the data to be transmitted to each undetermined edge server;
step S333, screen the shortest transmission time among the transmission times, and determine the undetermined edge server corresponding to the shortest transmission time as the target server.
Understandably, there may be a plurality of idle resource parameters larger than the reference resource parameter, so it is necessary to determine whether there are a plurality of target idle resource parameters when determining the target server. If the target idle resource parameters exist, the edge server from which each target idle resource parameter originates is taken as an edge server to be determined, the transmission time of the data to be transmitted to each edge server to be determined is calculated, and the calculation formula is as the following formula (2).
Wherein the content of the first and second substances,Ttin order to be able to transmit the time,Hin order to transmit the straight-line distance,Bin order to be able to transmit the bandwidth,Nin order to be able to measure the power of the noise,Pin order to transmit the power, the power is transmitted,Gin order to achieve the gain of the transmission channel,T0is the transmission path historical delay factor.
The historical delay factor is a delay time average value caused by the existence of some factors influencing transmission and can be determined according to the monitoring of historical transmission. The transmission time is calculated by combining various factors such as transmission bandwidth, noise power, transmission channel gain, historical time delay factors and the like, so that the calculation of the transmission time can be more accurate.
And further, after the transmission time of the data to be transmitted to each undetermined edge server is calculated, comparing the transmission times, determining the shortest transmission time, and determining the undetermined edge server with the shortest transmission time as a target server.
In this embodiment, an idle resource parameter is calculated for each edge server, and a target server is determined according to a matching degree between a reference resource parameter required for processing data to be transmitted and each idle resource parameter. Because the idle resource parameter of each edge server not only considers the task data volume of each edge server, but also considers the age coefficient and the total task coefficient of each edge server, the calculation accuracy of the idle resource parameter is greatly improved, and the determined target server is correspondingly more accurate. And for the condition that a plurality of idle resource parameters matched with the reference resource parameters exist, calculating the transmission time of the edge server corresponding to each idle resource parameter, selecting the target server according to the length of the transmission time, and transmitting the data to be transmitted to the target server for processing in the shortest transmission time, thereby ensuring the processing efficiency of the data to be transmitted.
Further, referring to fig. 3, a third embodiment of the low-blocking and low-latency data communication method according to the present invention is provided based on the first or second embodiment of the low-blocking and low-latency data communication method according to the present invention.
The third embodiment of the low-blocking low-latency data communication method differs from the first or second embodiment of the low-blocking low-latency data communication method in that the step of comparing each idle resource parameter with the reference resource parameter and determining a target idle resource parameter matching the reference resource parameter comprises:
step S334, comparing each idle resource parameter with the reference resource parameter, and determining whether there is an idle resource parameter greater than the reference resource parameter in each idle resource parameter;
step S335, if yes, determining the idle resource parameter larger than the reference resource parameter as the target idle resource parameter;
step S336, if there is no idle resource parameter greater than the reference resource parameter, combining the idle resource parameters to obtain multiple combination parameters;
step S337, determining the target resource parameter according to a magnitude relationship between each of the combination parameters and the reference resource parameter, and a combination transmission time corresponding to each of the combination parameters.
Understandably, in the process of comparing each idle resource parameter with the reference resource parameter respectively and determining the target idle resource parameter, there may be no situation that any idle resource parameter is larger than the reference resource parameter and needs to be combined. Specifically, each idle resource parameter is compared with a reference resource parameter, and whether the idle resource parameter greater than the reference resource parameter exists is judged. And if the idle resource exists, determining the idle resource parameter as a target idle resource parameter. If all the idle resource parameters are not greater than the reference resource parameter, all the idle resource parameters need to be combined to obtain a plurality of combined parameters. In this case, the conditions for combination may be set in advance. For example, two combinations are set, each combination includes two idle resource parameters, or a combination of the first three idle resource parameter values is set.
Further, after a plurality of combination parameters are obtained through combination, the target resource parameters are determined from the combination parameters according to the magnitude relation between the combination parameters and the reference resource parameters and the combination transmission time corresponding to the combination parameters respectively. Specifically, the step of determining the target resource parameter according to the magnitude relationship between each of the combination parameters and the reference resource parameter and the combined transmission time corresponding to each of the combination parameters includes:
step b1, comparing each combination parameter with the reference resource parameter respectively, and determining a middle combination parameter larger than the reference resource parameter;
b2, aiming at each intermediate combination parameter, searching a combination edge server corresponding to an idle resource parameter forming the intermediate combination parameter;
step b3, calculating the combined transmission time corresponding to each combined edge server, and determining the total transmission time corresponding to each intermediate combined parameter according to each combined transmission time;
and b4, screening out the target total transmission time with the shortest time from all the total transmission times, and determining an intermediate combination parameter corresponding to the target total transmission time as the target resource parameter.
Further, although the combination parameter is composed of at least two idle resource parameters, it is possible that the combination parameter obtained by combining two idle resource parameters is still smaller than the reference resource parameter. Therefore, it is still necessary to compare each combination parameter with the reference resource parameter, and to reject the combination parameter not greater than the reference resource parameter, and to screen out the combination parameter greater than the reference resource parameter as the intermediate combination parameter.
Understandably, the intermediate combination parameter is composed of at least two idle resource parameters, each idle resource parameter is originated from a certain edge server, so that the edge server from which each idle resource parameter composing the intermediate combination parameter is originated is searched as a combined edge server. For example, the intermediate combination parameter includes an idle resource parameter D1 and an idle resource parameter D2, where D1 is derived from the edge server W1, D2 is derived from the edge server W2, and W1 and W2 are both combined edge servers.
Further, the transmission time of each combined edge server is calculated as a combined transmission time, and the calculation may be performed by equation (2) above. And then, the combined transmission time of each combined edge server is added to obtain the total transmission time corresponding to each intermediate combined parameter, wherein the total transmission time represents the time spent by the corresponding combined edge server for transmitting the data to be transmitted. For example, for the above-mentioned combined edge servers W1 and W2, the transmission times of both are calculated as combined transmission times Tw1 and Tw2, respectively, and the result of adding Tw1 and Tw2 is the total transmission time.
Furthermore, after the total transmission time of each group of combination edge servers, namely the total transmission time corresponding to each intermediate combination parameter, is obtained through calculation, comparison is performed in each total transmission time, and the total transmission time with the shortest time is screened out to be used as the target total transmission time. On one hand, the corresponding intermediate combination parameter of the target total transmission time is matched with the reference resource parameter and is enough for transmitting the data to be transmitted, and on the other hand, the target total transmission time is shortest in transmission time and can quickly transmit the data to be transmitted to the server for processing. Therefore, the corresponding intermediate combination parameter is determined as the target resource parameter, so that the data to be transmitted is transmitted to the edge server with the target resource parameter, and the rapid processing of the data to be transmitted is realized.
It should be noted that, when data to be transmitted is transmitted to the edge servers having the target resource parameters, the data to be transmitted can be determined according to the idle resource parameters of each edge server. Namely, according to the respective idle resource parameter size, one part of the data to be transmitted is transmitted to one of the edge servers for processing, and the other part of the data to be transmitted is transmitted to the other edge server for processing. In addition, a summary server may be set, and the processing results of other edge servers may be sent to the summary server to be summarized to obtain a final result. The summary server may be one of the edge servers that process the data to be transmitted, or one of the edge servers that does not process the data to be transmitted.
When the idle resource parameters cannot meet the requirements of the reference resource parameters, multiple idle resource parameters are combined to form multiple groups of combination parameters, the combination parameters which are matched with the reference resource parameters and have the shortest transmission time are screened out from the multiple groups of combination parameters, and then the corresponding edge server is determined, so that the data to be transmitted can be transmitted to the corresponding edge server as fast as possible to be processed, and the processing efficiency is ensured.
Further, referring to fig. 4, a fourth embodiment of the low-blocking and low-latency data communication method according to the present invention is provided based on the first, second, or third embodiments of the low-blocking and low-latency data communication method according to the present invention.
The fourth embodiment of the low-blocking, low-latency data communication method differs from the first, second, or third embodiments of the low-blocking, low-latency data communication method in that the step of identifying a target server from among the plurality of edge servers includes the step of identifying a target server from among the plurality of edge servers
Step S40, determining a standby server corresponding to the target server from the plurality of edge servers;
the step of transmitting the data to be transmitted to the target server based on the transmission condition of the preferential transmission list comprises the following steps:
step S50, transmitting the data to be transmitted to the standby server so as to store the data to be transmitted as standby data in the standby server, and repairing the data to be transmitted in the target server based on the standby data when the data to be transmitted in the target server is damaged.
Understandably, after the data to be transmitted is transmitted to the target server, the target server may malfunction for various reasons, resulting in the loss or damage of the data to be transmitted. In order to repair lost or damaged data to be transmitted, the embodiment is provided with a standby data mechanism. Specifically, after the target server is determined from the plurality of edge servers, the server is further screened from other remaining edge servers as a standby server corresponding to the target server. In addition, any one of the remaining edge servers may be used as a backup server, an edge server having the longest transmission time may be used as a backup server, or an edge server having a transmission time that is next to the destination server may be used as a backup server.
Further, after the data to be transmitted is transmitted to the target server, the data to be transmitted is also transmitted to the standby server, so that the data to be transmitted is stored in the standby server as standby data. And once the target server fails to cause the data to be transmitted to be lost or damaged, the standby data of the standby server is used for repairing. Specifically, the step of repairing the data to be transmitted in the target server based on the backup data includes:
step S51, detecting the total quantity of the standby data, the missing data quantity of the data to be transmitted relative to the standby data and the difference data quantity between the standby data and the data to be transmitted;
step S52, determining a missing coefficient corresponding to the missing data amount and a difference coefficient corresponding to the difference data amount according to the proportional relation between the missing data amount and the difference data amount;
step S53, calculating a data repair coefficient according to the total data amount, the missing data amount, the difference data amount, the missing coefficient and the difference coefficient;
and S54, transmitting the standby data to the target server according to the data repair coefficient, and repairing the data to be transmitted.
Understandably, the standby server has own data to be processed, the standby data is used for repairing the data to be transmitted in the target server, and the data processed by the standby server is not influenced. Therefore, in this embodiment, the data to be transmitted is repaired according to the repair urgency level embodied by the repair coefficient. Specifically, the total data amount of the standby data is detected, the standby data and the data to be transmitted are compared, the data missing relative to the standby data of the data to be transmitted and the difference data between the data to be transmitted and the standby data are determined, and the missing data amount and the difference data amount are obtained respectively.
Further, the amount of missing data and the amount of difference data represent the degree of damage of the data to be transmitted, and the degree of damage of the missing data is higher than that of the difference data. The missing data amount and the difference data amount are added and processed, the ratio of the missing data amount to the addition result is used, the ratio of the difference data amount to the addition result is used, the proportional relation between the missing data amount and the difference data amount is reflected by the ratio relation, and then the proportion of the missing data to the whole damaged data and the proportion of the difference data to the whole damaged data are determined.
Furthermore, the mapping relation between the proportional range and the coefficient is preset, the obtained proportional relation is compared with the comparison range in each mapping relation, the proportional range in which the proportional relation falls is determined, and the coefficient of the proportional range in the mapping relation is searched. The searched coefficients include a coefficient related to missing data and a coefficient related to difference data, i.e., a missing coefficient corresponding to the amount of missing data and a difference coefficient corresponding to the amount of difference data, respectively. And calculating a data repair coefficient according to the total data amount, the missing data amount, the difference data amount, the missing coefficient and the difference coefficient of the spare data, wherein the calculation formula is shown as the following formula (3).
Wherein the content of the first and second substances,win order to be a data repair factor,nas the total amount of data,n1in order to be able to miss the amount of data,n2in order to be the amount of the difference data,k1in order to obtain the missing coefficients,k2is the coefficient of difference.
The larger the calculated data repair coefficient value is, the higher the damage degree of the data to be transmitted is, and the data needs to be repaired as soon as possible. Presetting a preset threshold value representing the magnitude of the numerical value, comparing the calculated data repair coefficient with the preset threshold value, if the data repair coefficient is larger than the preset threshold value, preferentially repairing the data to be transmitted by the waiting task of the standby server, otherwise, firstly processing the waiting task of the standby server and then repairing the data to be transmitted, or simultaneously processing the waiting task and the data to be transmitted. When in repair, the standby data is transmitted to the target server, only missing data or difference data in the data to be transmitted can be transmitted so as to repair the missing data or the data with difference in the data to be transmitted, and all the standby data can be transmitted to the target server so as to perform replacement repair on the data to be transmitted.
In the embodiment, the standby repair mechanism is arranged, the data to be transmitted is transmitted to the standby server to serve as the standby data, and when the data to be transmitted is damaged, the data to be transmitted is repaired through the standby data, so that the safety of the data to be transmitted is ensured. And moreover, the influence on the data processing of the standby server is avoided by calculating the data restoration coefficient during restoration, so that the data restoration is more reasonable and accurate.
In addition, the embodiment of the invention also provides a data communication system with low blocking and low delay. Referring to fig. 5, fig. 5 is a schematic structural diagram of a hardware operating environment of a device according to an embodiment of the data communication system with low blocking and low latency.
As shown in fig. 5, the low-blocking low-latency data communication system may include: a processor 1001, such as a CPU, a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. The communication bus 1002 is used to implement connection communication among these components. The user interface 1003 may include a Display (Display), an input unit such as a Keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface). The memory 1005 may be a high-speed RAM memory or a non-volatile memory (e.g., a magnetic disk memory). The memory 1005 may alternatively be a memory device separate from the processor 1001 described above.
Those skilled in the art will appreciate that the hardware configuration of the low-blocking low-latency data communication system illustrated in fig. 5 does not constitute a limitation of the low-blocking low-latency data communication system, and may include more or fewer components than those illustrated, or some components in combination, or a different arrangement of components.
As shown in fig. 5, a memory 1005, which is a storage medium, may include therein an operating system, a network communication module, a user interface module, and a control program. The operating system is a program for managing and controlling a low-blocking low-delay data communication system and software resources, and supports the running of a network communication module, a user interface module, a control program and other programs or software; the network communication module is used to manage and control the network interface 1004; the user interface module is used to manage and control the user interface 1003.
In the hardware structure of the data communication system with low blocking and low delay shown in fig. 5, the network interface 1004 is mainly used for connecting a background server and performing data communication with the background server; the user interface 1003 is mainly used for connecting a client (user side) and performing data communication with the client; the processor 1001 may call the control program stored in the memory 1005 and perform the following operations:
when a data transmission request is received, determining whether the data transmission request carries a priority identification;
if the data communication system carries a priority identification, controlling to add the data to be transmitted corresponding to the data transmission request to a priority transmission list corresponding to the priority identification, and determining a plurality of edge servers corresponding to the data transmission request in the data communication system;
determining a target server from the plurality of edge servers according to the task parameters of each edge server and the data size identification carried in the data transmission request;
and transmitting the data to be transmitted to the target server based on the transmission condition of the priority transmission list.
Further, the step of determining a target server from the plurality of edge servers according to the task parameters of each edge server and the data size identifier carried in the data transmission request includes:
determining idle resource parameters of each edge server according to the current task data volume and a preset task coefficient in the task parameters of each edge server;
determining a reference resource parameter corresponding to the data to be transmitted according to the data size identifier;
and comparing each idle resource parameter with the reference resource parameter, determining a target idle resource parameter matched with the reference resource parameter, and determining the edge server corresponding to the target idle resource parameter as the target server.
Further, the step of determining the idle resource parameter of each edge server according to the current task data amount and the preset task coefficient in the task parameter of each edge server includes:
determining single processing time corresponding to each single task data volume in the current task data volume respectively for each edge server;
calculating the data volume of each single task as an average data volume, and calculating the processing time of each single task as an average processing time;
calculating the current load coefficient of each edge server according to the data volume of each single task, the processing time of each single task, the average data volume and the average processing time, wherein the calculation formula is as follows:
wherein the content of the first and second substances,Efor the purpose of the current load factor,mithe amount of data for a single task is,Tiin order to be a single item of processing time,αis an age factor ofα≥1，βIs a coefficient of total task amount andβ≥1，min order to average the amount of data,Tis the average treatment time;
and performing difference operation on a preset task coefficient of each edge server and the current load coefficient of each edge server to obtain an idle resource parameter of each edge server.
Further, the step of determining the edge server corresponding to the target idle resource parameter as the target server includes:
judging whether a plurality of target idle resource parameters exist or not, and if the plurality of target idle resource parameters exist, determining undetermined edge servers corresponding to the target idle resource parameters respectively;
calculating the transmission time of the data to be transmitted to each undetermined edge server, wherein the calculation formula is as follows:
wherein the content of the first and second substances,Ttin order to be able to transmit the time,Hin order to transmit the straight-line distance,Bin order to be able to transmit the bandwidth,Nin order to be able to measure the power of the noise,Pin order to transmit the power, the power is transmitted,Gin order to achieve the gain of the transmission channel,T0historical delay factors for the transmission path;
and screening the shortest transmission time in the transmission times, and determining the undetermined edge server corresponding to the shortest transmission time as the target server.
Further, the step of comparing each idle resource parameter with the reference resource parameter and determining a target idle resource parameter matching the reference resource parameter includes:
comparing each idle resource parameter with the reference resource parameter respectively, and judging whether the idle resource parameter larger than the reference resource parameter exists in each idle resource parameter;
if yes, determining the idle resource parameter larger than the reference resource parameter as the target idle resource parameter;
if the idle resource parameters larger than the reference resource parameter do not exist, combining the idle resource parameters to obtain a plurality of combined parameters;
and determining the target resource parameters according to the magnitude relation between each combination parameter and the reference resource parameters and the combination transmission time corresponding to each combination parameter.
Further, the step of determining the target resource parameter according to the magnitude relationship between each of the combination parameters and the reference resource parameter and the combination transmission time corresponding to each of the combination parameters includes:
comparing each combination parameter with the reference resource parameter respectively, and determining a middle combination parameter larger than the reference resource parameter;
aiming at each intermediate combination parameter, searching a combination edge server corresponding to an idle resource parameter forming the intermediate combination parameter;
calculating the combined transmission time corresponding to each combined edge server, and determining the total transmission time corresponding to each intermediate combined parameter according to each combined transmission time;
and screening out the target total transmission time with the shortest time from all the total transmission times, and determining an intermediate combination parameter corresponding to the target total transmission time as the target resource parameter.
Further, after the step of determining the target server from the plurality of edge servers, the processor 1001 may call the control program stored in the memory 1005, and perform the following operations:
determining a standby server corresponding to the target server from the plurality of edge servers;
after the step of transmitting the data to be transmitted to the target server based on the transmission condition of the prioritized transmission list, the processor 1001 may call the control program stored in the memory 1005 and perform the following operations:
and transmitting the data to be transmitted to the standby server so as to store the data to be transmitted as standby data in the standby server, and repairing the data to be transmitted in the target server based on the standby data when the data to be transmitted in the target server is damaged.
Further, the step of repairing the data to be transmitted in the target server based on the backup data includes:
detecting the total quantity of the standby data, the missing data quantity of the data to be transmitted relative to the standby data and the difference data quantity between the standby data and the data to be transmitted;
determining a missing coefficient corresponding to the missing data amount and a difference coefficient corresponding to the difference data amount according to a proportional relation between the missing data amount and the difference data amount;
calculating a data restoration coefficient according to the total data amount, the missing data amount, the difference data amount, the missing coefficient and the difference coefficient, wherein the calculation formula is as follows:
according to the data restoration coefficient, transmitting the standby data to the target server, and restoring the data to be transmitted;
wherein the content of the first and second substances,win order to be a data repair factor,nis the total amount of the data,n1in order to have the amount of missing data,n2in order to be the amount of the difference data,k1in order to be a missing coefficient,k2is the coefficient of difference.
The specific implementation of the low-blocking low-delay data communication system of the present invention is basically the same as the embodiments of the low-blocking low-delay data communication method described above, and will not be described herein again.
The embodiment of the invention also provides a readable storage medium. The readable storage medium has stored thereon a control program which, when executed by a processor, implements the steps of the low-blocking low-latency data communication method described above.
The readable storage medium of the present invention may be a computer readable storage medium, and the specific implementation manner of the readable storage medium of the present invention is substantially the same as that of each embodiment of the low-blocking low-latency data communication method, which is not described herein again.
The present invention is described in connection with the accompanying drawings, but the present invention is not limited to the above embodiments, which are only illustrative and not restrictive, and those skilled in the art can make various changes without departing from the spirit and scope of the invention as defined by the appended claims, and all changes that come within the meaning and range of equivalency of the specification and drawings that are obvious from the description and the attached claims are intended to be embraced therein.
Claims (8)
1. A low-blocking low-delay data communication method is applied to a low-blocking low-delay data communication system, and comprises the following steps:
when a data transmission request is received, determining whether the data transmission request carries a priority identification;
if the data communication system carries the priority identification, controlling to add the data to be transmitted corresponding to the data transmission request to a priority transmission list corresponding to the priority identification, and determining a plurality of edge servers corresponding to the data transmission request in the data communication system;
determining a target server from the plurality of edge servers according to the task parameters of each edge server and the data size identification carried in the data transmission request;
transmitting the data to be transmitted to the target server based on the transmission condition of the priority transmission list;
the step of determining the target server from the plurality of edge servers according to the task parameters of each edge server and the data size identifier carried in the data transmission request comprises:
determining idle resource parameters of each edge server according to the current task data volume and a preset task coefficient in the task parameters of each edge server;
determining a reference resource parameter corresponding to the data to be transmitted according to the data size identifier;
comparing each idle resource parameter with the reference resource parameter, determining a target idle resource parameter matched with the reference resource parameter, and determining an edge server corresponding to the target idle resource parameter as the target server;
the step of determining the idle resource parameters of each edge server according to the current task data volume and the preset task coefficient in the task parameters of each edge server comprises:
determining single processing time corresponding to each single task data volume in the current task data volume respectively for each edge server;
calculating the data volume of each single task as an average data volume, and calculating the processing time of each single task as an average processing time;
calculating the current load coefficient of each edge server according to the data volume of each single task, the processing time of each single task, the average data volume and the average processing time, wherein the calculation formula is as follows:
wherein, the first and the second end of the pipe are connected with each other,Efor the purpose of the current load factor,miin order to be able to measure the data volume of a single task,Tiin order to be a single item of processing time,αis an age factor ofα≥1，βIs a coefficient of total task amount andβ≥1，min order to average the amount of data,Tis the average treatment time;
and performing difference operation on a preset task coefficient of each edge server and the current load coefficient of each edge server to obtain an idle resource parameter of each edge server.
2. The data communication method of claim 1, wherein the determining the edge server corresponding to the target free resources parameter as the target server comprises:
judging whether a plurality of target idle resource parameters exist or not, and if the plurality of target idle resource parameters exist, determining undetermined edge servers corresponding to the target idle resource parameters respectively;
calculating the transmission time of the data to be transmitted to each undetermined edge server, wherein the calculation formula is as follows:
wherein, the first and the second end of the pipe are connected with each other,Ttin order to be able to transmit the time,Hin order to transmit the straight-line distance,Bin order to be able to transmit the bandwidth,Nin order to be the power of the noise,Pin order to transmit the power of the radio,Gin order to achieve the gain of the transmission channel,T0is a transmission path historical delay factor;
and screening the shortest transmission time in the transmission times, and determining the undetermined edge server corresponding to the shortest transmission time as the target server.
3. The data communication method according to claim 1, wherein the step of comparing each idle resource parameter with the reference resource parameter and determining a target idle resource parameter matching the reference resource parameter comprises:
comparing each idle resource parameter with the reference resource parameter respectively, and judging whether the idle resource parameter larger than the reference resource parameter exists in each idle resource parameter;
if yes, determining the idle resource parameter larger than the reference resource parameter as the target idle resource parameter;
if the idle resource parameters larger than the reference resource parameters do not exist, combining the idle resource parameters to obtain a plurality of combined parameters;
and determining the target idle resource parameters according to the magnitude relation between each combination parameter and the reference resource parameter and the combination transmission time corresponding to each combination parameter.
4. The data communication method according to claim 3, wherein the step of determining the target idle resource parameter according to the magnitude relationship between each of the combination parameters and the reference resource parameter and the combined transmission time corresponding to each of the combination parameters comprises:
comparing each combination parameter with the reference resource parameter respectively, and determining a middle combination parameter larger than the reference resource parameter;
aiming at each intermediate combination parameter, searching a combination edge server corresponding to an idle resource parameter forming the intermediate combination parameter;
calculating the combined transmission time corresponding to each combined edge server, and determining the total transmission time corresponding to each intermediate combined parameter according to each combined transmission time;
and screening out the target total transmission time with the shortest time from all the total transmission times, and determining an intermediate combination parameter corresponding to the target total transmission time as the target idle resource parameter.
5. The data communication method of claim 1, wherein said step of determining a destination server from a plurality of said edge servers is followed by comprising
Determining a standby server corresponding to the target server from a plurality of edge servers;
the step of transmitting the data to be transmitted to the target server based on the transmission condition of the preferential transmission list comprises the following steps:
and transmitting the data to be transmitted to the standby server so as to store the data to be transmitted as standby data in the standby server, and repairing the data to be transmitted in the target server based on the standby data when the data to be transmitted in the target server is damaged.
6. The data communication method according to claim 5, wherein the step of repairing the data to be transmitted in the target server based on the backup data comprises:
detecting the total data amount of the standby data, the missing data amount of the data to be transmitted relative to the standby data and the difference data amount between the standby data and the data to be transmitted;
determining a missing coefficient corresponding to the missing data quantity and a difference coefficient corresponding to the difference data quantity according to the proportional relation between the missing data quantity and the difference data quantity;
calculating a data restoration coefficient according to the total data amount, the missing data amount, the difference data amount, the missing coefficient and the difference coefficient, wherein the calculation formula is as follows:
according to the data restoration coefficient, transmitting the standby data to the target server, and restoring the data to be transmitted;
wherein the content of the first and second substances,win order to repair the coefficients for the data,nas the total amount of data,n1in order to be able to miss the amount of data,n2in order to be the amount of the difference data,k1in order to be a missing coefficient,k2is the coefficient of difference.
7. A low-blocking low-latency data communication system, said low-blocking low-latency data communication system comprising: a memory, a processor, a communication bus, and a control program stored on the memory:
the communication bus is used for realizing connection communication between the processor and the memory;
the processor is adapted to execute the control program to implement the steps of the low-blocking low-latency data communication method of any one of claims 1-6.
8. A readable storage medium having stored thereon a control program which, when executed by a processor, carries out the steps of the low-blocking low-latency data communication method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310012450.1A CN115801693B (en) | 2023-01-05 | 2023-01-05 | Low-blocking low-delay data communication method and system and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310012450.1A CN115801693B (en) | 2023-01-05 | 2023-01-05 | Low-blocking low-delay data communication method and system and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115801693A CN115801693A (en) | 2023-03-14 |
| CN115801693B true CN115801693B (en) | 2023-04-07 |
Family
ID=85428613
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310012450.1A Active CN115801693B (en) | 2023-01-05 | 2023-01-05 | Low-blocking low-delay data communication method and system and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115801693B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017186260A1 (en) * | 2016-04-25 | 2017-11-02 | Huawei Technologies Co., Ltd. | Edge server and method of operating an edge server |
| CN109800058A (en) * | 2019-01-23 | 2019-05-24 | 山东超越数控电子股份有限公司 | A kind of virtual machine Autonomic Migration Framework method |
| CN110650487A (en) * | 2019-09-27 | 2020-01-03 | 常熟理工学院 | Internet of things edge computing configuration method based on data privacy protection |
| CN113326126A (en) * | 2021-05-28 | 2021-08-31 | 湘潭大学 | Task processing method, task scheduling device and computer equipment |
| CN113783798A (en) * | 2021-09-24 | 2021-12-10 | 上海明胜品智人工智能科技有限公司 | Data transmission method and system and edge service equipment |
| CN113961264A (en) * | 2021-09-30 | 2022-01-21 | 河海大学 | Intelligent unloading algorithm and system for video monitoring cloud edge coordination |
| CN114039819A (en) * | 2022-01-07 | 2022-02-11 | 中大检测(湖南)股份有限公司 | Edge intelligent gateway based on 5G |
| CN114528092A (en) * | 2022-01-04 | 2022-05-24 | 中国神华能源股份有限公司神朔铁路分公司 | Edge node task scheduling method and device, computer equipment and storage medium |
| CN114969444A (en) * | 2022-05-24 | 2022-08-30 | 北京百度网讯科技有限公司 | Data processing method and device, electronic equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112637290B (en) * | 2020-12-14 | 2024-03-19 | 厦门宏泰科技研究院有限公司 | Global communication network system based on micro base station and edge calculation |
-
2023
- 2023-01-05 CN CN202310012450.1A patent/CN115801693B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017186260A1 (en) * | 2016-04-25 | 2017-11-02 | Huawei Technologies Co., Ltd. | Edge server and method of operating an edge server |
| CN109800058A (en) * | 2019-01-23 | 2019-05-24 | 山东超越数控电子股份有限公司 | A kind of virtual machine Autonomic Migration Framework method |
| CN110650487A (en) * | 2019-09-27 | 2020-01-03 | 常熟理工学院 | Internet of things edge computing configuration method based on data privacy protection |
| CN113326126A (en) * | 2021-05-28 | 2021-08-31 | 湘潭大学 | Task processing method, task scheduling device and computer equipment |
| CN113783798A (en) * | 2021-09-24 | 2021-12-10 | 上海明胜品智人工智能科技有限公司 | Data transmission method and system and edge service equipment |
| CN113961264A (en) * | 2021-09-30 | 2022-01-21 | 河海大学 | Intelligent unloading algorithm and system for video monitoring cloud edge coordination |
| CN114528092A (en) * | 2022-01-04 | 2022-05-24 | 中国神华能源股份有限公司神朔铁路分公司 | Edge node task scheduling method and device, computer equipment and storage medium |
| CN114039819A (en) * | 2022-01-07 | 2022-02-11 | 中大检测(湖南)股份有限公司 | Edge intelligent gateway based on 5G |
| CN114969444A (en) * | 2022-05-24 | 2022-08-30 | 北京百度网讯科技有限公司 | Data processing method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115801693A (en) | 2023-03-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8560667B2 (en) | Analysis method and apparatus | |
| CN110417591B (en) | Voting node configuration method and system | |
| CN110704231A (en) | Fault processing method and device | |
| EP3806432A1 (en) | Method for changing service on device and service changing system | |
| US9558091B2 (en) | Information processing device, fault avoidance method, and program storage medium | |
| CN109981744B (en) | Data distribution method and device, storage medium and electronic equipment | |
| US11294736B2 (en) | Distributed processing system, distributed processing method, and recording medium | |
| US20210065083A1 (en) | Method for changing device business and business change system | |
| EP3541048A1 (en) | Method and apparatus for determining main scheduler from cloud computing system | |
| CN113543117B (en) | Prediction method and device for number portability user and computing equipment | |
| CN106656675B (en) | Detection method and device for transmission node cluster | |
| CN114840392A (en) | Method, apparatus, medium, and program product for monitoring task scheduling exception | |
| CN115801693B (en) | Low-blocking low-delay data communication method and system and readable storage medium | |
| CN107438015B (en) | intelligent power communication network virtual resource mapping method and device | |
| CN108985556A (en) | Method, apparatus, equipment and the computer storage medium of flow scheduling | |
| CN110941545A (en) | Method and device for processing regression test case based on defects and computing equipment | |
| US20180322412A1 (en) | Ticket Routing | |
| CN115774602A (en) | Container resource allocation method, device, equipment and storage medium | |
| CN110728306A (en) | Target parameter selection method in reverse proxy evaluation model and related device | |
| CN110795239A (en) | Application memory leakage detection method and device | |
| CN110880117A (en) | False service identification method, device, equipment and storage medium | |
| CN114237981A (en) | Data recovery method, device, equipment and storage medium | |
| CN114826908A (en) | Kubernets cluster service guarantee method, assembly and system | |
| CN112948229A (en) | Method and device for determining performance of scheduling cluster, computer equipment and storage medium | |
| CN112732451A (en) | Load balancing system in cloud environment |
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 |