Detection of real time cyber-attacks
with the GVS beetweenness Centrality algorithm
GVS algorithm
Beetweenness Centrality algorithm
Using an innovative mathematical calculation approach in graphs that we have created, GVS is the only supplier to have developed a Beetweenness Centrality algorithm that is not based on the above-mentioned mathematical tools.
GVS algorithm
Key advantages
Immediate detection in the event of a cyber-attack
enabling the organization to halt the attack before it is hacked.
Exhaustive, permanent monitoring of networks
regardless of their size or density (no limits).
Significant outperformance of the alert response time of competitors
the GVS algorithm runs faster when the size and/or density of the network increases
BC calculations can be performed on ordinary small laptops
(on the market @€300).
GVS’s BC algorithm can be parallelized
Calculation running time is divided by the number of laptops used.
GVS’s BC algorithm can easily be implanted on CPU chips.
Sample cases
GVS versus Neo4j
Using a database provided by Stanford University containing a graph of 62 K nodes and 145 K links. (This database is issued of a real use case and could represent the network of a middle sized bank).
Calculation on the graph on a laptop from 1,000 start points need :
seconds
0
seconds
0
Calculation on the same graph from 62,000 start points,
hours
0
seconds
0