IP Library Granted Patent US 9,485,201
Granted Patent B1
US 9,485,201 · App. 14/191,304 · Granted Nov 1, 2016

System, method, and computer program for partially authorizing a multi-target communication request

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 9,485,201
App. No.
14/191,304
Granted
Nov 1, 2016
Kind
B1
Abstract

A system, method, and computer program product are provided for partially authorizing a multi-target communication request. In use, a plurality of targets associated with a multi-target communication request are determined. Further, the multi-target communication request is automatically authorized, wherein the multi-target communication request includes a request to send at least one communication to each of the plurality of targets. Additionally, it is determined whether the multi-target communication request has been successfully authorized for each of the plurality of targets. Responsive to determining that the multi-target communication request has not been successfully authorized for at least one of the plurality of targets, the multi-target communication request is rolled back for only the at least one target.

Claims (35)

1. A computer program product embodied on a non-transitory computer readable medium, comprising computer code for:

receiving a request to send a communication to a plurality of targets as a single transaction; in response to the request, creating a plurality of sub-transactions, each of the sub-transactions specifying a different one of the targets and being for sending the message to the specified target;

determining whether enough funds are present to cover a cost of sending the communication to all of the targets;

when it is determined that enough funds are present to cover a cost of sending the communication to all of the targets, automatically processing the sub-transactions to send the communication to all of the targets;

when it is determined that enough funds are not present to cover a cost of sending the communication to all of the targets:

automatically selecting in accordance with a predefined policy a subset of the sub-transactions for which enough funds are present to cover a cost of sending the communication to the targets specified thereby, wherein the predefined policy specifies to select as the subset a highest number of the sub-transactions as possible within an amount of the funds that are available,

automatically processing the sub-transactions in the subset to send the communication to the targets specified by the sub-transactions in the subset, and

rolling back the remaining sub-transactions not included in the subset such that the communication is not sent to the targets specified by the remaining sub-transactions.

2. The computer program product of claim 1 , wherein the communicated requested is a short messaging service (SMS) message.

3. The computer program product of claim 1 , wherein the communication requested is a multimedia messaging service (MMS) message.

4. The computer program product of claim 1 , wherein the targets are mobile devices.

5. The computer program product of claim 4 , wherein the mobile devices are mobile phones.

6. The computer program product of claim 1 , wherein the request is sent by a client device.

7. The computer program product of claim 1 , wherein the computer code is adapted to be executed by a computer.

8. The computer program product of claim 1 , further comprising computer code for:

creating a failure list indicating the targets specified by the rolled-back sub-transactions; and

sending the failure list to a client device that initiated the request.

9. A method, comprising:

receiving a request to send a communication to a plurality of targets as a single transaction; in response to the request, creating a plurality of sub-transactions, each of the sub-transactions specifying a different one of the targets and being for sending the message to the specified target;

determining whether enough funds are present to cover a cost of sending the communication to all of the targets;

when it is determined that enough funds are present to cover a cost of sending the communication to all of the targets, automatically processing the sub-transactions to send the communication to all of the targets;

when it is determined that enough funds are not present to cover a cost of sending the communication to all of the targets:

automatically selecting in accordance with a predefined policy a subset of the sub-transactions for which enough funds are present to cover a cost of sending the communication to the targets specified thereby, wherein the predefined policy specifies to select as the subset a highest number of the sub-transactions as possible within an amount of the funds that are available,

automatically processing the sub-transactions in the subset to send the communication to the targets specified by the sub-transactions in the subset, and

rolling back the remaining sub-transactions not included in the subset such that the communication is not sent to the targets specified by the remaining sub-transactions.

10. A system comprising:

a memory; and

a processor coupled to the memory and that is configured for:

receiving a request to send a communication to a plurality of targets as a single transaction; in response to the request, creating a plurality of sub-transactions, each of the sub-transactions specifying a different one of the targets and being for sending the message to the specified target;

determining whether enough funds are present to cover a cost of sending the communication to all of the targets;

when it is determined that enough funds are present to cover a cost of sending the communication to all of the targets, automatically processing the sub-transactions to send the communication to all of the targets;

when it is determined that enough funds are not present to cover a cost of sending the communication to all of the targets:

automatically selecting in accordance with a predefined policy a subset of the sub-transactions for which enough funds are present to cover a cost of sending the communication to the targets specified thereby, wherein the predefined policy specifies to select as the subset a highest number of the sub-transactions as possible within an amount of the funds that are available,

automatically processing the sub-transactions in the subset to send the communication to the targets specified by the sub-transactions in the subset, and

rolling back the remaining sub-transactions not included in the subset such that the communication is not sent to the targets specified by the remaining sub-transactions.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 4, 2016
From: AMDOCS SOFTWARE SYSTEMS LIMITED
To: AMDOCS DEVELOPMENT LIMITED; AMDOCS SOFTWARE SYSTEMS LIMITED
Reel/Frame 039695/0965 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 26, 2014
From: SHANI, OMER
To: AMDOCS SOFTWARE SYSTEMS LIMITED
Reel/Frame 033832/0879 →