US 12,088,589 B2
Method, system, and computer program product for controlling access in a network of servers
Shankar Narayanan Viswanathan, Newark, CA (US); Dilip Shekhar, Palo Alto, CA (US); and Whitney LaRose Nelson, Atlanta, GA (US)
Assigned to Visa International Service Association, San Francisco, CA (US)
Appl. No. 17/432,956
Filed by VISA INTERNATIONAL SERVICE ASSOCIATION, San Francisco, CA (US)
PCT Filed Apr. 18, 2019, PCT No. PCT/US2019/028088
§ 371(c)(1), (2) Date Aug. 23, 2021,
PCT Pub. No. WO2020/214175, PCT Pub. Date Oct. 22, 2020.
Prior Publication US 2022/0182386 A1, Jun. 9, 2022
Int. Cl. H04L 9/40 (2022.01); G06Q 20/16 (2012.01); G06Q 20/38 (2012.01)
CPC H04L 63/10 (2013.01) [G06Q 20/16 (2013.01); G06Q 20/3829 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method for controlling access in a network of servers, each server associated with at least one account, comprising:
generating, with at least one processor, a set of nodes comprising a node for each account of each server of a network of servers, wherein each account is associated with an application having an application criticality rating;
for each respective node of the set of nodes, determining, with at least one processor, at least one other node of the set of nodes having credential-free access to the respective node;
for each respective node of the set of nodes, generating, with at least one processor, an edge connecting the respective node to each of the at least one other node of the set of nodes having credential-free access to the respective node, the set of nodes and the edges comprising a graph;
determining, with at least one processor, a weight for each edge based on a number of users associated with the account of the at least one other node, wherein determining the weight for each edge comprises determining the weight for each edge further based on at least one of the application criticality rating of the application associated with the account of the respective node, the application criticality rating of the application associated with the account of the at least one other node, or any combination thereof;
for at least one first node of the set of nodes, determining, with at least one processor, at least one second node of the set of nodes having indirect access to the at least one first node via a path of edges from the at least one second node through at least one of the at least one other node having credential-free access to the at least one first node; and
for each respective second node of the at least one second node, determining, with at least one processor, a weight of the path of edges between the respective second node and the at least one first node based on the weight of each edge of the path of edges.