<< NL_R_BellmanFordRT NL_R: Routing NL_R_CongestionSinkFlood >>

NARVAL >> NL_R: Routing > NL_R_CongestionMap

NL_R_CongestionMap

Perform the normalized congestion map of a network topology described by a routing table.

Calling Sequence

[P,D] = NL_R_CongestionMap(R,N,S)

Arguments

R :

Routing table.

N :

Network size.

S :

Sampling value.

P :

Vector of probabilities to cross each node by a random shortest path stored in the routing table.

D :

Normalized congestion map.

Description

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.

Examples

n=80;//network size
L=1000;//network square area side
dmax=100;//Locality radius
[g]=NL_T_LocalityConnex(n,L,dmax);//generation of a topology in respect with the Locality method
r=NL_R_DijkstraRT(g);//performance of its routing table
n=g.node_number;//quantity of nodes
ns=10;//sampling value
[np,nd]=NL_R_CongestionMap(r,n,ns)//application of NL_R_CongestionMap
g.node_border=nd'+5;//nodes parameters
ind=1;//window index
f=NL_G_ShowGraphN(g,ind);//graph visualization

Report an issue
<< NL_R_BellmanFordRT NL_R: Routing NL_R_CongestionSinkFlood >>