Professional Documents
Culture Documents
14IT066
Practical: 9
Aim : Simulate the below scenario and find out value of ?? i.e. there is no packet drop
prove it by supporting graph.
Rate : 1
Interval: 150
CBR1:
Rate : 0.05
Interval : 150
CSPIT 1
IT315
14IT066
Program:
#n0 to n2
$ns duplex-link $n0 $n2 10.0Mb 10ms SFQ
$ns queue-limit $n0 $n2 50
#n1 to n2
$ns duplex-link $n1 $n2 10.0Mb 10ms SFQ
$ns queue-limit $n1 $n2 50
#n2 to n3
$ns duplex-link $n2 $n3 5.0Mb 10ms SFQ
$ns queue-limit $n2 $n3 50
#n3 to n4
$ns duplex-link $n3 $n4 10.0Mb 10ms SFQ
$ns queue-limit $n3 $n4 50
#n3 to n5
$ns duplex-link $n3 $n5 10.0Mb 10ms SFQ
$ns queue-limit $n3 $n5 50
CSPIT 2
IT315
14IT066
Output:
CSPIT 3
IT315
14IT066
AWK Script:
BEGIN{
a=0;
b=0;
}{
if( $1 == "r" ){
a=a+1;
}
else if( $1 == "d" ){
b=b+1;
}
}
END{
print "files received:" a;
print "files dropped:" b;
}
Output :
CSPIT 4
IT315
14IT066
Jitter.awk Script:
BEGIN {
recvdSize = 0
startTime = 1e6
stopTime = 0
r=0;
}
{
event = $1
time = $2
flow_id = $8
pkt_id = $12
pkt_size = $6
flow_t = $5
if (event == "r" ) {
if (time > stopTime) {
stopTime = time
r++;
recvdSize += pkt_size
recvTime[pkt_id] = time
}
END {
CSPIT 5
IT315
14IT066
if (recvdNum != 0) {
avg_delay = delay / r
} else {
avg_delay = 0
}
jitter1 = 0
prev_time = delay = prev_delay = 0
prev_delay = -1
for (i=0; i<r; i++) {
if(recvTime[i] != 0) {
if(prev_time != 0) {
delay = recvTime[i] - prev_time
e2eDelay = recvTime[i] - sendTime[i]
if(delay < 0) delay = 0
if(prev_delay != -1) {
jitter1 += abs(e2eDelay - prev_e2eDelay)
}
prev_delay = delay
prev_e2eDelay = e2eDelay
}
prev_time = recvTime[i]
}
}
if (recvdNum != 0) {
jitter1 = jitter1*1000/r
printf("\n")
printf(" %15s: %f\n", "startTime", startTime)
printf(" %15s: %f\n", "stopTime", stopTime)
printf(" %15s: %g\n", "receivedPkts", r)
printf(" %15s: %g\n", "avgJitter[ms]", jitter1)
function abs(value) {
if (value < 0) value = 0-value
return value
}
CSPIT 6
IT315
14IT066
Output:
Xgraph file:
"SQF"
20 40
30 40
50 40
60 40
80 40
Xgraph:
Conclusion:
In this practical, weve learnt different type of queueing mechanism.
CSPIT 7