CN112261091B - Signaling routing method, device, server and computer readable storage medium based on bypass service cluster - Google Patents
Signaling routing method, device, server and computer readable storage medium based on bypass service cluster Download PDFInfo
- Publication number
- CN112261091B CN112261091B CN202011047626.XA CN202011047626A CN112261091B CN 112261091 B CN112261091 B CN 112261091B CN 202011047626 A CN202011047626 A CN 202011047626A CN 112261091 B CN112261091 B CN 112261091B
- Authority
- CN
- China
- Prior art keywords
- load
- historical
- bypass
- data
- load data
- 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/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/29—Flow control; Congestion control using a combination of thresholds
-
- 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
- H04L67/1004—Server selection for load balancing
- H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application discloses a signaling routing method based on bypass service clusters, which is applied to a server and comprises the following steps: receiving a signaling to be forwarded, and acquiring a room number corresponding to the signaling to be forwarded; judging whether a preset room code set contains the room number, if not, executing a bypass server determining operation aiming at a bypass service cluster to obtain a target bypass server; forwarding the signaling to be forwarded to the target bypass server. The embodiment of the application has the advantage of improving the bypass service cluster efficiency.
Description
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a signaling routing method, device, server and computer readable storage medium based on bypass service clusters.
Background
With the development of live broadcasting technology, the bypass service is used as a receiving user to join the low-delay real-time network, receives signaling (the signaling contains information such as room, live broadcasting user, wheat-connected user, media stream, etc.) from the low-delay real-time network, pulls the audio and video stream out of the low-delay real-time network according to the signaling information, selectively carries out transcoding, mixed stream, recording, etc., and then forwards the audio and video stream to the content distribution network, and then distributes the audio and video stream to the user watching the live broadcasting through the content distribution network.
When the business is developed to a certain scale, the bypass service will not be adequate using only a single machine. In order to access more traffic and improve the overall load capacity of the system, and simultaneously in order to prevent single-point faults, the bypass service is clustered at the moment, overload problems are easily generated in the bypass service clustering, currently, load balancing strategies such as polling, weighted polling and fastest response are mainly available, but the load balancing strategies lack a feedback mechanism and are not suitable for stateful service clusters, overload of the bypass service is easily caused, the bypass service cluster is crashed, and therefore the efficiency of the bypass service cluster is low, and the user experience is low.
Disclosure of Invention
The embodiment of the application provides a signaling routing method, device, server and computer readable storage medium based on bypass service clusters, which are used for improving the efficiency of the bypass service clusters and improving the user experience.
In a first aspect, an embodiment of the present application provides a signaling routing method based on a bypass service cluster, which is applied to a server, and the method includes:
receiving a signaling to be forwarded, and acquiring a room number corresponding to the signaling to be forwarded;
Judging whether a preset room code set contains the room number, if not, executing a bypass server determining operation aiming at a bypass service cluster to obtain a target bypass server;
forwarding the signaling to be forwarded to the target bypass server.
In one embodiment, the performing a bypass server determination operation for a bypass service cluster includes: acquiring a historical load data set corresponding to the bypass service cluster, wherein any group of historical load data in the historical load data set comprises: historical usage data and historical way count data; performing screening operation on the historical bypass load data set based on a preset load threshold value to obtain a load data set to be selected; judging whether the load data set to be selected is an empty set or not; if the load data set to be selected is a non-empty set, performing comprehensive load value calculation aiming at the load data set to be selected to obtain a comprehensive load value set; and determining the bypass server corresponding to the minimum value in the comprehensive load value set as a target bypass server.
In one embodiment, the performing the comprehensive load value calculation on the load data set to be selected to obtain a comprehensive load value set includes: performing comprehensive load value calculation operation on a plurality of groups of load data to be selected contained in the load data set to be selected to obtain the comprehensive load value set; wherein the integrated load value calculation operation includes: determining any group of load data to be selected as target data in the plurality of groups of load data to be selected; acquiring historical road number data corresponding to the target data from the historical load data set; acquiring a preset load factor association coefficient matrix, and calculating a plurality of load factor weights based on the historical road number data and the load factor association coefficient matrix; and performing weighted calculation based on the plurality of load factor weights and the historical usage data to obtain a comprehensive load value corresponding to the target data.
In one embodiment, the calculating a plurality of load factor weights based on the historical road count data and the load factor association coefficient matrix includes: extracting a plurality of road number values corresponding to a plurality of preset operations from the historical road number data, and executing accumulation operation based on the plurality of road number values to obtain a total road number value; inputting the plurality of road number values into a preset road number factor calculation formula to obtain a plurality of road number factors, wherein the road number factor calculation formula comprises: road number factor = road number value/total road number value; and for any one of the plurality of load factors, extracting a plurality of association coefficients corresponding to the any one load factor and the plurality of preset operations from the load factor association coefficient matrix, and performing a weighted calculation operation on the plurality of association coefficients and the plurality of road number factors to obtain a load factor weight corresponding to the any one load factor.
In one embodiment, the performing a filtering operation on the historical bypass load data set based on a preset load threshold includes: for any one group of the historical load data in the historical bypass load data set, acquiring the historical use data from the historical load data, wherein the historical use data comprises: a plurality of usage rates; performing traversal screening on the plurality of utilization rates based on the load threshold; if any one of the utilization rates is greater than the load threshold, determining that the historical load data is non-candidate load data; and if any one of the utilization rates is not greater than the load threshold, determining that the historical load data is the load data to be selected.
In one embodiment, the method further comprises: if the load data set to be selected is an empty set, determining that the bypass service cluster is in a full-load state; and storing the signaling to be forwarded to a signaling queue.
In one embodiment, the method further comprises: if the room code set contains the room number, acquiring a bypass server number corresponding to the room number; forwarding the signaling to be forwarded to the bypass server.
In a second aspect, an embodiment of the present application provides a signaling routing device based on a bypass service cluster, applied to a server, where the device includes:
the receiving unit is used for receiving the signaling to be forwarded and acquiring a room number corresponding to the signaling to be forwarded;
the judging unit is used for judging whether a preset room code set contains the room number or not, and if not, executing a bypass server determining operation aiming at the bypass service cluster to obtain a target bypass server;
and the forwarding unit is used for forwarding the signaling to be forwarded to the target bypass server.
In a third aspect, embodiments of the present application provide a server comprising a processor, a memory, a communication interface, and one or more programs stored in the memory and configured to be executed by the processor, the programs comprising instructions for performing part or all of the steps described in the method of the first aspect of embodiments of the present application.
In a fourth aspect, embodiments of the present application provide a computer readable storage medium, where the computer readable storage medium is used to store a computer program, where the computer program is executed by a processor to implement some or all of the steps described in the method according to the first aspect of the embodiments of the present application.
It can be seen that, in the embodiment of the present application, a server receives a signaling to be forwarded, and acquires a room number corresponding to the signaling to be forwarded; judging whether a preset room code set contains the room number, if not, executing a bypass server determining operation aiming at a bypass service cluster to obtain a target bypass server; forwarding the signaling to be forwarded to the target bypass server. Therefore, the target bypass server corresponding to the signaling to be forwarded can be determined aiming at the bypass service cluster, the overload condition of the bypass service and the collapse of the bypass service cluster are avoided, the efficiency of the bypass service cluster is improved, and the user experience is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic application environment diagram of a signaling routing method based on a bypass service cluster according to an embodiment of the present application;
fig. 2 is a schematic flow chart of a signaling routing method based on a bypass service cluster according to an embodiment of the present application;
fig. 3 is a schematic diagram of an application framework of signaling routing based on bypass service clusters according to an embodiment of the present application;
fig. 4 is a flow chart of another signaling routing method based on bypass service clusters according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a server 500 according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a signaling routing device based on a bypass service cluster according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The terms "first," "second," "third," and "fourth" and the like in the description and in the claims and drawings are used for distinguishing between different objects and not necessarily for describing a particular sequential or chronological order. Furthermore, the terms "comprise" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those listed steps or elements but may include other steps or elements not listed or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, result, or characteristic described in connection with the embodiment may be included in at least one embodiment of the invention. The appearances of such phrases in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments.
In the following, some terms in the present application are explained for easy understanding by those skilled in the art.
The electronic devices may include various handheld devices, vehicle mounted devices, wearable devices (e.g., smart watches, smart bracelets, pedometers, etc.), computing devices or other processing devices communicatively coupled to wireless modems, as well as various forms of User Equipment (UE), mobile Stations (MSs), terminal devices (terminal devices), etc. For convenience of description, the above-mentioned devices are collectively referred to as electronic devices.
Referring to fig. 1, fig. 1 is a schematic application environment diagram of a signaling routing method based on a bypass service cluster, where a server 101 and an electronic device 102 communicate through a network, where the server 101 and the electronic device 102 may be, but are not limited to, various personal computers, notebook computers, smart phones, tablet computers and portable wearable devices, and the server 104 may be implemented by an independent server or a server cluster formed by a plurality of servers.
The electronic device 102 transmits signaling with the server 101 through the network, and after the server 101 receives the signaling, a signaling routing method is executed for the signaling, a target bypass server is determined in the bypass service cluster, and the target bypass server is supposed to send the signaling.
Referring to fig. 2, fig. 2 is a flow chart of a signaling routing method based on a bypass service cluster according to an embodiment of the present application, and the method is applied to the server in fig. 1 for illustration, and includes the following steps:
optionally, before receiving the signaling to be forwarded, a room association cache and a load association cache are established based on a preset room set and a bypass service cluster, wherein the room association cache is used for associating a room number and a bypass server number, the load association cache is used for associating the bypass server number and a load factor, one room number corresponds to one bypass server number one by one, and one bypass server number corresponds to one load factor group one by one.
Optionally, after receiving the signaling to be forwarded, extracting signaling information corresponding to the signaling to be forwarded, and extracting a room number from the signaling information, where the room number is used to determine a room for sending the signaling to be forwarded.
optionally, whether the preset room code set contains a room number is judged, if so, a room corresponding to the room number is determined to be a registered room, and if not, a room corresponding to the room number is determined to be a new room.
And 203, forwarding the signaling to be forwarded to the target bypass server.
In one possible example, the performing a bypass server determination operation for a bypass service cluster includes: acquiring a historical load data set corresponding to the bypass service cluster, wherein any group of historical load data in the historical load data set comprises: historical usage data and historical way count data; performing screening operation on the historical bypass load data set based on a preset load threshold value to obtain a load data set to be selected; judging whether the load data set to be selected is an empty set or not; if the load data set to be selected is a non-empty set, performing comprehensive load value calculation aiming at the load data set to be selected to obtain a comprehensive load value set; and determining the bypass server corresponding to the minimum value in the comprehensive load value set as a target bypass server.
Wherein the historical usage data may include: cpu usage, memory usage, disk IO usage, network bandwidth usage, and the like, without limitation.
Wherein, the historical road number data may include: the number of pull channels, the number of mixed channels, the number of transcoded channels, the number of recorded channels, and the number of push channels are not limited herein.
Optionally, the historical load data set corresponds to a bypass service cluster, and any one set of historical load data in the historical load data set corresponds to one bypass load server in the bypass service cluster through a load association cache.
Optionally, before performing the bypass service cluster determination operation for the bypass service cluster, the method further includes: and setting a load data feedback mechanism for the bypass service cluster, namely setting a plurality of feedback time points, and controlling the bypass service cluster to feed back the current load data set when the current time is matched with any feedback time point in the feedback time points.
Further, a load data set fed back by the bypass service cluster is received, and the historical load data set is updated according to the load data set.
In a possible example, the performing the comprehensive load value calculation for the candidate load data set to obtain a comprehensive load value set includes: performing comprehensive load value calculation operation on a plurality of groups of load data to be selected contained in the load data set to be selected to obtain the comprehensive load value set; wherein the integrated load value calculation operation includes: determining any group of load data to be selected as target data in the plurality of groups of load data to be selected; acquiring historical road number data corresponding to the target data from the historical load data set; acquiring a preset load factor association coefficient matrix, and calculating a plurality of load factor weights based on the historical road number data and the load factor association coefficient matrix; and performing weighted calculation based on the plurality of load factor weights and the historical usage data to obtain a comprehensive load value corresponding to the target data.
Wherein the loading factor may include: cpu usage, memory usage, disk IO usage, network bandwidth usage, and the like, are not limited herein.
The load factor correlation matrix is used for representing the influence degree of various load factors when various operations are executed, and the numerical value in the correlation matrix represents the correlation magnitude, and the larger the numerical value is, the stronger the correlation is, and the smaller the numerical value is, the weaker the correlation is.
In a specific implementation process, multiple groups of load data to be selected in the load data set to be selected are obtained, and for each group of load data to be selected in the multiple groups of load data to be selected, a comprehensive load value calculation operation is performed, that is, a first group of load data to be selected in the load data to be selected is assumed to be obtained as target data, historical path number data (for example, a pull path number 5, a mixed path number 10, a transcoding path number 4, a recording path number 3 and a push path number 9) corresponding to the target data is obtained, and a preset load factor correlation matrix is obtained, wherein the load factor correlation matrix may include:
is not limited herein; wherein cpu represents central processing unit usage, mem represents memory usage, disk represents disk usage, io represents disk io usage, bw represents network bandwidth usage. In one possible example, the calculating a plurality of load factor weights based on the historical road count data and the load factor association coefficient matrix includes: extracting a plurality of road number values corresponding to a plurality of preset operations from the historical road number data, and executing accumulation operation based on the plurality of road number values to obtain a total road number value; inputting the plurality of road number values into a preset road number factor calculation formula to obtain a plurality of road number factors, wherein the road number factor calculation formula comprises: road number factor = road number value/total road number value; and for any one of the plurality of load factors, extracting a plurality of association coefficients corresponding to the any one load factor and the plurality of preset operations from the load factor association coefficient matrix, and performing a weighted calculation operation on the plurality of association coefficients and the plurality of road number factors to obtain a load factor weight corresponding to the any one load factor.
Optionally, performing an accumulating operation based on the plurality of way number values to obtain a total way number value, i.e. obtaining the plurality of way number values: pull_cnt, mix_cnt, trans_cnt, rd_cnt and push_cnt are added up to a plurality of path numbers to obtain a total path number value total_cnt, namely:
total_cnt＝pull_cnt+mix_cnt+trans_cnt+rd_cnt+push_cnt。
further, a plurality of way count factors are calculated based on the total way count value, wherein a way count factor calculation formula includes a way count factor=way count value/total way count value, namely a pull way count factor pull ' =pull_cnt/total_cnt, a mixed way count factor mix ' =mix_cnt/total_cnt, a transcoding way count factor trans ' =trans_cnt/total_cnt, a recording way count factor rd ' =rd_cnt/total_cnt, and a push way count factor push ' =push_cnt/total_cnt.
Optionally, a plurality of load factors are obtained: for each load factor, calculating a load factor weight based on a load factor association coefficient matrix, namely, for the load factor cpu usage, acquiring a correlation coefficient cpu_pull_k of the cpu usage and a pull operation, a correlation coefficient cpu_mix_k of the cpu usage and a mixed stream operation, a correlation coefficient cpu_trans_k of the cpu usage and a transcoding operation, a correlation coefficient cpu_rd_k of the cpu usage and a correlation coefficient cpu_push_k of a push operation, and calculating a weight cpu_w of the cpu usage based on a plurality of correlation coefficients and a plurality of road number factors, namely, a calculation formula of cpu_w is as follows:
cpu_w＝cpu_pull_k*pull’+cpu_mix_k*mix’
+cpu_trans_k*trans’+cpu_rd_k*rd’+cpu_push_k*push’；
Similarly, the calculation formula of the weight mem_w of the mem usage is as follows:
mem_w＝mem_pull_k*pull’+mem_mix_k*mix’
+mem_trans_k*trans’+mem_rd_k*rd’+mem_push_k*push’；
the calculation formula of the weight disk_w of the disk usage rate is as follows:
disk_w＝disk_pull_k*pull’+disk_mix_k*mix’
+disk_trans_k+disk_rd_k+disk_push_k; the calculation formula of the weight io_w of io usage is as follows:
io_w＝io_pull_k*pull’+io_mix_k*mix’
+io_trans_k*trans’+io_rd_k*rd’+io_push_k*push’；
the calculation formula of the weight bw_w of bw usage is as follows:
bw_w＝bw_pull_k*pull’+bw_mix_k*mix’
+bw_trans_k*trans’+bw_rd_k*rd’+bw_push_k*push’；
wherein mem_pull_k is a correlation coefficient of a mem utilization rate and a pull stream operation, mem_mix_k is a correlation coefficient of a mem utilization rate and a mixed stream operation, mem_trans_k is a correlation coefficient of a mem utilization rate and a transcoding operation, mem_rd_k is a correlation coefficient of a mem utilization rate and a recording operation, and mem_push_k is a correlation coefficient of a mem utilization rate and a push stream operation; disc_pull_k is the correlation coefficient of disc usage and pull stream operation, disc_mix_k is the correlation coefficient of disc usage and mixed stream operation, disc_trans_k is the correlation coefficient of disc usage and transcoding operation, disc_rd_k is the correlation coefficient of disc usage and recording operation, and disc_push_k is the correlation coefficient of disc usage and push stream operation; the method comprises the steps that the io_pull_k is a correlation coefficient of the io utilization rate and a pull stream operation, the io_mix_k is a correlation coefficient of the io utilization rate and a mixed stream operation, the io_trans_k is a correlation coefficient of the io utilization rate and a transcoding operation, the io_rd_k is a correlation coefficient of the io utilization rate and a recording operation, and the io_push_k is a correlation coefficient of the io utilization rate and a push stream operation; the bw_pull_k is the correlation coefficient of the bw utilization rate and the pull stream operation, the bw_mix_k is the correlation coefficient of the bw utilization rate and the mixed stream operation, the bw_trans_k is the correlation coefficient of the bw utilization rate and the transcoding operation, the bw_rd_k is the correlation coefficient of the bw utilization rate and the recording operation, and the bw_push_k is the correlation coefficient of the bw utilization rate and the push stream operation.
In one possible example, the performing a screening operation on the historical bypass load dataset based on a preset load threshold includes: for any one group of the historical load data in the historical bypass load data set, acquiring the historical use data from the historical load data, wherein the historical use data comprises: a plurality of usage rates; performing traversal screening on the plurality of utilization rates based on the load threshold; if any one of the utilization rates is greater than the load threshold, determining that the historical load data is non-candidate load data; and if any one of the utilization rates is not greater than the load threshold, determining that the historical load data is the load data to be selected.
In the implementation process, historical usage data (for example: cpu usage rate 50%, mem usage rate 40%, disk usage rate 55%, io usage rate 33%, bw usage rate 66%) in any group of historical load data are obtained, and a preset load threshold is obtained, wherein the load threshold may be any preset value, and if the load threshold is 80%, judgment is made for each usage rate in the historical usage data, that is, cpu usage rate 50% < load threshold 80%, mem usage rate 40% < load threshold 80%, disk usage rate 55% < load threshold 80%, io usage rate 33% < load threshold 80%, bw usage rate 66% < load threshold 80%, it is determined that any usage rate in the historical usage data is not greater than the load threshold, and it is determined that the historical load data is load data to be selected; suppose historical usage data: the CPU utilization rate is 90%, the mem utilization rate is 40%, the disk utilization rate is 55%, the io utilization rate is 33%, and the bw utilization rate is 66%, if the CPU utilization rate is 90% > the load threshold value is 80%, one utilization rate in the historical load data is greater than the load threshold value, and it is determined that the bypass server corresponding to the historical load data is in a full load state.
In one possible example, the method further comprises: if the load data set to be selected is an empty set, determining that the bypass service cluster is in a full-load state; and storing the signaling to be forwarded to a signaling queue.
Optionally, before storing the signaling to be forwarded in the signaling queue, marking the signaling to be forwarded to be allocated to obtain unallocated signaling, and storing the unallocated signaling in the signaling queue.
In one possible example, the method further comprises: if the room code set contains the room number, acquiring a bypass server number corresponding to the room number; forwarding the signaling to be forwarded to the bypass server.
Optionally, if the room code set includes the room number, determining that the room number is a registered room, obtaining a room association cache, determining a bypass server number corresponding to the registered room based on the room association cache, obtaining historical load data of a bypass server corresponding to the bypass server number, calculating a comprehensive load value of the bypass server based on the historical load data, obtaining a preset comprehensive load threshold, judging whether the comprehensive load value is greater than the comprehensive load threshold, if so, determining that the bypass server is in a full load state, marking the signaling to be forwarded based on the bypass server number, obtaining a full load signaling to be forwarded, and storing the full load signaling to be forwarded to a signaling queue; if the signaling is smaller than the preset threshold, sending the signaling to be forwarded to the bypass server; wherein the integrated load threshold may include: 80%, 75%, 70%, etc., without limitation.
It can be seen that, in the embodiment of the present application, a server receives a signaling to be forwarded, and acquires a room number corresponding to the signaling to be forwarded; determining a target bypass server in the bypass service cluster according to whether the room number is a new room or not, if the room is a new room, determining the target bypass server in the bypass service cluster according to a preset load threshold, and thus, determining the target bypass server aiming at the load of the bypass service cluster, and avoiding causing overload condition of the bypass service and breakdown of the bypass service cluster; when the number of the bypass servers meeting the condition that the number of the bypass servers is smaller than the load threshold is larger than 1, calculating the comprehensive load value of the bypass servers, and determining the bypass server corresponding to the minimum value in the comprehensive load value as the target bypass server is beneficial to improving the efficiency of the bypass service cluster and improving the user experience.
Referring to fig. 3, fig. 3 is an application framework schematic diagram of a signaling route based on a bypass service cluster, where a user terminal performs data communication with a server through a real-time network, the real-time network sends signaling corresponding to the user operation to a signaling router in the server through a signaling flow, the real-time network sends media data corresponding to the user operation through a bypass load cluster in the media flow server, the bypass load cluster returns a load factor to the signaling router, the signaling router determines a target bypass server for forwarding the signaling based on a signaling distribution load balancing policy, sends the signaling to the target server through the signaling flow, and selectively performs transcoding, mixing, recording and other processes after the bypass server receives the signaling and the media data to obtain a processing result, and pushes the processing result to a content distribution network through the media flow, where the content distribution network distributes the processing content to the user, and the signaling router is used for performing the signaling route method based on the bypass service cluster as described in fig. 2.
Referring to fig. 4, fig. 4 is a flow chart of another signaling routing method based on a bypass service cluster, which is provided in the embodiment of the present application, and the method is applied to a server, wherein the server executes step 401, receives signaling to be forwarded, obtains a room number corresponding to the signaling to be forwarded, then executes step 402, determines whether a preset room code set includes the room number, if the room code set includes the room number, executes step 404, obtains a bypass server number corresponding to the room number, and finally forwards the signaling to be forwarded; if the room code set does not contain a room number, executing step 405 to obtain a historical load data set corresponding to the bypass service cluster, then executing step 406 to perform a screening operation on the historical bypass load data set based on a preset load threshold to obtain a to-be-selected load data set, then executing step 407 to determine whether the to-be-selected load data set is an empty set, if the to-be-selected load data set is a non-empty set, executing step 408 to perform comprehensive load value calculation on the to-be-selected load data set to obtain a comprehensive load value set, then executing step 410 to determine that a bypass server corresponding to the minimum value in the comprehensive load value set is a target bypass server, and finally forwarding the to-be-forwarded signaling; if the load data set to be selected is an empty set, step 409 is executed to determine that the bypass service cluster is in a full load state, and finally the signaling to be forwarded is stored in a signaling queue.
It should be understood that, although the steps in the flowchart of fig. 4 are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in fig. 1-4 may include multiple sub-steps or stages that are not necessarily performed at the same time, but may be performed at different times, nor do the order in which the sub-steps or stages are performed necessarily occur sequentially, but may be performed alternately or alternately with at least a portion of the sub-steps or stages of other steps or steps.
Referring to fig. 5, fig. 5 is a schematic structural diagram of a server 500 provided in the embodiment of the present application, as shown in the drawing, the server 500 includes an application processor 510, a memory 520, a communication interface 530, and one or more programs 521, where the one or more programs 521 are stored in the memory 520 and configured to be executed by the application processor 510, and the one or more programs 521 include instructions for performing the following steps:
Receiving a signaling to be forwarded, and acquiring a room number corresponding to the signaling to be forwarded;
judging whether a preset room code set contains the room number, if not, executing a bypass server determining operation aiming at a bypass service cluster to obtain a target bypass server;
forwarding the signaling to be forwarded to the target bypass server.
It can be seen that, in the embodiment of the present application, a server receives a signaling to be forwarded, and acquires a room number corresponding to the signaling to be forwarded; judging whether a preset room code set contains the room number, if not, executing a bypass server determining operation aiming at a bypass service cluster to obtain a target bypass server; forwarding the signaling to be forwarded to the target bypass server. Therefore, the target bypass server corresponding to the signaling to be forwarded can be determined aiming at the bypass service cluster, the overload condition of the bypass service and the collapse of the bypass service cluster are avoided, the efficiency of the bypass service cluster is improved, and the user experience is improved.
In one possible example, in terms of the performing bypass server determination operations for a bypass service cluster, the instructions in the program are specifically for performing the following operations: acquiring a historical load data set corresponding to the bypass service cluster, wherein any group of historical load data in the historical load data set comprises: historical usage data and historical way count data; performing screening operation on the historical bypass load data set based on a preset load threshold value to obtain a load data set to be selected; judging whether the load data set to be selected is an empty set or not; if the load data set to be selected is a non-empty set, performing comprehensive load value calculation aiming at the load data set to be selected to obtain a comprehensive load value set; and determining the bypass server corresponding to the minimum value in the comprehensive load value set as a target bypass server.
In a possible example, in the aspect of performing the comprehensive load value calculation for the candidate load data set to obtain a comprehensive load value set, the instructions in the program are specifically configured to perform the following operations: performing comprehensive load value calculation operation on a plurality of groups of load data to be selected contained in the load data set to be selected to obtain the comprehensive load value set; wherein the integrated load value calculation operation includes: determining any group of load data to be selected as target data in the plurality of groups of load data to be selected; acquiring historical road number data corresponding to the target data from the historical load data set; acquiring a preset load factor association coefficient matrix, and calculating a plurality of load factor weights based on the historical road number data and the load factor association coefficient matrix; and performing weighted calculation based on the plurality of load factor weights and the historical usage data to obtain a comprehensive load value corresponding to the target data.
In one possible example, in terms of the calculating a plurality of load factor weights based on the historical road count data and the load factor association coefficient matrix, the instructions in the program are specifically for: extracting a plurality of road number values corresponding to a plurality of preset operations from the historical road number data, and executing accumulation operation based on the plurality of road number values to obtain a total road number value; inputting the plurality of road number values into a preset road number factor calculation formula to obtain a plurality of road number factors, wherein the road number factor calculation formula comprises: road number factor = road number value/total road number value; and for any one of the plurality of load factors, extracting a plurality of association coefficients corresponding to the any one load factor and the plurality of preset operations from the load factor association coefficient matrix, and performing a weighted calculation operation on the plurality of association coefficients and the plurality of road number factors to obtain a load factor weight corresponding to the any one load factor.
In one possible example, in terms of the performing a filtering operation on the historical bypass load dataset based on a preset load threshold, the instructions in the program are specifically for performing the following operations: for any one group of the historical load data in the historical bypass load data set, acquiring the historical use data from the historical load data, wherein the historical use data comprises: a plurality of usage rates; performing traversal screening on the plurality of utilization rates based on the load threshold; if any one of the utilization rates is greater than the load threshold, determining that the historical load data is non-candidate load data; and if any one of the utilization rates is not greater than the load threshold, determining that the historical load data is the load data to be selected.
In one possible example, the instructions in the program are further for performing the following: if the load data set to be selected is an empty set, determining that the bypass service cluster is in a full-load state; and storing the signaling to be forwarded to a signaling queue.
In one possible example, the instructions in the program are further for performing the following: if the room code set contains the room number, acquiring a bypass server number corresponding to the room number; forwarding the signaling to be forwarded to the bypass server.
The foregoing description of the embodiments of the present application has been presented primarily in terms of a method-side implementation. It will be appreciated that the electronic device, in order to achieve the above-described functions, includes corresponding hardware structures and/or software modules that perform the respective functions. Those of skill in the art will readily appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is implemented as hardware or computer software driven hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The embodiment of the application may divide the functional units of the electronic device according to the above method example, for example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated in one control unit. The integrated units may be implemented in hardware or in software functional units. It should be noted that, in the embodiment of the present application, the division of the units is schematic, which is merely a logic function division, and other division manners may be implemented in actual practice.
Referring to fig. 6, fig. 6 is a schematic structural diagram of a signaling routing device based on a bypass service cluster according to an embodiment of the present application, including: a receiving module 601, a judging module 602 and a forwarding module 603, wherein:
a receiving unit 601, configured to receive a signaling to be forwarded, and obtain a room number corresponding to the signaling to be forwarded;
a judging unit 602, configured to judge whether a preset room code set includes the room number, and if not, execute a bypass server determining operation for a bypass service cluster to obtain a target bypass server;
and a forwarding unit 603, configured to forward the signaling to be forwarded to the target bypass server.
It can be seen that, in the embodiment of the present application, a server receives a signaling to be forwarded, and acquires a room number corresponding to the signaling to be forwarded; judging whether a preset room code set contains the room number, if not, executing a bypass server determining operation aiming at a bypass service cluster to obtain a target bypass server; forwarding the signaling to be forwarded to the target bypass server. Therefore, the target bypass server corresponding to the signaling to be forwarded can be determined aiming at the bypass service cluster, the overload condition of the bypass service and the collapse of the bypass service cluster are avoided, the efficiency of the bypass service cluster is improved, and the user experience is improved.
In one possible example, in the aspect of performing the bypass server determining operation for the bypass service cluster, the determining unit 602 is specifically configured to: acquiring a historical load data set corresponding to the bypass service cluster, wherein any group of historical load data in the historical load data set comprises: historical usage data and historical way count data; performing screening operation on the historical bypass load data set based on a preset load threshold value to obtain a load data set to be selected; judging whether the load data set to be selected is an empty set or not; if the load data set to be selected is a non-empty set, performing comprehensive load value calculation aiming at the load data set to be selected to obtain a comprehensive load value set; and determining the bypass server corresponding to the minimum value in the comprehensive load value set as a target bypass server.
In one possible example, in the aspect of performing the comprehensive load value calculation for the candidate load data set to obtain a comprehensive load value set, the determining unit 602 is specifically configured to: performing comprehensive load value calculation operation on a plurality of groups of load data to be selected contained in the load data set to be selected to obtain the comprehensive load value set; wherein the integrated load value calculation operation includes: determining any group of load data to be selected as target data in the plurality of groups of load data to be selected; acquiring historical road number data corresponding to the target data from the historical load data set; acquiring a preset load factor association coefficient matrix, and calculating a plurality of load factor weights based on the historical road number data and the load factor association coefficient matrix; and performing weighted calculation based on the plurality of load factor weights and the historical usage data to obtain a comprehensive load value corresponding to the target data.
In one possible example, in the calculating a plurality of load factor weights based on the historical road number data and the load factor association coefficient matrix, the determining unit 602 is specifically configured to: extracting a plurality of road number values corresponding to a plurality of preset operations from the historical road number data, and executing accumulation operation based on the plurality of road number values to obtain a total road number value; inputting the plurality of road number values into a preset road number factor calculation formula to obtain a plurality of road number factors, wherein the road number factor calculation formula comprises: road number factor = road number value/total road number value; and for any one of the plurality of load factors, extracting a plurality of association coefficients corresponding to the any one load factor and the plurality of preset operations from the load factor association coefficient matrix, and performing a weighted calculation operation on the plurality of association coefficients and the plurality of road number factors to obtain a load factor weight corresponding to the any one load factor.
In one possible example, in terms of performing the filtering operation on the historical bypass load data set based on the preset load threshold, the determining unit 602 is specifically configured to: for any one group of the historical load data in the historical bypass load data set, acquiring the historical use data from the historical load data, wherein the historical use data comprises: a plurality of usage rates; performing traversal screening on the plurality of utilization rates based on the load threshold; if any one of the utilization rates is greater than the load threshold, determining that the historical load data is non-candidate load data; and if any one of the utilization rates is not greater than the load threshold, determining that the historical load data is the load data to be selected.
In a possible example, the forwarding unit 603 is further configured to: if the load data set to be selected is an empty set, determining that the bypass service cluster is in a full-load state; and storing the signaling to be forwarded to a signaling queue.
In a possible example, the forwarding unit 603 is further configured to: if the room code set contains the room number, acquiring a bypass server number corresponding to the room number; forwarding the signaling to be forwarded to the bypass server.
The embodiment of the application also provides a computer storage medium, where the computer storage medium stores a computer program for electronic data exchange, where the computer program causes a computer to execute part or all of the steps of any one of the methods described in the embodiments of the method, where the computer includes an electronic device.
Embodiments of the present application also provide a computer program product comprising a non-transitory computer-readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of any one of the methods described in the method embodiments above. The computer program product may be a software installation package, said computer comprising an electronic device.
It should be noted that, for simplicity of description, the foregoing method embodiments are all expressed as a series of action combinations, but it should be understood by those skilled in the art that the present application is not limited by the order of actions described, as some steps may be performed in other order or simultaneously in accordance with the present application. Further, those skilled in the art will also appreciate that the embodiments described in the specification are all preferred embodiments, and that the acts and modules referred to are not necessarily required in the present application.
In the foregoing embodiments, the descriptions of the embodiments are emphasized, and for parts of one embodiment that are not described in detail, reference may be made to related descriptions of other embodiments.
In the several embodiments provided in this application, it should be understood that the disclosed apparatus may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, such as the above-described division of units, merely a division of logic functions, and there may be additional manners of dividing in actual implementation, such as multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, or may be in electrical or other forms.
The units described above as separate components may or may not be physically separate, and components shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units described above, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable memory. Based on such understanding, the technical solution of the present application may be embodied in essence or a part contributing to the prior art or all or part of the technical solution in the form of a software product stored in a memory, including several instructions for causing a computer device (which may be a personal computer, a server or a network device, etc.) to perform all or part of the steps of the above-mentioned method of the various embodiments of the present application. And the aforementioned memory includes: a U-disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Those of ordinary skill in the art will appreciate that all or a portion of the steps in the various methods of the above embodiments may be implemented by a program that instructs associated hardware, and the program may be stored in a computer readable memory, which may include: flash disk, read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), magnetic disk or optical disk.
The foregoing has outlined rather broadly the more detailed description of embodiments of the present application, wherein specific examples are provided herein to illustrate the principles and embodiments of the present application, the above examples being provided solely to assist in the understanding of the methods of the present application and the core ideas thereof; meanwhile, as those skilled in the art will have modifications in the specific embodiments and application scope in accordance with the ideas of the present application, the present description should not be construed as limiting the present application in view of the above.
Claims (8)
1. A signaling routing method based on a bypass service cluster, applied to a server, the method comprising:
receiving a signaling to be forwarded, and acquiring a room number corresponding to the signaling to be forwarded;
judging whether a preset room code set contains the room number, if not, executing a bypass server determining operation aiming at a bypass service cluster to obtain a target bypass server;
Forwarding the signaling to be forwarded to the target bypass server;
the performing a bypass server determination operation for a bypass service cluster includes:
acquiring a historical load data set corresponding to the bypass service cluster, wherein any group of historical load data in the historical load data set comprises: historical usage data and historical way count data;
performing screening operation on the historical load data set based on a preset load threshold value to obtain a load data set to be selected;
judging whether the load data set to be selected is an empty set or not;
if the load data set to be selected is a non-empty set, performing comprehensive load value calculation aiming at the load data set to be selected to obtain a comprehensive load value set;
determining a bypass server corresponding to the minimum value in the comprehensive load value set as the target bypass server;
wherein the performing a screening operation on the historical load dataset based on a preset load threshold includes:
for any one group of the historical load data in the historical load data set, acquiring the historical use data from the historical load data, wherein the historical use data comprises: a plurality of usage rates;
performing traversal screening on the plurality of utilization rates based on the load threshold;
If any one of the utilization rates is greater than the load threshold, determining that the historical load data is non-candidate load data;
and if any one of the utilization rates is not greater than the load threshold, determining that the historical load data is the load data to be selected.
2. The method of claim 1, wherein performing a comprehensive load value calculation for the candidate load data set results in a comprehensive load value set, comprising:
performing comprehensive load value calculation operation on a plurality of groups of load data to be selected contained in the load data set to be selected to obtain the comprehensive load value set;
wherein the integrated load value calculation operation includes:
determining any group of load data to be selected as target data in the plurality of groups of load data to be selected;
acquiring historical road number data corresponding to the target data from the historical load data set;
acquiring a preset load factor association coefficient matrix, and calculating a plurality of load factor weights based on the historical road number data and the load factor association coefficient matrix;
and performing weighted calculation based on the plurality of load factor weights and the historical usage data to obtain a comprehensive load value corresponding to the target data.
3. The method of claim 2, wherein the calculating a plurality of load factor weights based on the historical road count data and the load factor association coefficient matrix comprises:
extracting a plurality of road number values corresponding to a plurality of preset operations from the historical road number data, and executing accumulation operation based on the plurality of road number values to obtain a total road number value;
inputting the plurality of road number values into a preset road number factor calculation formula to obtain a plurality of road number factors, wherein the road number factor calculation formula comprises: road number factor = road number value/total road number value;
and for any one of the plurality of load factors, extracting a plurality of association coefficients corresponding to the any one load factor and the plurality of preset operations from the load factor association coefficient matrix, and performing a weighted calculation operation on the plurality of association coefficients and the plurality of road number factors to obtain a load factor weight corresponding to the any one load factor.
4. The method according to claim 1, wherein the method further comprises:
if the load data set to be selected is an empty set, determining that the bypass service cluster is in a full-load state;
And storing the signaling to be forwarded to a signaling queue.
5. The method according to claim 1, wherein the method further comprises:
if the room code set contains the room number, acquiring a bypass server number corresponding to the room number;
forwarding the signaling to be forwarded to the bypass server.
6. A signaling routing apparatus based on a bypass service cluster, applied to a server, the apparatus comprising:
the receiving unit is used for receiving the signaling to be forwarded and acquiring a room number corresponding to the signaling to be forwarded;
the judging unit is used for judging whether a preset room code set contains the room number or not, and if not, executing a bypass server determining operation aiming at the bypass service cluster to obtain a target bypass server;
a forwarding unit, configured to forward the signaling to be forwarded to the target bypass server;
wherein, in the aspect of the performing the bypass server determining operation for the bypass service cluster, the determining unit is specifically configured to:
acquiring a historical load data set corresponding to the bypass service cluster, wherein any group of historical load data in the historical load data set comprises: historical usage data and historical way count data;
Performing screening operation on the historical load data set based on a preset load threshold value to obtain a load data set to be selected;
judging whether the load data set to be selected is an empty set or not;
if the load data set to be selected is a non-empty set, performing comprehensive load value calculation aiming at the load data set to be selected to obtain a comprehensive load value set;
determining a bypass server corresponding to the minimum value in the comprehensive load value set as the target bypass server;
wherein, in terms of the performing a screening operation on the historical load data set based on a preset load threshold, the determining unit is specifically configured to:
for any one group of the historical load data in the historical load data set, acquiring the historical use data from the historical load data, wherein the historical use data comprises: a plurality of usage rates;
performing traversal screening on the plurality of utilization rates based on the load threshold;
if any one of the utilization rates is greater than the load threshold, determining that the historical load data is non-candidate load data;
and if any one of the utilization rates is not greater than the load threshold, determining that the historical load data is the load data to be selected.
7. A server comprising a processor, a memory, a communication interface, and one or more programs stored in the memory and configured to be executed by the processor, the programs comprising instructions for performing the steps in the method of any of claims 1-5.
8. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program, which is executed by a processor to implement the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011047626.XA CN112261091B (en) | 2020-09-29 | 2020-09-29 | Signaling routing method, device, server and computer readable storage medium based on bypass service cluster |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011047626.XA CN112261091B (en) | 2020-09-29 | 2020-09-29 | Signaling routing method, device, server and computer readable storage medium based on bypass service cluster |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112261091A CN112261091A (en) | 2021-01-22 |
| CN112261091B true CN112261091B (en) | 2023-05-02 |
Family
ID=74234704
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011047626.XA Active CN112261091B (en) | 2020-09-29 | 2020-09-29 | Signaling routing method, device, server and computer readable storage medium based on bypass service cluster |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112261091B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2890133A2 (en) * | 2012-08-24 | 2015-07-01 | ZTE Corporation | System and method for distributing live broadcast content |
| CN108683820A (en) * | 2018-04-26 | 2018-10-19 | 贵阳朗玛信息技术股份有限公司 | The mobile Internet voice platform system and its application process of combining PSTN |
| CN110113307A (en) * | 2019-04-01 | 2019-08-09 | 视联动力信息技术股份有限公司 | A kind of method and apparatus of live streaming |
| CN110536178A (en) * | 2018-05-25 | 2019-12-03 | 视联动力信息技术股份有限公司 | A kind of live-broadcast control method and system |
| CN111541684A (en) * | 2020-04-20 | 2020-08-14 | 北京达佳互联信息技术有限公司 | Signaling sending method and device of live broadcast room, server and storage medium |
-
2020
- 2020-09-29 CN CN202011047626.XA patent/CN112261091B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2890133A2 (en) * | 2012-08-24 | 2015-07-01 | ZTE Corporation | System and method for distributing live broadcast content |
| CN108683820A (en) * | 2018-04-26 | 2018-10-19 | 贵阳朗玛信息技术股份有限公司 | The mobile Internet voice platform system and its application process of combining PSTN |
| CN110536178A (en) * | 2018-05-25 | 2019-12-03 | 视联动力信息技术股份有限公司 | A kind of live-broadcast control method and system |
| CN110113307A (en) * | 2019-04-01 | 2019-08-09 | 视联动力信息技术股份有限公司 | A kind of method and apparatus of live streaming |
| CN111541684A (en) * | 2020-04-20 | 2020-08-14 | 北京达佳互联信息技术有限公司 | Signaling sending method and device of live broadcast room, server and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 基于Webrtc和PWA的视频互动直播系统;彭永超等;《电脑编程技巧与维护》;20170118(第02期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112261091A (en) | 2021-01-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2015141337A1 (en) | Reception packet distribution method, queue selector, packet processing device, and recording medium | |
| CN109831524B (en) | Load balancing processing method and device | |
| CN104901989B (en) | A kind of Site Service offer system and method | |
| US20140359084A1 (en) | Electronic device, storage medium and file transferring method | |
| CN108965884B (en) | Distribution method of transcoding tasks, scheduling device and transcoding device | |
| US10892837B2 (en) | Methods and apparatus for transporting data on a network | |
| CN102882829A (en) | Transcoding method and system | |
| CN109218216B (en) | Link aggregation flow distribution method, device, equipment and storage medium | |
| CN103999504A (en) | A method and system for rate adaptive allocation of resources | |
| US9781595B2 (en) | Wireless communication device | |
| US10554761B2 (en) | Methods and apparatus to improve transmission of a field data set to a network access point via parallel communication sessions | |
| US20180376176A1 (en) | Quality-of-experience optimization apparatus, network quality estimation apparatus, mobile terminal, quality-of-experience optimization method, network quality estimation method, and program | |
| CN103561078A (en) | Telecom operation system and service implementation method | |
| CN108989845A (en) | A kind of video transmission method based on SPICE protocol | |
| CN104471904B (en) | Method and apparatus for content optimization | |
| CN110831039A (en) | Data transmission method and transmission server in multi-path concurrent system | |
| CN108632863A (en) | Flow method for early warning, device and server | |
| CN108600020A (en) | Method for processing business, device and server | |
| WO2016192081A1 (en) | Enable access point availability prediction | |
| CN106686036A (en) | Multimedia data downloading method and system, client and server | |
| CN115002238A (en) | Traffic transmission method, device, equipment and storage medium | |
| CN109361749A (en) | Message processing method, relevant device and computer storage medium | |
| CN112261091B (en) | Signaling routing method, device, server and computer readable storage medium based on bypass service cluster | |
| CN108289041A (en) | A kind of processing method and relevant apparatus of server info | |
| CN110620807B (en) | File transmission method, server, system, device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |