CN111106994A - Method and storage medium for improving push efficiency - Google Patents
Method and storage medium for improving push efficiency Download PDFInfo
- Publication number
- CN111106994A CN111106994A CN201911165067.XA CN201911165067A CN111106994A CN 111106994 A CN111106994 A CN 111106994A CN 201911165067 A CN201911165067 A CN 201911165067A CN 111106994 A CN111106994 A CN 111106994A
- Authority
- CN
- China
- Prior art keywords
- routing
- routing address
- long link
- addresses
- address list
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/21—Monitoring or handling of messages
- H04L51/214—Monitoring or handling of messages using selective forwarding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/30—Routing of multiclass traffic
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a method and a storage medium for improving push efficiency, wherein the method comprises the following steps: when the network is not good, the client requests to establish a long link to a routing address in the routing address list every preset time interval, and the routing addresses for establishing the long link are different each time; after the client establishes the long link with the routing address, the long link which is being established with other routing addresses is closed, and the request for establishing the long link to other routing addresses is stopped. The invention can greatly shorten the time required for successfully accessing the service; moreover, the probability of successful access of each access request can be obviously improved; therefore, the timeliness of client pushing can be realized. Furthermore, the resource of the server can not be greatly influenced; finally, the method also has the advantages of easy realization and the like.
Description
Technical Field
The invention relates to the field of message pushing, in particular to a method and a storage medium for improving pushing efficiency.
Background
Today, most mobile phone APPs provide a message pushing function. Such as hot news recommendations for news clients, chat message reminders for IM tools, e-commerce product promotions, notification and approval processes for enterprise applications, and the like. The push plays an important role in improving the activity of products, the utilization rate of functional modules, the viscosity of users and the retention rate of users.
However, in many push applications, a routing cluster, that is, an access cluster deployed by multiple clusters, exists. The client accesses the routing cluster in advance, acquires an access list recording accessible addresses, then selects one of the access addresses, establishes a long link with one access application in the cluster, and after the long link is established, the server and the client keep a long link, and all message receiving and sending are performed through the long link.
However, the network environment of the client varies. When the network environment is not good or in a weak network condition, the client frequently goes up and down, i.e. connection and disconnection are frequently created along with the network condition. There are few cases where the establishment of a connection is slow or a retry fails because the network is not good, and even the retry may fail because the access service network is not good.
Therefore, it is necessary to provide a solution capable of improving the push efficiency for the case of poor network environment.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: a method and a storage medium for improving the push efficiency are provided to improve the connection problem when the network is in a bad condition and improve the push efficiency.
In order to solve the technical problems, the invention adopts the technical scheme that:
a method for improving push efficiency comprises the following steps:
when the network is not good, the client requests to establish a long link to a routing address in the routing address list every preset time interval, and the routing addresses for establishing the long link are different each time;
after the client establishes the long link with the routing address, the long link which is being established with other routing addresses is closed, and the request for establishing the long link to other routing addresses is stopped.
The invention provides another technical scheme as follows:
a computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, is capable of carrying out the steps included in the above-mentioned method for improving push efficiency.
The invention has the beneficial effects that: when the network is not good, the client side initiates a long link request to each routing address in the routing address list in a time-sharing manner, and once a long link is established with any routing address, the client side stops initiating requests to other routing addresses. By the mode of simultaneously initiating the long link request to the plurality of routing addresses, the speed of successfully establishing long links with the routing addresses under the scene of poor network can be obviously improved, and the timeliness of pushing is sequentially ensured; and, because the time-sharing sending mechanism is adopted, the number of concurrent requests can be reduced, and the resource consumption of the server is reduced.
Drawings
Fig. 1 is a flowchart illustrating a method for improving push efficiency according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating a method for improving push efficiency according to an embodiment of the present invention.
Detailed Description
In order to explain technical contents, achieved objects, and effects of the present invention in detail, the following description is made with reference to the accompanying drawings in combination with the embodiments.
The most key concept of the invention is as follows: and a long link request is sent to a plurality of routing addresses in a time-sharing manner, so that the speed of successfully establishing long links with the routing addresses is increased.
Referring to fig. 1, the present invention provides a method for improving push efficiency, including:
when the network is not good, the client requests to establish a long link to a routing address in the routing address list every preset time interval, and the routing addresses for establishing the long link are different each time;
after the client establishes the long link with the routing address, the long link which is being established with other routing addresses is closed, and the request for establishing the long link to other routing addresses is stopped.
From the above description, the beneficial effects of the present invention are: when the network is unstable or in a weak network scene, a plurality of long link requests are simultaneously initiated in a time-sharing manner, and as long as one long link is successfully established, the client actively disconnects the other requests. By adopting the multilink request mode, the problem of frequent request failure of a certain access address caused by network instability can be solved to a certain extent under the condition of a weak network, so that the speed of successfully establishing a long link between a client and a routing address is obviously increased, and the instantaneity of client message pushing is ensured.
Further, the client requests a route address in the route address list to establish a long link every preset time interval, and the route addresses requesting establishment of the long link are different each time, specifically:
the client requests the routing addresses in the routing address list one by one to establish long links, and the requests corresponding to the routing addresses are sent at preset time intervals.
It can be known from the above description that initiating a link request to a routing address in a routing address list in a time-sharing sequence can avoid initiating two requests to the same routing address, thereby implementing orderly request initiation, reducing time waste, and improving the success rate of connection.
Further, the method further comprises:
obtaining the accessible quantity and the residual resource condition corresponding to each routing address in the routing address list;
and arranging the routing addresses in the routing address list according to the descending order of the accessible quantity and the ascending order of the residual resource condition.
As can be seen from the above description, the routing address list is set to combine the accessible number and the remaining resources of each routing address in advance to perform sorting, so that the routing address with the highest connectable number and the most remaining resources preferentially receives the connection request, and the success rate of establishing the long link is significantly improved.
Further, the obtaining of the accessible quantity and the remaining resource condition corresponding to each routing address in the routing address list specifically includes:
monitoring and acquiring the accessed number of each routing address in the routing address list at regular time, and calculating to obtain the accessible number of each routing address;
and monitoring and acquiring the residual resource condition of each routing address in the routing address list at regular time.
According to the description, the accessed quantity and the residual resource condition of each routing address can be obtained according to the daily monitoring result, and the method has higher convenience, so that the implementation convenience of the method is improved.
Further, still include:
counting the connection failure times of each routing address in the routing address list;
and arranging the routing addresses in the routing address list in an ascending order according to the connection failure times.
As can be seen from the above description, in another example, the routing address list may be further arranged in an ascending order according to the connection failure times of the routing addresses, that is, the lower the failure times, the earlier the routing address list is arranged in the table, which can also achieve the effect of significantly improving the success rate of establishing long links, and the implementation is more convenient.
Further, the preset time is half of the time required for successfully establishing the long link when the network is normal.
It can be known from the above description that the time interval for continuously initiating the link request, which is set according to the above manner, not only leaves sufficient execution time for successfully establishing the link for the previous route address, but also can initiate the link request to the next route address in time, thereby further reducing the number of concurrent requests and reducing the resource consumption of the server.
The invention provides another technical scheme as follows:
a computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, is capable of carrying out the steps included in the above-mentioned method for improving push efficiency.
The steps include:
when the network is not good, the client requests to establish a long link to a routing address in the routing address list every preset time interval, and the routing addresses for establishing the long link are different each time;
after the client establishes the long link with the routing address, the long link which is being established with other routing addresses is closed, and the request for establishing the long link to other routing addresses is stopped.
Further, the client requests a route address in the route address list to establish a long link every preset time interval, and the route addresses requesting establishment of the long link are different each time, specifically:
the client requests the routing addresses in the routing address list one by one to establish long links, and the requests corresponding to the routing addresses are sent at preset time intervals.
Further, the method further comprises:
obtaining the accessible quantity and the residual resource condition corresponding to each routing address in the routing address list;
and arranging the routing addresses in the routing address list according to the descending order of the accessible quantity and the ascending order of the residual resource condition.
Further, the obtaining of the accessible quantity and the remaining resource condition corresponding to each routing address in the routing address list specifically includes:
monitoring and acquiring the accessed number of each routing address in the routing address list at regular time, and calculating to obtain the accessible number of each routing address;
and monitoring and acquiring the residual resource condition of each routing address in the routing address list at regular time.
Further, still include:
counting the connection failure times of each routing address in the routing address list;
and arranging the routing addresses in the routing address list in an ascending order according to the connection failure times.
Further, the preset time is half of the time required for successfully establishing the long link when the network is normal.
From the above description, the beneficial effects of the above technical means are: it should be understood by those skilled in the art that all or part of the processes in the above technical solutions may be implemented by instructing the related hardware through a computer program, where the program may be stored in a computer-readable storage medium, and when executed, the program may include the processes of the above methods. And after the process is executed, the beneficial effects of the corresponding methods can be realized.
The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
Example one
Referring to fig. 2, the present embodiment provides a method for improving push efficiency, including:
s1: the client requests a routing cluster in advance to acquire an accessible routing address list.
The list of routing addresses is a set of accessible routing addresses.
In a first specific example, the routing address list sorts the routing addresses in the table according to a first sorting policy. The first arrangement policy is a random policy. I.e. each routing address in the routing address list is arranged randomly.
In a second embodiment, the routing address list sorts the routing addresses in the table according to a second ranking policy. The second ranking strategy integrates the accessible quantity and the remaining resource situation. The method specifically comprises the following steps:
s11: obtaining the accessible quantity and the residual resource condition corresponding to each routing address in the routing address list;
specifically, the accessed number of each routing address in the routing address list is monitored regularly, and according to the formula: the accessible data is the maximum access quantity-the accessed quantity, and the accessible quantity of each routing address in the routing address list is obtained through calculation; the remaining resource condition of each routing address can be obtained by timing monitoring.
S12: and arranging the routing addresses in the address list according to the descending order of the accessible quantity and the ascending order of the condition of the residual resources. I.e. sorting after integrating the accessible quantity and the condition of the residual resources.
Preferably, the sorting is performed in ascending order according to the remaining resource condition and then in descending order according to the accessible quantity. After the ranking, the access services with the largest accessible number and less resource occupation are ranked first and then ranked according to the ranking.
The routing address list based on the second ranking strategy can ensure that the routing address with the largest access data volume and less resource occupation starts to try to access, thereby obviously improving the probability of successful access.
In a third specific example, the routing address list sorts the routing addresses in the table according to a third arrangement policy. The third arrangement strategy is arranged in an ascending order according to the connection failure times. And the first routing address of the sorted routing address list is the access service with the least connection failure times. Specifically, the method is realized by the following steps:
s13: counting the connection failure times of each routing address in the routing address list;
s14: and arranging the routing addresses in the routing address list in an ascending order according to the connection failure times.
Based on the third ranking strategy, the probability of successful access can be obviously improved, and the implementation mode is simpler and more convenient.
S2: when the network is normal, the client initiates an access request to a first routing address in a routing address list which is ordered according to any one of the first arranging strategy, the second arranging strategy or the third arranging strategy. If the access is successful, establishing a long link; if the access fails, the access request is initiated to the same routing address again or the access request is initiated to a second routing address according to a preset failure processing rule.
Wherein the failure handling rule is specifically determined according to a service. Since the routing address list has been sorted according to the first or second or third sorting policy described above, it can be directly set to try to establish long links one by one in order. I.e. the current routing address tries to access once, and if it fails, requests the next address to establish a long link. Or, the access request to the current routing address is set to be circularly initiated, that is, if the access attempt of the current routing address fails, the access request is continuously initiated to the routing address until the access is successful. Of course, it may also be configured that after the same routing address initiates for N times (N is greater than or equal to 2) continuously, the request is initiated to the next routing address.
S3: when the network is not good, the client requests to establish the long link from a routing address in the routing address list every preset time interval, and the routing addresses for establishing the long link are different each time.
The network poor condition includes that the network is unstable or in a weak network state.
Specifically, the client only needs to request the routing addresses in the routing address list one by one to establish long links, and the request corresponding to each routing address is sent every preset time interval. That is, the client initiates a long link establishment request to a first routing address in the routing address list, and initiates a long link establishment request to a second routing address in the routing address list after a preset time interval; after a preset time interval, a long link establishment request is sent to the third routing address, and so on, so that access requests are sent to the routing addresses of the routing address list in sequence in a time division manner. Under the request, the system can simultaneously initiate access requests to a plurality of (at least two) routing addresses to realize concurrent requests so as to greatly improve the speed of successfully accessing the service.
In another example, the routing address list is not arranged in advance, and corresponding to the current step, an access request is directly and randomly initiated to one routing address in the routing address list, and after a preset time interval, an access request is initiated to another routing address which is randomly selected except the routing address where the request has been sent, and so on.
In this step, the preset time is preferably half of the time required for successfully establishing the long link when the network is normal. For example, under normal conditions of a general network, if 4 seconds can successfully establish a long link, the preset time is set to 2 seconds. I.e. a long link request is initiated to a routing address every 2 s.
S4: after the client establishes the long link with the routing address, the long link which is being established with other routing addresses is closed, and the request for establishing the long link to other routing addresses is stopped.
In the process of the concurrent request, that is, in the process executed in S3, if the client successfully establishes a long link with any routing address, the client actively closes the connection service with other access. So as to reduce server resource consumption even if concurrent requests are aborted.
For example, first, a request for establishing a long link is initiated to the routing address a; after 2 seconds, the client initiates a request for establishing the long link to the routing address B; after 2 seconds, the client initiates a request of long link to the routing address C, and so on, as long as one of the long links is successfully established, the other links can be actively closed by the client.
The embodiment is different from the inefficient connection mode that only when the access of the current routing address fails, another routing address is tried again, and the embodiment has certain concurrency capability through the interval concurrent request mode to shorten the time required for successfully accessing the service; and, based on the setting of the interval time, the number of concurrencies is defined, thereby reducing resource consumption of the server.
Example two
This embodiment provides a specific application scenario corresponding to the first embodiment:
in the existing push system, there is a routing cluster, and before the pushed client establishes a long link, an interface in the routing cluster for acquiring a routing address list is requested in advance, and the interface returns a set of one or more accessible routing addresses, that is, a routing address list. In the prior art, a client randomly selects one routing address to establish a long link, and when the request fails or is unsuccessful or times out, the client selects another routing address to establish the long link.
In a specific application scenario of the first embodiment, the client determines a network condition in advance, and when the network condition is within a normal range, the long-chain grounding is established according to old logic, that is, the long-chain grounding is performed according to the steps of the prior art; when the network is unstable or in a weak network scenario, the following method is used, and a method of performing concurrent requests at intervals is used to establish a long link.
First, to implement this functionality, improvements are needed to the return routing address list step in legacy routing clusters. The route list returned by the old route interface is the accessible route list meeting the condition. Each access service (routing address) in the table has its own maximum access number (known from pressure measurements) and also a real-time access number (which will be +1 and recorded in memory for each successful access to a client). The number of further accesses per access server is known by the maximum number of accesses-the number of accesses already. Corresponding to this embodiment, in the returned routing address list, sorting is performed in descending order according to the number of accessible services. In this way, the first one in the routing address list acquired by the client is the access server address with the largest accessible number, so that the probability of successful access can be improved. In addition, the accessible quantity and the residual resource condition can be integrated to carry out sequencing, or the sequencing mode such as ascending sequencing according to the connection failure times and the like is adopted to improve the probability of successful access.
At this time, it is assumed that A, B and C, which are 3 routing addresses, have already been acquired in the routing address list. After the sorting is carried out according to the mode, the accessible quantity of A is the largest, and B is the second smallest and C is the smallest. When the network is normal, the long link is established according to the old logic, and when the network is weak, the long link is established by adopting the interval request.
Assuming that a typical network is normal, 4 seconds can successfully establish a long link. Firstly, initiating a request for establishing a long link to A under the condition of a weak network; after 2 seconds, the client initiates a request for establishing the long link to the B; after 2 seconds, the client initiates a request of long link to C, and so on, as long as one of the links successfully establishes a long link, the other links can be actively closed by the client.
Here, unlike the conventional method, instead of requesting an access service connection, and after synchronously waiting for a return result, performing a second long link according to the return result, a plurality of different routing addresses are requested at intervals, which can be implemented.
Then, the access service (routing address) needs to be slightly modified, when the request for establishing each long link is reached, the cache needs to be queried in advance to determine whether the same client device has already established a long link, and if so, the long link connection is already established at a concurrency interval; if not, the long link is established normally. (each pushed client device has a unique identifier of itself, and such an identifier is created when the pushing function is used, so that the judgment can be directly made according to the unique identifier of the client).
The purpose of this is to have a certain concurrency capability by this way of interval concurrent request, and at the same time, it will not request to establish too many (more than 3) long links each time because of weak network condition, so as to reduce the loss of server resource.
EXAMPLE III
This embodiment corresponds to the first embodiment and the second embodiment, and provides a computer-readable storage medium, on which a computer program is stored, where the computer program is capable of implementing the steps included in the method for improving push efficiency according to the first embodiment or the second embodiment when the computer program is executed by a processor. The specific steps are not repeated here, and refer to the description of the first embodiment or the second embodiment for details.
In summary, the method and the storage medium for improving the push efficiency provided by the present invention can greatly shorten the time required for successfully accessing the service; moreover, the probability of successful access of each access request can be obviously improved; thereby the timeliness of pushing by the client can be realized; furthermore, the resource of the server can not be greatly influenced; finally, the method also has the advantages of easy realization and the like.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all equivalent changes made by using the contents of the present specification and the drawings, or applied directly or indirectly to the related technical fields, are included in the scope of the present invention.
Claims (7)
1. A method for improving push efficiency, comprising:
when the network is not good, the client requests to establish a long link to a routing address in the routing address list every preset time interval, and the routing addresses for establishing the long link are different each time;
after the client establishes the long link with the routing address, the long link which is being established with other routing addresses is closed, and the request for establishing the long link to other routing addresses is stopped.
2. The method according to claim 1, wherein the client requests a route address in the route address list to establish a long link every preset time interval, and the route addresses requesting establishment of the long link are different each time, specifically:
the client requests the routing addresses in the routing address list one by one to establish long links, and the requests corresponding to the routing addresses are sent at preset time intervals.
3. The method of claim 2, wherein the method further comprises:
obtaining the accessible quantity and the residual resource condition corresponding to each routing address in the routing address list;
and arranging the routing addresses in the routing address list according to the descending order of the accessible quantity and the ascending order of the residual resource condition.
4. The method according to claim 3, wherein the obtaining of the accessible quantity and the remaining resource condition corresponding to each routing address in the routing address list specifically includes:
monitoring and acquiring the accessed number of each routing address in the routing address list at regular time, and calculating to obtain the accessible number of each routing address;
and monitoring and acquiring the residual resource condition of each routing address in the routing address list at regular time.
5. The method of claim 2, further comprising:
counting the connection failure times of each routing address in the routing address list;
and arranging the routing addresses in the routing address list in an ascending order according to the connection failure times.
6. The method as claimed in claim 1, wherein the predetermined time is half of a time required for successfully establishing a long link when the network is normal.
7. A computer-readable storage medium, on which a computer program is stored, wherein the program, when executed by a processor, is capable of implementing the steps included in the method for improving push efficiency according to any one of the claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911165067.XA CN111106994A (en) | 2019-11-25 | 2019-11-25 | Method and storage medium for improving push efficiency |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911165067.XA CN111106994A (en) | 2019-11-25 | 2019-11-25 | Method and storage medium for improving push efficiency |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111106994A true CN111106994A (en) | 2020-05-05 |
Family
ID=70420729
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911165067.XA Pending CN111106994A (en) | 2019-11-25 | 2019-11-25 | Method and storage medium for improving push efficiency |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111106994A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005136805A (en) * | 2003-10-31 | 2005-05-26 | Nippon Telegr & Teleph Corp <Ntt> | Method and device for detecting communication quality deterioration |
| CN104065761A (en) * | 2011-09-29 | 2014-09-24 | 北京奇虎科技有限公司 | Application server selecting method and network connection method |
| CN104796387A (en) * | 2014-01-21 | 2015-07-22 | 腾讯科技（深圳）有限公司 | Communication method and device of long connection of network |
| CN106713454A (en) * | 2016-12-22 | 2017-05-24 | 腾讯科技（深圳）有限公司 | Network connection method and device |
| CN107659473A (en) * | 2017-09-28 | 2018-02-02 | 努比亚技术有限公司 | Connection control method, system, routing server and computer-readable recording medium |
| CN109981810A (en) * | 2019-03-08 | 2019-07-05 | 福建天泉教育科技有限公司 | A kind of method and system of routing address list update |
| CN110049496A (en) * | 2019-05-31 | 2019-07-23 | 维沃移动通信有限公司 | A kind of method for network access and mobile terminal |
-
2019
- 2019-11-25 CN CN201911165067.XA patent/CN111106994A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005136805A (en) * | 2003-10-31 | 2005-05-26 | Nippon Telegr & Teleph Corp <Ntt> | Method and device for detecting communication quality deterioration |
| CN104065761A (en) * | 2011-09-29 | 2014-09-24 | 北京奇虎科技有限公司 | Application server selecting method and network connection method |
| CN104796387A (en) * | 2014-01-21 | 2015-07-22 | 腾讯科技（深圳）有限公司 | Communication method and device of long connection of network |
| CN106713454A (en) * | 2016-12-22 | 2017-05-24 | 腾讯科技（深圳）有限公司 | Network connection method and device |
| CN107659473A (en) * | 2017-09-28 | 2018-02-02 | 努比亚技术有限公司 | Connection control method, system, routing server and computer-readable recording medium |
| CN109981810A (en) * | 2019-03-08 | 2019-07-05 | 福建天泉教育科技有限公司 | A kind of method and system of routing address list update |
| CN110049496A (en) * | 2019-05-31 | 2019-07-23 | 维沃移动通信有限公司 | A kind of method for network access and mobile terminal |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10313452B2 (en) | Migrating a chat message service provided by a chat server to a new chat server | |
| KR100725066B1 (en) | A system server for data communication with multiple clients and a data processing method | |
| CN107888634B (en) | Data request method and device of distributed storage system | |
| CN106202082B (en) | Method and device for assembling basic data cache | |
| CN109714757B (en) | Method and device for preparing eSIM card in shared mode | |
| WO2017185615A1 (en) | Method for determining service status of service processing device and scheduling device | |
| CN111092934B (en) | Method for updating client routing and storage medium | |
| CN110909030B (en) | Information processing method and server cluster | |
| CN110392119B (en) | Data transmission method and base station | |
| CN109981779B (en) | Service providing method, server and computer storage medium | |
| CN108429703B (en) | DHCP client-side online method and device | |
| CN111083204A (en) | File transmission method, device and storage medium | |
| CN112055077B (en) | Block link access method, device and storage medium | |
| CN111106994A (en) | Method and storage medium for improving push efficiency | |
| CN108616576B (en) | Method and device for scheduling application server | |
| CN111191134B (en) | Intelligent pushing method and terminal | |
| CN111258821B (en) | Cloud computing-based backup data rapid extraction method | |
| CN111104376B (en) | Resource file query method and device | |
| CN112714181A (en) | Data transmission method and device | |
| CN107819858B (en) | Method and device for managing cloud service during dynamic expansion and contraction of cloud service | |
| CN112351072B (en) | Message pushing method and terminal | |
| CN115129402B (en) | Channel resource calling method and device and computer storage medium | |
| CN112394951B (en) | Application deployment method and server cluster | |
| CN114979284B (en) | 5G message scheduling method, device and system | |
| CN116962488B (en) | Method, device, electronic equipment and readable medium for establishing cloud service connection |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200505 |