Multiplex communications – Fault recovery – Bypass an inoperative station
Reexamination Certificate
2003-10-17
2009-06-23
Ngo, Ricky (Department: 2416)
Multiplex communications
Fault recovery
Bypass an inoperative station
C370S242000, C370S256000
Reexamination Certificate
active
07551552
ABSTRACT:
A guaranteed distributed failure notification method is described, wherein a failure notification (FN) facility allows applications using the facility to create FN groups to which the application associates an application state. The application registers failure handlers with the FN facility on nodes in the FN group; each failure handler is associated with a specific FN group. When, on a given node, the FN facility learns of a failure in the FN group, the facility executes the associated failure handler on that node. System failures detected by the application are signaled to other FN group members using the facility. The facility detects system failures that occur in an overlay network on which the facility is implemented, and signals a failure notification to the other FN group members.
REFERENCES:
patent: 5905714 (1999-05-01), Havansi
patent: 6396815 (2002-05-01), Greaves et al.
patent: 6778833 (2004-08-01), Fortuna
patent: 6801496 (2004-10-01), Saleh et al.
patent: 6865149 (2005-03-01), Kalman et al.
patent: 7092356 (2006-08-01), Rabie et al.
patent: 7180866 (2007-02-01), Chartre et al.
patent: 7218645 (2007-05-01), Lotter et al.
patent: 7246160 (2007-07-01), Yamabe
patent: 2003/0058804 (2003-03-01), Saleh et al.
patent: 2003/0137932 (2003-07-01), Nishioka et al.
patent: 2003/0185148 (2003-10-01), Shinomiya et al.
patent: 2005/0015511 (2005-01-01), Izmailov et al.
patent: 2005/0068954 (2005-03-01), Liu et al.
A. Adya,W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. P. Wattenhofer, “FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment,”In Proceedings of the 5thSymposium on Operating Systems Design and Implementation(OSDI), 2002.
L. F. Cabrera, M. B. Jones, and M. Theimer, “Herald: Achieving a global event notification service,”In HotOS VIII, May 2001.
A. Adya,W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. P. Wattenhofer, “FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment,”In Proceedings of the 5thSymposium on Operating Systems Design and Implementation(OSDI), 2002.
J. Halpern and Y. Moses, “Knowledge and common knowledge in a distributed environment,”Journal of the ACM, 37:549-587, 1990.
N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman, “SkipNet: A Scalable Overlay Network with Practical Locality Properties,”In Proceedings of Fourth USENIX Symposium on Internet Technologies and Systems(USITS'03), Mar. 2003.
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,”In Proceedings of ACM SIGCOMM, Aug. 2001.
A. Rowstron and P. Druschel. “Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems,”In International Conference on Distributed Systems Platforms(Middleware), pp. 329-350, Heidelberg, Germany, Nov. 2001.
I. Stoica, R. Morris, D. Karger,M. F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications,”In Proceedings of ACM SIGCOMM, Aug. 2001.
B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, “Tapestry: An Infrastructure for Fault-Tolerant Wide-area Location and Routing,”Technical Report UCB//CSD-01-1141, UC Berkeley, Apr. 2001.
R. van Renesse, K. P. Birman, R. Friedman, M. Hayden, and D. A. Karr, “A framework for protocol composition in Horus,”In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 80-89, Ottawa, Ontario, Canada, Aug. 2-23, 1995.
R. van Renesse, Y. Minsky, and M. Hayden, “A gossip-style failure detection service,”Proceedings of Middleware, 1998.
N. Hu and P. Steenkiste, “Evaluation and Characterization of Available Bandwidth Probing Techniques,”In the IEEE JSAC Special Issue in Internet and WWW Measurement, Mapping, and Modeling, vol. 21(6), Aug. 2003.
D. Karger, P. Klein, and R. Tarjan, “A randomized linear-time algorithm to find minimum spanning trees,”Journal of the Association for Computing Machinery, 42(2), 1995.
M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron, “Scribe: A large-scale and decentralized application-level multicast infrastructure,”IEEE Journal on Selected Areas in Communications(JSAC) (Special issue on Network Support for Multicast Communications), 20(8), Oct. 2002.
Raynal M. et al., “Group membership failure detection: a simple protocol and its probabilistic analysis”, Distributed Systems Engineering, Institute of Physics Publishing, Bristol, GB, vol. 6, No. 3, Sep. 1, 1999, pp. 95-102, XP020073385.
Zhuang S. Q. et al., “Bayeux: An Architecture for Scalable and Fault-Tolerant Wide-Area Data Dissemination”, Proceedings of the 11thInternational Workshop on Network and Operating Systems Support for Digital Audio and Video, NOSSDAV 2001, Port Jefferson, NY, Jun. 25-26, 2001, pp. 11-20, XP001134292.
Dunagan J. et al., “Fuse: Lightweight Guaranteed Distributed Failure Notification”, Proceedings of the Sixth Symposium on Operating Systems Design and Implementation (OSDI '04), Usenix Assoc., Berkeley, CA, 2004, pp. 151-166, XP002439223.
Dunagan John
Harvey Nicholas J. A.
Jones Michael B.
Kostić Dejan
Theimer Marvin M.
Microsoft Corporation
Ngo Ricky
Wolf Greenfield & Sacks P.C.
Yuen Kan
LandOfFree
Method for providing guaranteed distributed failure... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for providing guaranteed distributed failure..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for providing guaranteed distributed failure... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4099001