Multiplex communications – Diagnostic testing
Reexamination Certificate
2011-08-02
2011-08-02
Pezzlo, John (Department: 2465)
Multiplex communications
Diagnostic testing
C370S252000, C370S254000, C370S386000
Reexamination Certificate
active
07990878
ABSTRACT:
A computer system (2) is provided which is arranged to receive network data (1) identifying nodes and links between nodes. The computer system (2) processes the input network data (1) to utilise the network topology to identify nodes and links having high importance for network integrity. A report (4) identify the critical components can then be output.
REFERENCES:
patent: 5748844 (1998-05-01), Marks
patent: 6038390 (2000-03-01), Sofman
patent: 6065063 (2000-05-01), Abali
patent: 6167492 (2000-12-01), Keller et al.
patent: 6229791 (2001-05-01), Nusekabel et al.
patent: 6437804 (2002-08-01), Ibe et al.
patent: 6677861 (2004-01-01), Henry et al.
patent: 7466663 (2008-12-01), Young et al.
patent: 2005/0262050 (2005-11-01), Fagin et al.
patent: 2006/0069667 (2006-03-01), Manasse et al.
patent: 2006/0095416 (2006-05-01), Barkhin et al.
patent: 2006/0143197 (2006-06-01), Kaul et al.
patent: 2008/0071773 (2008-03-01), Gross
patent: 2010/0129078 (2010-05-01), Weston-Dawkes et al.
patent: 0 507 110 (1992-10-01), None
patent: 0 637 153 (1995-02-01), None
patent: 0652 665 (1995-05-01), None
patent: 0 887 749 (1998-12-01), None
patent: 0637153 (2001-10-01), None
patent: 1 158 447 (2001-11-01), None
patent: WO 0193504 (2001-12-01), None
patent: WO 0197463 (2001-12-01), None
Zien et al., Identification of Drug Target Proteins, ERCIM News, Oct. 2000, No. 43 (Internet).
European Search Report, Jan. 14, 2009.
Schroeder, M. A., et al, “Enhanced network survivability through balanced resource criticality”, Oct. 15, 1989, pp. 682-687.
Noakes, M. D., et al., “An adaptive link assignment algorithm for dynamically changing topologies”, Oct. 23, 1988, pp. 683-689.
Van Helden, J., et al., “Representing and analysing molecular and cellular function using the computer”, Biol. Chem., vol. 381 Sep./Oct. 2000, pp. 921-935.
Dogan, A. et al., “Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing”, IEEE Transactions on Parallel and Distributed Systems, vol. 13, No. 3, Mar. 2002, pp. 308-323.
Tarjan, R., “Depth-first search and linear graph algorithms”, Switching and Automata Theory, 1971. 12th Annual Symposium on, IEEE, Piscataway, NJ, USA, Oct. 13, 1971, pp. 114-121.
Vilar, J., “Minimal cuts up to third order in a planar graph”, IEEE Transactions on Reliability, vol. R-33, No. 3 Aug. 1984, pp. 250-256.
Zien, et al., “Identification of drug target proteins”, ERCIM News No. 43, Oct. 2000, pp. 1-3.
European Search Report for related EP Application No. 09172242.1-2416, Jan. 19, 2010, 7 pages.
European Search Report for related EP Application No. 09172247.0-24162157734, Apr. 8, 2010, 9 pages.
Meghabghab, “Discovering Authorities and hubs in different topological web graph structures”, Information Processing & Management, Elsevier, Barking, GB, vol. 38, No. 1, Jan. 1, 2002, pp. 111-140.
Gazandam, et al., “Statistical Clustering In The Design Of Logical Topologies For Wide-Area Optical Networks”, IEEE Africon Conference In Africa, vol. 1, Oct. 2, 2002, pp. 209-210.
EP Partial Search Report for EP 10164987.9-2414, Mar. 1, 2011, 6 pgs.
Andras Peter E.
O'Neill Mark A.
Young Malcolm P.
Brooks Cameron & Huebsch PLLC
E-Therapeutics PLC
Pezzlo John
LandOfFree
Identifying components of a network having high importance... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Identifying components of a network having high importance..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Identifying components of a network having high importance... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2730678