Increasing Resilience of a Network Service
First Claim
1. A method comprising:
- obtaining a set of data 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 being represented as edges in the graph;
finding a first subset of the set of hardware nodes, 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 comprising at least one of node failures and edge failures; and
ranking the hardware nodes in the first subset based on expected resiliency, to obtain a ranked list.
1 Assignment
0 Petitions
Accused Products
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.
27 Citations
20 Claims
-
1. A method comprising:
-
obtaining a set of data 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 being represented as edges in the graph; finding a first subset of the set of hardware nodes, 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 comprising at least one of node failures and edge failures; and ranking the hardware nodes in the first subset based on expected resiliency, to obtain a ranked list. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A computer program product comprising a tangible computer readable recordable storage medium including computer usable program code, the computer program product including:
-
computer usable program code for obtaining a set of data 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 being represented as edges in the graph; computer usable program code for finding a first subset of the set of hardware nodes, 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 comprising at least one of node failures and edge failures; and computer usable program code for ranking the hardware nodes in the first subset based on expected resiliency, to obtain a ranked list. - View Dependent Claims (13, 14, 15)
-
-
16. An apparatus comprising:
-
a memory; and at least one processor, coupled to the memory, and operative to; obtain a set of data 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 being represented as edges in the graph; find a first subset of the set of hardware nodes, 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 comprising at least one of node failures and edge failures; and rank the hardware nodes in the first subset based on expected resiliency, to obtain a ranked list. - View Dependent Claims (17, 18, 19)
-
-
20. An apparatus comprising:
-
means for obtaining a set of data 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 being represented as edges in the graph; means for finding a first subset of the set of hardware nodes, 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 comprising at least one of node failures and edge failures; and means for ranking the hardware nodes in the first subset based on expected resiliency, to obtain a ranked list.
-
Specification