<< NARVAL_G_CirclePlace NARVAL NARVAL_G_Connex >>

NARVAL >> NARVAL > NARVAL_G_ConnectionNeigh

NARVAL_G_ConnectionNeigh

Perform the 1-hop neighborhood of the shortest path between two network nodes in respect with a routing table.

Calling Sequence

[vs] = NARVAL_G_ConnectionNeigh(g,rt,nd,nf,n)

Parameters

g :

network graph.

rt :

routing table.

nd :

emission node.

nf :

destination node.

n :

network size.

vs :

1-hop neighborhood.

Description

NARVAL_G_ConnectionNeigh performs the 1-hop neighborhood vs of the shortest path between the two nodes nd and nf inside the network graph g of size n. rti corresponds to the ith routing table used to calculate the shortest path between the connection extremal nodes. rti stores all paths between any couple of distinct nodes within the network. rti can be generated with the application of NARVAL_R_ERoutingTable on routing tables created from NARVAL_R_TFlood, NARVAL_R_TDijkstra, or NARVAL_R_TBellmanFord. For a better convenience, we already generated a scenario whith the creation of a graph composed by 100 nodes. We have also performed 5 enhanced routing tables [rt1,rt2,rt3,rt4,rt5] providing multiple paths for each connection between two nodes. The route between the nodes i and j can be read at the line of index (i-1)*n+j where n represents the network size. Then for each path stored into a single line, its hop length can be found in the first column, followed by its length and finally the path composed by a list of nodes ([hop length | length | path]).

Examples

[path]=NARVAL_F_NARVALPath();//path to NARVAL module
path=path+'/demos/';//folder path
load(path+'RoutingTables_topo_100.dat','pt','rt1','rt2','rt3','rt4','rt5');//loading of the network routing tables
load(path+'topo_100.graph','g');//loading of the network graph
n=100;//network size
[nd,nf]=NARVAL_F_Random_i_j(n);//generation of connection extreme nodes
[vs]=NARVAL_G_ConnectionNeigh(g,rt1,nd,nf,n);//application of NARVAL_G_ConnectionNeigh
p=NARVAL_R_PathERT(rt1,nd,nf,n);//shortest path extraction between nd and nf
i1=1;//window index
[gr,f]=NARVAL_G_ShowNodes(g,vs,5,10,30,i1);
[pl]=NARVAL_G_Nodes2Path(p,g);
nl=length(gr.head);
ec=ones(1,nl);
ec(pl)=2;
eb=ones(1,nl);
eb(pl)=2;
gr.edge_width=eb;
gr.edge_color=ec;
NARVAL_G_ShowGraph(gr,i1);//graph visualization

Dependency

NARVAL_R_PathERT, NARVAL_G_NodeNeighbors

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_G_CirclePlace NARVAL NARVAL_G_Connex >>