Electrical computers and digital processing systems: multicomput – Computer network managing – Computer network monitoring
Reexamination Certificate
2005-02-14
2009-12-29
Elchanti, Hussein (Department: 2457)
Electrical computers and digital processing systems: multicomput
Computer network managing
Computer network monitoring
C709S220000, C709S223000
Reexamination Certificate
active
07640339
ABSTRACT:
A method for monitoring a target node in a distributed system, that includes determining a plurality of neighbor nodes of the target node, determining a plurality of neighbor watch nodes, wherein the plurality of neighbor watch nodes are selected from the plurality of neighbor nodes, monitoring at least one selected from the group consisting of data sent by the target node and data received by the target node, using at least one of the plurality of neighbor watch nodes to obtain tracking information, and determining, using at least one the plurality of neighbor watch nodes, an action to perform using the tracking information and a response policy, wherein the action is specified in the response policy, wherein the distributed system implements an overlay network for message delivery.
REFERENCES:
patent: 6112257 (2000-08-01), Mason et al.
patent: 6119143 (2000-09-01), Dias et al.
patent: 6263368 (2001-07-01), Martin
patent: 6327622 (2001-12-01), Jindal et al.
patent: 6405252 (2002-06-01), Gupta et al.
patent: 6484143 (2002-11-01), Swildens et al.
patent: 6553413 (2003-04-01), Leighton et al.
patent: 6587878 (2003-07-01), Merriam
patent: 6820133 (2004-11-01), Grove et al.
patent: 7111061 (2006-09-01), Leighton et al.
patent: 7483391 (2009-01-01), Xu et al.
patent: 2004/0078490 (2004-04-01), Anderson et al.
A. Adya, et al.; “Farsite: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment”; Proceedings of the 5thSymposium on Operating Systems and Design Implementation OSDI; Dec. 2002 (14 pages).
I. Clarke, et al.; “Freenet: A Distributed Anonymous Information Storage and Retrieval System”; Lecture Notes in Computer Science; 2000 (21 pages).
J. Kubiatowicz, et al.; “OceanStore: An Architecture for Global-Scale Persistent Storage”; Proceedings of ACM ASPLOS; Nov. 2000 (12 pages).
A. Rowstron, et al.; “Storage Management and Caching in PAST, a Large-Scale, Peristent Peer-to-Peer Storage Utility”; Symposium on Operating Systems Principles; Oct. 2001 (13 pages).
S. Quinlan, et al.; “Venti: A New Approach to Archival Storage”; Proceedings of the FAST 2002 Conference on File and Storage Technologies; First USENIX Conference on File and Storage Technologies; Jan. 2002 (14 pages).
A. Muthitacharoen, et al.; “Ivy: A Read/Write Peer-to-Peer File System”; Proceedings of the 5thUSENIX Symposium on Operating Systems Design and Implementation (OSDI '02); Dec. 2002 (23 pages).
F. Dabek, et al.; “Towards a Common API for Structured Peer-to-Peer Overlays”; Proceedings of 2ndInternational Workshop on Peer-to-Peer Systems (IPTPS '03), Feb. 2003 (11 pages).
I. Stoica, et al.; “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications”; Proceedings of the SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications; Aug. 2001 (12 pages).
B. Zhao, et al.; “Tapestry: A Resilient Global-Scale Overlay for Service Deployment”; IEEE Journal on Selected Areas in Communications; Jan. 2004 (15 pages).
A. Rowstron, et al.; “Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems”; Lecture Notes in Computer Science; 2001 (22 pages).
C. Greg Plaxton, et al.; “Accessing Nearby Copies of Replicated Objects in a Distributed Environment”; ACM Symposium on Parallel Algorithms and Architectures, Jun. 1997 (23 pages).
M. Castro, et al.; “Practical Byzantine Fault Tolerance”; Symposium on Operating Systems Design and Implementation; Feb. 1999 (14 pages).
D. B. Terry, et al.; “Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System”; Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles; Dec. 1995 (12 pages).
D. Boneh, et al.; “Efficient Generation of Shared RSA Keys”; Journal of the ACM; 2001 (21 pages).
Y. Frankel, et al.; “Robust Efficient Distributed RAS-Key Generation”; Proc. 30thAnnual ACM Symposium on Theory of Computing (STOC); May 1998 (10 pages).
Caronni Germano
Rom Raphael J.
Scott Glenn Carter
El-chanti Hussein
Osha • Liang LLP
Sun Microsystems Inc.
LandOfFree
Method and apparatus for monitoring a node in a distributed... 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 and apparatus for monitoring a node in a distributed..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for monitoring a node in a distributed... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4067925