Electrical computers and digital processing systems: multicomput – Computer network managing
Reexamination Certificate
2011-06-14
2011-06-14
Dharia, Rupal D (Department: 2455)
Electrical computers and digital processing systems: multicomput
Computer network managing
C370S254000
Reexamination Certificate
active
07962595
ABSTRACT:
A method, apparatus and computer-program product for determining the status of a connection among a plurality of elements in a distributed system is disclosed. The method comprising the steps of determining an initial configuration of the connections among selected ones of the plurality of elements as a relationship of one of said selected elements to another of said elements, wherein at least one of said relationships is associated with a root element of an associated connection, responsive to a stimulus, determining a second configuration of the connections among the selected elements, determining a current condition of the connections among the selected elements is based on at least the second configuration; and providing an indication when at least a significant change has occurred. The device discloses, in one aspect, a processor executing code for implementing the method steps described and the computer product providing code to a processor for implementing the method steps described.
REFERENCES:
patent: 4555781 (1985-11-01), Baldry et al.
patent: 5084816 (1992-01-01), Boese et al.
patent: 5430729 (1995-07-01), Rahnema
patent: 5491690 (1996-02-01), Alfonsi et al.
patent: 5606669 (1997-02-01), Bertin et al.
patent: 5914939 (1999-06-01), Serkowski
patent: 5941955 (1999-08-01), Wilby et al.
patent: 6061735 (2000-05-01), Rogers
patent: 6122664 (2000-09-01), Boukobza et al.
patent: 6219739 (2001-04-01), Dutt et al.
patent: 6330229 (2001-12-01), Jain et al.
patent: 6400681 (2002-06-01), Bertin et al.
patent: 6654802 (2003-11-01), Oliva et al.
patent: 6781960 (2004-08-01), Charas
patent: 7239618 (2007-07-01), La Porta et al.
patent: 7680031 (2010-03-01), Luft et al.
patent: 7725859 (2010-05-01), Lenahan et al.
patent: 7778970 (2010-08-01), Caronni et al.
patent: 2001/0021177 (2001-09-01), Ishii
patent: 2001/0034853 (2001-10-01), Takatama et al.
patent: 2002/0067693 (2002-06-01), Kodialam et al.
patent: 2002/0147800 (2002-10-01), Gai et al.
patent: 2003/0165117 (2003-09-01), Garcia-Luna-Aceves et al.
patent: 2003/0193959 (2003-10-01), Lui et al.
patent: 2004/0047300 (2004-03-01), Enomoto et al.
patent: 2004/0076164 (2004-04-01), Vanderveen et al.
patent: 2004/0153568 (2004-08-01), Ho et al.
patent: 2004/0156310 (2004-08-01), Fredette et al.
patent: 2004/0160904 (2004-08-01), Enomoto et al.
patent: 2004/0221027 (2004-11-01), Parrott
patent: 2005/0083834 (2005-04-01), Dunagan et al.
patent: 2005/0114551 (2005-05-01), Basu et al.
patent: 2005/0254429 (2005-11-01), Kato et al.
patent: 2006/0071684 (2006-04-01), Schwarz et al.
patent: 2006/0101214 (2006-05-01), Mikami
patent: 2006/0104210 (2006-05-01), Nielsen
patent: 2006/0133366 (2006-06-01), Ho et al.
patent: 2006/0136931 (2006-06-01), Sever et al.
patent: 2007/0189165 (2007-08-01), Johnson et al.
patent: 2007/0286087 (2007-12-01), Compton et al.
patent: 2008/0137580 (2008-06-01), Axelsson et al.
patent: 2008/0316917 (2008-12-01), Farkas et al.
IEEE Standard 802.1D, Local and metropolitan area networks—Media Access Control (MAC) Bridges (Jun. 2004).
IEEE Standard 802.1w-2001 Local and metropolitan area networks—Part 3: Media Access Control (MAC) Bridges—Amendment 2: Rapid Reconfiguration (Jul. 2001).
Managing Your Network with HP OpenView Network Node Manager, Hewlett-Packard Company (Nov. 1998).
R. Sedgewick, Algorithms in C++. Parts 1-4 Addison Wesley, Third Edition, Fundamentals, Data Structures, Sorting, Searching (1998).
R. Sedgewick,Algorithms in Java, Third Edition, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching (2002).
R. Sedgewick—Case Study—Union Find—java code (2002) UnionFind java code—http://www.cs.princeton.edu/algs4/15uf/UF.java.html.
Galil & Italiiano, Data Structures and Algorithms for Disjoint Set Union Problems, ACM Computing Surveys, vol. 23, No. 2, Sep. 1991, p. 319-344.
Galil & Italiano Fully Dynamic Algorithms for Edge Connectivity Problems, Annual ACM Symposium on Theory of Computing Proceedings of the twenty-third annual ACM symposium on Theory of computing (1991).
Roditty & Zwick, “A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time”, ACM 1-58113-852-0/04/0006 (2004), pp. 184-191.
Roditty & Zwick, Improved dynamic reachability algorithms for directed graphs, The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02), Vancouver, BC, CA (2002).
Roditty & Zwick, On Dynamic Shortest Paths Problems, ESA 2004 Lecture Notes in Computer Science, 2004, vol. 3221/2004.
Nardelli et al , Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures, Algorithmica (2004) 40:119-132.
R. Sedgewick, Algorithms in Java, Fundamentals, data structures, sorting, searching (2003).
D'Angelo Joseph
Dharia Rupal D
EMC Corporation
Gupta Krishnendu
Shaw Robert
LandOfFree
Method and apparatus for diagnosing host to storage data... 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 diagnosing host to storage data..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for diagnosing host to storage data... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2653764