Perform the normalized congestion map of a network topology described by a routing table.
[np,nd] = NARVAL_R_CongestionMap(r,n,ns)
routing table.
network size.
sampling value.
vector of probabilities to cross each node i by a random shortest path stored in the routing table.
normalized congestion map.
NARVAL_R_CongestionMap constructs the normalized congestion map nd 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 np(i) provides the probability that a random shortest path crosses the node i. np is normalized as min(np)-->1 and max(np)-->ns. As a consequence ns congestion states can be separated.
Dr. Foued Melakessou
Research Associate
Interdisciplinary Centre for Security, Reliability and Trust
Room F106
University of Luxembourg
6, rue Coudenhove Kalergi
L-1359 Luxembourg-Kirchberg
E-mail: foued.melakessou@uni.lu
Tel: (+352) 46 66 44 5346