Exactly once protocol for message-based collaboration

Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S204000, C709S205000, C709S230000, C709S236000, C707S793000, C707S793000, C707S793000, C719S316000

Reexamination Certificate

active

07373424

ABSTRACT:
Methods and systems for reliably exchanging a message among collaborating applications are disclosed. The methods and systems utilize a central exchange infrastructure (XI) for executing collaborative business processes among heterogeneous applications. Reliable message transmission is guaranteed by an Exactly Once Protocol (EOP), in which a database associated with the messaging and transport layer (MTL) of an HTTP-compliant server is used for storing a message identifier and comparing the message identifier to previously received message identifiers. If there is no match, the XI facilitates an exchange of message content of application data from a sending application to a receiving application.

REFERENCES:
patent: 6810431 (2004-10-01), Narisi et al.
patent: 6826606 (2004-11-01), Freeman et al.
patent: 7000012 (2006-02-01), Moore et al.
patent: 7047532 (2006-05-01), Connelly
patent: 7068654 (2006-06-01), Joseph et al.
patent: 7076556 (2006-07-01), Brock et al.
patent: 7177839 (2007-02-01), Claxton et al.
patent: 7225237 (2007-05-01), Tenereillo
patent: 7249157 (2007-07-01), Stewart et al.
patent: 2001/0056422 (2001-12-01), Benedict et al.
patent: 2002/0019825 (2002-02-01), Smiga et al.
patent: 2002/0026520 (2002-02-01), Mendiola et al.
patent: 2002/0052968 (2002-05-01), Bonefas et al.
patent: 2002/0120761 (2002-08-01), Berg
patent: 2002/0156927 (2002-10-01), Boucher et al.
patent: 2002/0194180 (2002-12-01), Alsop et al.
patent: 2002/0198994 (2002-12-01), Patton et al.
patent: 2003/0046416 (2003-03-01), Heuer
patent: 2003/0177252 (2003-09-01), Krichevski et al.
Silva, Mario J. and Katz, Randy H. “The Case for Design using the World Wide Web,” Proceedings of the 32nd ACM/IEEE conference on Design Automation, 1995, pp. 579-585.
Ravindran, K. et al. “Reliable Client-Server Communication in Distributed Programs,” Proceedings 14th Conference on Local Computer Networks, Oct. 10-12, 1989, pp. 242-251.
Ravindran, K. and Lin, X.T. “Structural Complexity and Execution Efficiency of Distributed Application Protocols,” Applications, Technologies, Architectures, and Protocols for Computer Communication, 1993, pp. 160-169.
Rescorla, E. “HTTP Over TLS,” RFC 2818, May 2000, pp. 1-7.
Hoffman, P. “SMTP Service Extension for Secure SMTP over Transport Layer Security,” RFC 3207, Feb. 2002, pp. 1-9.
Ong, L. and Yoakum, J. “An Introduction to the Stream Control Transmission Protocol (SCTP),” RFC 3286, May 2002, pp. 1-10.
Schutt, T.E. et al. “Message-Handling Systems Based on the CCITT X.400 Recommendations,” IBM Systems Journal, vol. 26, No. 3, 1987, pp. 235-254.
Kang, Tae-Gun, et al. “Design of Connection Management Module for MOM,” 2ndInternational Symposium on Parallel and Distributed Computing, Oct. 13-14, 2003, pp. 123-130.
Peersman, G. et al. “A Tutorial Overview of the Short Message Service Within GSM,” Computing and Control Engineering Journal, vol. 11, Issue 2, Apr. 2000, pp. 79-89.
Hodges, J. et al. “Lightweight Directory Access Protocol (v3): Extension for Transport Layer Security,” RFC 2830, May 2000, pp. 1-12.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Exactly once protocol for message-based collaboration does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Exactly once protocol for message-based collaboration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exactly once protocol for message-based collaboration will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3983501

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.