Network Traffic Simulator.
[buf,bufs,at,tt,it,sw,rt,routep,probch,pch] = NARVAL_I_NTS(g,rt1,rt2,rt3,rt4,rt5,pt,n,L,bs,tpmax,swmin,rtmin,rtmax,nd,nf,tlim,cpmax,ct,cs,cpt,closs,cack,T,pr,sa,Tr,iw)
network graph.
first routing table.
second routing table.
third routing table.
fourth routing table.
fifth routing table.
presence table.
network size.
network square area side.
buffer size.
maximal quantity of packets simultaneously stored inside the packet manager.
source node of the connection under studies.
source node of the connection under studies.
simulation duration.
maximal size of new connections.
connection type selection index.
size of the connection of interest.
packet type of the connection of interest.
modification factor of the route manager after a packet loss.
modification factor of the route manager after a packet acknowledgement.
periodicity of the creation beginning of new connections.
probability threshold.
boolean (display backup).
throughput factor.
buffer evolution of each emission network matrix.
buffer evolution of each emission network matrix.
arrival time process of the defined connection packets.
travel time process of the defined connection packets.
indexes vector of the defined connection packets.
sliding window process of the defined connection.
retransmission time process of the defined connection.
route process of the connection packets.
route manager change process.
route manager change process of the defined connection.
NARVAL_I_NTS simulates data communications on a network graph. A Point-to-Point connection between the nodes ne and nr is studied. The traffic is propagated on two networks. The emission matrix is responsible of the creation of new connections. In this matrix, each node stores packets that need to be transfered on the real network. Thereafter packets are sent on the reception network where they are routed in order to reach their destination. NARVAL_I_NTS permits to analyse the interaction between the network topology, the user demand and the routing algorithms.
stacksize(50000000); [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 load(path+'topo_100.graph','g');//loading of the network graph n=length(g.node_x);//network size L=1000;//network square area side bs=20;//constant buffer size tpmax=n*bs;//maximal quantity of packets simultaneously supported by each network matrix swmin=1;//initial sliding window rtmin=1;//initial retransmission time rtmax=50;//maximal retransmission time [nd,nf]=NARVAL_F_Random_i_j(n);//generation of connection extreme nodes tlim=500;//simulation duration(steps) cpmax=10;//maximal size of new connections ct=3;//connection type selection index:90% TCP 10% UDP cs=200;//size of the connection of interest cpt=1;//TCP packets closs=0.9;//loss factor cack=0.1;//acknowledgement factor T=30;//traffic periodicity pr=0.5;//probability threshold Tr=1;//throughput factor iw=1;//window index [buf,bufs,at,tt,it,sw,rt,routep,probch,pch]=NARVAL_I_NTS(g,rt1,rt2,rt3,rt4,rt5,pt,n,L,bs,tpmax,swmin,rtmin,rtmax,nd,nf,tlim,cpmax,ct,cs,cpt,closs,cack,T,pr,Tr,iw);//application of NARVAL_I_NTS | ![]() | ![]() |
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