<< Related EU Project NARVAL NARVAL_D_RecDijkstra >>

NARVAL >> NARVAL > NARVAL Project

NARVAL Project

Network Analysis and Routing eVALuation Module

Acknowledgment

This research work was supported by the European FP7 project BUTLER, under contract no. 287901.

Copyright

Dr. Foued Melakessou

2011-2012 - Snt

2009-2010 - Snt/University of Luxembourg

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.

Description

NARVAL has been designed on top of the Scilab environment. It has been created 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 module is focusing on the analysis of network protocols. The main goal of this toolbox is to provide a complete software environment enabling the understanding of available communication algorithms, but also the design of new schemes. NARVAL permits to generate random topologies in order to study the impact of routing algorithms on the effectiveness of transmission protocols used by data communications The target audience includes academics, students, engineers and scientists. We put some efforts to build detailed help files. The description of each function has been carefully done in order to facilitate the end users' comprehension.The module is self-sufficient as it does not depend on other internal/extrenal scilab toolboxes. NARVAL is running on the current release Scilab 5.3.3. We decided to create a specific classification according to the goal of each function:

This list is not fixed. It will evolve with the addition of new functions on a regular basis in order to enrich the capabilities of NARVAL. In order to work on network algorithms, users must be able to generate some topologies composed by nodes and links. To achieve this task, we released a set of functions belonging to the subset NARVAL_T_*. Thus users can create their own topologies in respect with many approaches from pure random topologies to structured grids. Each topology can therafter be transformed after graph modifications already included within the graph subset NARVAL_G_*. Indeed basic operations such as node/link-insertion/deletion, graph union and also the performance of general graph metrics, are handled. NARVAL_F_* gathers all mathematical functions such as random generators. Routing algorithms can be found in NARVAL_R_* such as Bellman-Ford, Dijkstra, Flood, BFS, DFS, Prim, and Floyd-Warshall algorithms. They aim at performing the shortest path or multipath between two network nodes in respect with the definition of specific objective functions based on distance, delay, number of hops, etc. We also released a set of functions (NARVAL_M_*) that consider mobility of nodes in simulations. As a matter of couse, the global network connectivity will be directly affected by the mobility models that govern the nodes' displacements. We also provide a set of functions focusing on the discovery of a network topology from a single source or multiple nodes. This approach is similar to Traceroute commands that enable the discovery of paths within a network. Peer-to-Peer is also tackled within NARVAL_P_*, with functionalities such as overlay node selection, anonymization, information slicing, etc. We also released functions related to security in NARVAL_S_*, with the performance of encrytion keys, RSA, etc. Wireless sensor network can be analyzed with NARVAL_W_* that permits to assign optimal channels, to select aggregation nodes, etc. New algorithms are under studies and will be released in future versions of NARVAL.

Collaborators

Dr. Foued Melakessou, Research Associate, SnT

Prof.Dr. Thomas Engel, SnT vice-director, SnT

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


<< Related EU Project NARVAL NARVAL_D_RecDijkstra >>