<< NARVAL_R_TDijkstra NARVAL NARVAL_R_TreeExtraction >>

NARVAL >> NARVAL > NARVAL_R_TFlood

NARVAL_R_TFlood

Perform the routing table of a topology in respect with the Flood algorithm.

Calling Sequence

[rt] = NARVAL_R_TFlood(g,TTL)

Parameters

g :

network graph.

TTL :

Flood Time-To-Live.

rt :

routing table.

Description

NARVAL_R_TFlood computes the shortest paths between all couples of distinct network nodes of the graph g composed by n nodes in respect with the Flood algorithm.

The paths are stored in the routing table matrix rt. Thus the route between the nodes i and j can be read at the line of index (i-1)*n+j. The first column of rt provides each path length.

Examples

n=50;//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;//window index
f=NARVAL_G_ShowNodesIndex(g,ind);//graph visualization
TTL=10;//Flood Time-To-Live
[rt]=NARVAL_R_TFlood(g,TTL);//application of NARVAL_R_TFlood 
rt

Dependency

NARVAL_R_Flood, NARVAL_F_RVector

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_TDijkstra NARVAL NARVAL_R_TreeExtraction >>