Intelligent mobile messaging and communication traffic Hub (iHub)

• US 20050277430A1
• Filed: 05/11/2004
• Published: 12/15/2005
• Est. Priority Date: 05/11/2004
• Status: Abandoned Application

• Current Assignee: Redknee Inc.
• Original Assignee: Redknee Inc.
• Inventors: Meisl, Armin, Lakhani, Shailesh
• Application Number:
  US10/842,509
• Publication Number:
  US 20050277430A1
• Time in Patent Office: Days
• US Class Current: 455/466
• CPC Class Codes: H04L 51/58 Message adaptation for wireless communication
• CPC Class Codes: H04W 4/14 Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]

Abstract

The invention disclosed is designed to facilitate and enable text and/or multi-media messaging between multiple network elements such as ESMEs, SMSCs, MMSCs, or other such messaging elements.

Claims

1. An open architecture message routing and management system, designed to facilitate and enable text and/or multi-media messaging between multiple telecommunications network elements.

2. The system of claim 1, where such network elements includes ESMEs, SMSCs, MMSCs, and other such elements which may ordinarily intermediate messaging traffic.

3. The system of claim 1, whereby the invention exists as part of a computer program product, comprising:

a) a computer readable memory medium; and

b) a computer program including the mathematic and programmatic logic required to facilitate the steps, methods and rules as such.

4. The system of claim 3, where the computer program product has been articulated to bind and/or receive bind connections from certain network elements.

5. The system of claim 4, whereby messaging traffic between network elements is directed and routed as per parameters articulated within the computer program product.

6. The system of claim 5, whereby such parameters may also be configured as to block, filter, truncate, or otherwise augment or manipulate the telecommunications messaging traffic as per the network operator'"'"'s needs (including illicit use of network resources, inter alia).

7. An improved method for message routing and load sharing technologies which allow for enhanced utilization of the SMPP message set.

8. The method of claim 7, which is differentiated from the typical round robin mode, in which traffic has been traditionally load shared across a number of transmitter connections to connected SMSCs, and therefore unable to route subsequent follow-up messages (replace_sm, query_sm, submit_sm with replace, etc.) to the same connection, resulting in ESMEs/LAs not being able to utilize the many commands in the SMPP message set.

9. The method of claim 7, whereby such messages sent over a transmitter bind to a specific destination MSISDN are always routed to the same SMSC in a load-sharing configuration, thereby preventing transparency loss in the SMSC bind, and enables ESMEs to utilize the SMPP primitives that need to be routed to the same connection.

10. The method of claim 9, whereby in addressing load sharing needs, said messages need be shared across the different SMSC by a unique identifier.

11. The method of claim 9, whereby the computer program product load shares messaging traffic based on any number of parameters.

12. The method of claim 11, where such parameters may include the source address of the ESME submitted messages

13. The method of claim 10, whereby messages may be grouped and submitted to a single SMSC based on any number of parameters.

14. The method of claim 13, whereby one of those parameters include source address.

15. The method of claim 13, wherein all messages from a particular source address are grouped to and submitted to a single SMSC.

16. The method of claim 15, whereby the computer program product may perform a one-way hash on the source address and a modulus function on the result to transmit all messages from a single source address to a single route.