Asynchronous mechanism and message pool

• US 20050044151A1
• Filed: 03/04/2004
• Published: 02/24/2005
• Est. Priority Date: 03/05/2003
• Status: Active Grant

• Current Assignee: Messagesoft, Inc.
• Original Assignee: Messagesoft, Inc.
• Inventors: Wu, Shijun, Jiang, Jianguo, Liu, Yaping, Huang, Wei, Liang, Jingwei
• Granted Patent: US 8,788,591 B2
• Time in Patent Office: Days
• US Class Current: 709/206
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues
• CPC Class Codes: H04L 47/2441 relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 47/50 Queue scheduling
• CPC Class Codes: H04L 47/521 Static queue service slot or fixed bandwidth allocation
• CPC Class Codes: H04L 47/6215 Individual queue per QOS, rate or priority
• CPC Class Codes: H04L 49/90 Buffering arrangements
• CPC Class Codes: H04L 49/9036 Common buffer combined with individual queues
• CPC Class Codes: H04L 51/214 using selective forwarding
• CPC Class Codes: H04L 51/226 Delivery according to priorities
• CPC Class Codes: H04L 51/23 Reliability checks, e.g. acknowledgments or fault reporting

Abstract

Messages are received and retained in memory and are batch processed including transferring the messages to a cell pool having cells of predetermined size. The location and size of the messages are recorded in a table map with other pertinent information as is required. Messages in the cell pool are processed and delivered asynchronously.

Claims

21-1. The method of claim 1, further comprising:

receiving a first message as returned from the recipient;

determining that the first message is a returned message; and

storing the returned message in a backup system for processing at a later time.

22. A computer implemented system for processing messages, comprising:

a message processor for receiving messages, acknowledging messages received and batching messages;

a memory having one or more cells of a predetermined size, the message processor operable to write messages in batches to the memory including writing respective individual messages to one or more cells depending on a size of a given message; and

a table map for recording an association between each message and each cell in which the message is written.

23. The system of claim 22, wherein:

the one or more cells have a numeric order; and

the one or more cells are written to in the numeric order of the cells.

24. The system of claim 22, wherein:

the one or more cells are each a predetermined size and the size is substantially equal to a size of a majority of messages processed.

25. The system of claim 22, wherein:

the one or more cells are sized to store at least 80% of an average message size for messages received by the message receiver.

26. The system of claim 22, further comprising:

a delivery processor for delivering the messages to a receiver.

27. The system of claim 26, further comprising:

a queue structure for receiving storing messages to be delivered by the delivery processor and extracted from the cells.

28. The system of claim 27, wherein:

the queue structure includes one or more queues and each queue has a priority; and

the delivery processor is configured to access each queue according to the priority of the queue.

29. The system of claim 22, further comprising:

a backup data storage for storing files that have not been processed successfully, wherein the delivery processor processes the files that have not been processed successfully.