<< NL_I_TCPSlidingWindow NL_I: Internet NL_M: Mobility >>

NARVAL >> NL_I: Internet > NL_I_TrafficSimulation

NL_I_TrafficSimulation

Network Traffic Simulator.

Calling Sequence

[Be,Bes,At,Tt,It,Sw,Rt,Rp,Rm,Rms] = NL_I_TrafficSimulation(G,R1,R2,R3,R4,R5,Pt,N,L,Bs,PM,Swm,Rtm,RtM,I,J,TM,CM,Ct,Cs,PC,Cl,Ca,D,Pt,Sa,Tr,W)

Arguments

G :

Network graph.

:

First routing table.

:

Second routing table.

:

Third routing table.

:

Fourth routing table.

:

Fifth routing table.

:

Presence table.

N :

Network size.

L :

Network square area side.

:

Buffer size.

:

Maximal quantity of packets simultaneously stored inside the packet manager.

I :

Source node of the connection under studies.

J :

Destination 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.

D :

Periodicity of the creation beginning of new connections.

:

Probability threshold.

:

Boolean (display backup).

:

Throughput factor.

W :

Window index.

:

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.

Description

NL_I_TrafficSimulation simulates data communications on a network graph. A Point-to-Point connection between the nodes I and J 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. NL_I_TrafficSimulation permits to analyse the interaction between the network topology, the user demand and the routing algorithms.

Examples

stacksize(50000000);
[path]=NL_F_NLPath();//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]=NL_F_RandIntNiNj(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]=NL_I_TrafficSimulation(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 NL_I_TrafficSimulation

Dependency

NL_I_RouteManagerInit, , NL_I_PacketManagerInit, NL_I_TCPNetworkInit, NL_G_ConnectionNeighbors, , , NL_G_ShowGraph, , , NL_I_Reception2Reception, , NL_I_ShowTrafficChange, NL_R_PathERT

Report an issue
<< NL_I_TCPSlidingWindow NL_I: Internet NL_M: Mobility >>