Non-disruptive reconfiguration of a publish/subscribe system

Multiplex communications – Fault recovery

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S254000, C370S394000

Reexamination Certificate

active

10622279

ABSTRACT:
A publish/subscribe system is non-disruptively reconfigured, such that messages are not lost during the reconfiguration. After reconfiguration is initiated, messages that are to be delivered within the publish/subscribe system are forwarded using either an old path or a new path. That is, until the reconfigured system is stabilized, some messages may be delivered using the old path, while other messages are delivered using a new path. After the system is stabilized, the new path is used for delivery of all the messages, until another reconfiguration is initiated.

REFERENCES:
patent: 5257369 (1993-10-01), Skeen et al.
patent: 5325362 (1994-06-01), Aziz
patent: 5428606 (1995-06-01), Moskowitz
patent: 5517562 (1996-05-01), McConnell
patent: 5522046 (1996-05-01), McMillen et al.
patent: 5555244 (1996-09-01), Gupta et al.
patent: 5557798 (1996-09-01), Skeen et al.
patent: 5570366 (1996-10-01), Baker et al.
patent: 5581764 (1996-12-01), Fitzgerald et al.
patent: 5600630 (1997-02-01), Takano et al.
patent: 5604867 (1997-02-01), Harwood
patent: 5761405 (1998-06-01), Tadamura et al.
patent: 5870605 (1999-02-01), Bracho et al.
patent: 6011780 (2000-01-01), Vaman et al.
patent: 6112249 (2000-08-01), Bader et al.
patent: 6236642 (2001-05-01), Shaffer et al.
patent: 6336119 (2002-01-01), Banavar et al.
patent: 6400681 (2002-06-01), Bertin et al.
patent: 6535491 (2003-03-01), Dutt et al.
Hanson et al., “A Predicate Matching Algorithm for Database Rule Systems”, Published at Proceedings of SIGMOD, pp. 271-280 (1991).
Mishra et al., “Consul: A Communication Substrate for Fault-Tolerant Distributed Programs”, TR91-32, Department of Computer Science, The University of Arizona, pp. 1-33 (Nov. 1991).
Smirnov, M.I., “Object-Oriented Framework for a Scalable Multicast Call Modelling”, Teleservices and Multimedia Communications Second International COST 237 Workshop, Proceedings, Springer-Verlag, vii+277, pp. 1-39 (1996).
Hofmann, M. “A Generic Concept for Large-Scale Multicast”, Broadband Communications, Network, Services, Applications, Future Directions, International Zurich Seminar on Digital Communications, IZS '96, Proceedings, Springer-Verlang, xiv+358, pp. 95-106 (1996).
Zabele et al., “High Performance Infrastructure For Visually-Intensive CSCW Applications”, Transcending Boundaries, CSCW '94, Proceedings of the Conference on Computer Supported Cooperative Work, ACM, xi+464, pp. 395-403 (Oct. 1994) (Abstract Only).
K.P. Birman, “The Process Group Approach to Reliable Distributed Computing”, Communications of the ACM, vol. 36, No. 12 (Dec. 1993), pp. 37-53.
Oki et al., “The Information Bus—An Architecture for Extensible Distributed Systems”, SIGOPS '93, ACM 0-89791-632-8/93/0012, (1993), pp. 58-68.
D. Powell, “Group Communication”, Communications of the ACM, vol. 39, No. 4; (Apr. 1996), pp. 52-100.
M.I. Smirnov, “Efficient Multicast Routing in High Speed Networks”, IN Comput Commun. (UK), vol. 19, No. 1, Elsevier, (Jan. 1996), pp. 59-75.
M. Grossglauser, “Optimal Deterministic Timeouts for Reliable Scalable Multicast”, 0743-166X/96, 1996 IEEE, pp. 1425-1432.

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

Non-disruptive reconfiguration of a publish/subscribe system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Non-disruptive reconfiguration of a publish/subscribe system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-disruptive reconfiguration of a publish/subscribe system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3899697

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