The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Oct. 21, 2014

Filed:

Jun. 29, 2009
Applicants:

Dipyaman Banerjee, New Delhi, IN;

Venkateswara R Madduri, New Delhi, IN;

Mudhakar Srivatsa, White Plains, NY (US);

Inventors:

Dipyaman Banerjee, New Delhi, IN;

Venkateswara R Madduri, New Delhi, IN;

Mudhakar Srivatsa, White Plains, NY (US);

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 3/00 (2006.01); G06F 9/00 (2006.01); G06F 17/00 (2006.01); H04L 12/24 (2006.01); H04L 12/26 (2006.01);
U.S. Cl.
CPC ...
H04L 41/12 (2013.01); H04L 41/22 (2013.01); H04L 43/10 (2013.01);
Abstract

A set of data is obtained, representing a graph of a computer network having a set of hardware nodes and a set of hardware links between the hardware nodes. The hardware links are represented as edges in the graph. A first subset (for example, a vertex cut set) of the set of hardware nodes is found, such that those of the hardware nodes in the first subset are able to withstand a maximum number of failures before the graph disconnects. The failures include node failures and/or edge failures. The hardware nodes in the first subset are ranked based on expected resiliency, to obtain a ranked list. Optionally, in case of a tie between two or more of the hardware nodes in the ranked list, the tie is broken using a sum of shortest path metric.


Find Patent Forward Citations

Loading…