<< NARVAL_D_RecDijkstraA NARVAL NARVAL_D_RecDijkstraMS >>

NARVAL >> NARVAL > NARVAL_D_RecDijkstraMM

NARVAL_D_RecDijkstraMM

Discover a topology in respect with successive routes extracted from multiple sources by the Dijkstra's algorithm. Nodes with a degree greater than 1 are considered as a part of the topology. The node degree is used in the normalization process.

Calling Sequence

[s,t,tn]=NARVAL_D_RecDijkstraMM(g,ns,w)

Parameters

g :

network graph.

ns :

quantity of network sources.

w :

window index.

s :

network sources.

t :

evolution of the quantity of the discovered nodes in the topology.

tn :

vector of discovered nodes.

Description

NARVAL_D_RecDijkstraMM discovers the network topology g in respect with the route extracted from ns randomly selected sources s by the Dijkstra's algorithm. Nodes with a degree greater than 1 are considered as a part of the topology. The others are the basic users. The normalized topology recovery metric rating d/D is performed. d is the current quantity of links already discovered and D corresponds to the total amount of topology links. This function is plotted with a normalized scale e.g. the sum of the degrees of network targets divided by the total network degree. Then the node degree is used in the normalization. An interesting feature lies on the slope of the curve tangent at the origin. In fact a larger value corresponds to the ability to discover the network topology in a faster way. The line i of t represents the quantity of known topology nodes from the discovery process that started from the node i. Targets are randomly selected inside the network. tn gathers the chronological order of the nodes discovery. The graph is plotted into the window w.

Examples

n=100;//network size
l=1000;//network squared area side
d=100;//Locality radius
[g]=NARVAL_T_LocalityConnex(n,l,d);//generation of a topology
ind=1
f=NARVAL_G_ShowGraph(g,ind);
ns=5;//quantity of sources
w=2;//window index
[s,t,tn]=NARVAL_D_RecDijkstraMM(g,ns,w);//application of NARVAL_D_RecDijkstraMM
s
t
tn

Dependency

NARVAL_G_GraphDegDistWD, NARVAL_F_RandWtRepl, NARVAL_F_RandWtRepl, NARVAL_F_Unity

Author

http://wwwen.uni.lu/interdisciplinary_centre_for_security_reliability_and_trust

Contact

<< NARVAL_D_RecDijkstraA NARVAL NARVAL_D_RecDijkstraMS >>