IP Library Granted Patent US 10,652,192
Granted Patent B1
US 10,652,192 · App. 16/371,823 · Granted May 12, 2020

Method, system and computer readable medium for notification delivery

Inventors: Gary Douglas Pulford (Lafayette, CO); Bruce Pollock (Omaha, NE); Ian James Juliano (Omaha, NE); James P. Breen (Chicago, IL)
Assignee: West Corporation
H04L51/26G06F9/4887G06F9/546H04L41/5003H04L51/04H04L51/24H04W4/12G06F2209/548
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 10,652,192
App. No.
16/371,823
Granted
May 12, 2020
Kind
B1
Abstract

In a system, method and computer readable medium for managing message delivery, message delivery jobs are dynamically prioritized into a plurality of priority queues based on a delivery timeframe for each job. A delivery manager controls delivery of the message delivery jobs through a number of delivery channels and ports. A priority manager reviews jobs pending in the queues. If the priority manager determines that a message delivery job will not be completed within its delivery timeframe, the priority manager assigns a higher priority to the message delivery job.

Claims (32)

1. A method, comprising:

assigning, by a processor, each message of at least one delivery job to one of a plurality of job queues, each of said plurality of job queues being associated with a delivery timeframe;

determining, by the processor, a number of ports required to ensure that each message of said message delivery job is delivered to its respective recipient within said delivery timeframe; and

wherein the determining of the number of ports required is based on a number of jobs in the job queue and an estimated time to complete each job.

2. The method of claim 1 , wherein each message delivery job comprises at least one message and at least one message recipient.

3. The method of claim 1 , comprising determining, by the processor, the delivery timeframe for the message delivery job.

4. The method of claim 1 , comprising determining, by the processor, whether a message delivery job in said job queue will be completed within its respective delivery timeframe.

5. The method of claim 4 , comprising reassigning, by the processor, said message delivery job to a higher priority job queue upon determining that said message delivery job will not be completed within its respective delivery timeframe.

6. The method of claim 1 , comprising receiving, by the processor, a further message delivery job.

7. The method of claim 6 , comprising assigning, by the processor, said further message delivery job to a priority queue having a higher priority than said selected message delivery job.

8. The method of claim 7 , comprising re-assigning, by the processor, one or more ports assigned to said selected message delivery job to said further message delivery job.

9. A non-transitory computer-readable medium comprising instructions that, when read by a processor, cause the processor to perform:

assigning each message of at least one delivery job to one of a plurality of job queues, each of said plurality of job queues being associated with a delivery timeframe;

determining a number of ports required to ensure that each message of said message delivery job is delivered to its respective recipient within said delivery timeframe; and

wherein the determining of the number of ports required is based on a number of jobs in the job queue and an estimated time to complete each job.

10. The non-transitory computer-readable medium of claim 9 , wherein each message delivery job comprises at least one message and at least one message recipient.

11. The non-transitory computer-readable medium of claim 9 , comprising instructions that, when read by the processor, cause the processor to perform determining the delivery timeframe for the message delivery job.

12. The non-transitory computer-readable medium of claim 9 , comprising instructions that, when read by the processor, cause the processor to perform determining whether a message delivery job in said job queue will be completed within its respective delivery timeframe.

13. The non-transitory computer-readable medium of claim 12 , comprising instructions that, when read by the processor, cause the processor to perform reassigning said message delivery job to a higher priority job queue upon determining that said message delivery job will not be completed within its respective delivery timeframe.

14. The non-transitory computer-readable medium of claim 9 , comprising instructions that, when read by the processor, cause the processor to perform receiving a further message delivery job.

15. The non-transitory computer-readable medium of claim 14 , comprising instructions that, when read by the processor, cause the processor to perform assigning said further message delivery job to a priority queue having a higher priority than said selected message delivery job.

16. The non-transitory computer-readable medium of claim 15 , comprising instructions that, when read by the processor, cause the processor to perform re-assigning one or more ports assigned to said selected message delivery job to said further message delivery job.

17. A system, comprising:

a processor; and

memory;

wherein the processor and the memory are communicably coupled;

wherein the processor:

assigns each message of at least one delivery job to one of a plurality of job queues, each of said plurality of job queues being associated with a delivery timeframe; determines a number of ports required to ensure that each message of said message delivery job is delivered to its respective recipient within said delivery timeframe;

wherein the number of ports required being determined is based on a number of jobs in the job queue and an estimated time to complete each job.

18. The system of claim 17 , wherein each message delivery job comprises at least one message and at least one message recipient.

19. The system of claim 17 , wherein the processor determines the delivery timeframe for the message delivery job.

20. The system of claim 17 wherein the processor determines whether a message delivery job in said job queue will be completed within its respective delivery timeframe.

Assignments (6)
OMNIBUS ASSIGNMENT OF SECURITY INTEREST IN INTELLECTUAL PROPERTY Recorded Nov 25, 2024
From: UBS AG, STAMFORD BRANCH (AS SUCCESSOR TO CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH IN ITS CAPACITY AS COLLATERAL AGENT)
To: WILMINGTON TRUST, NATIONAL ASSOCIATION, AS THE SUCCESSOR COLLATERAL AGENT
Reel/Frame 069438/0775 →
CHANGE OF NAME Recorded Apr 3, 2023
From: INTRADO CORPORATION
To: WEST TECHNOLOGY GROUP, LLC
Reel/Frame 063239/0876 →
CHANGE OF NAME Recorded Apr 3, 2023
From: WEST CORPORATION
To: INTRADO CORPORATION
Reel/Frame 063239/0900 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 19, 2023
From: PULFORD, GARY DOUGLAS; POLLOCK, BRUCE; JULIANO, IAN JAMES; BREEN, JAMES P.
To: WEST CORPORATION
Reel/Frame 063027/0690 →
NOTICE OF GRANT OF SECURITY INTEREST (SECOND LIEN) IN PATENTS Recorded Jan 31, 2023
From: CX360, INC.; WEST TECHNOLOGY GROUP, LLC (FKA INTRADO CORPORATION, FKA WEST CORPORATION); INTRADO INTERACTIVE SERVICES CORPORATION (FKA WEST INTERACTIVE SERVICES CORPORATION, FKA COBALT ACQUISITION COMPANY)
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION, AS COLLATERAL AGENT
Reel/Frame 062571/0018 →
SECURITY INTEREST Recorded Jun 30, 2020
From: INTRADO CORPORATION (F/K/A WEST CORPORATION)
To: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH, AS COLLATERAL AGENT
Reel/Frame 053083/0932 →