USE OF TEMPLATE MESSAGES TO OPTIMIZE A SOFTWARE MESSAGING SYSTEM

• US 20090144357A1
• Filed: 10/15/2008
• Published: 06/04/2009
• Est. Priority Date: 11/29/2007
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Rungta, Saket, White, Matthew Brian, Cope, Brian Charles
• Application Number:
  US12/251,920
• Publication Number:
  US 20090144357A1
• Time in Patent Office: Days
• US Class Current: 709/202
• CPC Class Codes: G06F 2209/547 Messaging middleware
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues

Abstract

A method uses template messages to optimize software messaging system. A message is decomposed into a template message portion containing message content, and a field message portion. A correlation identifier identifies a template message and only those template messages with unique correlation identifiers are stored or forwarded. A field message portion includes a correlation identifier associated with a template message. A recomposition function combines a field message portion with the appropriate template message portion as identified in the field message portion.

Claims

1. A computer system for optimizing a software messaging system, comprising:

a computer-implemented module operable to autonomously detect patterns of repeated data in a plurality of messages and generate a plurality of template messages, each of said plurality of template messages containing a different pattern of repeated data detected in said plurality of messages, the computer-implemented module further operable to replace a template message with one determined to have more of commonly repeated data, said computer-implemented module further operable to assign a correlation identifier to said each template message;

a computer storage device operable to store said each template message with a corresponding correlation identifier;

a message decomposition module operable, for each message being communicated, to extract dynamic portion of said each message and generate a field message to contain the dynamic portion, the message decomposition module further operable to select a template message from said plurality of template messages having message content of said each message, said message decomposition module further operable to determine a correlation identifier assigned to said selected template message, and communicate said field message to a recipient application with the correlation identifier that matches the selected template message without communicating content of said selected template message;

a message recomposition module operable to receive said field message with the correlation identifier and to recompose using said field message and said correlation identifier, said message recomposition module further operable to search recipient application'"'"'s cache storing a plurality of template messages to select a template message having said correlation identifier, said message recomposition module further operable to non-destructively retrieve said template message having said correlation identifier and destructively retrieve said field message, said message recomposition module further operable to replace placeholders in said template message with equivalent fields from said field message by sequence order; and

an agent process deployed to notify said recipient application when there is a change in one or more of the template messages cached in said recipient application'"'"'s cache, said recipient application clearing said one or more of the template messages that have changed from its cache upon being notified,

wherein the computer-implemented module autonomously detects patterns, generates a plurality of template messages, assigns a correlation identifier, and stores said each template message with a corresponding correlation identifier as said each message is being communicated.