Perform the distance distribution of a graph.
[D] = NARVAL_G_Distance(ERT)
enhanced routing table.
distance distribution.
NARVAL_G_Distance performs the distance distribution D of the graph g in respect with its enhanced routing table ERT. ERT stores all paths between any couple of distinct nodes within the network. ERT 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]). D provides the probability D(x) for a random pair of nodes to be at a distance x hops from each other.
[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 [D]=NARVAL_G_Distance(rt1);//application of NARVAL_G_Distance plo=1;//window index scf(plo);//graph visualization clf(plo); f=gcf(); f.figure_name="NARVAL_G_Distance"; plot2d3(1:length(D),D,rect=[0 0 length(D) 1]); plot2d(1:length(D),D,rect=[0 0 length(D) 1],style=5); xtitle('Distance Distribution','Distance','Frequency'); | ![]() | ![]() |
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