The module Network Analysis and Routing eVALuation NARVAL 1.0 is a part of the
Copyright (c) Foued Melakessou
Copyright (c) 2011-2012 - Snt
Copyright (c) 2009-2010 - Snt/University of Luxembourg
Copyright (c) 2007-2009 - University of Luxembourg
Licence: This module must be used under the terms of the CeCILL. The terms are
also available at http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt.
Permission to use, copy, modify, and distribute this software for any purpose
without fee is hereby granted, provided that this entire notice is included in
all copies of any software which is or includes a copy or modification of this
software and in all copies of the supporting documentation for such software.
This software is being provided "as is", without any express or
implied warranty. In particular, the authors do not make any representation or
warranty of any kind concerning the merchantability of this software or its
fitness for any particular purpose.
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.
This work was carried out as a part of the European Project BUTLER.
This module is an updated version of the toolbox Network Topology Generator
NTG3.0 that run on previous version Scilab 4.1.2 until release 5.2.1. NTG3.0
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 module. 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 redesigned, 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
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
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.