Perform the normalized congestion map of a network topology described by a routing table.
[P,D] = NL_R_CongestionMap(R,N,S)
Routing table.
Network size.
Sampling value.
Vector of probabilities to cross each node by a random shortest path stored in the routing table.
Normalized congestion map.
NL_R_CongestionMap constructs the normalized congestion map D that helps to distinguish the network nodes where the probability to face congestion phenomenon is high. These probabilities are connected to the occurence of each node i in all possible shortest routes over the network recorded on the routing table R. Thus P(i) provides the probability that a random shortest path crosses the node i. P is normalized as min(P)-->1 and max(P)-->S. As a consequence S congestion states can be separated.