WO2016188282A1 - 一种消息处理方法、装置及系统 - Google Patents

一种消息处理方法、装置及系统 Download PDF

Info

Publication number
WO2016188282A1
WO2016188282A1 PCT/CN2016/080018 CN2016080018W WO2016188282A1 WO 2016188282 A1 WO2016188282 A1 WO 2016188282A1 CN 2016080018 W CN2016080018 W CN 2016080018W WO 2016188282 A1 WO2016188282 A1 WO 2016188282A1
Authority
WO
WIPO (PCT)
Prior art keywords
message
sending
application
token
time
Prior art date
Application number
PCT/CN2016/080018
Other languages
English (en)
French (fr)
Inventor
黄孟俊
Original Assignee
阿里巴巴集团控股有限公司
黄孟俊
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 阿里巴巴集团控股有限公司, 黄孟俊 filed Critical 阿里巴巴集团控股有限公司
Priority to JP2017561369A priority Critical patent/JP6787933B2/ja
Priority to EP16799171.0A priority patent/EP3306866B1/en
Priority to SG11201709484RA priority patent/SG11201709484RA/en
Priority to PL16799171T priority patent/PL3306866T3/pl
Priority to ES16799171T priority patent/ES2808951T3/es
Priority to KR1020177036851A priority patent/KR102110023B1/ko
Publication of WO2016188282A1 publication Critical patent/WO2016188282A1/zh
Priority to US15/818,504 priority patent/US10700993B2/en

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/07—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail characterised by the inclusion of specific contents
    • H04L51/18—Commands or executable codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
    • H04L41/5051—Service on demand, e.g. definition and deployment of services in real time
    • 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/28—Flow control; Congestion control in relation to timing considerations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/74—Admission control; Resource allocation measures in reaction to resource unavailability
    • H04L47/743—Reaction at the end points
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/40—Support for services or applications
    • 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
    • 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/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/62—Establishing a time schedule for servicing the requests
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/42—Systems providing special services or facilities to subscribers
    • H04M3/42382—Text-based messaging services in telephone networks such as PSTN/ISDN, e.g. User-to-User Signalling or Short Message Service for fixed networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/74—Admission control; Resource allocation measures in reaction to resource unavailability
    • H04L47/748—Negotiation of resources, e.g. modification of a request
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/78—Architectures of resource allocation
    • H04L47/781—Centralised allocation of resources

Definitions

  • the present application belongs to the field of computer communication information processing, and in particular, to a message processing method, device and system.
  • the processing power of the system is always limited, and the number of service messages that the caller needs to process in the callee system and the time at which the service message is generated are not fixed. If one or more callers output multiple service messages to the callee almost simultaneously in a short period of time, it will have a brief impact on the callee. If the amount of traffic is too large, the frequent bursty services may even lead to serious consequences such as message blocking and system crash of the called party's business system. In order to ensure the stable operation of the callee's service system, the prior art usually adopts a concurrency control mechanism to control the service processing traffic of the called party.
  • the concurrency control mechanism generally refers to setting the maximum number of concurrent links that the caller and the callee can maintain when calling between systems, and when the new link request occurs, it is found that the current number of links has exceeded the maximum number of concurrent links set. Then refuse to create a new link.
  • the caller competes for the unit time.
  • the service message sending opportunity is easy to cause the request to fail and needs to be repeated and repeated. When the caller has a new service message, it will go to the service node to apply for sending.
  • the existing concurrency control mechanism mainly controls the traffic flow processed by the callee at the counting control node according to the service processing capability of the called party, and the service message to the caller There is no limit to the output.
  • the caller can output service messages at different frequencies. After the service messages are generated, the counting control node needs to be unified to perform message transmission processing, which undoubtedly causes comparison to the counting control node. A large burden causes performance bottlenecks in the processing of single-node service messages, reducing the processing efficiency of the entire message.
  • the caller's business system is an application scenario in which each flow in a batch needs to access the callee system, then there are often multiple flows (for example, equal to the number of concurrent 100).
  • the called party system is accessed, and then processed and released almost simultaneously.
  • different callers can generate high concurrent service messages in different time periods.
  • multiple callers are concurrent in the same or adjacent time period, and sometimes all idle. This will result in a wave or spike in system performance, which is not conducive to the stable operation of the caller system.
  • the concurrency control mechanism set between the caller and the callee adopted in the prior art cannot control the message output of the caller system, thereby reducing the stable running performance of the called system.
  • the service message processing performance of the counting control node is also reduced.
  • the purpose of the present application is to provide a message processing method, device and system, which can enable a caller to output a service message smoothly and evenly, improve the stability of the system of the called party, and improve the service processing performance of the called party or the link control node. And efficiency.
  • the message processing method and apparatus described in the present application can maximize the utilization of the service processing capability of the called party and improve the resource use efficiency without exceeding the maximum service processing capability of the called party system.
  • a message processing method, apparatus and system provided by the present application are implemented as follows:
  • a message processing method comprising:
  • the calling party calculates the sending duration of the sending service message, and applies to the control node for the occupied time period according to the sending duration;
  • the control node After receiving the application message of the time period of the caller, the control node determines an application result of the time period occupied by the caller according to a predetermined rule, and feeds back the application result to the corresponding call. square;
  • the calling party calculates a sending time of the service message when the received application result of the occupied time period is successful
  • the calling party When the calling party detects that the sending time of the service message is exceeded, the calling party applies to the control node for a sending token of the service message;
  • the control node After receiving the application message of the sending token of the caller, the control node determines, according to whether the maximum service processing capability of the callee is reached, the application result of the caller sending the token, and feedbacks the application result. Give the corresponding caller;
  • a message processing method comprising:
  • a message processing method comprising:
  • the application result of the sending token is determined according to whether the maximum service processing capability of the called party is reached, and the application result of the sending token is sent.
  • a message processing device comprising:
  • a calculation module configured to calculate a sending duration of the sending service message, and calculate an occupied time period of sending the service message based on the sending duration
  • a time period application module configured to send a first application message for applying the occupied time period
  • a receiving module configured to receive a message that occupies a time period and sends an application result of the token
  • a sending time calculation module configured to calculate a sending time of the service message according to the received application result of the occupied time period as a successful message
  • a token application module configured to monitor whether a current time exceeds a sending time of the service message; and when detecting that the sending time is exceeded, sending a second application message for requesting a sending token of the service message;
  • a sending module configured to send, according to the received application result of the sending the token, a service message that the sending token application is successful.
  • a message processing device comprising:
  • An application message receiving module configured to receive an application message that includes an occupied time period; and is further configured to receive an application message that sends a token;
  • An occupation time allocation module configured to allocate an occupation time period of the service message to the occupied time period in the application message according to a predetermined rule
  • a token allocation module configured to allocate a token according to the current service traffic and maximum service processing capability of the called party
  • the application result sending module is configured to send the message that the time period application result is used; and is further configured to send the message that sends the token application result.
  • a message processing system comprising:
  • a message client configured to send, to the control end, a first application message based on an occupied time period including a setting of a sending duration; and configured to calculate a sending time of the service message according to the received application result of the occupied time period as a successful message And a method for monitoring whether the current time exceeds the sending time of the service message, and sending a second application message for requesting the sending token of the service message to the control terminal when the sending time is exceeded; Transmitting, according to the received application result of the sending the token, a successful service message that the sending token application is successful;
  • the control end is configured to receive the first application message and the second application message sent by the message client, and is further configured to allocate an occupation time period of the service message to the occupied time period in the first application message according to a predetermined rule. And a method for allocating a sending token to the service message in the second application message according to the current service traffic and the maximum service processing capability of the called party; and the application for the first application message and the second application message The result is sent to the message client.
  • the message processing method, device and system provided by the present application can apply a time period for a service message and set a corresponding sending time for each service message, and can send a service message after applying for a token.
  • the output control of the caller's service message can be performed to achieve a uniform and smooth output of the service message, which can improve the stability of the callee system operation.
  • the caller can maximize the output of the service message without exceeding the maximum service processing capability of the called party, fully utilize the maximum processing capability of the called party system, and improve system resource utilization.
  • performance single point and bottleneck problems in the cluster mode can be avoided.
  • FIG. 1 is a schematic flow chart of an embodiment of a message processing method according to the present application.
  • FIG. 2 is a schematic flow chart of an embodiment of a message processing method according to the present application.
  • FIG. 3 is a schematic flow chart of another embodiment of a message processing method according to the present application.
  • FIG. 4 is a schematic flow chart of another embodiment of a message processing method according to the present application.
  • FIG. 5 is a schematic flowchart diagram of an embodiment of a message processing method according to the present application.
  • FIG. 6 is a schematic flow chart of another embodiment of a message processing method according to the present application.
  • FIG. 7 is a schematic flow chart of another embodiment of a message processing method according to the present application.
  • FIG. 8 is a schematic structural diagram of a module of an embodiment of a message processing apparatus according to the present application.
  • FIG. 9 is a schematic structural diagram of a module of an embodiment of a computing module in a message processing apparatus according to the present application.
  • FIG. 10 is a schematic structural diagram of a module of another embodiment of the message processing apparatus according to the present application.
  • FIG. 11 is a schematic structural diagram of a module of another embodiment of the message processing apparatus according to the present application.
  • FIG. 12 is a schematic structural diagram of a module of an embodiment of a message processing apparatus according to the present application.
  • FIG. 13 is a schematic structural diagram of a module of another embodiment of the message processing apparatus according to the present application.
  • FIG. 14 is a schematic structural diagram of a module of another embodiment of the message processing apparatus according to the present application.
  • 15 is a block diagram showing the structure of a message processing system of the present application.
  • the application can describe the application scenario in the cluster mode by using the message transfer between the caller and the callee.
  • the message processing method described in this application is not limited to the message interaction between the caller and the callee in the cluster mode, and the application scenarios of message interaction between other multiple terminals or different applications on the same terminal are still The message processing method described in this application can be applied.
  • the cluster can generally refer to a group of computers that are independent of each other and interconnected by a network. These computers form a group that can be a distributed network workgroup. One or more or all of the computers in the cluster may open the service as a server, and perform information interaction with computers outside the cluster. In some application scenarios, multiple computers in the cluster may be sent as service directions to other computers in the cluster for processing. At this time, other computers in the cluster receiving the service message may serve as the called party. Make the appropriate response.
  • the caller, the callee, and the like described in the method of the present application may be the cluster.
  • the computer terminal in the mode may also be an application on the terminal, or may also be a function module on the terminal.
  • the message processing method described in the present application will be described in detail below by taking a plurality of server terminals in a cluster mode as an example with reference to the accompanying drawings.
  • 1 is a flow chart of a method for an embodiment of a message processing method according to the present application. As shown in FIG. 1, the method may include:
  • S1 The caller calculates the sending duration of the sending service message, and requests the control node to occupy the time period according to the sending duration.
  • the caller can calculate the sending time required to send the service message.
  • the caller generating a service message may generally include generating a plurality of service messages belonging to the same batch or the same service flow (such as an order message summarized by the cycle collection), and the service messages usually need to be accessed in a relatively concentrated time period.
  • the called party may calculate, according to a sending interval of a single service message, a sending duration required to send all the service messages under a certain batch of the calling party.
  • the caller may also send a service message according to the batch or service flow, and may also send all the to-be-sent service messages in the current caller in some application scenarios, or send all current ones after periodic scanning. Service message to be sent.
  • the sending duration can be calculated according to the sending interval of a single service message. For example, the calling party needs to send 100 service messages, and each service message is sent every 10 milliseconds. Then, the calculated transmission duration can be 990 milliseconds.
  • the control node may apply to the control node for the occupied time period required for sending the service message according to the sending duration. Specifically, the applying for the occupation time period to the control node according to the sending duration may include:
  • S101 Acquire a latest occupied time of the control node, and send, to the control node, a first application message that uses the acquired latest occupied time plus the sending duration as the occupied time period.
  • the control node may generally include a data processing function module configured to ensure that the number of concurrent links established with the called party does not exceed the set maximum number of concurrent links, and may include a database or a control unit.
  • the control node described in this application may include a distributed counting node, and specifically, for example, Tair or memcache may be used.
  • the control node may be set in the service message access interface of the called party, or may be set in the caller unified message output interface or as a separate service unit. Controls the caller's message delivery. In this embodiment, the control node may be used as a separate service unit.
  • the caller may first apply for sending a resource to the control node, and the control node is invoked according to the network resource, the caller, or the caller.
  • the party's business status, etc. allocate resources to the caller.
  • the occupied time may be expressed as the time that the control node has been allocated and occupied before the occupied time, and the time after the occupied time may be applied for occupation.
  • the occupied time can be updated after each time period is allocated to ensure that the latest occupied time is provided correctly and timely. For example, the current time is 0 seconds, and the occupied time is 100 seconds. It can be expressed that the service message cannot be sent in the time from the current time 0 seconds to the occupied time 100 seconds, and the caller can be at the occupied time 100.
  • the time period for applying for sending a business message after a second is expressed as the time that the control node has been allocated and occupied before the occupied time, and the time after the occupied time may be applied for occupation.
  • the occupied time can be updated after each time period is allocated to ensure that the latest occupied time is provided correctly and timely. For example, the current time is 0 seconds, and the occupied time is 100 seconds. It can be expressed that the service message cannot be sent in the time from the current time 0
  • the latest occupation time T0 of the control node may be acquired, and the latest occupation time plus the calculated transmission time length TL may be used as a time period for the caller to send the service message.
  • the first application message may be sent to the control node, where the first application message may include the occupied time period request information of the T0+TL.
  • the caller fails to apply for the occupied time period, for example, the application time period is 100 seconds to 110 seconds (the acquired occupied time is 100 seconds + the sending time is 10 seconds), and the other calling party first applies.
  • the caller can obtain the latest occupied time of 105 seconds, and then continue to send the occupied time period to the control node for 105 seconds to 115 seconds according to the latest occupied time of 105 seconds (acquired The first application message of the latest occupation time of 105 seconds + transmission time of 10 seconds).
  • the caller can calculate the sending duration of the sent service message, and can apply to the control node for the occupied time period according to the sending duration.
  • control node After receiving the application message of the occupied time period of the caller, the control node determines an application result of the caller occupied time period according to a predetermined rule, and feeds back the application result to the corresponding caller.
  • the control node such as a TAIR counting node, may be a processing unit that transmits time resource allocations.
  • the control node receives one or more application messages of the application occupation time period sent by one or more callers, and may process according to the set predetermined rule to determine the application result of one or more callers occupying the time period.
  • the latest occupied moment of the control node may be information disclosed to all callers, and multiple callers may apply for a occupied time period according to the latest occupied time of the disclosure.
  • the control node may adopt a predetermined rule that preferentially processes the first received application message, and allocates the transmission time after the latest occupied time The caller to the latest received application message.
  • the control node may feed back the caller's application result to the corresponding caller.
  • the latest occupied time acquired by the three callers C1, C2, and C3 is 100 seconds, and the application time period is (100 to 110) seconds, (100 to 130) seconds, respectively. (100 to 115) seconds.
  • the control node first receives the occupation time period application message of the caller C1, and then allocates the time resource of 100 to 110 seconds to the caller C1 for use, and the application result of the time zone of the caller C is the application success.
  • the control node may update the latest occupied time of 100 seconds to 110 seconds according to the number of recent C1 application messages.
  • the control node finds that the occupied time period of the application according to the acquired occupation time is 100 seconds, and the application result is that the application fails.
  • the callers C2 and C3 can obtain the latest occupied time as 110 seconds, and then can re-apply the occupied time period to the control node according to the latest occupied time of 110 seconds.
  • the foregoing embodiment is an application scenario in which the control node processes the application message in the cluster mode.
  • the predetermined rule that the processing caller occupies the time period application may also be set according to other application scenarios or requirements.
  • the application message with a higher priority level may be preferentially processed according to the priority of the application time period of the occupation time period, or the application message received first may be processed, and the time period is allocated when the occupied time period in the processed application message is not occupied. .
  • the control node After receiving the application message of the time period of the caller, the control node determines, according to a predetermined rule, an application result of the time period occupied by the caller; the control node feeds back the application result to the corresponding caller. .
  • S3 The calling party calculates a sending time of the service message when the received application result of the occupied time period is successful.
  • the caller may send the sending time of each service message in the batch. If the application time period is 100 seconds to 110 seconds, 100 service messages need to be sent in the occupied time period, and each message sending time is 100 milliseconds, and the sending time of the first service message is 100 seconds. The sending time of the second service message is 100.1 seconds, ..., and the sending time of the 100th service message is 109.9 seconds.
  • the caller calculates the sending time of each service message, and then can be stored in the local message sending queue.
  • the sending queue may be a data storage and processing unit such as a stack or a process that sets a sending priority according to a storage sequence.
  • the occupied time period may be re-applied according to the latest occupied time of the obtained control node.
  • the calling party may calculate the sending time of each service message when the received application result of the occupied time period is successful, and may place the service message in the sending queue.
  • the status of the service message in the sending queue may also be set to the status to be sent.
  • the service message of the caller can effectively output the service message of the caller by using the occupied time period and setting the sending time for the service message.
  • S4 the calling party sends a control time to the control section when it exceeds the sending time of the service message. Click to send a token for the service message.
  • the caller may periodically monitor the service message that the application is successful in the occupied time period.
  • the control node may apply for sending a token to obtain a service message sending instruction.
  • a process may be configured to scan the sending time of the service message to be sent in the sending queue every 1 second, and when the sending time of the to-be-sent service message exceeds the current time. You can apply for a concurrent token to the TAIR counting node.
  • the sending time of the service message exceeding or reaching the service message in the embodiment may include that the current time is the same as the sending time, or the current time may be greater than the sending time.
  • the transmission time of the service message MSG_A is 99 seconds after the scan to the current time, but the transmission time of the service message MSG_B has not yet arrived is 99.9 seconds.
  • the caller can apply for the concurrent token of the service message MSG_A first. After 1 second, the current time is 100 seconds, and the scanning time that has exceeded the service message MSG_B is 99.9 seconds. At this time, the concurrent token of the service message MSG_B can be applied.
  • the expiration time that the current time is greater than the sending time may be set, and the service token that exceeds the expiration time may no longer apply for a sending token.
  • the setting is 30 seconds
  • it can be expressed as the scanning time until the current time exceeds the sending time of the service message by 30 seconds, and the token can be no longer sent for the service message exceeding the sending time of 30 seconds.
  • the business message that no longer applies for sending a token it can also be processed by other specified methods.
  • the calling party may periodically monitor the sending time of the scanning service message, and apply to send the token to the control node when the current time exceeds the sending time of the service message.
  • control node After receiving the application message of the sending token of the caller, the control node determines, according to whether the maximum service processing capability of the callee is reached, the application result of the caller sending the token, and the application is The result is fed back to the corresponding caller.
  • the control node may reach the set maximum service according to the current caller's service condition.
  • the processing can determine whether to allocate a token for the service message requesting to send the token, and implement control of the caller service processing traffic. For example, the control node determines, according to the current number of concurrent links and the set maximum concurrent link that the caller and the called method can maintain, the application result of the concurrent token, if the current number of concurrent connections does not reach the maximum number of concurrent links,
  • the concurrent tokens may be sent for the service message according to the chronological order of the received concurrent tokens.
  • the result of the application can then be sent to the caller.
  • the token can be sent to the service message when the maximum service processing capability of the callee is not reached, and the caller's service processing capability is maximized to improve the message processing efficiency.
  • the sending token request of the service message may be failed, and the result of the application failure may be returned to the corresponding caller.
  • the service message that fails to send the token request may re-apply for sending the token after the predetermined time of the sleep. The time when the caller sleeps can be set according to the message processing requirements.
  • S6 The calling party sends the service message that the sending token application is successful when the received sending token application result of the service message is successful.
  • the service message of the caller may send the service message to the called party after the application for sending the token is successful.
  • the service message that fails to send a token request may re-apply for sending a token after a predetermined time of sleep.
  • the caller can effectively set the sending party's service message to output at a uniform frequency by setting the sending time for the service message.
  • the set control node controls the timing of sending the service message.
  • the present application can distribute the centralized message processing at the control node to each caller by the caller fixed frequency output and the called service flow control, thereby greatly reducing the message processing burden of the control node, and effectively avoiding the message processing single. Point performance bottlenecks and improve the processing power of sending messages.
  • the control node can maximize the processing of the callee's business system in a uniform and stable manner without exceeding the processing power of the called party's business system. Improve system processing performance and stable operation of the system.
  • FIG. 2 is a schematic flowchart of a method for processing a message processing method according to an embodiment of the present application. As shown in FIG. 2, the method may include:
  • S11 Calculate a sending duration of the sending service message, and send a first application message to the application occupation time period according to the sending duration;
  • S13 monitoring whether the current time exceeds the sending time of the service message; and when detecting that the sending time is exceeded, sending a second application message for requesting the sending token of the service message;
  • the sent first application message or the second application message may be received and processed by a call control node, such as a TAIR count control node.
  • a call control node such as a TAIR count control node.
  • the present application does not exclude other message processing devices or function modules and the like to receive and process the first or second application message.
  • the processing of the time-consuming message, the monitoring of the sending time, the processing of the sending of the token message, and the like may be referred to other embodiments in the present application, and details are not described herein.
  • the present application can provide a calculation manner of the occupied time period.
  • the request message for sending the application occupation time period according to the sending duration may include:
  • S111 Acquire a latest occupation time of the control node, and send, to the control node, a first application message that uses the acquired latest occupied time plus the sending duration as the occupied time period.
  • FIG. 3 is a schematic flowchart of a method for processing a message processing method according to another embodiment of the present disclosure. As shown in FIG. 3, in another embodiment of the message processing method, the method may also be include:
  • the application of the occupied time period of the occupied time period fails, and the time period of the application according to the latest occupied time instant currently acquired may have been applied for by the other callers.
  • the latest occupation time can be updated, so that the subsequent caller can apply for the time resource again.
  • the latest occupied time of the update may be obtained, and the new occupied time period is recalculated in combination with the sending time.
  • the first application message including the new occupied time period may be continuously sent to continue to apply for the occupied time period.
  • the threshold of the number of application failures may also be set. If the application period of the caller fails multiple times, the application may be stopped when the number reaches the threshold, or a warning, prompt, statistics, etc. may be issued, according to other settings. The method is processed.
  • the caller may re-apply the application for sending the token when the result of the request for sending the token is failed, or may apply again after a fixed period of sleep.
  • the sending of the token request failure may generally include that the current service traffic reaches the maximum service processing capability of the callee, for example, the current number of concurrent links reaches the maximum number of concurrent connections that the caller and the callee can maintain.
  • the idle service processing capability can allow access to the performed service.
  • the caller usually sends a service message or a token for sending a message to the called party or the control node according to the situation of the service message of the user.
  • the called party may not access the service again, and the service message or the sending token application fails, which may result in blindly sending a new application, resulting in unnecessary data processing burden.
  • the caller fails to send the token request, and may be sent according to the control node.
  • the most recent available time of the token indicates the sleep time of the caller, allowing the caller to apply for a send token again upon reaching the valid application time of the sending token. In this way, the application success rate of sending the token can be improved, and at the same time, the sending of the token for the contention can be avoided, and the application is repeated multiple times in the case that the sending token is not applicable, and additional overhead is added.
  • FIG. 4 is a schematic flowchart of a method for processing a message processing method according to another embodiment of the present application. As shown in FIG. 4, in another embodiment of a message processing method according to the present application, the method further Can include:
  • the control node described in the message processing method of the present application may process the message sent by the caller, for example, allocate the occupation time of the service message occupation time period or allocate the transmission token according to the maximum service processing capability of the caller. And other resources.
  • the application may provide a message processing method, and the method may include:
  • S22 Determine, according to a predetermined rule, an application result of the occupied time period, and send an application result of the occupied time period;
  • S23 Determine an application result of the sending token according to whether the maximum service processing capability of the called party is reached, and send the application result of the sending token.
  • FIG. 5 is a schematic flow chart of a method for processing a message according to an embodiment of the present disclosure.
  • the control node may receive the occupation time period sent by the caller and the application message for sending the token, and then perform corresponding data processing, and return the processing result to the caller.
  • the predetermined rule that the control node determines the application result of the occupied time period may be according to a message processing requirement.
  • Make settings For example, the resource of the occupied time period may be allocated according to the latest occupied time of the control node and the occupied time period first received at the latest occupied time, or may be based on the application priority of the occupied time period set in the application message. Make an assignment. Specifically, it can be set according to actual message processing requirements, and this embodiment may not be limited to a specific manner.
  • FIG. 6 is a schematic flowchart of a method for performing another method of message processing according to the foregoing application. As shown in FIG. 6, in another embodiment of a message processing method provided by the present application, the method may include:
  • the latest occupied time can be updated, so that the caller who fails to apply for the other time period can re-apply to send the time resource according to the updated latest occupied time.
  • FIG. 7 is a schematic flowchart of a method for performing another method of message processing according to the foregoing application. As shown in FIG. 7, in another embodiment of a message processing method provided by the present application, the method may include:
  • the set token application validity time may include the most recent service access available time for the called party, and may also include the valid time of other token requests set.
  • the providing the token valid time to the caller may include providing a query interface or sending the token request validity time to the caller.
  • the message processing method described in the foregoing embodiment of the present application can distribute the centralized message processing at the control node to each caller by uniformly and smoothly outputting the caller service message and controlling the called service flow, thereby greatly reducing the control node.
  • the message processing burden can effectively avoid the single-point performance bottleneck problem of message processing and improve the processing capability of sending messages.
  • applying the method can make the called party business system in a uniform and stable manner without exceeding the processing capability of the called party's business system. Maximizes the performance of the callee system and improves the stability of the system operation.
  • FIG. 8 is a schematic structural diagram of a module of an embodiment of a message processing apparatus according to the present application.
  • the message processing terminal may include a PC terminal, a mobile electronic device, a server, a distributed network terminal, and a device, module, application, or the like including an executable program stored on a physical medium.
  • the message processing apparatus may include:
  • the calculating module 101 is configured to calculate a sending duration of the sending service message, and calculate an occupied time period of sending the service message according to the sending duration;
  • the time period application module 102 may be configured to send a first application message for applying the occupied time period
  • the receiving module 103 can be configured to receive a message that occupies a time period and sends an application result of the token;
  • the sending time calculation module 104 is configured to calculate, according to the received application result of the occupied time period, a sending time of the service message for the successful message;
  • the token application module 105 may be configured to: monitor whether a current time exceeds a sending time of the service message; and when detecting the sending time, send a second application message that applies a sending token of the service message;
  • the sending module 106 is configured to send, according to the received application result of the sending token, a service message that the sending token application is successful.
  • the message processing apparatus provided by the present application can output a service message with a uniform and smooth transmission time of the service message calculated by using the occupied time period of the application, and can output the maximum service by sending the token.
  • the message processing apparatus of the present application can effectively improve the stability of the operation of the service message by the caller system, and can reduce the burden of the control node and avoid the single point performance bottleneck problem of the control node service message processing.
  • FIG. 9 is a schematic structural diagram of a module of an embodiment of a computing module 101 in a message processing apparatus according to the present application.
  • the computing module 101 can include:
  • the occupancy time module 1011 can be used to acquire the latest occupied time of the control node
  • the occupied time period module 1012 may be configured to use, as the occupied time period, a time period calculated by using the acquired latest occupied time plus the sending duration.
  • FIG. 10 is a schematic structural diagram of a module of another embodiment of a message processing apparatus according to the present application. As shown in FIG. 10, the apparatus may further include:
  • the first application failure processing module 107 may be configured to calculate a new occupation time period of the service message according to the latest occupation time acquired by the calculation module when the application result of the occupation time period is failed; The first application message of the new occupied time period is sent to the time period application module 102.
  • the latest occupied time of the update may be obtained, and the new occupied time period is recalculated in combination with the sending time. Then, the first application message including the new occupied time period may be continuously sent to continue to apply for the occupied time period.
  • the threshold of the number of application failures may also be set. If the application period of the caller fails multiple times, the application may be stopped when the number reaches the threshold, or a warning, prompt, statistics, etc. may be issued, according to other settings. The method is processed.
  • FIG. 11 is a schematic structural diagram of a module of another embodiment of a message processing apparatus according to the present application. As shown in FIG. 11, the device may further include:
  • the second application failure processing module 108 may be configured to: when the received application result of the sending token is a failure, acquire a token application validity time; and when the token application validity time is reached, send the sending module to the sending module 106: Release an instruction to resend the second application message that the sending token request result is a failed service message.
  • the caller fails to apply for the sending token, and may indicate the sleep time of the caller according to the latest available time of the sending token determined by the control node, so that the The caller then applies for a sending token when it arrives at the validity request time of the sending token.
  • the application success rate of sending the token can be improved, and at the same time, the sending of the token for the contention can be avoided, and the application is repeated multiple times in the case that the sending token is not applicable, and additional overhead is added.
  • the processing party of the first application message or the second application message may perform processing such as allocation of message resources and control of the number of links on the message output end according to a preset message processing method to implement a message output end service. Uniform output of messages and maximum utilization of the caller's business processing capabilities without exceeding the maximum processing power of the callee's business.
  • the present application may further provide a message processing apparatus, such as a control node in a cluster mode in a specific embodiment, and an implementation method of the apparatus is as shown in FIG. 12, and the specific apparatus may include:
  • the application message receiving module 201 may be configured to receive an application message that includes an occupied time period; and may be further configured to receive an application message that sends a token;
  • the occupation time allocation module 202 may be configured to allocate an occupation time period of the service message to the occupied time period in the application message according to a predetermined rule
  • the token allocation module 203 is configured to allocate a sending token according to the current service traffic and the maximum service processing capability of the called party.
  • the application result sending module 204 may be configured to send the message that occupies the application result of the time period; and may also be used to send the message that sends the result of the request for the token.
  • FIG. 12 is a schematic structural diagram of a module of an embodiment of a message processing apparatus according to the present application.
  • the message processing apparatus in this embodiment may be, for example, a control node, and may receive an application period message of an occupation time period and a transmission token sent by the caller, and then perform corresponding data processing, and return the processing result to the caller.
  • the predetermined rule that the control node determines the application result of the occupied time period in the foregoing embodiment may be set according to the message processing requirement.
  • the resource of the occupied time period may be allocated according to the latest occupied time of the control node and the occupied time period first received at the latest occupied time, or may be based on the application priority of the occupied time period set in the application message. Make an assignment. Specifically, it can be set according to actual message processing requirements, and this embodiment may not be limited to a specific manner.
  • FIG. 13 is a schematic structural diagram of a module of another embodiment of a message processing apparatus according to the present application. Such as shown in FIG. 13, the apparatus may further include:
  • the occupancy time update module 205 can be configured to update the latest occupation time of the occupation time allocation module 202 after the occupation time period is allocated for the service message.
  • the occupied time update module 205 may update the latest occupied time after the time interval of the service message for the message processing device is allocated, so that the caller who fails to apply for the other time period may re-apply to send according to the updated latest occupied time.
  • the latest occupied time may be indicated in the device in the message processing, and the time before the occupied time has been allocated, and the time after the occupied time may be applied for occupation.
  • the unit that implements the data processing may be disposed in the occupied time allocation module 202. Of course, other embodiments may be disposed in other or dedicated modules.
  • FIG. 14 is a schematic structural diagram of a module of another embodiment of a message processing apparatus according to the present application. As shown in FIG. 14, the apparatus may further include:
  • the token application time module 206 may be configured to acquire the most recent service access time of the called party when the maximum service processing capability of the called party is reached, and use the latest service access time as an order. The time the card is valid.
  • the token application time module 206 is configured to effectively improve the application success rate of the caller service message sending token, reduce the number of times the token application is sent, and improve system processing performance.
  • FIG. 15 is a schematic structural diagram of a message processing system according to the present application. As shown in FIG. 15, the system may include:
  • the message client 1 may be configured to send a first application message based on the occupied time period including the sending duration setting to the control terminal 2, and may also be configured to calculate a service for the successful message based on the received application result of the occupied time period.
  • the time when the message was sent it can also be used to monitor whether the current time exceeds the industry Transmitting a message, and transmitting a second application message requesting the sending token of the service message to the control terminal 2 when the sending time is exceeded; and may also be used to receive the sending command based on the received
  • the result of the application of the card is a successful message that the transmission token application is successful.
  • the control terminal 2 may be configured to receive the first application message and the second application message sent by the message client, and may be further configured to allocate a service message to the occupied time period in the first application message according to a predetermined rule.
  • the time period may be used to allocate a sending token to the service message in the second application message according to the current service traffic and the maximum service processing capability of the called party; and may be used to send the first application message and the first The application result of the second application message is sent to the message client.
  • the message processing method, device and system described in the present application can distribute the centralized message processing at the control node to each caller by controlling the uniform and smooth output of the caller service message and controlling the called service flow, thereby greatly reducing the control.
  • the message processing burden of the node can effectively avoid the single-point performance bottleneck problem of message processing and improve the processing capability of the service message transmission.
  • applying the method can maximize the processing of the callee's business system in a uniform and stable manner without exceeding the processing capability of the called party's business system, and improve the processing performance of the called system and the stability of the system operation.
  • the present application is not limited to the method which must be completely standard or mentioned. Data interaction and processing.
  • the above description of the various embodiments in the present application is only an application in some embodiments of the present application.
  • the slightly modified processing method may also implement the foregoing embodiments of the present application. Program.
  • the same application can still be implemented in other non-innovative variations of the processing method steps described in the above embodiments of the present application, and details are not described herein again.
  • the unit or module illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product having a certain function.
  • the above devices are described as being separately divided into various modules by function.
  • the functions of each module may be implemented in the same software or software and/or hardware when implementing the present application, for example, the sending time module is incorporated into the computing module to calculate the sending time, and the module that implements the same function may also be A combination of multiple submodules or subunits.
  • the controller can be logically programmed by means of logic gates, switches, ASICs, programmable logic controllers, and Embedded in the form of a microcontroller or the like to achieve the same function. Therefore, such a controller can be considered as a hardware component, and a device for internally implementing it for implementing various functions can also be regarded as a structure within a hardware component. Or even a device for implementing various functions can be considered as a software module that can be both a method of implementation and a structure within a hardware component.
  • the application can be described in the general context of computer-executable instructions executed by a computer, such as a program module.
  • program modules include routines, programs, objects, components, data structures, classes, and the like that perform particular tasks or implement particular abstract data types.
  • the present application can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are connected through a communication network.
  • program modules can be located in both local and remote computer storage media including storage devices.
  • the technical solution of the present application may be embodied in the form of a software product in essence or in the form of a software product, which may be stored in a storage medium such as a ROM/RAM or a disk. , an optical disk, etc., includes instructions for causing a computer device (which may be a personal computer, mobile terminal, server, or network device, etc.) to perform the methods described in various embodiments of the present application or portions of the embodiments.
  • a computer device which may be a personal computer, mobile terminal, server, or network device, etc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Telephonic Communication Services (AREA)
  • Information Transfer Between Computers (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本申请提供一种消息处理方法、装置及系统。所述方法可以包括：计算发送业务消息的发送时长，根据所述发送时长发送申请占用时间段的第一申请消息；在接收到的所述占用时间段的申请结果为成功时，计算所述业务消息的发送时间；监测当前时间是否超过所述业务消息的发送时间；在监测到超过所述发送时间时，发送申请所述业务消息的发送令牌的第二申请消息；在接收到的所述发送令牌的申请结果为成功时，发送所述发送令牌申请成功的业务消息。利用本申请中各个实施例，可以使调用方平稳、均匀的输出业务消息，提高被调用方系统运行的稳定性和最大化利用被调用方业务处理能力。

Description

一种消息处理方法、装置及系统
技术邻域
本申请属于计算机通信信息处理领域，尤其涉及一种消息处理方法、装置及系统。
背景技术
伴随着互联网在快速发展，许多领域中互联网应用的服务器访问量呈明显上升趋势。服务器上的业务系统需要具有一定的业务处理能力，对访问服务器的调用方的消息进行快速、准确处理。
一般的，在服务器业务系统被调用时，系统的处理能力总是有限的，而调用方需要在被调用方系统中处理的业务消息的数量和所述业务消息的产生时间不是固定的。如一个或多个调用方在短时间内几乎同时输出多个业务消息访问被调用方，会对被调用方产生短暂的冲击。如果访问量过大、经常性的突发性业务甚至还会导致被调用方业务系统的消息阻塞、系统崩溃等严重后果。为保障被调用方业务系统的稳定运行，现有技术中通常采用并发控制机制控制被调用方的业务处理流量。
所述的并发控制机制通常是指在系统间调用时，设置调用方与被调用方可保持的最大并发链接数，当出现新的链接请求时发现当前链接数已经超过设置的最大并发链接数时则拒绝创建新的链接。但在一些应用场景如集群模式下多个调用方访问被调用方时，虽然采用了并发机制控制所述调用方与被调用方可保持的最大并发链接数，但调用方为了争夺单位时间内的业务消息发送机会很容易造成请求失败而需要不停的重复请求发送，而调用方有新的业务消息产生时又会去业务节点申请发送。现有的并发控制机制主要是根据被调用方的业务处理能力在计数控制节点控制被调用方处理的业务流量，对调用方的业务消息 输出没有限制。而调用方尤其是所述集群模式下高并发情况下可以以不同的频率输出业务消息，这些业务消息产生后都需要统一去所述计数控制节点进行消息发送处理，这样无疑对计数控制节点造成较大负担，造成单节点业务消息的处理的性能瓶颈问题，降低整个消息的处理效率。
所述集群模式下，如果所述调用方的业务系统是一个批次里的每笔流水都需要访问被调用方系统的应用场景，那么往往就会存在多笔流水(例如等于并发数100)几乎同时访问被调用方系统，而后处理后又几乎同时释放。实际的应用场景中不同的调用方可以在不同的时间段产生高并发业务消息，有的时候会多个调用方在相同或者临近时间段并发，有的时候也会全部空闲。这样会导致系统运行性能呈现波浪式或者尖刺，不利于调用方系统的稳定运行。
现有技术中采用的在调用方和被调用方之间设置的并发控制机制不能对调用方系统的消息输出进行控制，降低了被调用系统的稳定运行性能。在一些应用场景中如集群模式下还降低了计数控制节点的业务消息处理性能。
发明内容
本申请目的在于提供一种消息处理方法、装置及系统，可以使调用方平稳、均匀的输出业务消息，提高被调用方系统运行的稳定性，提升被调用方或者链接控制节点的业务消息处理性能和效率。本申请所述的消息处理方法和装置可以在不超过被调用方系统最大业务处理能力的情况下，最大化的利用被调用方的业务处理能力，提高资源使用效率。
本申请提供的一种消息处理方法、装置及系统是这样实现的：
一种消息处理方法，所述方法包括：
调用方计算发送业务消息的发送时长，根据所述发送时长向控制节点申请占用时间段；
所述控制节点在收到调用方的所述占用时间段的申请消息后，根据预定规则确定所述调用方占用时间段的申请结果，并将所述申请结果反馈给相应的调用 方；
所述调用方在接收到的所述占用时间段的申请结果为成功时，计算所述业务消息的发送时间；
所述调用方在监测到超过所述业务消息的发送时间时，向所述控制节点申请所述业务消息的发送令牌；
所述控制节点在收到调用方的所述发送令牌的申请消息后，根据是否达到被调用方的最大业务处理能力确定所述调用方发送令牌的申请结果，并将所述申请结果反馈给相应的调用方；
所述调用方在接收到的所述业务消息的发送令牌申请结果为成功时，发送所述发送令牌申请成功的业务消息。
一种消息处理方法，所述方法包括：
计算发送业务消息的发送时长，根据所述发送时长发送申请占用时间段的第一申请消息；
在接收到的所述占用时间段的申请结果为成功时，计算所述业务消息的发送时间；
监测当前时间是否超过所述业务消息的发送时间；在监测到超过所述发送时间时，发送申请所述业务消息的发送令牌的第二申请消息；
在接收到的所述发送令牌的申请结果为成功时，发送所述发送令牌申请成功的业务消息。
一种消息处理方法，所述方法包括：
接收申请占用时间段和发送令牌的申请消息；
根据预定规则确定占用时间段的申请结果，发送所述占用时间段的申请结果；
根据是否达到被调用方的最大业务处理能力确定所述发送令牌的申请结果，发送所述发送令牌的申请结果。
一种消息处理装置，所述装置包括：
计算模块，用于计算发送业务消息的发送时长，并基于所述发送时长计算发送业务消息的占用时间段；
时间段申请模块，用于发送申请所述占用时间段的第一申请消息；
接收模块，用于接收占用时间段和发送令牌的申请结果的消息；
发送时间计算模块，用于基于接收到的所述占用时间段的申请结果为成功的消息计算业务消息的发送时间；
令牌申请模块，用于监测当前时间是否超过所述业务消息的发送时间；在监测到超过所述发送时间时，发送申请所述业务消息的发送令牌的第二申请消息；
发送模块，用于基于接收到的所述发送令牌的申请结果为成功的消息发送所述发送令牌申请成功的业务消息。
一种消息处理装置，所述装置包括：
申请消息接收模块，用于接收包括占用时间段的申请消息；还用于接收发送令牌的申请消息；
占用时间分配模块，用于根据预定规则为所述申请消息中的占用时间段分配业务消息的占用时间段；
令牌分配模块，用于根据被调用方当前的业务流量和最大业务处理能力分配发送令牌；
申请结果发送模块，用于发送所述占用时间段申请结果的消息；还用于发送所述发送令牌申请结果的消息。
一种消息处理系统，所述系统包括：
消息客户端，用于向控制端发送基于包括发送时长设置的占用时间段的第一申请消息；还用于基于接收到的所述占用时间段的申请结果为成功的消息计算业务消息的发送时间；还用于监测当前时间是否超过所述业务消息的发送时间，并在监测到超过所述发送时间时向所述控制端发送申请所述业务消息的发送令牌的第二申请消息；还用于基于接收到的所述发送令牌的申请结果为成功的消息发送所述发送令牌申请成功的业务消息；
控制端，用于接收消息客户端发送的所述第一申请消息和所述第二申请消息；还用于根据预定规则为所述第一申请消息中的占用时间段分配业务消息的占用时间段；还用于根据被调用方当前的业务流量和最大业务处理能力为所述第二申请消息中的业务消息分配发送令牌；还用于将所述第一申请消息和第二申请消息的申请结果发送给所述消息客户端。
本申请提供的一种消息处理方法、装置及系统，可以通过为业务消息申请占用时间段，并对每条业务消息设置相应的发送时间，在申请到发送令牌后才可以发送业务消息。这样，可以对调用方业务消息的进行输出控制，实现均匀平稳的输出业务消息，可以提高被调用方系统运行的稳定性。在本申请中可以在不超过被调用方最大业务处理能力的情况下，调用方可以最大化的输出业务消息，充分利用被调用方系统的最大处理能力，提高系统资源利用率。同时由于对所述调用方的输出控制，可以避免集群模式下性能单点和瓶颈问题。
附图说明
为了更清楚地说明本申请实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请中记载的一些实施例，对于本邻域普通技术人员来讲，在不付出创造性劳动性的前提下，还可以根据这些附图获得其他的附图。
图1是本申请一种消息处理方法一种实施例的流程示意图；
图2是本申请一种消息处理方法一种实施例的流程示意图；
图3是本申请一种消息处理方法另一种实施例的流程示意图；
图4是本申请一种消息处理方法另一种实施例的流程示意图；
图5是本申请一种消息处理方法一种实施例的流程示意图；
图6是本申请一种消息处理方法另一种实施例的流程示意图；
图7是本申请一种消息处理方法另一种实施例的流程示意图；
图8是本申请一种消息处理装置一种实施例的模块结构示意图；
图9是本申请所述消息处理装置中计算模块一种实施例的模块结构示意图；
图10是本申请所述消息处理装置另一种实施例的模块结构示意图；
图11是本申请所述消息处理装置另一种实施例的模块结构示意图；
图12是本申请所述消息处理装置一种实施例的模块结构示意图；
图13是本申请所述消息处理装置另一种实施例的模块结构示意图；
图14是本申请所述消息处理装置另一种实施例的模块结构示意图；
图15是本申请一种消息处理系统的模块结构示意图。
具体实施方式
为了使本技术邻域的人员更好地理解本申请中的技术方案，下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本申请一部分实施例，而不是全部的实施例。基于本申请中的实施例，本邻域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都应当属于本申请保护的范围。
本申请可以以集群模式下调用方和被调用方之间的消息传递为应用场景进行说明。当然，本申请所述的消息处理方法不局限于所述集群模式下的调用方与被调用方的消息交互，其他的多个终端或者同一终端上的不同应用之间的消息交互的应用场景仍然可以适用本申请所述的消息处理方法。所述的集群通常可以指一组相互独立的、通过网络互联的计算机。这些计算机构成了一个组，可以为分布式的网络工作组。所述的集群中的一个或者多个或者全部计算机可以作为服务器对外开放业务，向所述集群外的计算机进行信息交互。在一些应用场景中，所述集群中的多个计算机可以作为调用方向所述集群中的其他计算机发送业务消息进行处理，此时，所述接收业务消息的集群中的其他计算机可以作为被调用方进行相应的响应。
需要说明的是，本申请方法中所述的调用方、被调用方等可以为所述集群 模式下的计算机终端，也可以为终端上的应用，或者也可以为终端上的功能模块。下面结合附图以集群模式下的多个服务器终端为例对本申请所述的消息处理方法进行详细的说明。图1是本申请所述一种消息处理方法一种实施例的方法流程图。如图1所示，所述方法可以包括：
S1：调用方计算发送业务消息的发送时长，根据所述发送时长向控制节点申请占用时间段。
所述调用方在产生流水业务需要发送业务消息时，可以计算发送完所述业务消息所需要的发送时间。一般的，所述调用方产生业务消息通常可以包括产生属于同一批次或者同一业务流水(如周期采集汇总的订单消息)的多个业务消息，这些业务消息通常需要在相对集中的时间段内访问被调用方。所述调用方可以根据单个业务消息的发送间隔计算发送完所述调用方某个批次下所有业务消息所述需要的发送时长。当然，所述调用方也可以不按照所述批次或者业务流水发送业务消息，在一些应用场景中也可以发送当前调用方中所有的待发送业务消息，或者周期性的扫描后发送当前所有的待发送业务消息。
如上所述，所述发送时长可以根据单个业务消息的发送间隔进行计算，如调用方需要发送100条业务消息，每个间隔10毫秒发送一条业务消息。那么，计算得到的所述发送时长可以为990毫秒。在计算完所述发送时长后，可以根据所述发送时长向控制节点申请发送所述业务消息需要的占用时间段。具体的，所述根据所述发送时长向控制节点申请占用时间段可以包括：
S101：获取控制节点的最新占用时刻，向所述控制节点发送以所述获取的最新占用时刻加上所述发送时长作为所述占用时间段的第一申请消息。
所述的控制节点通常可以包括为保障与被调用方建立的并发链接数不超过设置的最大并发链接数而设置的数据处理功能模块，可以包括数据库或者控制单元。本申请中所述的控制节点可以包括分布式计数节点，具体的例如可以采用Tair或者memcache等。所述的控制节点可以设置在被调用方的业务消息接入接口中，也可以设置在调用方统一的消息输出接口或者作为单独的服务单元 控制调用方的消息发送。本实施例中可以采用将所述控制节点作为单独的服务单元，所述调用方需要发送业务消息时可以先向所述控制节点进行申请发送资源，由控制节点根据网络资源、调用方或者被调用方的业务状态等为调用方分配资源。
所述的控制节点中通常需要设置占用时刻的信息。所述的占用时刻可以表示为所述控制节点在所述占用时刻之前的时间已经分配占用，所在占用时刻后面的时间可以申请占用。每次占用时间段分配后可以更新占用时刻，以保障提供的为正确、及时的最新占用时刻。例如当前时刻为0秒，所述占用时刻为100秒，可以表示为在当前时刻0秒至所述占用时刻100秒的时间内不能申请发送业务消息，所述调用方可以在所述占用时刻100秒后申请发送业务消息的占用时间段。因此，本实施例中可以获取所述控制节点的最新占用时刻T0，以所述最新占用时刻加上所述计算得到的发送时长TL作为该调用方发送所述业务消息需要占用时间段。然后可以向所述控制节点发送第一申请消息，所述第一申请消息中可以包括上述T0+TL的占用时间段请求信息。
当然，所述调用方在申请所述占用时间段失败时，例如申请的占用时间段为100秒至110秒(获取的占用时刻100秒+发送时长10秒)的时间段被其他调用方先申请占用了到了105秒的时刻，此时所述调用方可以获取最新的占用时刻105秒，然后根据所述最新的占用时刻105秒继续向控制节点发送占用时间段为105秒至115秒(获取的最新占用时刻105秒+发送时长10秒)的第一申请消息。
调用方可以计算发送业务消息的发送时长，并可以根据所述发送时长向控制节点申请占用时间段。
S2：所述控制节点在收到调用方的所述占用时间段的申请消息后，根据预定规则确定所述调用方占用时间段的申请结果，并将所述申请结果反馈给相应的调用方。
所述控制节点例如TAIR计数节点可以为发送时间资源分配的处理单元。所述控制节点收到一个或者多个调用方发送来的申请占用时间段的一个或者多个申请消息，可以根据设置的预定规则进行处理，确定一个或者多个调用方占用时间段的申请结果。一般的，所述控制节点的最新占用时刻可以为对所有调用方公开的信息，多个调用方可以根据公开的所述最新占用时刻申请占用时间段。所述控制节点在接收到多个根据最新的占用时刻发送的占用时间段申请消息时，可以采取优先处理最先接收到的申请消息的预定规则，将所述最新的占用时刻后面的发送时间分配给最新接收到的申请消息的调用方。相应的，在所述最新接收到的申请消息的调用方申请占用时间段成功后，其他同样根据上述申请成功的最新占用时刻发送的申请消息则申请失败。所述控制节点可以将所述调用方的申请结果反馈给相应的调用方。
具体的应用场景中，例如三个调用方C1、C2、C3获取的最新占用时刻为100秒，分别向所述控制节点申请占用时间段为(100至110)秒、(100至130)秒、(100至115)秒。所述控制节点先接收到调用方C1的占用时间段申请消息，然后将100至110秒的时间资源分配给调用方C1使用，那么所述调用方C占用时间段的申请结果为申请成功。此时，所述控制节点可以根据最近C1申请消息的数量将最新占用时刻100秒更新为110秒。与此同时，所述控制节点接收到调用方C2、C3的申请消息后，发现根据获取的占用时刻为100秒申请的占用时间段已经被占用，则申请结果为申请失败。所述调用方C2、C3可以获取最新的占用时刻为110秒，然后可以根据最新的占用时刻110秒重新向所述控制节点申请占用时间段。
上述实施例为集群模式下控制节点对申请消息处理的应用场景。当然，所述的处理调用方占用时间段申请的预定规则也可以根据其他应用场景或者需求进行设置。例如，可以根据占用时间段申请消息的优先级优先处理优先级别高的申请消息，或者处理先接收到的申请消息等，在处理的申请消息中的占用时间段没有被占用时为其分配时间段。
所述控制节点在收到调用方的所述占用时间段的申请消息后，根据预定规则确定所述调用方占用时间段的申请结果；所述控制节点将所述申请结果反馈给相应的调用方。
S3：所述调用方在接收到的所述占用时间段的申请结果为成功时，计算所述业务消息的发送时间。
所述调用方如果接收到的所述控制节点反馈的申请结果为所述占用时间段的占用时间申请成功，则可以调用方当前要发送批次中每条业务消息的发送时间。如申请的占用时间段为100秒至110秒，在所述占用时间段内需要发送100条业务消息，每条消息发送时间为100毫秒，则可以计算第一条业务消息的发送时间为100秒、第二条业务消息的发送时间为100.1秒、…、第100条业务消息的发送时间为109.9秒。
所述调用方计算完每条业务消息的发送时间，然后可以存放入本地的消息发送队列中。一般的，所述发送队列可以为采用根据存入先后顺序设定发送优先级的栈或进程等数据存储、处理单元。
如前所述，如果所述调用方接收的所述占用时间段的申请结果为失败时，可以根据获取的控制节点的最新占用时刻重新申请占用时间段。当然，也可以设置间隔一段时间后重新申请，或者申请失败达到阀值次数后发出提示信息，进行相应的处理。
所述调用方在接收到的所述占用时间段的申请结果为成功时，可以计算每条业务消息的发送时间，并可以将所述业务消息置于在发送队列中。本实施例中，也可以将所述发送队列中的业务消息的状态设置为待发送状态。本申请实施例中为调用方的业务消息通过申请占用时间段和为业务消息设置发送时间，可以有效的使调用方的业务消息固定频率输出。
S4：所述调用方在监测到超过所述业务消息的发送时间时，向所述控制节 点申请所述业务消息的发送令牌。
所述调用方可以对所述占用时间段申请成功的业务消息进行周期性的监测，当监测到到达所述业务消息的发生时间时可以向控制节点申请发送令牌，以获取业务消息发送指令。例如上述集群模式实施例中，可以设置一个进程每间隔1秒对所述发送队列中待发送状态的业务消息的发送时间进行扫描，在扫描到所述待发送业务消息的发送时间超过当前时刻时，可以向TAIR计数节点申请并发令牌。
需要说明的，本实施例中所述的超过或者到达所述业务消息的发送时间可以包括当前时间与所述发送时间相同，或者可以为所述当前时间大于所述发送时间。例如间隔1秒扫描所述发送时间时，扫描到当前时间99秒到达了业务消息MSG_A的发送时间99秒，但还没有到达业务消息MSG_B的发送时间为99.9秒。此时，调用方可以先申请业务消息MSG_A的并发令牌。经过1秒后当前时间为100秒，扫描到已经超过所述业务消息MSG_B的发送时间为99.9秒，此时可以申请业务消息MSG_B的并发令牌。当然，也可以设置所述当前时间大于所述发送时间的过期时间，可以对超过所述过期时间的业务消息不再申请发送令牌。例如设置所述为30秒时，可以表示为扫描到当前时间超过业务消息的发送时间30秒时，则可以不再为所述超过发送时间30秒的业务消息申请发送令牌。对于上述此次不再申请发送令牌的业务消息，也可以由其他指定方式进行处理。
所述调用方可以周期性的监测扫描业务消息的发送时间，在监测到当前时间超过所述业务消息的发送时间时，向所述控制节点申请发送令牌。
S5：所述控制节点在收到调用方的所述发送令牌的申请消息后，根据是否达到被调用方的最大业务处理能力确定所述调用方发送令牌的申请结果，并将所述申请结果反馈给相应的调用方。
所述控制节点可以根据当前被调用方的业务情况是否达到设定的最大业务 处理能判断是否为申请发送令牌的业务消息分配令牌，实现调用方业务处理流量的控制。例如所述控制节点根据当前的并发链接数和设置的调用方与被调用方法可以保持的最大并发链接确定所述并发令牌的申请结果，如果当前并发连接数没有达到所述最大并发链接数，则可以根据接收到的申请并发令牌的时间先后顺序为业务消息发送并发令牌。然后可以将所述申请结果发送至所述调用方。通过控制节点对并发链接数据的控制，可以在未达到被调用方的最大业务处理能力时为业务消息分配发送令牌，最大化的调用被调用方的业务处理能力，提高消息处理效率。
如果当前业务流量已经达到被调用方的最大业务处理能力，如达到最大并发链接数，则可以设置所述业务消息的发送令牌申请失败，可以将申请失败的结果返回给相应的调用方。此时，所述发送令牌申请失败的业务消息可以在休眠预定时间后重新申请发送令牌。所述调用方休眠的时间可以根据消息处理需求进行设定。
S6：所述调用方在接收到的所述业务消息的发送令牌申请结果为成功时，发送所述发送令牌申请成功的业务消息。
所述调用方的业务消息在申请发送令牌成功后，可以将业务消息发送至被调用方。如上所述，所述发送令牌申请失败的业务消息可以休眠预定时间后重新申请发送令牌。
本申请所述的一种消息处理方法，调用方可以通过为业务消息设置发送时间，可以有效的使调用方的业务消息以均匀的频率输出。同时，设置的控制节点对业务消息的发送时机进行控制。这样，本申请通过调用方固定频率输出和对被调用的业务流量控制可以将在控制节点的集中消息处理分散到各个调用方，大大减少控制节点的消息处理负担，可以有效的避免消息处理的单点性能瓶颈问题，提高发送消息的处理能力。控制节点可以在不超过被调用方业务系统处理能力的情况下，以均匀平稳的方式使被调用方业务系统处理能最大化， 提高系统处理性能和系统的稳定运行。
本申请所述的消息处理方法，可以适用于包括但不限于集群模式下的调用方的消息处理。具体的本申请还提供一种消息处理方法，图2是本申请所述一种消息处理方法一种实施例的方法流程示意图，如图2所示，所述方法可以包括：
S11：计算发送业务消息的发送时长，根据所述发送时长发送申请占用时间段的对第一申请消息；
S12：在接收到的所述占用时间段的申请结果为成功时，计算所述业务消息的发送时间；
S13：监测当前时间是否超过所述业务消息的发送时间；在监测到超过发送时间时，发送申请所述业务消息的发送令牌的第二申请消息；
S14：在接收到的所述发送令牌的申请结果为成功时，发送所述发送令牌申请成功的业务消息。
所述发送的第一申请消息或者第二申请消息，可以由调用方发送、例如TAIR的计数控制节点接收、处理。本申请不排除其他的消息处理装置或者功能模块等来接收、处理所述第一或者第二申请消息。具体的，本实施例中占用时间段消息处理、发送时刻的监测、发送令牌消息的处理等可以参照本申请中的其他实施例，在此不做赘述。
如前述所述，本申请可以提供一种所述占用时间段的计算方式。具体的本申请所述一种消息处理方法的另一种实施例中，所述根据所述发送时长发送申请占用时间段的申请消息可以包括：
S111：获取控制节点的最新占用时刻，向所述控制节点发送以所述获取的最新占用时刻加上所述发送时长作为所述占用时间段的第一申请消息。
本实施例中所述的根据获取的控制节点的最新占用时刻和发送时长计算得到的时间段具体的实施过程可以参照本申请中S101的实施方式和相关叙述。
本申请所述一种消息处理方法的另一种实施例中，如果申请所述占用时间段失败，调用方接收到所述占用时间段的申请结果为失败时，可以尝试重新发送 申请。图3是本申请所述一种消息处理方法另一种实施例的方法流程示意图，具体的如图3所示，所述一种消息处理方法的另一种实施例中，所述方法还可以包括：
S15：在接收到所述占用时间段的申请结果为失败时，根据获取的更新的最新占用时刻和所述发送时长计算新的占用时间段；发送包括所述新的占用时间段的第一申请消息。
所述占用时间段的占用时间段申请失败，通常的可以包括根据当前获取的最新占用时刻申请的占用时间段已经被其他调用方抢先申请使用。一般的，例如控制节点中新的占用时间段被申请使用成功后，可以更新最新占用时间，以便后续的调用方可以再次申请发送时间资源。本实施例中在所述占用时间段申请失败时，可以获取更新后的最新占用时刻，结合所述发送时长重新计算出新的占用时间段。然后可以继续发送包括所述新的占用时间段的第一申请消息，继续申请占用时间段。当然，也可以设置申请失败次数的阀值，如果调用方的占用时间段多次申请失败，次数达到所述阀值时可以采取停止申请，或者发出警告、提示、统计等信息，按照其他设定的方法进行处理。
本申请所述的一种消息处理方法，所述调用方在收到所述发送令牌申请结果为失败时，可以重新进行发送令牌的申请，也可以在休眠固定时间后再次申请。一般的，所述发送令牌申请失败通常可以包括当前业务流量达到了被调用方的最大业务处理能力，例如当前并发链接数达到调用方与被调用方可以保持的最大并发连接数。在这种情况下，需要被调用方处理完一条或者多条业务消息后，有空闲的业务处理能力才可以允许接入进行的业务。在现有的处理机制中，调用方通常是根据自身的业务消息产生情况向被调用方或者控制节点发送业务消息或者发送消息的令牌。在上述达到被调用方最大处理能力的情况下，被调用方不可以再接入业务，业务消息或者发送令牌申请失败，往往会导致盲目的发送新的申请，造成不必要的数据处理负担。本申请提供的另一种消息处理方法中，例如所述调用方在所述发送令牌申请失败，可以根据控制节点确定的发送 令牌最近的可用时间指示所述调用方的休眠时间，让所述调用方在到达所述发送令牌的有效申请时间时再申请发送令牌。这样既可以提高发送令牌的申请成功率，同时又可以避免为争抢发送令牌在发送令牌不可申请的情况下仍然多次重复发送申请，增加额外开销。
图4是本申请所述一种消息处理方法另一种实施例的方法流程示意图，如图4所示，本申请所述的一种消息处理方法的另一种实施例中，所述方法还可以包括：
S16：在接收到的所述发送令牌的申请结果为失败时，获取令牌申请有效时间；在达到所述令牌申请有效时间时，重新发送所述发送令牌申请结果为失败的业务消息的第二申请消息。
当然，除了上述被调用方达到最大处理能力的情况，其他的发送令牌暂时不可申请的应用场景，例如被其他调用方使用中未释放，或者设置的其他发送令牌申请限制的应用场景仍然可以采取上述实施例的所述的方法。
本申请所述一种消息处理方法中所述的控制节点可以对调用方发送的消息进行处理，例如分配所述业务消息占用时间段的占用时间或者根据调用方的最大业务处理能力分配发送令牌等资源。具体的，本申请可以提供一种消息处理方法，所述方法可以包括：
S21：接收申请占用时间段和发送令牌的申请消息；
S22：根据预定规则确定占用时间段的申请结果，发送所述占用时间段的申请结果；
S23：根据是否达到被调用方的最大业务处理能力确定所述发送令牌的申请结果，发送所述发送令牌的申请结果。
图5是本申请上述所述一种消息处理方法一种实施例的方法流程示意图。在本实施例中，可以由控制节点接收调用方发送的占用时间段和发送令牌的申请消息，然后进行相应的数据处理，将处理结果返回给调用方。上述实施例中所述控制节点确定所述占用时间段的申请结果的预定规则可以根据消息处理需求 进行设置。例如可以根据所述控制节点的最新占用时刻和在所述最新占用时刻最先接收到的占用时间段申请消息分配占用时间段的资源，也可以根据申请消息中设置的占用时间段的申请优先级进行分配。具体的可以根据实际消息处理需求设置，本实施例可以对此不做具体某一方式的限定。
图6是本申请上述所述一种消息处理方法另一种实施例的方法流程示意图。如图6所示，在本申请提供的一种消息处理方法的另一种实施例中，所述方法可以包括：
S24：所述占用时间段的申请结果为成功时，更新所述控制节点的最新占用时刻。
所述控制节点为调用方的业务消息分配占用时间段后，可以更新最新占用时刻，以便其它发送占用时间段申请失败的调用方可以根据更新的最新占用时刻重新申请发送时间资源。
图7是本申请上述所述一种消息处理方法另一种实施例的方法流程示意图。如图7所示，在本申请提供的一种消息处理方法的另一种实施例中，所述方法可以包括：
S25：在达到被调用方的最大业务处理能力时，获取所述被调用方最近的业务接入可用时间，将所述最近的业务接入可用时间作为令牌申请有效时间。
所述的设置的令牌申请有效时间可以包括为所述被调用方最近的业务接入可用时间，也可以包括设置的其他令牌申请的有效时间。所述的将所述令牌有效时间提供给调用方可以包括提供查询接口，或者发送所述令牌申请有效时间至调用方。
本申请上述实施例中所述的消息处理方法，通过对调用方业务消息均匀平稳输出和对被调用的业务流量控制可以将在控制节点的集中消息处理分散到各个调用方，大大减少控制节点的消息处理负担，可以有效的避免消息处理的单点性能瓶颈问题，提高发送消息的处理能力。并且申请所述方法可以在不超过被调用方业务系统处理能力的情况下，以均匀平稳的方式使被调用方业务系统处 理能最大化，提高被调用方系统处理性能和系统运行的稳定性。
基于本申请上述实施例所述的消息处理方法，本申请提供一种消息处理装置。图8是本申请所述消息处理装置一种实施例的模块结构示意图。所述消息处理终端可以包括PC终端、移动电子设备、服务器、分布式网络终端以及包括存储于实体介质上可执行程序的装置、模块、应用等。具体的，如图8所示，所述消息处理装置可以包括：
计算模块101，可以用于计算发送业务消息的发送时长，并基于所述发送时长计算发送业务消息的占用时间段；
时间段申请模块102，可以用于发送申请所述占用时间段的第一申请消息；
接收模块103，可以用于接收占用时间段和发送令牌的申请结果的消息；
发送时间计算模块104，可以用于基于接收到的所述占用时间段的申请结果为成功的消息计算业务消息的发送时间；
令牌申请模块105，可以用于监测当前时间是否超过所述业务消息的发送时间；在监测到超过所述发送时间时，发送申请所述业务消息的发送令牌的第二申请消息；
发送模块106，可以用于基于接收到的所述发送令牌的申请结果为成功的消息发送所述发送令牌申请成功的业务消息。
本申请提供的所述消息处理装置可以以申请的占用时间段计算出的业务消息的发送时间均匀、平稳的输出业务消息，并可以通过发送令牌实现最大业务的输出。本申请的消息处理装置可以有效提高业务消息被调用方系统运行的稳定性，同时可以降低控制节点的负担，避免控制节点业务消息处理的单点性能瓶颈问题。
图9是本申请所述消息处理装置中计算模块101一种实施例的模块结构示意图。如图9所示，所述计算模块101可以包括：
占用时刻模块1011，可以用于获取控制节点的最新占用时刻；
占用时间段模块1012，可以用于以所述获取的最新占用时刻加上所述发送时长计算出的时间段作为所述占用时间段。
图10是本申请所述一种消息处理装置另一种实施例的模块结构示意图。如图10所示，所述装置还可以包括：
第一申请失败处理模块107，可以用于在接收到所述占用时间段的申请结果为失败时，根据所述计算模块获取的最新占用时刻计算业务消息的新的占用时间段；将包括所述新的占用时间段的第一申请消息发送至所述时间段申请模块102。
本实施例中在所述占用时间段申请失败时，可以获取更新后的最新占用时刻，结合所述发送时长重新计算出新的占用时间段。然后可以继续发送包括所述新的占用时间段的第一申请消息，继续申请占用时间段。当然，也可以设置申请失败次数的阀值，如果调用方的占用时间段多次申请失败，次数达到所述阀值时可以采取停止申请，或者发出警告、提示、统计等信息，按照其他设定的方法进行处理。
图11是本申请所述一种消息处理装置另一种实施例的模块结构示意图。如图11所示，所述装置还可以包括：
第二申请失败处理模块108，可以用于在接收到的所述发送令牌的申请结果为失败时，获取令牌申请有效时间；在达到所述令牌申请有效时间时，向所述发送模块106下达重新发送所述发送令牌申请结果为失败的业务消息的第二申请消息的指令。
上述实施例的一种消息处理装置中，例如所述调用方在所述发送令牌申请失败，可以根据控制节点确定的发送令牌最近的可用时间指示所述调用方的休眠时间，让所述调用方在到达所述发送令牌的有效性申请时间时再申请发送令牌。这样既可以提高发送令牌的申请成功率，同时又可以避免为争抢发送令牌在发送令牌不可申请的情况下仍然多次重复发送申请，增加额外开销。
在所述第一申请消息或第二申请消息的处理方，例如控制节点，可以根据预先设置的消息处理方法对消息输出端进行消息资源的分配和链接数的控制等处理，实现消息输出端业务消息的均匀输出和在不超过被调用方业务最大处理能力的情况下最大化的利用被调用方的业务处理能力。本申请还可以提供一种消息处理装置，具体的实施例中如集群模式下的控制节点，所述装置的一种实施方法如图12所示，具体的所述装置可以包括：
申请消息接收模块201，可以用于接收包括占用时间段的申请消息；还可以用于接收发送令牌的申请消息；
占用时间分配模块202，可以用于根据预定规则为所述申请消息中的占用时间段分配业务消息的占用时间段；
令牌分配模块203，可以用于根据被调用方当前的业务流量和最大业务处理能力分配发送令牌；
申请结果发送模块204，可以用于发送所述占用时间段申请结果的消息；还可以用于发送所述发送令牌申请结果的消息。
图12是本申请所述一种消息处理装置一种实施例的模块结构示意图。本实施例中所述的消息处理装置例如可以为控制节点，可以接收调用方发送的占用时间段和发送令牌的申请消息，然后进行相应的数据处理，将处理结果返回给调用方。上述实施例中所述控制节点确定所述占用时间段的申请结果的预定规则可以根据消息处理需求进行设置。例如可以根据所述控制节点的最新占用时刻和在所述最新占用时刻最先接收到的占用时间段申请消息分配占用时间段的资源，也可以根据申请消息中设置的占用时间段的申请优先级进行分配。具体的可以根据实际消息处理需求设置，本实施例可以对此不做具体某一方式的限定。
图13是本申请所述一种消息处理装置另一种实施例的模块结构示意图。如 图13所示，所述装置还可以包括：
占用时刻更新模块205，可以用于在为所述业务消息分配占用时间段后，更新所述占用时间分配模块202最新占用时刻。
所述占用时刻更新模块205可以在所述消息处理装置为的业务消息分配占用时间段后，更新最新占用时刻，以便其它发送占用时间段申请失败的调用方可以根据更新的最新占用时刻重新申请发送时间资源。所述的最新占用时刻可以表示在所述消息处理中装置中，在所述占用时刻之前的时间已经分配占用，所在占用时刻后面的时间可以申请占用。实现该数据处理的单元可以设置在所述占用时间分配模块202中，当然，其他的实施例中也可以设置在其他或者专用的模块中。
图14是本申请所述一种消息处理装置另一种实施例的模块结构示意图。如图14所示，所述装置还可以包括：
令牌申请时间模块206，可以用于在达到所述被调用方的最大业务处理能力时，获取所述被调用方最近的业务接入可用时间，将所述最近的业务接入可用时间作为令牌申请有效时间。
本实施例中设置令牌申请时间模块206，可以有效的提高调用方业务消息发送令牌的申请成功率，减少发送令牌申请的次数，提高系统处理性能。
本申请所述的消息处理装置，可以用于所述集群模式下重发利用被调用方系统最大处理能力的并发控制。当然，本申请并不限于所述集群模式下的消息处理，也可以适用于其他应用场景消息发送控制的业务处理系统。基于上述实施例，本申请提供一种消息处理系统，图15是本申请所述一种消息处理系统的模块结构示意图，如图15所示，所述系统可以包括：
消息客户端1，可以用于向控制端2发送基于包括发送时长设置的占用时间段的第一申请消息；还可以用于基于接收到的所述占用时间段的申请结果为成功的消息计算业务消息的发送时间；还可以用于监测当前时间是否超过所述业 务消息的发送时间，并在监测到超过所述发送时间时向所述控制端2发送申请所述业务消息的发送令牌的第二申请消息；还可以用于基于接收到的所述发送令牌的申请结果为成功的消息发送所述发送令牌申请成功的业务消息。
控制端2，可以用于接收消息客户端发送的所述第一申请消息和所述第二申请消息；还可以用于根据预定规则为所述第一申请消息中的占用时间段分配业务消息的占用时间段；还可以用于根据被调用方当前的业务流量和最大业务处理能力为所述第二申请消息中的业务消息分配发送令牌；还可以用于将所述第一申请消息和第二申请消息的申请结果发送给所述消息客户端。
本申请中所述的消息处理方法、装置及系统，可以通过控制调用方业务消息均匀平稳输出和对被调用的业务流量控制可以将在控制节点的集中消息处理分散到各个调用方，大大减少控制节点的消息处理负担，可以有效的避免消息处理的单点性能瓶颈问题，提高业务消息发送的处理能力。并且申请所述方法可以在不超过被调用方业务系统处理能力的情况下，以均匀平稳的方式使被调用方业务系统处理能最大化，提高被调用方系统处理性能和系统运行的稳定性。
尽管本申请内容中提到集群模式下的消息交互、计数控制节点Tair、令牌等之类的数据交互、处理描述，但是，本申请并不局限于必须是完全标准或者所提及的方法的数据交互、处理的情况。本申请中各个实施例所涉及的上述描述仅是本申请中的一些实施例中的应用，在某些标准、方法的基础上略加修改后的处理方法也可以实行上述本申请各实施例的方案。当然，在符合本申请上述各实施例的中所述的处理方法步骤的其他无创造性的变形，仍然可以实现相同的申请，在此不再赘述。
虽然本申请提供了如实施例或流程图所述的方法操作步骤，但基于常规或者无创造性的手段可以包括更多或者更少的操作步骤。实施例中列举的步骤顺序仅仅为众多步骤执行顺序中的一种方式，不代表唯一的执行顺序。在实际中的装置或客户端产品执行时，可以按照实施例或者附图所示的方法顺序执行或 者并行执行(例如并行处理器或者多线程处理的环境)。
上述实施例阐明的单元或模块，具体可以由计算机芯片或实体实现，或者由具有某种功能的产品来实现。为了描述的方便，描述以上装置时以功能分为各种模块分别描述。当然，在实施本申请时可以把各模块的功能在同一个或多个软件和/或硬件中实现，例如将发送时间模块合并到计算模块中计算发送时间，也可以将实现同一功能的模块由多个子模块或子单元的组合实现。
本邻域技术人员也知道，除了以纯计算机可读程序代码方式实现控制器以外，完全可以通过将方法步骤进行逻辑编程来使得控制器以逻辑门、开关、专用集成电路、可编程逻辑控制器和嵌入微控制器等的形式来实现相同功能。因此这种控制器可以被认为是一种硬件部件，而对其内部包括的用于实现各种功能的装置也可以视为硬件部件内的结构。或者甚至，可以将用于实现各种功能的装置视为既可以是实现方法的软件模块又可以是硬件部件内的结构。
本申请可以在由计算机执行的计算机可执行指令的一般上下文中描述，例如程序模块。一般地，程序模块包括执行特定任务或实现特定抽象数据类型的例程、程序、对象、组件、数据结构、类等等。也可以在分布式计算环境中实践本申请，在这些分布式计算环境中，由通过通信网络而被连接的远程处理设备来执行任务。在分布式计算环境中，程序模块可以位于包括存储设备在内的本地和远程计算机存储介质中。
通过以上的实施方式的描述可知，本邻域的技术人员可以清楚地了解到本申请可借助软件加必需的通用硬件平台的方式来实现。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品可以存储在存储介质中，如ROM/RAM、磁碟、光盘等，包括若干指令用以使得一台计算机设备(可以是个人计算机，移动终端，服务器，或者网络设备等)执行本申请各个实施例或者实施例的某些部分所述的方法。
本说明书中的各个实施例采用递进的方式描述，各个实施例之间相同或相 似的部分互相参见即可，每个实施例重点说明的都是与其他实施例的不同之处。本申请可用于众多通用或专用的计算机系统环境或配置中。例如：个人计算机、服务器计算机、手持设备或便携式设备、平板型设备、多处理器系统、基于微处理器的系统、可编程的电子设备、网络PC、小型计算机、大型计算机、包括以上任何系统或设备的分布式计算环境等等。
虽然通过实施例描绘了本申请，本邻域普通技术人员知道，本申请有许多变形和变化而不脱离本申请的精神，希望所附的权利要求包括这些变形和变化而不脱离本申请的精神。

Claims (16)

  1. 一种消息处理方法，其特征在于，所述方法包括：
    调用方计算发送业务消息的发送时长，根据所述发送时长向控制节点申请占用时间段；
    所述控制节点在收到调用方的所述占用时间段的申请消息后，根据预定规则确定所述调用方占用时间段的申请结果，并将所述申请结果反馈给相应的调用方；
    所述调用方在接收到的所述占用时间段的申请结果为成功时，计算所述业务消息的发送时间；
    所述调用方在监测到超过所述业务消息的发送时间时，向所述控制节点申请所述业务消息的发送令牌；
    所述控制节点在收到调用方的所述发送令牌的申请消息后，根据是否达到被调用方的最大业务处理能力确定所述调用方发送令牌的申请结果，并将所述申请结果反馈给相应的调用方；
    所述调用方在接收到的所述业务消息的发送令牌申请结果为成功时，发送所述发送令牌申请成功的业务消息。
  2. 一种消息处理方法，其特征在于，所述方法包括：
    计算发送业务消息的发送时长，根据所述发送时长发送申请占用时间段的第一申请消息；
    在接收到的所述占用时间段的申请结果为成功时，计算所述业务消息的发送时间；
    监测当前时间是否超过所述业务消息的发送时间；在监测到超过所述发送时间时，发送申请所述业务消息的发送令牌的第二申请消息；
    在接收到的所述发送令牌的申请结果为成功时，发送所述发送令牌申请成功的业务消息。
  3. 如权利要求2所述的一种消息处理方法，其特征在于，所述根据所述发送时长发送申请占用时间段的第一申请消息包括：
    获取控制节点的最新占用时刻，向所述控制节点发送以所述获取的最新占用时刻加上所述发送时长作为所述占用时间段的第一申请消息。
  4. 如权利要求2所述的一种消息处理方法，其特征在于，所述方法还包括：
    在接收到所述占用时间段的申请结果为失败时，根据获取的更新的最新占用时刻和所述发送时长计算新的占用时间段；发送包括所述新的占用时间段的第一申请消息。
  5. 如权利要求2所述的一种消息处理方法，其特征在于，所述方法还包括：
    在接收到的所述发送令牌的申请结果为失败时，获取令牌申请有效时间；在达到所述令牌申请有效时间时，重新发送所述发送令牌申请结果为失败的业务消息的第二申请消息。
  6. 一种消息处理方法，其特征在于，所述方法包括：
    接收申请占用时间段和发送令牌的申请消息；
    根据预定规则确定占用时间段的申请结果，发送所述占用时间段的申请结果；
    根据是否达到被调用方的最大业务处理能力确定所述发送令牌的申请结果，发送所述发送令牌的申请结果。
  7. 如权利要求6所述的一种消息处理方法，其特征在于，所述方法还包括：
    所述占用时间段的申请结果为成功时，更新所述控制节点的最新占用时刻。
  8. 如权利要求6所述的一种消息处理方法，其特征在于，所述方法还包括：
    在达到被调用方的最大业务处理能力时，获取所述被调用方最近的业务接入可用时间，将所述最近的业务接入可用时间作为令牌申请有效时间。
  9. 一种消息处理装置，其特征在于，所述装置包括：
    计算模块，用于计算发送业务消息的发送时长，并基于所述发送时长计算发送业务消息的占用时间段；
    时间段申请模块，用于发送申请所述占用时间段的第一申请消息；
    接收模块，用于接收占用时间段和发送令牌的申请结果的消息；
    发送时间计算模块，用于基于接收到的所述占用时间段的申请结果为成功的消息计算业务消息的发送时间；
    令牌申请模块，用于监测当前时间是否超过所述业务消息的发送时间；在监测到超过所述发送时间时，发送申请所述业务消息的发送令牌的第二申请消息；
    发送模块，用于基于接收到的所述发送令牌的申请结果为成功的消息发送所述发送令牌申请成功的业务消息。
  10. 如权利要求9所述的一种消息处理装置，其特征在于，所述计算模块包括：
    占用时刻模块，用于获取控制节点的最新占用时刻；
    占用时间段模块，用于以所述获取的最新占用时刻加上所述发送时长计算出的时间段作为所述占用时间段。
  11. 如权利要求9所述的一种消息处理装置，其特征在于，所述装置还包括：
    第一申请失败处理模块，用于在接收到所述占用时间段的申请结果为失败时，根据所述计算模块获取的最新占用时刻计算业务消息的新的占用时间段；将包括所述新的占用时间段的第一申请消息发送至所述时间段申请模块。
  12. 如权利要求9所述的一种消息处理装置，其特征在于，所述装置还包括：
    第二申请失败处理模块，用于在接收到的所述发送令牌的申请结果为失败时，获取令牌申请有效时间；在达到所述令牌申请有效时间时，向所述发送模块下达重新发送所述发送令牌申请结果为失败的业务消息的第二申请消息的指令。
  13. 一种消息处理装置，其特征在于，所述装置包括：
    申请消息接收模块，用于接收包括占用时间段的申请消息；还用于接收发送令牌的申请消息；
    占用时间分配模块，用于根据预定规则为所述申请消息中的占用时间段分配业务消息的占用时间段；
    令牌分配模块，用于根据被调用方当前的业务流量和最大业务处理能力分配发送令牌；
    申请结果发送模块，用于发送所述占用时间段申请结果的消息；还用于发送所述发送令牌申请结果的消息。
  14. 如权利要求13所述的一种消息处理装置，其特征在于，所述装置还包括：
    占用时刻更新模块，用于在为所述业务消息分配占用时间段后，更新所述占用时间分配模块的最新占用时刻。
  15. 如权利要求13所述的一种消息处理装置，其特征在于，所述装置还包括：
    令牌申请时间模块，用于在达到所述被调用方的最大业务处理能力时，获取所述被调用方最近的业务接入可用时间，将所述最近的业务接入可用时间作为令牌申请有效时间。
  16. 一种消息处理系统，其特征在于，所述系统包括：
    消息客户端，用于向控制端发送基于包括发送时长设置的占用时间段的第一申请消息；还用于基于接收到的所述占用时间段的申请结果为成功的消息计算业务消息的发送时间；还用于监测当前时间是否超过所述业务消息的发送时间，并在监测到超过所述发送时间时向所述控制端发送申请所述业务消息的发送令牌的第二申请消息；还用于基于接收到的所述发送令牌的申请结果为成功的消息发送所述发送令牌申请成功的业务消息；
    控制端，用于接收消息客户端发送的所述第一申请消息和所述第二申请消息；还用于根据预定规则为所述第一申请消息中的占用时间段分配业务消息的占用时间段；还用于根据被调用方当前的业务流量和最大业务处理能力为所述第二申请消息中的业务消息分配发送令牌；还用于将所述第一申请消息和第二申请消息的申请结果发送给所述消息客户端。
PCT/CN2016/080018 2015-05-25 2016-04-22 一种消息处理方法、装置及系统 WO2016188282A1 (zh)

Priority Applications (7)

Application Number Priority Date Filing Date Title
JP2017561369A JP6787933B2 (ja) 2015-05-25 2016-04-22 メッセージ処理方法、装置、及びシステム
EP16799171.0A EP3306866B1 (en) 2015-05-25 2016-04-22 Message processing method, device and system
SG11201709484RA SG11201709484RA (en) 2015-05-25 2016-04-22 Message processing method, apparatus and system
PL16799171T PL3306866T3 (pl) 2015-05-25 2016-04-22 Sposób, urządzenie i system przetwarzania wiadomości
ES16799171T ES2808951T3 (es) 2015-05-25 2016-04-22 Método, dispositivo y sistema de procesamiento de mensajes
KR1020177036851A KR102110023B1 (ko) 2015-05-25 2016-04-22 메시지 프로세싱 방법, 장치 및 시스템
US15/818,504 US10700993B2 (en) 2015-05-25 2017-11-20 Controlling message output

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510268806.3A CN106302090B (zh) 2015-05-25 2015-05-25 一种消息处理方法、装置及系统
CN201510268806.3 2015-05-25

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15/818,504 Continuation US10700993B2 (en) 2015-05-25 2017-11-20 Controlling message output

Publications (1)

Publication Number Publication Date
WO2016188282A1 true WO2016188282A1 (zh) 2016-12-01

Family

ID=57392536

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/080018 WO2016188282A1 (zh) 2015-05-25 2016-04-22 一种消息处理方法、装置及系统

Country Status (9)

Country Link
US (1) US10700993B2 (zh)
EP (1) EP3306866B1 (zh)
JP (1) JP6787933B2 (zh)
KR (1) KR102110023B1 (zh)
CN (1) CN106302090B (zh)
ES (1) ES2808951T3 (zh)
PL (1) PL3306866T3 (zh)
SG (1) SG11201709484RA (zh)
WO (1) WO2016188282A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106973093A (zh) * 2017-03-23 2017-07-21 北京奇艺世纪科技有限公司 一种服务切换方法和装置
CN107612842A (zh) * 2017-09-07 2018-01-19 携程商旅信息服务（上海）有限公司 基于令牌管理的数据采集方法、系统、设备及存储介质
WO2019192103A1 (zh) * 2018-04-03 2019-10-10 平安科技（深圳）有限公司 并发访问控制方法、装置、终端设备及介质

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107707385B (zh) 2017-09-18 2019-03-12 贵州白山云科技股份有限公司 一种数据上报方法及系统
CN108337301A (zh) * 2018-01-24 2018-07-27 深圳乐信软件技术有限公司 应用程序的网络请求处理方法、装置、服务器及存储介质
US11368550B2 (en) * 2019-06-03 2022-06-21 Raytheon Company Systems and methods for entity aware allocation of electronic resources
CN112132532A (zh) * 2020-08-21 2020-12-25 微民保险代理有限公司 一种批改信息的发送方法、装置、电子设备及存储介质
CN112351072B (zh) * 2020-10-13 2022-10-21 福建天泉教育科技有限公司 一种消息推送方法及终端

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1747454A (zh) * 2005-10-28 2006-03-15 清华大学 控制业务接入时间间隔降低业务到达突发度的方法
CN101035013A (zh) * 2006-03-08 2007-09-12 中兴通讯股份有限公司 一种资源接纳控制方法及系统
US20090232103A1 (en) * 2008-03-11 2009-09-17 Alex Kesselman Apparatus and method adapted for directional bandwidth reservation with fixed announcement slot in wireless networks
CN101547198A (zh) * 2009-01-22 2009-09-30 联想网御科技(北京)有限公司 一种网络安全设备的连接控制方法及设备
CN102404786A (zh) * 2010-09-14 2012-04-04 中国移动通信集团江苏有限公司 一种控制业务阻塞的方法及装置

Family Cites Families (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5163046A (en) * 1989-11-30 1992-11-10 At&T Bell Laboratories Dynamic window sizing in a data network
JP2002189650A (ja) * 2000-12-20 2002-07-05 Hitachi Ltd 計算機制御方法及び装置並びにその処理プログラムを格納した記録媒体
JP2002268981A (ja) 2001-03-12 2002-09-20 Hitachi Ltd 通信帯域を保証する電子申請方法及びシステム
GB2391963B (en) * 2002-08-14 2004-12-01 Flyingspark Ltd Method and apparatus for preloading caches
US9191702B2 (en) * 2003-04-17 2015-11-17 Thomson Licensing Data requesting and transmitting devices and processes
JP2007515819A (ja) * 2003-08-21 2007-06-14 株式会社エヌ・ティ・ティ・ドコモ 分散型媒体アクセス制御を用いた無線ネットワークにおけるリソース予約
US7978599B2 (en) * 2006-11-17 2011-07-12 Cisco Technology, Inc. Method and system to identify and alleviate remote overload
JP2009075669A (ja) 2007-09-18 2009-04-09 Brother Ind Ltd サーバ装置及び同装置のプログラム及びデータ送受信方法
JP2010130440A (ja) 2008-11-28 2010-06-10 Mitsubishi Electric Corp 通信管理装置及び通信管理方法及びプログラム
JP2010191601A (ja) * 2009-02-17 2010-09-02 Kddi Corp 整理券発行サーバ
US8081569B2 (en) * 2009-04-20 2011-12-20 Telefonaktiebolaget L M Ericsson (Publ) Dynamic adjustment of connection setup request parameters
US8699343B2 (en) * 2009-04-27 2014-04-15 Sonus Networks, Inc. Adaptive rate control based on overload signals
US8510374B2 (en) * 2010-09-24 2013-08-13 Microsoft Corporation Polling protocol for automatic load limiting
US8782211B1 (en) * 2010-12-21 2014-07-15 Juniper Networks, Inc. Dynamically scheduling tasks to manage system load
EP3285458B1 (en) * 2011-02-10 2022-10-26 Trilliant Holdings, Inc. Device and method for facilitating secure communications over a cellular network
US9185189B2 (en) * 2013-06-07 2015-11-10 Apple Inc. Distributed control over client-side requests for server resources
US20150026525A1 (en) * 2013-07-18 2015-01-22 Synchronoss Technologies, Inc. Server controlled adaptive back off for overload protection using internal error counts
WO2015069837A1 (en) * 2013-11-06 2015-05-14 Calgary Scientific, Inc. Apparatus and method for client-side flow control in a remote access environment
US9635103B2 (en) * 2014-09-11 2017-04-25 Amazon Technologies, Inc. Dynamic virtual resource request rate control for utilizing physical resources
US10834179B2 (en) * 2015-03-30 2020-11-10 Telefonaktiebolaget Lm Ericsson (Publ) Load balancing
US9647950B2 (en) * 2015-05-11 2017-05-09 Ebay Inc. System and method of site traffic control

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1747454A (zh) * 2005-10-28 2006-03-15 清华大学 控制业务接入时间间隔降低业务到达突发度的方法
CN101035013A (zh) * 2006-03-08 2007-09-12 中兴通讯股份有限公司 一种资源接纳控制方法及系统
US20090232103A1 (en) * 2008-03-11 2009-09-17 Alex Kesselman Apparatus and method adapted for directional bandwidth reservation with fixed announcement slot in wireless networks
CN101547198A (zh) * 2009-01-22 2009-09-30 联想网御科技(北京)有限公司 一种网络安全设备的连接控制方法及设备
CN102404786A (zh) * 2010-09-14 2012-04-04 中国移动通信集团江苏有限公司 一种控制业务阻塞的方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3306866A4 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106973093A (zh) * 2017-03-23 2017-07-21 北京奇艺世纪科技有限公司 一种服务切换方法和装置
CN107612842A (zh) * 2017-09-07 2018-01-19 携程商旅信息服务（上海）有限公司 基于令牌管理的数据采集方法、系统、设备及存储介质
CN107612842B (zh) * 2017-09-07 2020-03-31 携程商旅信息服务（上海）有限公司 基于令牌管理的数据采集方法、系统、设备及存储介质
WO2019192103A1 (zh) * 2018-04-03 2019-10-10 平安科技（深圳）有限公司 并发访问控制方法、装置、终端设备及介质

Also Published As

Publication number Publication date
JP2018518897A (ja) 2018-07-12
ES2808951T3 (es) 2021-03-02
KR20180011222A (ko) 2018-01-31
PL3306866T3 (pl) 2020-12-14
US10700993B2 (en) 2020-06-30
US20180077078A1 (en) 2018-03-15
SG11201709484RA (en) 2017-12-28
EP3306866A4 (en) 2019-02-06
KR102110023B1 (ko) 2020-05-13
CN106302090A (zh) 2017-01-04
CN106302090B (zh) 2019-10-22
EP3306866A1 (en) 2018-04-11
EP3306866B1 (en) 2020-06-03
JP6787933B2 (ja) 2020-11-18

Similar Documents

Publication Publication Date Title
WO2016188282A1 (zh) 一种消息处理方法、装置及系统
US20160378570A1 (en) Techniques for Offloading Computational Tasks between Nodes
WO2005077060A2 (en) System and method for requesting and granting access to a network channel
WO2020056773A1 (zh) 上行数据传输方法、装置、设备及系统
CN105335231B (zh) 一种服务端线程的动态分配方法和设备
CN110995617B (zh) 基于mqtt的数据报送方法、装置、计算机设备和存储介质
KR20190099532A (ko) 미디어 다운링크 전송 제어 방법 및 관련 장치
CN111343275B (zh) 资源调度方法和系统
JP2020080059A (ja) 評価装置、評価方法および評価プログラム
WO2014173366A2 (zh) 一种实现电信能力群发的方法、装置及系统
CN111586140A (zh) 一种数据交互的方法及服务器
CN107294911A (zh) 一种数据包监听方法及装置、远程过程调用系统、设备
CN107786371A (zh) 一种数据的加速方法、装置及存储介质
CN111913784B (zh) 任务调度方法及装置、网元、存储介质
US11275621B2 (en) Device and method for selecting tasks and/or processor cores to execute processing jobs that run a machine
US8869171B2 (en) Low-latency communications
CN113391927A (zh) 一种业务事件的处理方法、装置、系统及存储介质
CN113660726A (zh) 资源分配方法和装置
JP6233141B2 (ja) データベースシステム、データベースサーバ、データベースサーバプログラム、データベースクライアント及びデータベースクライアントプログラム
CN111835806B (zh) 入网方法、入网设备、入网回应设备以及可读存储介质
CN111382139A (zh) 对数据库中同一账户的并行访问方法
CN111654480B (zh) 一种rpc连接建立方法、装置及存储介质
KR102675137B1 (ko) 자원 할당 방법, 장비 및 시스템
CN113742063A (zh) 分布式定时调度系统和方法
KR20060060384A (ko) 이동통신 시스템에서의 로딩 시스템 및 방법

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16799171

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 11201709484R

Country of ref document: SG

ENP Entry into the national phase

Ref document number: 2017561369

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 20177036851

Country of ref document: KR

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 2016799171

Country of ref document: EP