Quiescent reconfiguration of a routing network

Details Quiescent reconfiguration of a routing network Quiescent reconfiguration of a routing network

2005-06-14

2005-06-14

Rao, Seema S. (Department: 2666)

Multiplex communications

Network configuration determination

C370S256000, C370S412000, C714S004110

Reexamination Certificate

active

06907011

ABSTRACT:
Reconfiguration of a continuously available routing network of a publish/subscribe system is achieved by quiescing data messages and control messages within the routing network to preserve first-in first-out ordering thereof, and then, reconfiguring the quiesced routing network. This reconfiguration technique is particularly applicable to a routing network having at least one special node comprising one of a logger node or a sequencer node, wherein the logger node is used to store a message to persistent storage within the routing network prior to delivery of the message to one or more clients, and the sequencer sequences a message with other messages received by the network prior to delivery thereof for ordered delivery of the messages to one or more clients of the network.

REFERENCES:
patent: 5138615 (1992-08-01), Lamport et al.
patent: 5257369 (1993-10-01), Skeen et al.
patent: 5325362 (1994-06-01), Aziz
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: 5604867 (1997-02-01), Harwood
patent: 5870605 (1999-02-01), Bracho et al.
patent: 6333929 (2001-12-01), Drottar et al.
patent: 6336119 (2002-01-01), Banavar et al.
patent: 6396814 (2002-05-01), Iwamura et al.
patent: 2003/0091049 (2003-05-01), Abe 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 Modeling”, 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, Vo. 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, 45 Ref., Abstract Only.
M. Grossglauser, “Optimal Deterministic Timeouts for Reliable Scalable Multicast”, 0743-166X/96, 1996 IEEE, pp. 1425-1432.

Affiliated with

Also associated with

Rating

Quiescent reconfiguration of a routing network does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Quiescent reconfiguration of a routing network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quiescent reconfiguration of a routing network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3497364