<< NL_R_FloodIteration NL_R: Routing NL_R_FloydWarshall >>

NARVAL >> NL_R: Routing > NL_R_FloodRT

NL_R_FloodRT

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

Calling Sequence

[R] = NL_R_FloodRT(G,T)

Arguments

G :

Graph.

T :

Flood Time-To-Live.

R :

Routing table.

Description

NL_R_FloodRT 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 R. 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 R provides each path length.

Examples

n=50;//network size
l=1000;//network squared area side
d=100;//Locality radius
[g]=NL_T_LocalityConnex(n,l,d);//generation of a topology
ind=1;//window index
f=NL_G_ShowGraphN(g,ind);//graph visualization
TTL=10;//Flood Time-To-Live
[rt]=NL_R_FloodRT(g,TTL)//application of NL_R_FloodRT

Dependency

NL_R_Flood, NL_F_ReverseVector

Report an issue
<< NL_R_FloodIteration NL_R: Routing NL_R_FloydWarshall >>