<< NARVAL_R_BellmanFord NARVAL NARVAL_R_ConnNeighbor >>

NARVAL >> NARVAL > NARVAL_R_CongestionMap

NARVAL_R_CongestionMap

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

Calling Sequence

[np,nd] = NARVAL_R_CongestionMap(r,n,ns)

Parameters

r :

routing table.

n :

network size.

ns :

sampling value.

np :

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

nd :

normalized congestion map.

Description

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.

Examples

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

Authors

Foued Melakessou

Contact

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

Home Page


<< NARVAL_R_BellmanFord NARVAL NARVAL_R_ConnNeighbor >>