Discovering and grouping application endpoints in a network environment
First Claim
Patent Images
1. A method executed by a network element in network environment, comprising:
- discovering endpoints communicating in a network environment;
calculating affinity between the discovered endpoints;
grouping the endpoints into separate endpoint groups (EPGs) according to the calculated affinity, each EPG comprising a logical grouping of similar endpoints for applying common forwarding and policy logic according to logical application boundaries, wherein grouping the endpoints comprises;
creating a peer relationship matrix comprising the discovered endpoints;
sorting the endpoints in the peer relationship matrix according to a total number of connected peers;
selecting a specific endpoint as a seed;
sequentially comparing affinity of the seed with other endpoints in the peer relationship matrix; and
grouping the other endpoints having affinity greater than a predetermined threshold into a same EPG as the seed; and
generating, using the grouped endpoints, application profiles, to allow for stateless network policy definition and enforcement free from dependencies on locality and forwarding.
1 Assignment
0 Petitions
Accused Products
Abstract
An example method for discovering and grouping application endpoints in a network environment is provided and includes discovering endpoints communicating in a network environment, calculating affinity between the discovered endpoints, and grouping the endpoints into separate endpoint groups (EPGs) according to the calculated affinity, each EPG comprising a logical grouping of similar endpoints for applying common forwarding and policy logic according to logical application boundaries. In specific embodiments, the affinity includes a weighted average of network affinity, compute affinity and user specified affinity.
-
Citations
17 Claims
-
1. A method executed by a network element in network environment, comprising:
-
discovering endpoints communicating in a network environment; calculating affinity between the discovered endpoints; grouping the endpoints into separate endpoint groups (EPGs) according to the calculated affinity, each EPG comprising a logical grouping of similar endpoints for applying common forwarding and policy logic according to logical application boundaries, wherein grouping the endpoints comprises; creating a peer relationship matrix comprising the discovered endpoints; sorting the endpoints in the peer relationship matrix according to a total number of connected peers; selecting a specific endpoint as a seed; sequentially comparing affinity of the seed with other endpoints in the peer relationship matrix; and grouping the other endpoints having affinity greater than a predetermined threshold into a same EPG as the seed; and generating, using the grouped endpoints, application profiles, to allow for stateless network policy definition and enforcement free from dependencies on locality and forwarding. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A non-transitory tangible media that includes instructions for execution, which when executed by a processor of a network element, is operable to perform operations comprising:
-
discovering endpoints communicating in a network environment; calculating affinity between the discovered endpoints; grouping the endpoints into separate EPGs according to the calculated affinity, each EPG comprising a logical grouping of similar endpoints for applying common forwarding and policy logic according to logical application boundaries, wherein grouping the endpoints comprises; creating a peer relationship matrix comprising the discovered endpoints; sorting the endpoints in the peer relationship matrix according to a total number of connected peers; selecting a specific endpoint as a seed; sequentially comparing affinity of the seed with other endpoints in the peer relationship matrix; and grouping the other endpoints having affinity greater than a predetermined threshold into a same EPG as the seed; and generating, using the grouped endpoints, application profiles, to allow for stateless network policy definition and enforcement free from dependencies on locality and forwarding. - View Dependent Claims (11, 12, 13)
-
-
14. An apparatus, comprising:
-
a collection engine; a grouping analysis module; a reporting module; a memory element for storing data; and discovering endpoints communicating in a network environment; calculating affinity between the discovered endpoints; grouping the endpoints into separate EPGs according to the calculated affinity, each EPG comprising a logical grouping of similar endpoints for applying common forwarding and policy logic according to logical application boundaries, wherein grouping the endpoints comprises; creating a peer relationship matrix comprising the discovered endpoints; sorting the endpoints in the peer relationship matrix according to a total number of connected peers; selecting a specific endpoint as a seed; sequentially comparing affinity of the seed with other endpoints in the peer relationship matrix; and grouping the other endpoints having affinity greater than a predetermined threshold into a same EPG as the seed; and generating, using the grouped endpoints, application profiles, to allow for stateless network policy definition and enforcement free from dependencies on locality and forwarding. - View Dependent Claims (15, 16, 17)
-
Specification