CN113422877B - Method and device for realizing number outbound based on service scene and electronic equipment - Google Patents
Method and device for realizing number outbound based on service scene and electronic equipment Download PDFInfo
- Publication number
- CN113422877B CN113422877B CN202110694073.5A CN202110694073A CN113422877B CN 113422877 B CN113422877 B CN 113422877B CN 202110694073 A CN202110694073 A CN 202110694073A CN 113422877 B CN113422877 B CN 113422877B
- Authority
- CN
- China
- Prior art keywords
- outbound
- queue
- numbers
- access
- calling
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/50—Centralised arrangements for answering calls; Centralised arrangements for recording messages for absent or busy subscribers ; Centralised arrangements for recording messages
- H04M3/527—Centralised call answering arrangements not requiring operator intervention
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
-
- 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/50—Centralised arrangements for answering calls; Centralised arrangements for recording messages for absent or busy subscribers ; Centralised arrangements for recording messages
- H04M3/51—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing
- H04M3/5166—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing in combination with interactive voice response systems or voice portals, e.g. as front-ends
Abstract
The invention relates to the field of big data, and discloses a method and a device for realizing number outbound based on a service scene, and electronic equipment, wherein the method comprises the following steps: storing a plurality of outbound numbers to a plurality of queues according to the service scene types of the outbound numbers in a preset list; wherein each queue corresponds to a service scene type; allocating a second number of access numbers to the first queue based on the first number of outbound numbers in the first queue and the scene priority corresponding to the first queue; determining a queue weight value of the first queue according to the scene priority, the first quantity and the second quantity corresponding to the first queue; the queue weight value is used for representing the priority order of outbound calling on the queues; and calling out the calling-out number in the first queue according to the queue weight value. The invention also relates to a block chain technology, and the outbound number in the preset list is written into the block chain node. The invention solves the technical problem of low outbound efficiency caused by low access number utilization rate in the outbound scheme in the related technology.
Description
Technical Field
The invention relates to the field of big data, in particular to a method and a device for realizing number outbound based on a service scene and electronic equipment.
Background
In the related technology, the access number is needed to be used as a medium when the list is called out, and because the medium can only carry one list call out at the same time, after the call out is finished, the access number can be released and recycled for the next list to use. The existing outbound scheme adopts a list blocking type to obtain access number resources, namely after a task is started, an outbound list is fished according to an outbound rule set by the task, then the list is traversed, meanwhile, a blocking attempt is carried out to obtain an access number, and if the access number is obtained, an outbound interface is directly called to carry out outbound; if not, the block waits for a certain time (e.g., 5 seconds) before attempting the outbound call. During the outbound peak, a plurality of threads are in thread blocking, and a large amount of lock competition exists in the process of acquiring the access number, so that the load of a server is increased; the outbound rate cannot reach the highest, for example, if the call is not acquired in the 1 st second, the call is acquired for 1 time again in the 6 th second, and so on, but in the waiting period (5 seconds), the access number may return after the 2 nd second, so that the access number is not utilized in the next waiting idle period of 4 seconds, and through statistics, the utilization rate of the current access number is only about 46%, and the outbound volume cannot meet the requirement; in addition, the situation of polling acquisition all the time when the access number is insufficient increases the system burden. Therefore, the existing outbound scheme has the technical problems of low outbound efficiency and low outbound volume due to low access number utilization rate.
In view of the above problems in the related art, no effective solution has been found at present.
Disclosure of Invention
The embodiment of the invention provides a method, a device and electronic equipment for realizing number outbound based on a service scene, which at least solve the technical problem of low outbound efficiency caused by low access number utilization rate in an outbound scheme in the related technology.
According to one embodiment of the invention, a method for realizing number outbound based on service scene is provided, which comprises the following steps: storing a plurality of outbound numbers to a plurality of queues according to the service scene types of the outbound numbers in a preset list; wherein each queue corresponds to a service scene type; allocating a second number of access numbers to a first queue based on a first number of outbound numbers in the first queue and a scene priority corresponding to the first queue; the scene priority is used for representing the priority sequence of outbound calls to outbound numbers corresponding to the service scene types, and the first queue is any one of the queues; determining a queue weight value of the first queue according to the scene priority corresponding to the first queue, the first quantity and the second quantity; wherein the queue weight values are used for representing the priority order of outbound calling on the queues; and calling out the calling-out number in the first queue according to the queue weight value.
Optionally, the storing the multiple outbound numbers to the multiple queues according to the service scenario types of the outbound numbers in the preset list includes: determining a service scene type corresponding to each outbound number in the preset list; dividing the plurality of outbound numbers into a plurality of groups according to the service scene type, and allocating a queue for each group; and performing enqueue operation on the outbound numbers in the first group according to a storage structure of a second queue and the number of the outbound numbers in the first group, wherein the second queue corresponds to the first group, and the first group is any one of the multiple groups.
Optionally, before storing the plurality of outbound numbers in the plurality of queues according to the service scenario types of the outbound numbers in the preset list, the method further includes: determining the outbound aging corresponding to each outbound external number in the preset list; comparing the outbound aging with a preset time period; if the outbound aging is located in the preset time period, dividing a third number of outbound numbers corresponding to the outbound aging into a second group, and distributing a new queue for the second group; and distributing a fourth number of access numbers to the newly-built queue according to the storage structure of the newly-built queue and the third number, wherein the fourth number is less than or equal to the third number.
Optionally, after allocating a fourth number of access numbers to the newly-created queue, the method further includes: calling the third number of outbound numbers in the newly-built queue by the fourth number of access numbers; and if the outbound numbers in the new queue are all outbound completed, canceling the new queue.
Optionally, determining a queue weight value of the first queue according to the scene priority corresponding to the first queue, the first number, and the second number includes: determining a fifth number of access numbers being used in the first queue, and calculating a ratio according to the fifth number and the second number; setting a first weight coefficient of the scene priority, a second weight coefficient of the ratio and a third weight coefficient of the first number; the sum of the first weight coefficient, the second weight coefficient and the third weight coefficient is one; calculating the queue weight value according to the scene priority, the first weight coefficient, the ratio, the second weight coefficient, the first quantity, and the third weight coefficient.
Optionally, before the outbound number in the first queue is outbound according to the queue weight value, the method further includes: judging whether an idle access number exists in the access number resource pool or not; if the access number resource pool has idle access numbers, acquiring the idle access numbers and determining the sixth number of the idle access numbers, and carrying out outbound call on the plurality of outbound numbers according to the access numbers of the sixth number and the queue weight value; and if no idle access number exists in the access number resource pool, entering a queuing mode until the idle access number exists in the access number resource pool.
Optionally, writing the outbound number in the preset list into a block chain node, where the outbound number in the first queue according to the queue weight value includes: if the number of the outbound numbers in the first group is larger than the first number, the outbound numbers at the head of the queue in the first queue are outbound; after the outbound numbers of the head of the calling queue are finished, the outbound numbers in a first group are enqueued from the tail of the first queue, wherein the first group corresponds to the first queue; judging whether the first queue has an outbound number capable of being outbound or not; if the first queue has the outbound number capable of being outbound, continuing to outbound the outbound number capable of being outbound; if the first queue does not have the outbound number capable of being outbound, judging whether other queues except the first queue have the outbound number capable of being outbound; if the other queues except the first queue have outbound numbers which can be called out, calling out; otherwise, ending the outbound call.
According to an embodiment of the present invention, a device for implementing number outbound based on a service scenario is provided, including: the storage module is used for storing the plurality of outbound numbers to a plurality of queues according to the service scene types of the outbound numbers in the preset list; wherein each queue corresponds to a service scene type; the first allocation module is used for allocating a second number of access numbers to a first queue based on a first number of outbound numbers in the first queue and a scene priority corresponding to the first queue; the scene priority is used for representing the priority sequence of outbound calls to outbound numbers corresponding to the service scene types, and the first queue is any one of the queues; a first determining module, configured to determine a queue weight value of the first queue according to a scene priority corresponding to the first queue, the first number, and the second number; wherein the queue weight values are used for representing the priority order of outbound calling on the queues; and the first calling module is used for calling out the calling-out number in the first queue according to the queue weight value.
Optionally, the storage module includes: a first determining unit, configured to determine a service scene type corresponding to each outbound number in the preset list; the grouping unit is used for dividing the plurality of outbound numbers into a plurality of groups according to the service scene type and distributing a queue for each group; and the processing unit is used for performing enqueue operation on the outbound numbers in the first group according to the storage structure of a second queue and the number of the outbound numbers in the first group, wherein the second queue corresponds to the first group, and the first group is any one of the groups.
Optionally, the apparatus further comprises: the second determining module is used for determining the outbound aging corresponding to each outbound number in the preset list before storing the plurality of outbound numbers to the plurality of queues according to the service scene types of the outbound numbers in the preset list; the comparison module is used for comparing the outbound aging with a preset time period; the second distribution module is used for dividing the outbound numbers with the third quantity corresponding to the outbound time period into a second group and distributing a new queue for the second group if the outbound time period is in the preset time period; and a third allocating module, configured to allocate a fourth number of access numbers to the new queue according to the storage structure of the new queue and the third number, where the fourth number is less than or equal to the third number.
Optionally, the apparatus further comprises: the second calling module is used for calling out a third number of calling-out numbers in the newly-built queue through the fourth number of access numbers after the fourth number of access numbers is distributed to the newly-built queue; and the canceling module is used for canceling the new queue if all the outbound numbers in the new queue are outbound and finished.
Optionally, the first determining module includes: a second determining unit, configured to determine a fifth number of access numbers in use in the first queue, and calculate a ratio according to the fifth number and the second number; a setting unit, configured to set a first weight coefficient of the scene priority, a second weight coefficient of the ratio, and a third weight coefficient of the first number; the sum of the first weight coefficient, the second weight coefficient and the third weight coefficient is one; a calculating unit, configured to calculate the queue weight value according to the scene priority, the first weight coefficient, the ratio, the second weight coefficient, the first quantity, and the third weight coefficient.
Optionally, the apparatus further comprises: the judging module is used for judging whether an idle access number exists in an access number resource pool before the outbound number in the first queue is outbound according to the queue weight value; a first execution module, configured to, if there is an idle access number in the access number resource pool, obtain the idle access number and determine a sixth number of the idle access number, and perform outbound call on the outbound numbers according to the sixth number of access numbers and the queue weight value; and the second execution module is used for entering a queuing mode until the access number resource pool has an idle access number if the access number resource pool has no idle access number.
Optionally, the outbound number in the preset list is written into a block chain node, and the first calling module includes: the first execution unit is used for calling out the calling-out numbers at the head of the queue in the first queue if the number of the calling-out numbers in the first group is larger than the first number; after the outbound number of the head of the calling queue is finished, the outbound numbers in a first group are queued from the tail of the first queue, wherein the first group corresponds to the first queue; a first judging unit, configured to judge whether there is an outbound number that can be outbound in the first queue; a second execution unit, configured to continue to call out the outbound number that can be called out if the first queue has the outbound number that can be called out; a second judging unit, configured to judge whether there is an outbound number that can be outbound in the other queues except the first queue if there is no outbound number that can be outbound in the first queue; a third execution unit, configured to make an outbound if other queues except the first queue have outbound numbers that can be outbound; otherwise, the outbound call is ended.
According to yet another embodiment of the present invention, there is also provided an electronic device, including a memory in which a computer program is stored and a processor configured to execute the computer program to perform the steps in any of the above method embodiments.
According to a further embodiment of the present invention, there is also provided a storage medium having a computer program stored therein, wherein the computer program is arranged to perform the steps in any of the apparatus embodiments described above when executed.
According to the method and the device, the plurality of outbound numbers are divided into the plurality of queues according to the service scene types of the outbound numbers in the list, so that all algorithms can be completed in the message queues in the memory, and the problem of concurrency locking is avoided; allocating a corresponding number of access numbers based on the number of outbound numbers in the queue and the scene priority corresponding to the queue; the method comprises the steps of determining the priority order of calling to queues according to scene priorities corresponding to the queues, the number of outbound numbers and data of access numbers, then carrying out outbound calling, carrying out outbound calling to a plurality of queues in sequence according to a designated order, and acquiring the next outbound number to carry out outbound calling based on the first-in first-out order of the queues after one number is outbound called, so that time waste caused by waiting of the access numbers is avoided, the outbound calling efficiency of the numbers is improved, the technical problem of low outbound calling efficiency caused by low use rate of the access numbers in an outbound calling scheme in the related technology is solved, and the outbound calling amount is increased.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention and not to limit the invention. In the drawings:
fig. 1 is a block diagram of a hardware structure of a computer terminal to which a method for implementing number outbound based on a service scenario according to an embodiment of the present invention is applied;
fig. 2 is a flowchart of a method for implementing number outbound based on a service scenario according to an embodiment of the present invention;
fig. 3 is a flow chart of an outbound call for implementing number outbound based on a service scenario according to an embodiment of the present invention;
fig. 4 is a block diagram illustrating an apparatus for implementing number outbound based on a service scenario according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The invention will be described in detail hereinafter with reference to the accompanying drawings in conjunction with embodiments. It should be noted that the embodiments and features of the embodiments of the present invention may be combined with each other without conflict.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.
The method provided by the embodiment of the invention can be executed in a mobile terminal, a server, a computer terminal or a similar operation device. Taking the operation on a computer terminal as an example, fig. 1 is a block diagram of a hardware structure of a method for implementing number outbound based on a service scenario, which is applied to a computer terminal according to an embodiment of the present invention. As shown in fig. 1, the computer terminal may include one or more (only one shown in fig. 1) processors 102 (the processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 for storing data, and optionally, a transmission device 106 for communication functions and an input-output device 108. It will be understood by those skilled in the art that the structure shown in fig. 1 is only an illustration and is not intended to limit the structure of the computer terminal. For example, the computer terminal may also include more or fewer components than shown in FIG. 1, or have a different configuration than shown in FIG. 1.
The memory 104 may be used to store a computer program, for example, a software program and a module of an application software, such as a computer program corresponding to the method for implementing number calling based on a service scenario in the embodiment of the present invention, and the processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, that is, implements the method described above. The memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory, and may also include volatile memory. In some examples, the memory 104 may further include memory located remotely from the processor 102, which may be connected to a computer terminal over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission device 106 is used to receive or transmit data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the computer terminal. In one example, the transmission device 106 includes a Network adapter (NIC), which can be connected to other Network devices through a base station so as to communicate with the internet. In one example, the transmission device 106 may be a Radio Frequency (RF) module, which is used to communicate with the internet in a wireless manner.
In an application scenario of the scheme, after an outbound task is started, an outbound rule is set according to the task, a list blocking type is adopted to acquire an idle access number from an access number resource pool, and then the number in a list is fished; if the access number is not acquired, blocking and waiting for a certain time, and then if the access number exists, trying to make an outbound call; then judging whether the list has a list which is not called out; if yes, the user is called out through the telephone platform, and for the list which is not called through by the telephone platform, the list is fed back to the list to form a closed loop, and the calling out is carried out in a circulating mode; the telephone platform makes an external call according to the broadcasting and broadcasting telephone art, collects the client telephone art, converts the term voice of the client telephone into a text and enters a sub-process; and finally, acquiring the sub-process content, forming TTS (Text To Speech, namely converting the Text into voice service) voice broadcast To the client, and ending.
Compared with the prior art, the method for realizing the number outbound based on the service scene belongs to list queuing (namely outbound number queuing), actively acquires the outbound number and performs outbound when the access number resource is released, avoids the condition that the access number resource is not idle, does not have a thread polling request all the time, and reduces the pressure of an access number resource pool.
The scheme is applied to the voice outbound platform and is also suitable for other application scenes needing queuing processing on resources. Fig. 2 is a flowchart of a method for implementing number outbound based on a service scenario according to an embodiment of the present invention, and as shown in fig. 2, the flowchart includes the following steps:
step S202, a plurality of outbound numbers are stored to a plurality of queues according to the service scene types of the outbound numbers in a preset list; wherein each queue corresponds to a service scene type;
in this embodiment, the preset list at least provides outbound numbers and service scenario types corresponding to each outbound number, where the service scenario types are determined according to service parties in the service system, for example, industry scenarios such as outbound marketing, satisfaction survey, and user return visit.
In an example of this embodiment, by grouping outbound lists, and then storing the grouped outbound lists into redis (a key-value storage system) message queues respectively, asynchronous processing operations can be performed by using the message queues; the algorithm is completely finished in the memory, and the problem of concurrent locking is avoided, so that the peak value when the application access amount is high is reduced, and the system pressure is relieved; in addition, the calculation time can be basically ignored, and the processing efficiency is improved.
Step S204, distributing a second number of access numbers for the first queue based on the first number of the outbound numbers in the first queue and the scene priority corresponding to the first queue; the method comprises the steps that a scene priority is used for representing a priority sequence of calling out numbers corresponding to service scene types, and a first queue is any one of a plurality of queues;
in this embodiment, each service scenario supports the use of multiple access number resources, and may be configured and allocated. Since the access number resources are much smaller than the number of tickets, queuing is required, and the number of access numbers is initially allocated by configuration. For example, the program may automatically perform dynamic allocation according to the amount of the list in each queue, or dynamically allocate the number of access numbers to each queue according to the priority attribute of each queue, thereby ensuring that access number resources are not idle.
In another embodiment, such as a core scenario, the core scenario is generally an important service scenario (i.e. the scenario has a higher priority), for example, the keep alive positive priority service reminder, the appropriate access number resource is inclined to the queue corresponding to the core scenario, and in the case of more core resources, more access number resources are appropriately allocated.
In one example, for a single service scenario, the number of access numbers supports dynamic deployment, in order to control the outbound speed of the service scenario, and the core scenario can be tilted by appropriate resources; the more the access number is, the higher the outbound speed is; but when the list quantity is less than or equal to the access number quantity, the list quantity is used as a standard.
Step S206, determining a queue weight value of the first queue according to the scene priority, the first quantity and the second quantity corresponding to the first queue; the queue weight value is used for representing the priority order of outbound calling on the queues;
in this embodiment, the queue weight of the queue is calculated by comprehensively considering the scene priority of the queue, the list quantity in the queue, and the number of the allocated access numbers, so as to determine the priority order of outbound to the queue, thereby avoiding the problem of concurrent lock generation when outbound to the queue.
And step S208, carrying out outbound on the outbound numbers in the first queue according to the queue weight values.
It should be emphasized that, in order to further ensure the privacy and security of the outbound numbers in the predetermined list, the outbound numbers in the predetermined list may also be stored in a node of a block chain.
According to the method for realizing number outbound based on the service scene, provided by the embodiment of the invention, the plurality of outbound numbers are divided into the plurality of queues according to the service scene types of the outbound numbers in the list, so that all algorithms can be completed in the message queues in the memory, and the problem of concurrent locking is avoided; allocating corresponding number of access numbers based on the number of outbound numbers in the queue and the scene priority corresponding to the queue; the method comprises the steps of determining the priority order of calling to queues according to scene priorities corresponding to the queues, the number of outbound numbers and data of access numbers, then carrying out outbound calling, carrying out outbound calling to a plurality of queues in sequence according to a designated order, and acquiring the next outbound number to carry out outbound calling based on the first-in first-out order of the queues after one number is outbound called, so that time waste caused by waiting of the access numbers is avoided, the outbound calling efficiency of the numbers is improved, the technical problem of low outbound calling efficiency caused by low use rate of the access numbers in the outbound calling scheme in the related art is solved, and the outbound calling amount is increased.
In an optional embodiment of the present disclosure, storing a plurality of outbound numbers to a plurality of queues according to service scenario types of the outbound numbers in a preset list includes: determining a service scene type corresponding to each outbound number in a preset list; dividing a plurality of outbound numbers into a plurality of groups according to the service scene type, and allocating a queue for each group; and performing enqueue operation on the outbound numbers in the first group according to the storage structure of a second queue and the number of the outbound numbers in the first group, wherein the second queue corresponds to the first group, and the first group is any one of the groups.
In this embodiment, a service scenario corresponding to each number in a list (i.e., the preset list) is determined, then all the numbers are grouped according to service scenario types, and a queue is allocated to each group, where each service scenario type corresponds to one queue. For example, redis queue, redis is a key-value storage system, and like Memcached, it supports relatively more values types to store, including string, list, set, and zset. Therefore, redis not only can be used as a cache server, but also can be used as a message queue, and the list type of the Redis is naturally supported to be used as the message queue; because the list of Redis is realized by using a doubly linked list and head and tail nodes are stored, the insertion and the extraction of elements at the head and the tail of the list are very quick.
In an optional embodiment of the present disclosure, before storing a plurality of outbound numbers into a plurality of queues according to service scenario types of the outbound numbers in a preset list, the method further includes: determining the outbound aging time corresponding to each outbound external number in a preset list; comparing the outbound aging with a preset time period; if the outbound aging is in the preset time period, dividing a third number of outbound numbers corresponding to the outbound aging into a second group, and distributing a new queue for the second group; and distributing a fourth number of access numbers to the new queue according to the storage structure and the third number of the new queue, wherein the fourth number is less than or equal to the third number.
According to the above embodiment, after allocating the fourth number of access numbers to the newly-created queue, the method further includes: calling out a third number of calling-out numbers in the newly-built queue through a fourth number of access numbers; and if the outbound numbers in the new queue are all outbound and finished, canceling the new queue.
Preferably, if there is a list, the number in the list is called out more urgently, and the list needs to be called out as soon as possible (that is, the time period of the call-out is within the preset time period), a queue is newly established for the list, which is equivalent to a "green" channel, and more access number resources are allocated to the list to ensure that the list can be called out quickly, for example, if there are 5 call-out numbers in the list that need to be called out urgently, 5 access number resources are allocated to the 5 call-out numbers; and after the list outbound call is finished, the green channel is automatically destroyed.
In another example, after a plurality of outbound numbers in a certain list (i.e. the preset list) are divided into queues based on a service scenario, if a part of the numbers in the list need to be outbound preferentially, a green channel (i.e. the newly-built queue) may be newly built for the part of the numbers, and the numbers in the green channel are outbound preferentially. Not only the outbound efficiency is improved, but also the outbound is preferentially carried out in order aiming at the number in special conditions (immediate effect emergency); and the newly-built queue is cancelled after the outbound call is finished, so that the memory occupation is reduced.
In an optional embodiment of the present disclosure, determining a queue weight value of the first queue according to the scene priority, the first number, and the second number corresponding to the first queue includes: determining a fifth number of the access numbers in use in the first queue, and calculating a ratio according to the fifth number and the second number; setting a first weight coefficient of scene priority, a second weight coefficient of proportion and a third weight coefficient of a first quantity; the sum of the first weight coefficient, the second weight coefficient and the third weight coefficient is one; and calculating a queue weight value according to the scene priority, the first weight coefficient, the ratio, the second weight coefficient, the first quantity and the third weight coefficient.
In one example of this embodiment, the first queue includes at least the following information: the number of allocated access numbers m, the number of access numbers n in use, the number of lists in the queue x (i.e. the first number mentioned above), the priority y (i.e. the scene priority mentioned above).
The method specifically comprises the following steps:
s301, setting a weight coefficient of priority (i.e. a first weight coefficient of the scene priority), a weight coefficient of a title amount (i.e. the second weight coefficient of the first number), and an access number allocation (i.e. a third weight coefficient of the allocation); for example, the priority weight is a (0-yarn-a-yarn-woven 100%), the list weight b (0-yarn-b-yarn-woven 100%), and the access number ratio (n/m) is 1-a-b.
In addition, when the list enters or exits the queue, the corresponding list quantity on the queue is dynamically modified, the number of the access numbers (the number of idle access numbers) is dynamically adjusted, and the corresponding operations of adding 1 to n and subtracting 1 from n are carried out when the access numbers are acquired and released each time.
S303, the cohort weight = a × N (y) + b × N (x) + (1-a-b) × N (N/m).
In an optional embodiment, before making an outbound call to an outbound number in the first queue according to the queue weight value, the method further includes: judging whether an idle access number exists in the access number resource pool or not; if the access number resource pool has idle access numbers, acquiring the idle access numbers, determining the sixth number of the idle access numbers, and carrying out outbound call on a plurality of outbound numbers according to the access numbers of the sixth number and the queue weight value; and if no idle access number exists in the access number resource pool, entering a queuing mode until the access number exists in the access number resource pool.
Optionally, writing the outbound number in the preset list into a block chain node, and performing outbound to the outbound number in the first queue according to the queue weight value includes: if the number of the outbound numbers in the first group is larger than the first number, the outbound numbers at the head of the first queue are outbound; after the outbound numbers of the head of the calling queue are finished, the outbound numbers in the first group are queued from the tail of the first queue, wherein the first group corresponds to the first queue; judging whether the first queue has an outbound number capable of being outbound or not; if the first queue has an outbound number capable of being outbound, continuing to outbound the outbound number capable of being outbound; if the first queue has no outbound number capable of outbound, judging whether other queues except the first queue have outbound numbers capable of outbound; if other queues except the first queue have outbound numbers which can be outbound, then outbound is carried out; otherwise, the outbound call is ended.
The block chain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism, an encryption algorithm and the like. A block chain (Blockchain), which is essentially a decentralized database, is a series of data blocks associated by using a cryptographic method, and each data block contains information of a batch of network transactions, so as to verify the validity (anti-counterfeiting) of the information and generate a next block. The blockchain may include a blockchain underlying platform, a platform product service layer, an application service layer, and the like.
In this embodiment, the access number is released after the outbound is completed, and when the access number is released, a corresponding task is found according to the finished list, and a list is supplemented to the tail of the queue; the task and the list are in a one-to-many mapping relation, each list has a unique task, and each time the list in one task is called out, a new list needs to be supplemented into the queue, so that the task can continuously carry out calling out under the number of access numbers expected to be controlled by a user, and if the list is not supplemented, only the first n lists of the task can be stopped by calling out; in addition, the new list needs to be supplemented to the tail of the queue to realize a queuing mechanism.
Preferably, a queue with the most required access number (i.e. the queue with the highest weight value) is selected according to the number of the activated access numbers (i.e. the idle access numbers), the configured initial access number value of each service scenario, the occupied amount of the current scenario (i.e. the access numbers in use), the scenario priority, and the length of each current queue, and then the queue is called out of the list.
And finally, if each scene has no list to call out, the access number enters a dormant state and waits for other tasks to be started and activated.
The following describes an embodiment of the present invention in more detail with reference to a specific embodiment:
fig. 3 is an outbound flow chart for implementing number outbound based on a service scenario according to an embodiment of the present invention, where as shown in fig. 3, the outbound flow includes the following steps:
step S401: and starting the task by an automatic/manual mode (calling out the task by a list corresponding to a certain service scene; displaying in the list, wherein one task comprises a plurality of lists, thereby facilitating batch operation of users).
Step S403: and (7) task inspection. If the task is not passed, the task is ended, and if the task is passed, the task is initialized;
step S405: allocating a second number of access numbers to the first queue based on the first number of outbound numbers in the first queue and the scene priority corresponding to the first queue; determining a queue weight value of the first queue according to the scene priority, the first quantity and the second quantity corresponding to the first queue; the queue weight value is used for representing the priority order of outbound of the queues;
the method specifically comprises the following steps:
1. in the data preparation stage, each queue information is attached with some information of the queue, including the number m of distributed access numbers, the number n of used access numbers, the number x of queue name lists and the priority y;
2. the priority and the list quantity can be weighted and proportioned, such as priority weight being a (0 and a & lt 100%), list quantity weight b (0 and b & lt 100%), then access number proportioning (n/m) being 1-a-b.
3. Modifying x on the queue correspondingly each time the list enters or exits the queue, and obtaining and releasing the access number correspondingly each time the operation of adding 1 to n and subtracting 1 from n in the same way as the access number;
4. counting statistics is performed on all queues in a preset period (for example, every 3 seconds), priority, unit number amount and access number ratio are sorted and scored in sequence, the higher the corresponding priority is, the larger the list amount is, the larger the access number ratio is, the higher the score is, the obtained scores are N (y), N (x) and N (N/m), and then the final score obtained by each queue is as follows: e (line) = a × N (y) + b × N (x) + (1-a-b) × N (N/m), thereby obtaining the E-value highest priority queue.
Step S407: asynchronously triggering idle access numbers, and acquiring n lists to enter a queue of a corresponding service scene for queuing according to the number n of configured access numbers (namely the first preset number, namely the number of access number resources expected by a user), and asynchronously attempting to wake up at most n access numbers;
step S409: firstly, determining a queue with the highest queue weight value; if the access number is free at the moment, every time an activated access number goes to the queue to salvage the call out of the list, the usage amount of the access number of the service scene is accumulated by one until no free access number exists or n access numbers are fished; if no idle access number exists, no processing is carried out, and the list is in waiting.
Step S411: judging whether an outbound list exists in the current queue;
step S413: if the current access number is released, supplementing other outbound lists without outbound in the current queue to the tail of the queue; or, step S415: if the current queue has no callable list, judging whether other queues have callable lists, if so, executing step S409; if not, the access number enters a dormant state and waits for other tasks to be started and activated; or, step S417: if there is an outbound list, step S409 is executed.
After the outbound number in a certain queue is outbound and the access number is released, the S411 stage judges whether a queue has a list which is not outbound, and then the queue with the highest priority is obtained through a weight algorithm to salvage the list for outbound, so as to realize stable control.
As the statistical data is totally in redis, the algorithm is totally finished in the memory at the same time, the problem of concurrent lock is avoided, the calculation time can be basically ignored, the idle time of an access number is basically not existed, the next list outbound can be quickly acquired after one outbound, and the outbound rate is greatly improved. Through the improvement of the flow, the utilization rate of the access number reaches 73%, and meanwhile, the outbound volume is greatly improved, so that the purposes of cost reduction and efficiency improvement are achieved; the scheme perfectly avoids thread blocking and lock competition resources, the maximum outbound volume completely depends on the number of access numbers, the complexity of architecture design is reduced, the server burden is reduced, and meanwhile, the utilization rate of the resources is improved, thereby achieving two purposes.
Based on the method for implementing number outbound based on service context provided in the foregoing embodiments, based on the same inventive concept, this embodiment further provides a device for implementing number outbound based on service context, where the device is used to implement the foregoing embodiments and preferred embodiments, and the description of the device is omitted. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
Fig. 4 is a block diagram of an apparatus for implementing number outbound based on service scenario according to an embodiment of the present invention, and as shown in fig. 4, the apparatus includes: the storage module 40 is configured to store the plurality of outbound numbers into a plurality of queues according to the service scene types of the outbound numbers in the preset list; wherein each queue corresponds to a service scene type; a first allocating module 42, connected to the storing module 40, configured to allocate a second number of access numbers to the first queue based on the first number of outbound numbers in the first queue and the scene priority corresponding to the first queue; the scene priority is used for representing the priority sequence of outbound calling on outbound numbers corresponding to the service scene types, and the first queue is any one of a plurality of queues; a first determining module 44, connected to the allocating module 42, configured to determine a queue weight value of the first queue according to the scene priority, the first quantity, and the second quantity corresponding to the first queue; the queue weight value is used for representing the priority order of outbound calling on the queues; and a first calling module 46, connected to the first allocating module 42, for calling out the calling-out number in the first queue according to the queue weight value.
It should be emphasized that, in order to further ensure the privacy and security of the outbound numbers in the preset list, the outbound numbers in the preset list may also be stored in a node of a block chain.
Optionally, the storage module 40 includes: the first determining unit is used for determining the service scene type corresponding to each outbound number in the preset list; the grouping unit is used for dividing a plurality of outbound numbers into a plurality of groups according to the service scene type and distributing a queue for each group; and the processing unit is used for carrying out enqueue operation on the outbound numbers in the first group according to the storage structure of the second queue and the number of the outbound numbers in the first group, wherein the second queue corresponds to the first group, and the first group is any one of the groups.
Optionally, the apparatus further comprises: the second determining module is used for determining the outbound aging time corresponding to each outbound number in the preset list before the plurality of outbound numbers are stored in the plurality of queues according to the service scene types of the outbound numbers in the preset list; the comparison module is used for comparing the outbound aging with a preset time period; the second distribution module is used for dividing the outbound numbers with the third quantity corresponding to the outbound time period into a second group and distributing a new queue for the second group if the outbound time period is in the preset time period; and the third distribution module is used for distributing a fourth number of access numbers to the newly-built queue according to the storage structure and the third number of the newly-built queue, wherein the fourth number is less than or equal to the third number.
Optionally, the apparatus further comprises: the second calling module is used for carrying out outbound to the outbound numbers of the third quantity in the newly-built queue through the access numbers of the fourth quantity after distributing the access numbers of the fourth quantity to the newly-built queue; and the canceling module is used for canceling the new queue if the outbound numbers in the new queue are all outbound and finished.
Optionally, the first determining module 44 includes: a second determining unit, configured to determine a fifth number of access numbers in use in the first queue, and calculate a ratio according to the fifth number and the second number; the setting unit is used for setting a first weight coefficient of scene priority, a second weight coefficient of matching and a first number of third weight coefficients; the sum of the first weight coefficient, the second weight coefficient and the third weight coefficient is one; and the calculating unit is used for calculating a queue weight value according to the scene priority, the first weight coefficient, the ratio, the second weight coefficient, the first quantity and the third weight coefficient.
Optionally, the apparatus further comprises: the judging module is used for judging whether an idle access number exists in the access number resource pool or not before the outbound number in the first queue is outbound according to the queue weight value; the first execution module is used for acquiring the idle access numbers and determining the sixth number of the idle access numbers if the idle access numbers exist in the access number resource pool, and carrying out outbound calling on the plurality of outbound numbers according to the access numbers and the queue weight values of the sixth number; and the second execution module is used for entering a queuing mode until the access number resource pool has an idle access number if the access number resource pool does not have the idle access number.
Optionally, the outbound number in the preset list is written into the blockchain node, and the first calling module 46 includes: the first execution unit is used for calling out the calling-out numbers at the head of the queue in the first queue if the number of the calling-out numbers in the first group is larger than the first number; after the outbound numbers of the head of the calling queue are finished, the outbound numbers in the first group are queued from the tail of the first queue, wherein the first group corresponds to the first queue; the first judging unit is used for judging whether the first queue has an outbound number which can be outbound; the second execution unit is used for continuing to call out the outbound number which can be called out if the outbound number which can be called out exists in the first queue; the second judging unit is used for judging whether other queues except the first queue have the outbound numbers capable of being outbound if the first queue does not have the outbound numbers capable of being outbound; the third execution unit is used for calling out if other queues except the first queue have calling-out numbers which can be called out; otherwise, the outbound call is ended.
It should be noted that the above modules may be implemented by software or hardware, and for the latter, the following may be implemented, but not limited to: the modules are all positioned in the same processor; alternatively, the modules are respectively located in different processors in any combination.
Embodiments of the present invention also provide a storage medium having a computer program stored therein, wherein the computer program is arranged to perform the steps of any of the above method embodiments when executed.
Alternatively, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:
s1, storing a plurality of outbound numbers to a plurality of queues according to service scene types of the outbound numbers in a preset list; wherein each queue corresponds to a service scene type;
s2, distributing a second number of access numbers to a first queue based on a first number of outbound numbers in the first queue and a scene priority corresponding to the first queue; the scene priority is used for representing the priority sequence of calling out the calling-out numbers corresponding to the service scene types, and the first queue is any one of the queues;
s3, determining a queue weight value of the first queue according to the scene priority corresponding to the first queue, the first quantity and the second quantity; the queue weight value is used for representing the priority order of outbound calling on the queues;
and S4, carrying out outbound call on the outbound number in the first queue according to the queue weight value.
Optionally, in this embodiment, the storage medium may include, but is not limited to: various media capable of storing computer programs, such as a usb disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk.
It should be emphasized that, in order to further ensure the privacy and security of the outbound numbers in the predetermined list, the outbound numbers in the predetermined list may also be stored in a node of a block chain.
Based on the foregoing embodiment of the method shown in fig. 2 and the apparatus shown in fig. 4, to achieve the foregoing object, an embodiment of the present invention further provides an electronic device, as shown in fig. 5, which includes a memory 52 and a processor 51, where both the memory 52 and the processor 51 are disposed on a bus 53, the memory 52 stores a computer program, and when the processor 51 executes the computer program, the method for implementing number outbound based on a service scenario, as shown in fig. 2, is implemented.
Based on such understanding, the technical solution of the present invention can be embodied in the form of a software product, which can be stored in a memory (which can be a CD-ROM, a usb disk, a removable hard disk, etc.), and includes several instructions for enabling an electronic device (which can be a personal computer, a server, or a network device, etc.) to execute the method according to the implementation scenarios of the present invention.
Optionally, the device may also be connected to a user interface, a network interface, a camera, radio Frequency (RF) circuitry, sensors, audio circuitry, a WI-FI module, and so forth. The user interface may include a Display screen (Display), an input unit such as a Keyboard (Keyboard), etc., and the optional user interface may also include a USB interface, a card reader interface, etc. The network interface may optionally include a standard wired interface, a wireless interface (e.g., a bluetooth interface, WI-FI interface), etc.
It will be understood by those skilled in the art that the structure of an electronic device provided in the present embodiment does not constitute a limitation of the physical device, and may include more or less components, or some components in combination, or a different arrangement of components.
Optionally, for a specific example in this embodiment, reference may be made to the examples described in the above embodiment and optional implementation, and this embodiment is not described herein again.
It will be apparent to those skilled in the art that the modules or steps of the present invention described above may be implemented by a general purpose computing device, they may be centralized on a single computing device or distributed across a network of multiple computing devices, and alternatively, they may be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by a computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the principle of the present invention should be included in the protection scope of the present invention.
Claims (9)
1. A method for realizing number outbound based on service scene is characterized by comprising the following steps:
storing a plurality of outbound numbers to a plurality of queues according to the service scene types of the outbound numbers in a preset list; wherein each queue corresponds to a service scene type;
allocating a second number of access numbers to a first queue based on a first number of outbound numbers in the first queue and a scene priority corresponding to the first queue; the scene priority is used for representing the priority sequence of calling out the calling-out numbers corresponding to the service scene types, and the first queue is any one of the queues;
determining a queue weight value of the first queue according to the scene priority corresponding to the first queue, the first quantity and the second quantity; the queue weight value is used for representing the priority order of outbound calling on the queues;
calling the outbound number in the first queue according to the queue weight value;
determining a queue weight value of the first queue according to the scene priority corresponding to the first queue, the first number, and the second number comprises:
determining a fifth number of access numbers being used in the first queue, and calculating a proportion according to the fifth number and the second number;
setting a first weight coefficient of the scene priority, a second weight coefficient of the ratio and a third weight coefficient of the first number; the sum of the first weight coefficient, the second weight coefficient and the third weight coefficient is one;
calculating the queue weight value according to the scene priority, the first weight coefficient, the ratio, the second weight coefficient, the first quantity and the third weight coefficient;
the calling out the calling-out number in the first queue according to the queue weight value comprises:
if the number of the outbound numbers in the first group is larger than the first number, the outbound numbers at the head of the queue in the first queue are outbound; after the outbound number of the head of the calling queue is finished, the outbound numbers in a first group are queued from the tail of the first queue, wherein the first group corresponds to the first queue;
judging whether the first queue has an outbound number capable of being outbound;
if the first queue has the outbound number capable of being outbound, continuing to outbound the outbound number capable of being outbound;
if the first queue does not have the outbound number capable of being outbound, judging whether other queues except the first queue have the outbound number capable of being outbound or not; if other queues except the first queue have outbound numbers which can be outbound, then outbound is carried out; otherwise, ending the outbound call.
2. The method of claim 1, wherein storing the plurality of outbound numbers to the plurality of queues according to the service scenario types of the outbound numbers in the preset list comprises:
determining a service scene type corresponding to each outbound number in the preset list;
dividing the plurality of outbound numbers into a plurality of groups according to the service scene type, and allocating a queue for each group;
and performing enqueuing operation on the outbound numbers in the first group according to a storage structure of a second queue and the number of the outbound numbers in the first group, wherein the second queue corresponds to the first group, and the first group is any one of the multiple groups.
3. The method of claim 1, wherein before storing the plurality of outbound numbers to the plurality of queues according to the service scenario types of the outbound numbers in the predetermined list, the method further comprises:
determining the outbound aging time corresponding to each outbound external number in the preset list;
comparing the outbound aging with a preset time period;
if the outbound aging is located in the preset time period, dividing a third number of outbound numbers corresponding to the outbound aging into a second group, and distributing a new queue for the second group;
and distributing a fourth number of access numbers to the newly-built queue according to the storage structure of the newly-built queue and the third number, wherein the fourth number is less than or equal to the third number.
4. The method of claim 3, wherein after allocating the fourth number of access numbers to the newly created queue, the method further comprises:
calling out a third number of calling-out numbers in the newly-built queue through the fourth number of access numbers;
and if the outbound numbers in the new queue are all outbound and finished, canceling the new queue.
5. The method according to any of claims 1-4, wherein prior to placing an outbound call to an outbound number in the first queue according to the queue weight value, the method further comprises:
judging whether an idle access number exists in the access number resource pool or not;
if the access number resource pool has idle access numbers, acquiring the idle access numbers, determining the sixth number of the idle access numbers, and calling the outbound numbers according to the access numbers of the sixth number and the queue weight value;
and if no idle access number exists in the access number resource pool, entering a queuing mode until the idle access number exists in the access number resource pool.
6. Method according to any of claims 1-4, characterized in that the outgoing numbers in the pre-set list are written into blockchain nodes.
7. A device for realizing number outbound based on service scene is characterized by comprising:
the storage module is used for storing the plurality of outbound numbers to a plurality of queues according to the service scene types of the outbound numbers in the preset list; wherein each queue corresponds to a service scene type;
the first allocation module is used for allocating a second number of access numbers to a first queue based on a first number of outbound numbers in the first queue and the scene priority corresponding to the first queue; the scene priority is used for representing the priority sequence of outbound calls to outbound numbers corresponding to the service scene types, and the first queue is any one of the queues;
a first determining module, configured to determine a queue weight value of the first queue according to a scene priority corresponding to the first queue, the first number, and the second number; wherein the queue weight values are used for representing the priority order of outbound calling on the queues;
the first calling module is used for calling out the calling-out number in the first queue according to the queue weight value;
the first determining module includes: a second determining unit, configured to determine a fifth number of access numbers in use in the first queue, and calculate a ratio according to the fifth number and the second number; a setting unit, configured to set a first weight coefficient of the scene priority, a second weight coefficient of the ratio, and a third weight coefficient of the first number; the sum of the first weight coefficient, the second weight coefficient and the third weight coefficient is one; a calculating unit, configured to calculate the queue weight value according to the scene priority, the first weight coefficient, the ratio, the second weight coefficient, the first quantity, and the third weight coefficient;
the first calling module comprises: the first execution unit is used for calling out the calling-out numbers at the head of the queue in the first queue if the number of the calling-out numbers in the first group is larger than the first number; after the outbound numbers of the head of the calling queue are finished, the outbound numbers in a first group are enqueued from the tail of the first queue, wherein the first group corresponds to the first queue; a first judging unit, configured to judge whether there is an outbound number that can be outbound in the first queue; a second execution unit, configured to continue to call out the outbound number that can be called out if the first queue has the outbound number that can be called out; a second judging unit, configured to judge whether there is an outbound number that can be outbound in the other queues except the first queue if there is no outbound number that can be outbound in the first queue; a third execution unit, configured to make an outbound if other queues except the first queue have outbound numbers that can be outbound; otherwise, ending the outbound call.
8. An electronic device comprising a memory and a processor, the memory storing a computer program, wherein the processor implements the steps of the method according to any one of claims 1 to 6 when executing the computer program.
9. A computer storage medium on which a computer program is stored, characterized in that the computer program, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110694073.5A CN113422877B (en) | 2021-06-22 | 2021-06-22 | Method and device for realizing number outbound based on service scene and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110694073.5A CN113422877B (en) | 2021-06-22 | 2021-06-22 | Method and device for realizing number outbound based on service scene and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113422877A CN113422877A (en) | 2021-09-21 |
| CN113422877B true CN113422877B (en) | 2022-11-15 |
Family
ID=77716161
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110694073.5A Active CN113422877B (en) | 2021-06-22 | 2021-06-22 | Method and device for realizing number outbound based on service scene and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113422877B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106453979A (en) * | 2016-10-17 | 2017-02-22 | 上海携程商务有限公司 | Call-out control method for call center |
| CN108762896A (en) * | 2018-03-26 | 2018-11-06 | 福建星瑞格软件有限公司 | One kind being based on Hadoop cluster tasks dispatching method and computer equipment |
| CN110290281A (en) * | 2019-07-19 | 2019-09-27 | 携程旅游信息技术（上海）有限公司 | Calling-out method, system, electronic equipment and medium |
| CN112492111A (en) * | 2020-11-25 | 2021-03-12 | 苏宁金融科技(南京)有限公司 | Intelligent voice outbound method, device, computer equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200314245A1 (en) * | 2019-03-26 | 2020-10-01 | Avaya Inc. | Artificial intelligence driven call routing system |
-
2021
- 2021-06-22 CN CN202110694073.5A patent/CN113422877B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106453979A (en) * | 2016-10-17 | 2017-02-22 | 上海携程商务有限公司 | Call-out control method for call center |
| CN108762896A (en) * | 2018-03-26 | 2018-11-06 | 福建星瑞格软件有限公司 | One kind being based on Hadoop cluster tasks dispatching method and computer equipment |
| CN110290281A (en) * | 2019-07-19 | 2019-09-27 | 携程旅游信息技术（上海）有限公司 | Calling-out method, system, electronic equipment and medium |
| CN112492111A (en) * | 2020-11-25 | 2021-03-12 | 苏宁金融科技(南京)有限公司 | Intelligent voice outbound method, device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113422877A (en) | 2021-09-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20200264942A1 (en) | Message management method and device, and storage medium | |
| CN110808922B (en) | Message processing method and device, storage medium and electronic equipment | |
| CN108174305B (en) | The message treatment method and device of chatroom is broadcast live | |
| CN110287003B (en) | Resource management method and management system | |
| CN112363813A (en) | Resource scheduling method and device, electronic equipment and computer readable medium | |
| CN110022364B (en) | File downloading method and server | |
| EP4242843A1 (en) | Graphics card memory management method and apparatus, device, and system | |
| CN110837401A (en) | Hierarchical processing method and device for java thread pool | |
| CN113971519B (en) | Robot scheduling method and device, electronic equipment and storage medium | |
| CN105592110A (en) | Resource scheduling method and device | |
| CN108681481A (en) | The processing method and processing device of service request | |
| CN114490082A (en) | Graphics processor resource management method, device, equipment and storage medium | |
| CN110225102B (en) | Method, device and system for pushing information | |
| CN111193802A (en) | Dynamic resource allocation method, system, terminal and storage medium based on user group | |
| CN113422877B (en) | Method and device for realizing number outbound based on service scene and electronic equipment | |
| CN113422808B (en) | Internet of things platform HTTP information pushing method, system, device and medium | |
| CN114579323A (en) | Thread processing method, device, equipment and medium | |
| CN117193992B (en) | Model training method, task scheduling device and computer storage medium | |
| CN111124672A (en) | Data distribution method based on Redis cluster and related equipment | |
| CN113326150A (en) | Online small-batch message processing method and device | |
| CN110750350B (en) | Large resource scheduling method, system, device and readable storage medium | |
| CN110097200A (en) | Meeting room preordering method, device, equipment and storage medium | |
| CN114896295A (en) | Data desensitization method, desensitization device and desensitization system in big data scene | |
| CN110516922B (en) | Method and device for distributing data processing objects | |
| CN114489970A (en) | Method and system for realizing queue sequencing by using scheduling plug-in Kubernetes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |