Systems, software, and methods for routing events among publishe

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

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 1300

Patent

active

060214430

ABSTRACT:
A method and apparatus for publishing and receiving events to and from a network. A plurality of "publisher" entities publish information and a plurality of "subscriber" entities request and use the information. Publishers and subscribers are connected to each other through a network. The network is a "store and forward" network whose routing is "content-based." The basic quanta of information is called an "event." Publishers publish events and subscribers subscribe to events that match criteria defined by the subscriber. Publication and subscription are performed asynchronously. Publishers and subscribers do not have direct knowledge of each other. The system receives a published event from a publisher and routes the event to all appropriate subscribers. Each subscriber is guaranteed to receive all events published on the system if, and only it they match the subscription criteria specified by the subscriber. A legacy data base can be added to the network by way of a data base connector, which can be a publisher, a subscriber, or both.

REFERENCES:
patent: 4751635 (1988-06-01), Kret
patent: 4823122 (1989-04-01), Mann et al.
patent: 4897781 (1990-01-01), Chang et al.
patent: 4975904 (1990-12-01), Mann et al.
patent: 4975905 (1990-12-01), Mann et al.
patent: 5058108 (1991-10-01), Mann et al.
patent: 5151989 (1992-09-01), Johnson et al.
patent: 5187787 (1993-02-01), Skeen et al.
patent: 5257369 (1993-10-01), Skeen et al.
patent: 5339392 (1994-08-01), Risberg et al.
patent: 5347632 (1994-09-01), Filepp et al.
patent: 5404491 (1995-04-01), Huzenlaub et al.
patent: 5406475 (1995-04-01), Kouchi et al.
patent: 5442771 (1995-08-01), Filepp et al.
patent: 5491818 (1996-02-01), Malatesta et al.
patent: 5539903 (1996-07-01), Kaplan et al.
patent: 5557798 (1996-09-01), Skeen et al.
patent: 5594910 (1997-01-01), Filepp et al.
Kenneth Birman et al., "Reliable Communication in the Presence of Failures," Feb. 1987, ACM Transactions on Computer Systems, vol. 5, No. 1, pp. 47-76.
Kenneth Birman et al., "Exploiting Virtual Synchrony in Distributed Systems," 1987, ACM, pp. 123-138.
Kenneth Birman et al., "The ISIS System Manual,"Mar. 15, 1988, pp. 1-212.
IBM Technical Disclosure Bulletin, "Revisable From Document Conversation," vol. 28, No. 5, Oct. 1985, pp. 2160-2161.
Kenneth Birman et al., "ISIS Documentation: Release 1," Jul. 1987.
Kenneth Birman et al., "ISIS and the Meta Project," 1989, Sun Technology, pp. 90-104.
Nicholas Carriero et al., "Linda in Context," 1989, ACM, Artificial Intelligence & Language Processing.
David R. Cheriton et al., Distributed Process Groups in the V Kernel, May 1985, ACM Transactions on Computer Systems, vol. 3, No. 2, pp. 77-107.
C. Anthony DellaFera et al., "Zephyr Notification Services," Section E.4.1, Abstract, Jun. 5, 1989, Massachusettes Institute of Technology, pp. 1-35.
C. Anthony DellaFera et al., "Zephyr Notification Service," Abstract, Feb. 1988, Massachusetts Institute of Technology pp. 1-9.
Ariel J. Frank et al, "Multicast Communication on Network Computers," May 1995, IEEE Software, pp. 49-61.
Robert S. French et al., "The Zephyr Programmer's Manual," Protocol Version ZEPHO.2, Apr. 5, 1989, pp. 1-82.
Phillip B. Gibbons, "A Stub Generator for Multilanguage RPC in Heterogeneous Environments," IEEE Transactions on Software Engineering, vol. SE 13, No. 1, Jan. 1987, p 77-87.
Ronald D. Gordon, "Providing Multiple-Channel Communication Using the Experimental Digital Switch," IEEE Transactions on Communications, vol. Com-30, No. 6, Jun. 1982, pp. 1409-1416.
Larry Hughes, "A Multicast Interface for UNIX 4.3," Software Practice and Experience, vol. 18(1), Jan. 1988, pp. 15-27.
V.Y. Lum et al., "A General Methodology for Data Converstion and Restructuring," Data Converstion, vol. 20, No. 5, Sep. 1976, pp. 483-497.
Steven P. Reiss, "Integration Mechanisms in the FIELD Environment," Brown University, Computer Science Department, Oct. 1988, pp. 1-21.
M. Schroeder et al., "Experience with Grapevine: The Growth of a Distributed System," ACM Transactions on Computer Systems, vol. 2, No. 1, Feb. 1984, pp. 3-23.
Dale Skeen, "Reliable Message Diffusion," IBM Almaden Research Center, Oct. 1987, pp. 1-29.
Andrew S. Tanenbaum et al., "A Retrospective and Evaluation of the Amoeba Distributed Operating System," Dept. of Mathematics and Computer Science Vrije Universiteit, Amsterdam, The Netherlands, pp. 1-25.
IBM, "Bind the Business Together Without Tying it Down," MQ Series, Commmercial Messaging, Ver. 1, Release 3.0.
Leslie Yeamans, "Transactional Messaging," OTM Spectrum Reports, (Nov. 1993), vol. 7, Report 4, pp. 13-21.
Henderson, H., The USENET System (1987).
Source Code for file tk.sub.- news.c (including a facility called the "News Service" and hereafter referred to as "Old News") dated May 1990, Feb. 24, 1988, and Dec. 14, 1987).
Answer and Counter Claims of Defendant Isis Distributed Systems, Inc., Isis Distributed Systems, Inc. v. Teknekron Software Systems, Inc., US District Ct. (Northern District of New York), Case No. 93-CV-268-FJS-GJD, dated Jul. 28, 1997, 25 pages.

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

Systems, software, and methods for routing events among publishe does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Systems, software, and methods for routing events among publishe, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems, software, and methods for routing events among publishe will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-945860

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