[1.12 MB]
Source code archive
===============================================================================================================================================================================================================
Changelogs v1.2
===============================================================================================================================================================================================================
* Addition of the file changelogs.txt that summarizes all modifications between
each NARVAL version, and its predecessor.
* Correction of typo errors on the example provided for each function.
* NARVAL_G_Save_graph, NARVAL_R_SearchEndW (distribution vector),
NARVAL_R_SearchStartW (distribution vector) have been updated.
* Addition of new functions:
NARVAL_G_Assortativity
NARVAL_G_AvgDistance
NARVAL_G_AvgNeighborConn
NARVAL_G_AvgNodeDegree
NARVAL_G_Betweenness
NARVAL_G_Coreness
NARVAL_G_Distance
NARVAL_G_InternLinks
NARVAL_G_kCore
NARVAL_G_LocalClustering
NARVAL_G_MaxNodeDegree
NARVAL_G_MLClustering
NARVAL_G_RichClubConnect
NARVAL_R_NodeInPaths
===============================================================================================================================================================================================================
Changelogs v1.1
===============================================================================================================================================================================================================
* The quantity of input (rhs) and output (lhs) parameters is now checked for
each function. If users don't provide the right numbers of parameters, each
function generates an error message and display the correct syntax.
* The file '/demos/Routing_Table_100.dat' has been updated.
* Due to the previous dependency on Metanet, the weight (length) of edges of a
graph 'g' used for the path calculation is now stored in 'g.edge_length'. It was
previously stored in 'g.edges.data.length'. As a consequence some functions have
been updated in order to consider this modification:
NARVAL_R_EroutingTable
NARVAL_R_BellmanFord
NARVAL_R_Dijkstra
NARVAL_R_FloydWarshall
NARVAL_R_MPathDijkstra
NARVAL_R_PathWeightMod
NARVAL_R_SearchDistance
* Some functions display a waiting bar during their performance. It seems that
there is an issue with the command 'winclose(winId);' in the current release
5.3.3. For that reason, all these commands have been changed to comments in the
source code. As a consequence, users need to manually close the waiting bars
generated by these functions. This issue has been already mentioned to Scilab
developers.
*Several function have an example that is based on files stored in the module
folder '/demos/'. The path is now automatically generated in respect with the
location where NARVAL is installed:
NARVAL_R_ERoutingTable
NARVAL_R_FloydWarshall
NARVAL_R_FloydWarshallP
NARVAL_R_MPathDijkstra
NARVAL_R_MPathERT
NARVAL_R_PathERT
NARVAL_R_PathRT
NARVAL_R_PathWeightMod
NARVAL_R_RTPathPresence
NARVAL_R_ShortestRT
NARVAL_R_ShowPath
* Addition of new functions:
NARVAL_F_NARVALPath
NARVAL_F_RemovIndex
NARVAL_F_RemovIndexes
NARVAL_G_AddEdges
NARVAL_G_AddNodes
NARVAL_G_AdjacencyMatrix
NARVAL_G_CenterERT
NARVAL_G_DeleteEdges
NARVAL_G_DeleteNodes
NARVAL_G_DiameterERT
NARVAL_G_EccentricityERT
NARVAL_G_Edge2Nodes
NARVAL_G_EdgeDataFields
NARVAL_G_EdgeNumber
NARVAL_G_EdgesOfNode
NARVAL_G_GraphSize
NARVAL_G_LoadGraph
NARVAL_G_OriginalGraph
NARVAL_G_NodeDataFields
NARVAL_G_NodeNumber
NARVAL_G_Nodes2Edge
NARVAL_G_PeripheryERT
NARVAL_G_RadiusERT
NARVAL_G_SaveGraph
NARVAL_G_ShowEdges
NARVAL_G_ShowNodes
NARVAL_G_SplitEdge
NARVAL_G_Union
NARVAL_G_VisParMod
NARVAL_T_UploadTopology
===============================================================================================================================================================================================================
Changelogs v1.0
===============================================================================================================================================================================================================
* First release of the module NARVAL
This module is dedicated to network topology generation and routing analysis. It
has been designed at the University of Luxembourg within the Interdisciplinary
Centre for Security, Reliability and Trust (Snt). The Centre carries out
interdisciplinary research and graduate education in secure, reliable, and
trustworthy ICT systems and services
(http://wwwfr.uni.lu/interdisciplinary_centre_for_security_reliability_and_trust).
This work was carried out as a part of the European Project BUTLER
(http://www.iot-butler.eu/).
This module is an updated version of the toolbox Network Topology Generator NTG
3.0 that run on previous version Scilab 4.1.2 until release 5.2.1. NTG depends
on the graph module METANET, that has been removed from ATOMS in the current
release 5.3.3. As a consequence the new module NARVAL Network Analysis and
Routing eVALuation (NARVAL) has been developed in order to provide to its users
an independent and self-sufficient toolbox. NARVAL is running on the current
release Scilab 5.3.3.
New functionalities have been added in order to enrich the capabilities of the
module. Basic graph functions used from METANET have been implemented, and all
dependencies have been removed. NARVAL 1.0 permits to generate random topologies
in order to study the impact of routing algorithms on the effectiveness of
transmission protocols used by data communications. Random scenario closed to
the actual Internet can be simulated. First random topologies can be generated
in respect with the latest accurate models known as Barabasi-Albert, Locality,
Waxman, and Hierarchic M-Level (NARVAL_T_Ntg). Thereafter many path algorithms
have been implemented in order to calculate routes between network nodes as
Bellman-Ford, Dijkstra, Flood, BFS, DFS, Prim, and Floyd-Warshall. Moreover
basic statistics as Node Degree Distribution, Joint Degree Distribution and
Congestion map can also be calculated directly on the generated graphs. Mobility
of nodes has also be included in this release (Random Way Point model on free
space and movement constraints as roads in Vehicular Network). The mains goal
relies on the analysis of the global connectivity of Mobile Ad hoc Networks
(MANETs). In fact the topology of a MANET is in a constant change due to the
mobility of nodes. New functions permit to measure the impact of Ah doc network
protocols on the effectiveness of connections between mobile nodes. Recent works
suggest for example to use multiple paths algorithms in order to improve the
data traffic behavior. In fact route diversity aims to avoid local congestion
phenomenons and reduce the traffic variability. New functions permits also to
study the efficiency of a topology discovery according to different research
approaches. The main goal is to build a topology map from a discovery process
starting from single or multiple sources.
NARVAL 1.0 includes the following functions:
NARVAL_D_RecDijkstra
NARVAL_D_RecDijkstraA
NARVAL_D_RecDijkstraMM
NARVAL_D_RecDijkstraMS
NARVAL_D_RecDijkstraNS
NARVAL_F_AleaInitFin
NARVAL_F_AleaNombre
NARVAL_F_AleaVec
NARVAL_F_Delet
NARVAL_F_DiffVectors
NARVAL_F_Distance
NARVAL_F_NARVALPath
NARVAL_F_RandDist
NARVAL_F_Random
NARVAL_F_Random_i_j
NARVAL_F_RandWtRepl
NARVAL_F_Remov
NARVAL_F_RemovIndex
NARVAL_F_RemovIndexes
NARVAL_F_RVector
NARVAL_F_Unity
NARVAL_F_XYRand
NARVAL_G_BriteToSci
NARVAL_G_CirclePlace
NARVAL_G_Connex
NARVAL_G_DeleteEdges
NARVAL_G_DeleteNodes
NARVAL_G_DisplayGraph
NARVAL_G_Edge2Nodes
NARVAL_G_EdgeDataFields
NARVAL_G_EdgeLength
NARVAL_G_EdgesOfNode
NARVAL_G_GraphConnex
NARVAL_G_GraphConnexInd
NARVAL_G_GraphDegDist
NARVAL_G_GraphDegDistWD
NARVAL_G_GraphInit
NARVAL_G_GraphSize
NARVAL_G_JDD
NARVAL_G_LayerPlacement
NARVAL_G_LoadGraph
NARVAL_G_LongueurArc
NARVAL_G_MakeGraph
