<< NARVAL_G_Distance NARVAL NARVAL_G_Edge2Nodes >>

NARVAL >> NARVAL > NARVAL_G_EccentricityERT

NARVAL_G_EccentricityERT

Return the eccentricity of all nodes inside a graph from its enhanced routing table.

Calling Sequence

[e] = NARVAL_G_EccentricityERT(ERT)

Parameters

ERT :

enhanced routing table.

e :

eccentricity vector.

Description

NARVAL_G_EccentricityERT computes the eccentricity vector e in respect with the graph 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]). The eccentricity of the node ni is the maximum distance between itself and all remaining nodes nj (WIKIPEDIA).

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
[e]=NARVAL_G_EccentricityERT(rt1);//application of NARVAL_G_EccentricityERT 
e

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_Distance NARVAL NARVAL_G_Edge2Nodes >>