Add node ranking section (#496)

kiali · Dec 15, 2021 · 88d8047 · 88d8047
1 parent bb6c7cf
commit 88d8047
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 0 deletions.
diff --git a/content/en/docs/Features/topology.md b/content/en/docs/Features/topology.md
@@ -63,6 +63,14 @@ TCP traffic is represented by offset circles where the speed of the circles indi
 
 ![Topology graph animation](/images/documentation/features/topology-graph-node-animation.gif)
 
+### Ranking
+
+Nodes can be ranked in the graph based on pre-defined criteria such as 'number of inbound edges'. Combined with the find/hide feature, this allows you to quickly highlight or filter for important workloads, services, and applications.
+
+Rankings are normalized to fit between 1..100 and nodes may tie with each other in rank. Ranking starts at 1 for the top ranked nodes so when ranking nodes based on 'number of inbound edges', the node(s) with the most inbound edges would have rank 1. Node(s) with the second most inbound edges would have rank 2. Each selected criteria contributes equally to a node's ranking. Although 100 rankings are possible, only the required number of rankings are assigned, starting at 1.
+
+![Topology graph ranking](/images/documentation/features/topology-graph-ranking.png)
+
 ### Graph Types
 
 Kiali offers four different traffic-graph renderings:

diff --git a/static/images/documentation/features/topology-graph-ranking.png b/static/images/documentation/features/topology-graph-ranking.png