Discovering and grouping application endpoints in a network environment
AssigneeCisco Technology, Inc.
InventorsSachin Waman Danait, Kannan Ponnuswamy, Paul John Lesiak
Life of this patent
Estimating the term…
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.
Claims20
A method comprising:
- sorting endpoints into a peer relationship matrix;
- selecting a first endpoint of the endpoints sorted in the peer relationship matrix;
- comparing, the endpoints in the peer relationship matrix with the first endpoint;
- and
- in response to an endpoint of the endpoints in the peer relationship matrix having an affinity with the first endpoint greater than an affinity threshold, grouping the endpoint in an endpoint group with the first endpoint and removing the endpoint from the peer relationship matrix.
A system comprising:
- at least one processor;
- and
- at least one memory storing instructions, which when executed by the at least one processor, causes the at least one processor to:
- sort endpoints into a peer relationship matrix;
- select a first endpoint of the endpoints sorted in the peer relationship matrix;
- compare, the endpoints in the peer relationship matrix with the first endpoint;
- and
- in response to an endpoint of the endpoints in the peer relationship matrix having an affinity with the first endpoint greater than an affinity threshold, group the endpoint in an endpoint group with the first endpoint and remove the endpoint from the peer relationship matrix.
At least one non-transitory computer readable medium storing instructions, which when executed by at least one processor, causes the at least one processor to:
- sort endpoints into a peer relationship matrix;
- select a first endpoint of the endpoints sorted in the peer relationship matrix;
- compare, the endpoints in the peer relationship matrix with the first endpoint;
- and
- in response to an endpoint of the endpoints in the peer relationship matrix having an affinity with the first endpoint greater than an affinity threshold, group the endpoint in an endpoint group with the first endpoint.
Dependencies are inferred from the claim text.