IP Library Granted Patent US 12,192,407
Granted Patent B2
US 12,192,407 · App. 18/475,516 · Granted Jan 7, 2025

Batch ringing for large call queues

Inventors: Fengkai Zhang (Hefei, CN); Hongjian Zhao (Campbell, CA)
Assignee: Zoom Video Communications, Inc.
H04M3/5191H04M3/42365H04M3/5175H04M3/5234
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,192,407
App. No.
18/475,516
Granted
Jan 7, 2025
Kind
B2
Abstract

Calls for large call queues are handled by a system that assigns agents of a call queue to one of a first group or a second group. A size of the first group or the second group is based on a number of agents in the call queue that are online. The system batch rings each agent of the first group when an incoming call is received. If the incoming call is unanswered by the first group, the system batch rings each agent of the second group.

Claims (34)

1. A method, comprising:

determining a group size of a first agent group and a second agent group based on online agents of a call queue;

assigning the online agents to the first agent group or to the second agent group based on a rotating structure and a respective agent idle time;

responsive to receiving an incoming call, batch ringing each agent of the first agent group; and

batch ringing each agent of the second agent group when the incoming call is unanswered by an agent of the first agent group.

2. The method of claim 1 , wherein the call queue has a call latency of at least 10 seconds.

3. The method of claim 1 , wherein the agents of the call queue are not pre-grouped.

4. The method of claim 1 , further comprising:

routing the incoming call to a voicemail box when a wait time threshold is met.

5. The method of claim 1 , wherein the group size of the first agent group and the second agent group is a static size.

6. The method of claim 1 , wherein the group size of the first agent group and the second agent group is a static size, and wherein the group size is based on a call latency of about 10 seconds.

7. The method of claim 1 , wherein the group size of the first agent group and the second agent group is a dynamic size.

8. The method of claim 1 , wherein the group size of the first agent group and the second agent group is a dynamic size, and wherein the group size is based on a call volume.

9. The method of claim 1 , wherein the group size of the first agent group and the second agent group is a dynamic size, wherein the group size is based on a call volume, and wherein the group size increases as the call volume increases.

10. A system, comprising:

a server configured to:

determine a group size of a first agent group and a second agent group based on online agents of a call queue;

assign the online agents to the first agent group or the second agent group based on a rotating structure and a respective agent idle time;

responsive to an incoming call, batch ring each agent of the first agent group; and

batch ring each agent of the second agent group when the incoming call is unanswered by an agent of the first agent group.

11. The system of claim 10 , wherein the server is configured to exclude a call queue agent that answered a previous call.

12. The system of claim 10 , wherein the incoming call is routed to a supervisor when a wait time threshold is met.

13. The system of claim 10 , wherein the server is configured to determine the agent idle time based on a time that an agent last answered a call.

14. The system of claim 10 , wherein the server is configured to rank the agents of the call queue from a highest agent idle time to a lowest agent idle time.

15. The system of claim 10 , wherein the first group has a higher average agent idle time than the second agent group.

16. A non-transitory computer-readable medium comprising instructions stored on a memory, that when executed by a processor, cause the processor to:

determine a group size of a first agent group and a second agent group based on online agents of a call queue;

assign the online agents to the first agent group or the second agent group based on a rotating structure and a respective agent idle time;

responsive to an incoming call, batch ring each agent of the first agent group; and

batch ring each agent of the second agent group when the incoming call is unanswered by an agent of the first agent group.

17. The non-transitory computer-readable medium of claim 16 , wherein the instructions, when executed by the processor, cause the processor to exclude a call queue agent that answered a previous call.

18. The non-transitory computer-readable medium of claim 16 , wherein the instructions, when executed by the processor, cause the processor to determine an agent idle time based on a time that an agent last answered a call.

19. The non-transitory computer-readable medium of claim 18 , wherein the instructions, when executed by the processor, cause the processor to rank the agents of the call queue from a highest agent idle time to a lowest agent idle time.

20. The non-transitory computer-readable medium of claim 18 , wherein the instructions, when executed by the processor, cause the processor to assign agents to the first agent group and the second agent group such that the agents of the first agent group have a higher average agent idle time than the agents of the second agent group.

Assignments (2)
CHANGE OF NAME Recorded Jan 7, 2025
From: ZOOM VIDEO COMMUNICATIONS, INC.
To: ZOOM COMMUNICATIONS, INC.
Reel/Frame 069839/0593 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 27, 2023
From: ZHANG, FENGKAI; ZHAO, HONGJIAN
To: ZOOM VIDEO COMMUNICATIONS, INC.
Reel/Frame 065046/0353 →
Continuity (2)
Continuation 17443947 · Jul 28, 2021
Related Publication 20240031486A1 · Jan 25, 2024
References Cited (25)
US 5341412A · Ramot et al. · 1994 [cited by applicant]
US 5815566A · Ramot · 1998 [cited by examiner]
US 6801619B1 · Bae · 2004 [cited by applicant]
US 7023979B1 · Wu et al. · 2006 [cited by applicant]
US 8068601B2 · Shaffer et al. · 2011 [cited by applicant]
US 8467354B1 · Jerkunica et al. · 2013 [cited by applicant]
US 8767944B1 · Davis et al. · 2014 [cited by applicant]
US 9292861B2 · Spievak et al. · 2016 [cited by applicant]
US 10104236B1 · Liu et al. · 2018 [cited by applicant]
US 10165109B1 · Custance · 2018 [cited by applicant]
US 20020114323A1 · Chowdhury et al. · 2002 [cited by applicant]
US 20030156704A1 · Dezonno et al. · 2003 [cited by applicant]
US 20090261157A1 · Kumar · 2009 [cited by examiner]
US 20100226490A1 · Schultz et al. · 2010 [cited by applicant]
US 20120300920A1 · Fagundes · 2012 [cited by examiner]
US 20140093063A1 · Hu · 2014 [cited by applicant]
US 20150016600A1 · Desai et al. · 2015 [cited by applicant]
US 20150139417A1 · Brown et al. · 2015 [cited by applicant]
US 20170374197A1 · Rumpf · 2017 [cited by applicant]
US 20180367672A1 · Ristock et al. · 2018 [cited by applicant]
US 20180375998A1 · Beilis et al. · 2018 [cited by applicant]
US 20200137231A1 · Revanur et al. · 2020 [cited by applicant]
US 20210132748A1 · Paiva · 2021 [cited by applicant]
US 20210136218A1 · Paiva · 2021 [cited by applicant]
International Search Report and Written Opinion mailed on Oct. 19, 2022 in corresponding PCT Application No. PCT/US2022/036210. [cited by applicant]