COMPUTER NETWORKS LABORATORY 2019 - 20

Introduction to
NS-2
• Widely known as NS2, is simply an event driven simulationtool.
• Useful in studying the dynamic nature of communicationnetworks.
• Simulation of wired as well as wireless network functions and protocols (e.g., routing
algorithms, TCP, UDP) can be done usingNS2.
• Ingeneral,NS2providesuserswithawayofspecifyingsuchnetworkprotocolsandsimulating
their correspondingbehaviours.
Basic Architecture of NS2

Tcl scripting
• Tcl is a general purpose scripting language.[Interpreter]
• Tcl runs on most of the platforms such as Unix, Windows, andMac.
• The strength of Tcl is itssimplicity.
• It is not necessary to declare a data type for variable prior to theusage.

Basics of TCL
Syntax:command arg1 arg2 arg3
 Hello World!
puts stdout{Hello,
World!} Hello, World!
 Variables CommandSubstitution
seta5 set len [string lengthfoobar]
setb$a set len [expr [string length foobar] +9]

 SimpleArithmetic
expr 7.2 / 4
 Procedures
proc Diag {a b} {
set c [expr sqrt($a * $a + $b *
$b)] return $c }
puts “Diagonal of a 3, 4 right triangle is [Diag 3
4]” Output: Diagonal of a 3, 4 right triangle is 5.0

Dept of CSE, RRCE. Page 1

COMPUTER NETWORKS LABORATORY 2019 - 20

 Loops
while{$i <$n} { for {set i 0} {$i < $n} {incr i}{
... ...
} }
Wired TCL Script Components
 Create the eventscheduler
 Open new files & turn on thetracing
 Create thenodes
 Setup thelinks
 Configure the traffic type (e.g., TCP, UDP,etc)
 Set the time of traffic generation (e.g., CBR,FTP)
 Terminate thesimulation
NS Simulator Preliminaries.
1. Initialization and termination aspects of the nssimulator.
2. Definition of network nodes, links, queues andtopology.
3. Definition of agents and ofapplications.
4. The nam visualizationtool.
5. Tracing and randomvariables.
Initialization and Termination of TCL Script in NS-2
An ns simulation starts with the command
set ns [new Simulator]
Which is thus the first line in the tcl script? This line declares a new variable as using the set
command, you can call this variable as you wish, In general people declares it as ns becauseit
is an instance of the Simulator class, so an object the code[new Simulator] is indeed the
installation of the class Simulator using the reserved wordnew.
In order to have output files with data on the simulation (trace files) or files used for
visualization (nam files), we need to create the files using “open” command:

#Open the Trace file set tracefile1 [open out.tr w]

$ns trace-all $tracefile1

#Open the NAM trace file set namfile [open out.nam w]

$ns namtrace-all $namfile

The above creates a data trace file called “out.tr” and a nam visualization trace file
called “out.nam”. Within the tcl script, these files are not called explicitly by their names, but
instead by pointers that are declared above and called “tracefile1” and “namfile” respectively.
Remark that they begins with a # symbol. The second line open the file “out.tr” to be used for
writing, declared with the letter “w”. The third line uses a simulator method called trace-all
that have as parameter the name of the file where the traces will go.
The last line tells the simulator to record all simulation traces in NAM input format. It
also gives the file name that the trace will be written to later by the command $ns flush-trace.
In our case, this will be the file pointed at by the pointer “$namfile”,i.e the file “out.tr”.

The termination of the program is done using a “finish” procedure.

Dept of CSE, RRCE. Page 2

COMPUTER NETWORKS LABORATORY 2019 - 20

#Define a ‘finish’ procedure

Proc finish { } {

global ns tracefile1 namfile

$ns flush-trace

Close $tracefile1

Close $namfile

Exec nam out.nam &

Exit 0

The word proc declares a procedure in this case called finish and without arguments.
Thewordglobalisusedtotellthatweareusingvariablesdeclaredoutsidetheprocedure.The
simulator method “flush-trace” will dump the traces on the respective files. The tclcommand
“close” closes the trace files defined before and exec executes the nam program for
visualization. The command exit will ends the application and return the number 0 as statusto
the system. Zero is the default for a clean exit. Other values can be used to say that is a exit
because somethingfails.
Attheendofnsprogramweshouldcalltheprocedure“finish”andspecifyatwhattime the
termination should occur. Forexample,
$ns at 125.0 “finish”
will be used to call “finish” at time 125sec.Indeed, the at method of the simulator allows us to
schedule events explicitly.
The simulation can then begin using the command
$ns run
Definition of a network of links and nodes
The way to define a node is
set n0 [$ns node]
We created a node that is printed by the variable n0. When we shall refer to that node in the
script we shall thus write $n0.
Once we define several nodes, we can define the links that connect them. An example
of a definition of a link is:
$ns duplex-link $n0 $n2 10Mb 10ms DropTail

Which means that $n0 and $n2 are connected using a bi-directional link that has 10ms
of propagation delay and a capacity of 10Mb per sec for each direction.
To define a directional link instead of a bi-directional one, we should replace “duplex-
link” by “simplex-link”.
In NS, an output queue of a node is implemented as a part of each link whose input is
that node. The definition of the link then includes the way to handle overflow at that queue.In

Dept of CSE, RRCE. Page 3

COMPUTER NETWORKS LABORATORY 2019 - 20

our case, if the buffer capacity of the output queue is exceeded then the last packet to arrive is
dropped.Manyalternativeoptionsexist,suchastheRED(RandomEarlyDiscard)mechanism, the
FQ (Fair Queuing), the DRR (Deficit Round Robin), the stochastic Fair Queuing (SFQ) and
the CBQ (which including a priority and a round-robinscheduler).
In ns, an output queue of a node is implemented as a part of each link whose input is
that node. We should also define the buffer capacity of the queue related to each link. An
example would be:
#set Queue Size of link (n0-n2) to 20

$ns queue-limit $n0 $n2 20

Agents and Applications

We need to define routing (sources, destinations) the agents (protocols)the application
that usethem.
FTP over TCP
TCP is a dynamic reliable congestion control protocol. It uses Acknowledgements
created by the destination to know whether packets are well received.
TherearenumbervariantsoftheTCPprotocol,suchasTahoe,Reno,NewReno,Vegas.
The type of agent appears in the first line:
set tcp [new Agent/TCP]
The command $ns attach-agent $n0 $tcp defines the source node of the tcp
connection.
The command set sink [new Agent /TCPSink]

Defines the behaviour of the destination node of TCP and assigns to it a pointer called sink.
#Setup a UDP connection
set udp [new Agent/UDP]

$ns attach-agent $n1 $udp

set null [new Agent/Null]

$ns attach-agent $n5 $null

$ns connect $udp $null

$udp set fid_2

#setup a CBR over UDP connection

set cbr [new Application/Traffic/CBR]

$cbr attach-agent $udp

$cbr set packetsize_ 100

$cbr set rate_ 0.01Mb

$cbr set random_ false

Dept of CSE, RRCE. Page 4

COMPUTER NETWORKS LABORATORY 2019 - 20

Above shows the definition of a CBR application using a UDP agent

The command $ns attach-agent $n4 $sink defines the destination node. The command
$ns connect $tcp $sink finally makes the TCP connection between the source and destination
nodes.
TCP has many parameters with initial fixed defaults values that can be changed if
mentioned explicitly. For example, the default TCP packet size has a size of
1000bytes.Thiscan be changed to another value, say 552bytes, using the command
$tcp set packetSize_ 552.
When we have several flows, we may wish to distinguish them so that we can identify
themwithdifferentcolorsinthevisualizationpart.Thisisdonebythecommand$tcpsetfid_ 1 that
assigns to the TCP connection a flow identification of “1”.We shall later give the flow
identification of “2” to the UDPconnection.
CBR over UDP
A UDP source and destination is defined in a similar way as in the case of TCP.
Instead of defining the rate in the command $cbr set rate_ 0.01Mb, one can define the
time interval between transmission of packets using the command.
$cbr set interval_ 0.005

The packet size can be set to some value using

$cbr set packetSize_ <packet size>

Scheduling Events
NSisadiscreteeventbasedsimulation.Thetcpscriptdefineswheneventshouldoccur. The
initializing command set ns [new Simulator] creates an event scheduler, and events are then
scheduled using theformat: $ns at <time><event>

The scheduler is started when running ns that is through the command $ns run.
The beginning and end of the FTP and CBR application can be done through the following
command

$ns at 0.1 “$cbr start”

$ns at 1.0 “ $ftp start”

$ns at 124.0 “$ftp stop”

Structure of Trace Files

WhentracingintoanoutputASCIIfile,thetraceisorganizedin12fieldsasfollowsin fig
shown below, The meaning of the fieldsare:

Event Time From To PKT PKT Flags Fid Src Dest Seq Pkt
Node Node Type Size Addr Addr Num id

1. The first field is the event type. It is given by one of four possible symbols r, +, -, d which
correspond respectively to receive (at the output of the link), enqueued, dequeued and
dropped.
2. The second field gives the time at which the eventoccurs.
3. Gives the input node of the link at which the eventoccurs.
4. Gives the output node of the link at which the eventoccurs.
Dept of CSE, RRCE. Page 5
COMPUTER NETWORKS LABORATORY 2019 - 20

5. Gives the packet type (eg CBR orTCP)

6. Gives the packetsize
7. Someflags
8. Thisistheflowid(fid)ofIPv6thatausercansetforeachflowattheinputOTclscriptone
canfurtherusethisfieldforanalysispurposes;itisalsousedwhenspecifyingstreamcolor for the
NAMdisplay.
9. This is the source address given in the form of“node.port”.
10. This is the destination address, given in the sameform.
11. This is the network layer protocol’s packet sequence number. Even though UDP
implementations in a real network do not use sequence number, ns keeps track of UDP
packet sequence number for analysispurposes
12. The last field shows the unique id of thepacket.

XGRAPH
Thexgraphprogramdrawsagraphonanx-displaygivendatareadfromeitherdatafile or
from standard input if no files are specified. It can display upto 64 independent data sets
usingdifferentcolorsandlinestylesforeachset.Itannotatesthegraphwithatitle,axislabels, grid
lines or tick marks, grid labels and alegend.
Syntax:
Xgraph [options] file-name
Options are listed here
/-bd <color> (Border)
This specifies the border color of the xgraph window.
/-bg <color> (Background)
This specifies the background color of the xgraph window.
/-fg<color> (Foreground)
This specifies the foreground color of the xgraph window.
/-lf <fontname> (LabelFont)
All axis labels and grid labels are drawn using this font.
/-t<string> (Title Text)
This string is centered at the top of the graph.
/-x <unit name> (XunitText)
This is the unit name for the x-axis. Its default is “X”.
/-y <unit name> (YunitText)
This is the unit name for the y-axis. Its default is “Y”.
Awk- An Advanced
awk is a programmable, pattern-matching, and processing tool available in UNIX. It
works equally well with text and numbers.
awkisnotjustacommand,butaprogramminglanguagetoo.Inotherwords,awkutility
isapatternscanningandprocessinglanguage.Itsearchesoneormorefilestoseeiftheycontain
linesthatmatchspecifiedpatternsandthenperformassociatedactions,suchaswritingtheline to the
standard output or incrementing a counter each time it finds amatch.
Syntax: awk option ‘selection_criteria {action}’ file(s)

Here, selection_criteria filters input and select lines for the action component to act
upon. The selection_criteria is enclosed within single quotes and the action within the curly
braces. Both the selection_criteria and action forms an awk program.
Example: $ awk ‘/manager/ {print}’ emp.lst
Variables
Awkallowstheusertousevariablesoftherechoice.Youcannowprintaserialnumber, using
Dept of CSE, RRCE. Page 6
COMPUTER NETWORKS LABORATORY 2019 - 20

the variable kount, and apply it those directors drawing a salary exceeding6700:
$ awk –F”|” ‘$3 == “director” && $6 > 6700 {
count =count+1
printf “ %3f %20s %-12s %d\n”, count,$2,$3,$6 }’ empn.lst
THE –f OPTION: STORING awk PROGRAMS INA FILE
You should holds large awk programs in separate file and provide them with the awk
extension for easier identification. Let’s first store the previous program in the file
empawk.awk:
$ cat empawk.awk
Observe that this time we haven’t used quotes to enclose the awk program. You can
now use awk with the –f filename option to obtain the same output:
Awk –F”|” –f empawk.awk empn.lst

THE BEGIN AND END SECTIONS

Awk statements are usually applied to all lines selected by the address, and if there
are no addresses, then they are applied to every line of input. But, if you have to print
something before processing the first line, for example, a heading, then the BEGIN section
can be used gainfully. Similarly, the end section useful in printing some totals after
processing is over.
The BEGIN and END sections are optional and take the form
BEGIN {action}
END {action}
These two sections, when present, are delimited by the body of the awk program. You
can use them to print a suitable heading at the beginning and the average salary at the end.
BUILT-IN VARIABLES
Awkhasseveralbuilt-invariables.Theyareallassignedautomatically,thoughitisalso
possible for a user to reassign some of them. You have already used NR, which signifies the
record number of the current line. We’ll now have a brief look at some of the other variable.
The FS Variable: as stated elsewhere, awk uses a contiguous string of spaces as the default
field delimiter. FS redefines this field separator, which in the sample database happens to be
the |. When used at all, it must occur in the BEGIN section so that the body of the program
knows its value before it startsprocessing:
BEGIN {FS=”|”}
This is an alternative to the –F option which does the same thing.
TheOFSVariable:whenyouusedtheprintstatementwithcomma-separatedarguments,each
argumentwasseparatedfromtheotherbyaspace.Thisisawk’sdefaultoutputfieldseparator, and can
reassigned using the variable OFS in the BEGINsection:
BEGIN { OFS=”~” }
When you reassign this variable with a ~ (tilde), awk will use this character for delimiting the
print arguments. This is a useful variable for creating lines with delimited fields.
The NF variable: NF comes in quite handy for cleaning up a database of lines that don’t
contain the right number of fields. By using it on a file, say emp.lst, you can locate those
lines not having 6 fields, and which have crept in due to faulty data entry:
$awk ‘BEGIN {FS = “|”}
NF! =6 {
Print “Record No “, NR, “has”, “fields”}’ empx.lst
The FILENAME Variable: FILENAME stores the name of the current file being processed.
Like grep and sed, awk can also handle multiple filenames in the command line. By default,
awk doesn’t print the filename, but you can instruct it to do so:
‘$6<4000 {print FILENAME, $0 }’
Dept of CSE, RRCE. Page 7
COMPUTER NETWORKS LABORATORY 2019 - 20

With FILENAME, you can device logic that does different things depending on the file that is
processed.
NS2 Installation
• NS2 is a free simulationtool.
• It runs on various platforms including UNIX (or Linux), Windows, and Macsystems.
• NS2 source codes are distributed in two forms: the all-in-one suite and the component-
wise.
• ‘all-in-one’packageprovidesan“install”scriptwhichconfigurestheNS2environmentand
creates NS2 executable file using the “make”utility.
NS-2 installation steps in Linux
➢ Go to Computer File System now paste the zip file “ns-allinone-2.34.tar.gz” into
optfolder.
➢ Now unzip the file by typing the followingcommand
[root@localhost opt] # tar -xzvfns-allinone-2.34.tar.gz
➢ After the files get extracted, we get ns-allinone-2.34 folder as well as zip file ns-allinone-
2.34.tar.gz
[root@localhost opt]#ns-allinone-2.34 ns-allinone-2.34.tar.gz
➢ Now go to ns-allinone-2.33 folder and install
it [root@localhost opt] # cd ns-allinone-2.34
[root@localhost ns-allinone-2.33] #./install
➢ Once the installation is completed successfully we get certain pathnames in that terminal
which must be pasted in “.bash_profile”file.
➢ Firstminimizetheterminalwhereinstallationisdoneandopenanewterminalandopen the
file“.bash_profile”
[root@localhost ~] # vi.bash_profile
➢ When we open this file, we get a line in that file which is shownbelow
PATH=$PATH:$HOME/bin
To this line we must paste the path which is present in the previous terminal where ns was
installed. First put “:” then paste the path in-front of bin. That path is shown below.
“:/opt/ns-allinone-2.33/bin:/opt/ns-allinone-2.33/tcl8.4.18/unix:/opt/ns-allinone-
2.33/tk8.4.18/unix”.
➢ In the next line type “LD_LIBRARY_PATH=$LD_LIBRARY_PATH:” and paste the
two paths separated by “:” which are present in the previous terminal i.e Important notices
section(1)
“/opt/ns-allinone-2.33/otcl-1.13:/opt/ns-allinone-2.33/lib”
➢ In the next line type “TCL_LIBRARY=$TCL_LIBRARY:” and paste the path which is
present in previous terminal i.e Important Notices section(2)
“/opt/ns-allinone-2.33/tcl8.4.18/library”
➢ In the next line type “exportLD_LIBRARY_PATH”
➢ In the next line type “exportTCL_LIBRARY”
➢ The next two lines are already present the file “export PATH” and “unsetUSERNAME”
➢ Save the program ( ESC + shift : wq and press enter)
➢ Nowintheterminalwherewehaveopened.bash_profilefile,typethefollowingcommand to
check if path is updated correctly ornot
[root@localhost ~] # vi.bash_profile
[root@localhost ~] # source.bash_profile
➢ If path is updated properly, then we will get the prompt as shown
below [root@localhost ~]#
➢ Now open the previous terminal where you have installedns
[root@localhost ns-allinone-2.33] #
➢ Here we need to configure three packages “ns-2.33”, “nam-1.13” and“xgraph-12.1”
Dept of CSE, RRCE. Page 8
COMPUTER NETWORKS LABORATORY 2019 - 20

➢ First, configure “ns-2.33” package as shown below

[root@localhost ns-allinone-2.33] # cd ns-2.33
[root@localhost ns-2.33] # ./configure
[root@localhost ns-2.33] # make clean
[root@localhost ns-2.33] # make
[root@localhost ns-2.33] # make install
[root@localhost ns-2.33] #ns
%
➢ If we get “%” symbol it indicates that ns-2.33 configuration wassuccessful.
➢ Second, configure “nam-1.13” package as shown
below [root@localhost ns-2.33] # cd ..
[root@localhost ns-allinone-2.33] # cd nam-1.13
[root@localhost nam-1.13] # ./configure
[root@localhost nam-1.13] # make clean
[root@localhost nam-1.13] # make
[root@localhost nam-1.13] # make install
[root@localhost nam-1.13] #ns
%
➢ If we get “%” symbol it indicates that nam-1.13 configuration wassuccessful.
➢ Third, configure “xgraph-12.1” package as shown
below [root@localhost nam-1.13] # cd ..
[root@localhost ns-allinone-2.33] # cd xgraph-12.1
[root@localhost xgraph-12.1] # ./configure
[root@localhost xgraph-12.1] # make clean
[root@localhost xgraph-12.1] # make
[root@localhost xgraph-12.1] # make install
[root@localhost xgraph-12.1] #ns
%
This completes the installation process of “NS-2” simulator.

Dept of CSE, RRCE. Page 9

COMPUTER NETWORKS LABORATORY 2019 - 20

PART-A

1. Implementthreenodespoint–to–pointnetworkwithduplexlinksbetweenthem.Set the
queue size, vary the bandwidth and find the number of packetsdropped.

set ns[newSimulator] /* Letter S is capital*/

set nf [open lab1.nam w] /* open a nam trace file in write mode */
$nsnamtrace-all$nf /* nf – nam file */

set tf [open lab1.tr w] /* tf- trace file */

$ns trace-all $tf

proc finish {} { /* provide space b/w proc and finish and all are in smallcase*/
global ns nftf
$nsflush-trace /* clears trace filecontents*/
close$nf
close $tf
exec nam lab1.nam &
exit 0
}

set n0 [$ns node] /* creates 4 nodes */

set n1 [$ns node]
set n2 [$ns node]
set n3 [$ns node]

$ns duplex-link $n0 $n2 200Mb 10ms DropTail /*Letter M is capital Mb*/
$ns duplex-link $n1 $n2 100Mb 5ms DropTail /*D and T are capital*/
$ns duplex-link $n2 $n3 1Mb 1000ms DropTail

$ns queue-limit $n0 $n2 10

$ns queue-limit $n1 $n2 10

set udp0 [new Agent/UDP] /* Letters A,U,D and P are capital */

$ns attach-agent $n0 $udp0

set cbr0 [new Application/Traffic/CBR] /* A,T,C,B and R are capital*/

$cbr0 set packetSize_ 500 /*S is capital, space after underscore*/
$cbr0 set interval_ 0.005
$cbr0 attach-agent $udp0

set udp1 [new Agent/UDP]

$ns attach-agent $n1 $udp1

set cbr1 [new Application/Traffic/CBR]

$cbr1 attach-agent $udp1

set udp2 [new Agent/UDP]

$ns attach-agent $n2 $udp2

Dept of CSE, RRCE. Page 10

COMPUTER NETWORKS LABORATORY 2019 - 20

set cbr2 [new Application/Traffic/CBR]

$cbr2 attach-agent $udp2

set null0 [new Agent/Null] /* A and N are capital */

$ns attach-agent $n3 $null0

$ns connect $udp0 $null0

$ns connect $udp1 $null0

$ns at 0.1 "$cbr0 start"

$ns at 0.2 "$cbr1 start"
$ns at 1.0 "finish"

$ns run

AWK file (Open a new editor using “vi command” and write awk file and save with
“.awk” extension)
/*immediately after BEGIN should open braces ‘{‘
BEGIN {
c=0;
}
{
If ($1= ="d")
{
c++;
printf("%s\t%s\n",$5,$11);
}
}
/*immediately after END should open braces ‘{‘
END{
printf("The number of packets dropped =%d\n",c);
}

Steps for execution

1) Open vi editor and type program. Program name should have the extension “ .tcl”
[root@localhost ~]# vi lab1.tcl
2) Save the program by pressing “ESC key” first, followed by “Shift and :” keys
simultaneously and type “wq” and press Enterkey.
3) Open vi editor and type awk program. Program name should have the extension
“.awk”
[root@localhost ~]# vi lab1.awk
4) Save the program by pressing “ESC key” first, followed by “Shift and :” keys
simultaneously and type “wq” and press Enterkey.
5) Run the simulationprogram
[root@localhost~]# ns lab1.tcl
i) Here “ns” indicates network simulator. We get the topology shown in thesnapshot.
ii) Now press the play button in the simulation window and the simulation will
begins.
6) After simulation is completed run awk file to see the output,
[root@localhost~]# awk –f lab1.awklab1.tr
7) To see the trace file contents open the file as,
Dept of CSE, RRCE. Page 11
COMPUTER NETWORKS LABORATORY 2019 - 20

[root@localhost~]# vi lab1.tr

Trace file contains 12 columns:-

Event type, Event time, From Node, Source Node, Packet Type, Packet Size, Flags
(indicated by --------), Flow ID, Source address, Destination address, Sequence ID,
Packet ID
Topology

Dept of CSE, RRCE. Page 12

COMPUTER NETWORKS LABORATORY 2019 - 20

Output

Note:
1. Set the queue size fixed from n0 to n2 as 10, n1-n2 to 10 and from n2-n3 as5.
Syntax: To set the queuesize
$ns set queue-limit <from><to><size> Eg:
$ns set queue-limit $n0 $n2 10
2. Go on varying the bandwidth from 10, 20 30 . . and find the number of packets
dropped at the node2

2. Implement transmission of ping messages/trace route over a network topology

consisting of 6 nodes and find the number of packets dropped due tocongestion.
set ns [ new Simulator ]
set nf [ open lab2.nam w ]
$ns namtrace-all $nf
set tf [ open lab2.tr w ]
$ns trace-all $tf
set n0 [$ns node]
set n1 [$ns node]
set n2 [$ns node]
set n3 [$ns node]
set n4 [$ns node]
set n5 [$ns node]
$n4 shape box
$ns duplex-link $n0 $n4 1005Mb 1ms DropTail
$ns duplex-link $n1 $n4 50Mb 1ms DropTail
$ns duplex-link $n2 $n4 2000Mb 1ms DropTail
$ns duplex-link $n3 $n4 200Mb 1ms DropTail

Dept of CSE, RRCE. Page 13

COMPUTER NETWORKS LABORATORY 2019 - 20

$ns duplex-link $n4 $n5 1Mb 1ms DropTail

set p1 [new Agent/Ping]
$ns attach-agent $n0 $p1
$p1 set packetSize_ 50000
$p1 set interval_ 0.0001
set p2 [new Agent/Ping]
$ns attach-agent $n1 $p2
set p3 [new Agent/Ping]
$ns attach-agent $n2 $p3
$p3 set packetSize_ 30000
$p3 set interval_ 0.00001
set p4 [new Agent/Ping]
$ns attach-agent $n3 $p4
set p5 [new Agent/Ping]
$ns attach-agent $n5 $p5
$ns queue-limit $n0 $n4 5
$ns queue-limit $n2 $n4 3
$ns queue-limit $n4 $n5 2
Agent/Ping instproc recv {from rtt} {
$self instvar node_
puts "node [$node_ id] received answer from $from with round trip time $rtt msec"
}
# please provide space between $node_ and id. No space between $ and from. No
#space between and $ and rtt */
$ns connect $p1 $p5
$ns connect $p3 $p4
proc finish { } {
global ns nf tf
$ns flush-trace
close $nf
close $tf
exec nam lab2.nam &
exit 0
}
$ns at 0.1 "$p1 send"
$ns at 0.2 "$p1 send"
$ns at 0.3 "$p1 send"
$ns at 0.4 "$p1 send"
$ns at 0.5 "$p1 send"
$ns at 0.6 "$p1 send"
$ns at 0.7 "$p1 send"
$ns at 0.8 "$p1 send"
$ns at 0.9 "$p1 send"
$ns at 1.0 "$p1 send"

Dept of CSE, RRCE. Page 14

COMPUTER NETWORKS LABORATORY 2019 - 20

$ns at 1.1 "$p1 send"

$ns at 1.2 "$p1 send"
$ns at 1.3 "$p1 send"
$ns at 1.4 "$p1 send"
$ns at 1.5 "$p1 send"
$ns at 1.6 "$p1 send"
$ns at 1.7 "$p1 send"
$ns at 1.8 "$p1 send"
$ns at 1.9 "$p1 send"
$ns at 2.0 "$p1 send"
$ns at 2.1 "$p1 send"
$ns at 2.2 "$p1 send"
$ns at 2.3 "$p1 send"
$ns at 2.4 "$p1 send"
$ns at 2.5 "$p1 send"
$ns at 2.6 "$p1 send"
$ns at 2.7 "$p1 send"
$ns at 2.8 "$p1 send"
$ns at 2.9 "$p1 send"
$ns at 0.1 "$p3 send"
$ns at 0.2 "$p3 send"
$ns at 0.3 "$p3 send"
$ns at 0.4 "$p3 send"
$ns at 0.5 "$p3 send"
$ns at 0.6 "$p3 send"
$ns at 0.7 "$p3 send"
$ns at 0.8 "$p3 send"
$ns at 0.9 "$p3 send"
$ns at 1.0 "$p3 send"
$ns at 1.1 "$p3 send"
$ns at 1.2 "$p3 send"
$ns at 1.3 "$p3 send"
$ns at 1.4 "$p3 send"
$ns at 1.5 "$p3 send"
$ns at 1.6 "$p3 send"
$ns at 1.7 "$p3 send"
$ns at 1.8 "$p3 send"
$ns at 1.9 "$p3 send"
$ns at 2.0 "$p3 send"
$ns at 2.1 "$p3 send"
$ns at 2.2 "$p3 send"
$ns at 2.3 "$p3 send"
$ns at 2.4 "$p3 send"
$ns at 2.5 "$p3 send"

Dept of CSE, RRCE. Page 15

COMPUTER NETWORKS LABORATORY 2019 - 20

$ns at 2.6 "$p3 send"

$ns at 2.7 "$p3 send"
$ns at 2.8 "$p3 send"
$ns at 2.9 "$p3 send"
$ns at 3.0 "finish"
$ns run

AWK file (Open a new editor using “vi command” and write awk file and save
with “.awk” extension)

BEGIN{
drop=0;
}
{
if($1= ="d" )
{
drop++;
}
}
END{
printf("Total number of %s packets dropped due to congestion =%d\n",$5,drop);
}
Steps for execution
1) Open vi editor and type program. Program name should have the extension “ .tcl”
[root@localhost ~]# vi lab2.tcl
2) Save the program by pressing “ESC key” first, followed by “Shift and :” keys
simultaneously and type “wq” and press Enterkey.
3) Open vi editor and type awk program. Program name should have the extension
“.awk”
[root@localhost ~]# vi lab2.awk
4) Save the program by pressing “ESC key” first, followed by “Shift and :” keys
simultaneously and type “wq” and press Enterkey.
5) Run the simulationprogram
[root@localhost~]# ns lab2.tcl
i) Here “ns” indicates network simulator. We get the topology shown in the
snapshot.
ii) Now press the play button in the simulation window and the simulation will
begins.
6) After simulation is completed run awk file to see the output,
[root@localhost~]# awk –f lab2.awklab2.tr
7) To see the trace file contents open the file as,
[root@localhost~]# vi lab2.tr

Dept of CSE, RRCE. Page 16

COMPUTER NETWORKS LABORATORY 2019 - 20

Topology

Output

Dept of CSE, RRCE. Page 17

COMPUTER NETWORKS LABORATORY 2019 - 20

Note:
Vary the bandwidth and queue size between the nodes n0-n2 , n2-n4. n6-n2 and n2- n5
and see the number of packets dropped at the nodes.

Dept of CSE, RRCE. Page 18

COMPUTER NETWORKS LABORATORY 2019 - 20

3. Implement an Ethernet LAN using n nodes and set multiple traffic nodes and plot
congestion window for different source /destination.
set ns [new Simulator]
set tf [open lab3.tr w]
$ns trace-all $tf
set nf [open lab3.nam w]
$ns namtrace-all $nf

set n0 [$ns node]

$n0 color "magenta"
$n0 label "src1"
set n1 [$ns node]
set n2 [$ns node]
$n2 color "magenta"
$n2 label "src2"
set n3 [$ns node]
$n3 color "blue"
$n3 label "dest2"
set n4 [$ns node]
set n5 [$ns node]
$n5 color "blue"
$n5 l
abel "dest1"

$ns make-lan "$n0 $n1 $n2 $n3 $n4" 100Mb 100ms LL Queue/DropTail Mac/802_3
/* should come in single line */
$ns duplex-link $n4 $n5 1Mb 1ms DropTail

set tcp0 [new Agent/TCP]

$ns attach-agent $n0 $tcp0
set ftp0 [new Application/FTP]
$ftp0 attach-agent $tcp0
$ftp0 set packetSize_ 500
$ftp0 set interval_ 0.0001
set sink5 [new Agent/TCPSink]
$ns attach-agent $n5 $sink5

$ns connect $tcp0 $sink5

set tcp2 [new Agent/TCP]

$ns attach-agent $n2 $tcp2
set ftp2 [new Application/FTP]
$ftp2 attach-agent $tcp2
$ftp2 set packetSize_ 600
$ftp2 set interval_ 0.001
set sink3 [new Agent/TCPSink]
$ns attach-agent $n3 $sink3

$ns connect $tcp2 $sink3

Dept of CSE, RRCE. Page 19

COMPUTER NETWORKS LABORATORY 2019 - 20

set file1 [open file1.tr w]

$tcp0 attach $file1
set file2 [open file2.tr w]
$tcp2 attach $file2

$tcp0 trace cwnd_ /* must put underscore ( _ ) after cwnd and no space between
them*/
$tcp2 trace cwnd_

proc finish { } {
global ns nf tf
$ns flush-trace
close $tf
close $nf
exec nam lab3.nam &
exit 0
}
$ns at 0.1 "$ftp0 start"
$ns at 5 "$ftp0 stop"
$ns at 7 "$ftp0 start"
$ns at 0.2 "$ftp2 start"
$ns at 8 "$ftp2 stop"
$ns at 14 "$ftp0 stop"
$ns at 10 "$ftp2 start"
$ns at 15 "$ftp2 stop"
$ns at 16 "finish"
$ns run

AWK file (Open a new editor using “vi command” and write awk file and save with
“.awk” extension)

cwnd:- means congestion window

BEGIN {
}
{
if($6= ="cwnd_") /* don’t leave space after writing cwnd_ */
printf("%f\t%f\t\n",$1,$7); /* you must put \n in printf */
}
END {
}
Steps for execution
1) Open vi editor and type program. Program name should have the extension “ .tcl”
[root@localhost ~]# vi lab3.tcl
2) Save the program by pressing “ESC key” first, followed by “Shift and :” keys
simultaneously and type “wq” and press Enterkey.
3) Open vi editor and type awk program. Program name should have the extension
“.awk”
[root@localhost ~]# vi lab3.awk
4) Save the program by pressing “ESC key” first, followed by “Shift and :” keys
Dept of CSE, RRCE. Page 20
COMPUTER NETWORKS LABORATORY 2019 - 20

simultaneously and type “wq” and press Enterkey.

5) Run the simulationprogram
[root@localhost~]# ns lab3.tcl

6) After simulation is completed run awk file to see the output,

i. [root@localhost~]# awk –f lab3.awk file1.tr >a1
ii. [root@localhost~]# awk –f lab3.awk file2.tr >a2
iii. [root@localhost~]# xgraph a1a2
7) Here we are using the congestion window trace files i.e. file1.tr and file2.tr and we
are redirecting the contents of those files to new files say a1 and a2 using output
redirection operator(>).
8) To see the trace file contents open the file as,
[root@localhost~]# vi lab3.tr
Topology

Output

Dept of CSE, RRCE. Page 21

COMPUTER NETWORKS LABORATORY 2019 - 20

4. Implement simple ESS and with transmitting nodes in wire-less LAN by simulation
and determine the performance with respect to transmission ofpackets.
set ns [new Simulator]
set tf [open lab4.tr w]
$ns trace-all $tf
set topo [new Topography]
$topo load_flatgrid 1000 1000
set nf [open lab4.nam w]
$ns namtrace-all-wireless $nf 1000 1000
$ns node-config -adhocRouting DSDV \
-llType LL \
-macType Mac/802_11 \
-ifqType Queue/DropTail \
-ifqLen 50 \
-phyType Phy/WirelessPhy \
-channelType Channel/WirelessChannel \
-propType Propagation/TwoRayGround \
-antType Antenna/OmniAntenna \
-topoInstance $topo \
-agentTrace ON \
-routerTrace ON
create-god 3
set n0 [$ns node]

Dept of CSE, RRCE. Page 22

COMPUTER NETWORKS LABORATORY 2019 - 20

set n1 [$ns node]

set n2 [$ns node]
$n0 label "tcp0"
$n1 label "sink1/tcp1"
$n2 label "sink2"

$n0 set X_ 50
$n0 set Y_ 50
$n0 set Z_ 0
$n1 set X_ 100
$n1 set Y_ 100
$n1 set Z_ 0
$n2 set X_ 600
$n2 set Y_ 600
$n2 set Z_ 0
$ns at 0.1 "$n0 setdest 50 50 15"
$ns at 0.1 "$n1 setdest 100 100 25"
$ns at 0.1 "$n2 setdest 600 600 25"

set tcp0 [new Agent/TCP]

$ns attach-agent $n0 $tcp0
set ftp0 [new Application/FTP]
$ftp0 attach-agent $tcp0
set sink1 [new Agent/TCPSink]
$ns attach-agent $n1 $sink1
$ns connect $tcp0 $sink1
set tcp1 [new Agent/TCP]
$ns attach-agent $n1 $tcp1
set ftp1 [new Application/FTP]
$ftp1 attach-agent $tcp1
set sink2 [new Agent/TCPSink]
$ns attach-agent $n2 $sink2
$ns connect $tcp1 $sink2
$ns at 5 "$ftp0 start"
$ns at 5 "$ftp1 start"
$ns at 100 "$n1 setdest 550 550 15"
$ns at 190 "$n1 setdest 70 70 15"
proc finish { } {
global ns nf tf
$ns flush-trace
exec nam lab4.nam &
close $tf
exit 0
}
$ns at 250 "finish"
$ns run

Dept of CSE, RRCE. Page 23

COMPUTER NETWORKS LABORATORY 2019 - 20

AWK file (Open a new editor using “vi command” and write awk file and save with
“.awk” extension)
BEGIN{
count1=0
count2=0
pack1=0
pack2=0
time1=0
time2=0
}
{
if($1= ="r"&& $3= ="_1_" && $4= ="AGT")
{
count1++
pack1=pack1+$8
time1=$2
}
if($1= ="r" && $3= ="_2_" && $4= ="AGT")
{
count2++
pack2=pack2+$8

time2=$2
}
}
END{
printf("The Throughput from n0 to n1: %f Mbps \n”, ((count1*pack1*8)/(time1*1000000)));
printf("The Throughput from n1 to n2: %f Mbps", ((count2*pack2*8)/(time2*1000000)));
}
Steps for execution
1) Open vi editor and type program. Program name should have the extension “ .tcl”
[root@localhost ~]# vi lab4.tcl
2) Save the program by pressing “ESC key” first, followed by “Shift and :” keys
simultaneously and type “wq” and press Enterkey.
3) Open vi editor and type awk program. Program name should have the extension
“.awk”
[root@localhost ~]# vi lab4.awk
4) Save the program by pressing “ESC key” first, followed by “Shift and :” keys
simultaneously and type “wq” and press Enterkey.
5) Run the simulationprogram
[root@localhost~]# ns lab4.tcl
i) Here “ns” indicates network simulator. We get the topology shown in the
snapshot.
ii) Now press the play button in the simulation window and the simulation
willbegins.
6) After simulation is completed run awk file to see the output,
[root@localhost~]# awk –f lab4.awklab4.tr
7) To see the trace file contents open the file as,
[root@localhost~]# vi lab4.tr
Dept of CSE, RRCE. Page 24
COMPUTER NETWORKS LABORATORY 2019 - 20

Topology

Node 1 and 2 are communicating

Trace file

Here “M” indicates mobile nodes, “AGT” indicates Agent Trace, “RTR” indicates Router
Trace

Dept of CSE, RRCE. Page 25

COMPUTER NETWORKS LABORATORY 2019 - 20

Output

Dept of CSE, RRCE. Page 26

COMPUTER NETWORKS LABORATORY 2019 - 20

5. Implement and study the performance of GSM on NS2/NS3 (Using MAC layer) or
equivalentenvironment.

SecondGeneration(2G)technologyisbasedonthetechnologyknownasglobalsystem for
mobile communication (GSM). This technology enabled various networks to provide
servicesliketextmessages,picturemessagesandMMS.Thetechnologiesusedin2Gareeither
TDMA (Time Division Multiple Access) which divides signal into different time slots
or CDMA (Code Division Multiple Access) which allocates a special code to each user so as
to communicate over a multiplex physicalchannel.
GSM uses a variation of time division multiple access (TDMA). 2G networks
developed as a replacement for first generation (1G) analog cellular networks, and the GSM
standard originally described as a digital, circuit-switched network optimized for fullduplex
voice telephony. This expanded over time to include data communications, first by circuit-
switched transport, then by packet data transport via GPRS (General Packet Radio Services).
GSM can be implemented on all the versions of NS2 (Since year 2004: ns-2.27, and later
versions of NS2)

Design:

Source Code:
# General Parameters
set opt(title) zero ;
set opt(stop) 100 ;# Stop time.
set opt(ecn) 0 ;
# Topology
set opt(type) gsm ;#type of link:
set opt(secondDelay) 55 ;# average delay of access links in ms
# AQM parameters
set opt(minth) 30 ;
set opt(maxth) 0 ;
set opt(adaptive) 1 ;# 1 for Adaptive RED, 0 for plain RED
# Traffic generation.
set opt(flows) 0 ;# number of long-lived TCP flows
set opt(window) 30 ;# window for long-lived traffic
set opt(web) 2 ;# number of web sessions

Dept of CSE, RRCE. Page 27

COMPUTER NETWORKS LABORATORY 2019 - 20

# Plotting statistics.
set opt(quiet) 0 ;# popup anything
set opt(wrap) 100 ;# wrap plots
set opt(srcTrace) is ;# where to plot traffic
set opt(dstTrace) bs2 ;# where to plot traffic
set opt(gsmbuf) 10 ; # buffer size for gsm

#default downlink bandwidth in bps

set bwDL(gsm) 9600
#default uplink bandwidth in bps
set bwUL(gsm) 9600
#default downlink propagation delay in seconds
set propDL(gsm) .500
#default uplink propagation delay in seconds
set propUL(gsm) .500
#default buffer size in packets
set buf(gsm) 10

set ns [new Simulator]

set tf [open out.tr w]
$ns trace-all $tf

set nodes(is) [$ns node]

set nodes(ms) [$ns node]
set nodes(bs1) [$ns node]
set nodes(bs2) [$ns node]
set nodes(lp) [$ns node]

proc cell_topo {} {
global ns nodes
$ns duplex-link $nodes(lp) $nodes(bs1) 3Mbps 10ms DropTail
$ns duplex-link $nodes(bs1) $nodes(ms) 1 1 RED
$ns duplex-link $nodes(ms) $nodes(bs2) 1 1 RED
$ns duplex-link $nodes(bs2) $nodes(is) 3Mbps 50ms DropTail
puts "Cell Topology"
}

proc set_link_params {t} {

global ns nodes bwUL bwDL propUL propDL buf
$ns bandwidth $nodes(bs1) $nodes(ms) $bwDL($t) simplex
$ns bandwidth $nodes(ms) $nodes(bs1) $bwUL($t) simplex
$ns bandwidth $nodes(bs2) $nodes(ms) $bwDL($t) simplex
$ns bandwidth $nodes(ms) $nodes(bs2) $bwUL($t) simplex
$ns delay $nodes(bs1) $nodes(ms) $propDL($t) simplex
$ns delay $nodes(ms) $nodes(bs1) $propDL($t) simplex
$ns delay $nodes(bs2) $nodes(ms) $propDL($t) simplex
$ns delay $nodes(ms) $nodes(bs2) $propDL($t) simplex
$ns queue-limit $nodes(bs1) $nodes(ms) $buf($t)
$ns queue-limit $nodes(ms) $nodes(bs1) $buf($t)
$ns queue-limit $nodes(bs2) $nodes(ms) $buf($t)
$ns queue-limit $nodes(ms) $nodes(bs2) $buf($t)

Dept of CSE, RRCE. Page 28

COMPUTER NETWORKS LABORATORY 2019 - 20

}
# RED and TCP parameters
Queue/RED set summarystats_ true
Queue/DropTail set summarystats_ true
Queue/RED set adaptive_ $opt(adaptive)
Queue/RED set q_weight_ 0.0
Queue/RED set thresh_ $opt(minth)
Queue/RED set maxthresh_ $opt(maxth)
Queue/DropTail set shrink_drops_ true
Agent/TCP set ecn_ $opt(ecn)
Agent/TCP set window_ $opt(window)
DelayLink set avoidReordering_ true

source web.tcl

#Create topology
switch $opt(type) {
gsm -
gprs -
umts {cell_topo}
}
set_link_params $opt(type)
$ns insert-delayer $nodes(ms) $nodes(bs1) [new Delayer]
$ns insert-delayer $nodes(bs1) $nodes(ms) [new Delayer]
$ns insert-delayer $nodes(ms) $nodes(bs2) [new Delayer]
$ns insert-delayer $nodes(bs2) $nodes(ms) [new Delayer]

# Set up forward TCP connection

if {$opt(flows) == 0} {
set tcp1 [$ns create-connection TCP/Sack1 $nodes(is) TCPSink/Sack1 $nodes(lp) 0]
set ftp1 [[set tcp1] attach-app FTP]
$ns at 0.8 "[set ftp1] start"
}
if {$opt(flows) > 0} {
set tcp1 [$ns create-connection TCP/Sack1 $nodes(is) TCPSink/Sack1 $nodes(lp) 0]
set ftp1 [[set tcp1] attach-app FTP]
$tcp1 set window_ 100
$ns at 0.0 "[set ftp1] start"

$ns at 3.5 "[set ftp1] stop"

set tcp2 [$ns create-connection TCP/Sack1 $nodes(is) TCPSink/Sack1 $nodes(lp) 0]
set ftp2 [[set tcp2] attach-app FTP]
$tcp2 set window_ 3
$ns at 1.0 "[set ftp2] start"
$ns at 8.0 "[set ftp2] stop"
}

proc stop {} {

Dept of CSE, RRCE. Page 29

COMPUTER NETWORKS LABORATORY 2019 - 20

global nodes opt nf

set wrap $opt(wrap)
set sid [$nodes($opt(srcTrace)) id]
set did [$nodes($opt(dstTrace)) id]
if {$opt(srcTrace) == "is"} {
set a "-a out.tr"
} else {
set a "out.tr"
}
set GETRC "../../../bin/getrc"
set RAW2XG "../../../bin/raw2xg"
exec $GETRC -s $sid -d $did -f 0 out.tr | \
$RAW2XG -s 0.01 -m $wrap -r > plot.xgr
exec $GETRC -s $did -d $sid -f 0 out.tr | \
$RAW2XG -a -s 0.01 -m $wrap >> plot.xgr
exec $GETRC -s $sid -d $did -f 1 out.tr | \
$RAW2XG -s 0.01 -m $wrap -r >> plot.xgr
exec $GETRC -s $did -d $sid -f 1 out.tr | \
$RAW2XG -s 0.01 -m $wrap -a >> plot.xgr
exec ./xg2gp.awk plot.xgr
if {!$opt(quiet)} {
exec xgraph -bb -tk -nl -m -x time -y packets plot.xgr &
}
exit 0
}
$ns at $opt(stop) "stop"
$ns run

Dept of CSE, RRCE. Page 30

COMPUTER NETWORKS LABORATORY 2019 - 20

Output:

GSM Trace file:

Dept of CSE, RRCE. Page 31

COMPUTER NETWORKS LABORATORY 2019 - 20

6. ImplementandstudytheperformanceofCDMAonNS2/NS3(UsingstackcalledCall net)
or equivalentenvironment.

3G networks developed as a replacement for second generation (2G) GSM standard

networkwithfullduplexvoicetelephony.CDMAisusedastheaccessmethodinmanymobilephone
standards.IS-95, also called cdmaOne, and its 3G evolution CDMA2000, are often simply
referred to as CDMA, but UMTS(The Universal Mobile Telecommunications
SystemisathirdgenerationmobilecellularsystemfornetworksbasedontheGSMstandard.), the 3G
standard used by GSM carriers, also uses wideband CDMA. Long-Term Evolution
(LTE) is a standard for high-speed wireless communication which uses CDMA
networktechnology.
3G technology generally refers to the standard of accessibility and speed of mobile
devices. The standards of the technology were set by the International Telecommunication
Union (ITU). This technology enables use of various services like GPS (Global
PositioningSystem), mobile television and video conferencing. It not only enables them to be
used worldwide, but also provides with better bandwidth and increased speed. The main aim
ofthis technology is to allow much better coverage and growth with minimuminvestment.

CDMA can be implemented on all the versions of NS2 (Since year 2004: ns-2.27, and later
versions of NS2)

Design:

Dept of CSE, RRCE. Page 32

COMPUTER NETWORKS LABORATORY 2019 - 20

Source Code:
# General Parameters
set opt(title) zero ;
set opt(stop) 100 ;# Stop time.
set opt(ecn) 0 ;
# Topology
set opt(type) umts ;#type of link:
set opt(secondDelay) 55 ;# average delay of access links in ms
# AQM parameters
set opt(minth) 30 ;
set opt(maxth) 0 ;
set opt(adaptive) 1 ;# 1 for Adaptive RED, 0 for plain RED
# Traffic generation.
set opt(flows) 0 ;# number of long-lived TCP flows
set opt(window) 30 ;# window for long-lived traffic
set opt(web) 2 ;# number of web sessions
# Plotting statistics.
set opt(quiet) 0 ;# popup anything
set opt(wrap) 100 ;# wrap plots
set opt(srcTrace) is ;# where to plot traffic
set opt(dstTrace) bs2 ;# where to plot traffic
set opt(umtsbuf) 10 ; # buffer size for umts
#default downlink bandwidth in bps
set bwDL(umts) 384000
#default uplink bandwidth in bps
set bwUL(umts) 64000
#default downlink propagation delay in seconds
set propDL(umts) .150
#default uplink propagation delay in seconds
set propUL(umts) .150
#default buffer size in packets
set buf(umts) 20

set ns [new Simulator]

set tf [open out.tr w]
$ns trace-all $tf

set nodes(is) [$ns node]

set nodes(ms) [$ns node]
set nodes(bs1) [$ns node]
set nodes(bs2) [$ns node]
set nodes(lp) [$ns node]

proc cell_topo {} {
global ns nodes
$ns duplex-link $nodes(lp) $nodes(bs1) 3Mbps 10ms DropTail
$ns duplex-link $nodes(bs1) $nodes(ms) 1 1 RED
$ns duplex-link $nodes(ms) $nodes(bs2) 1 1 RED
$ns duplex-link $nodes(bs2) $nodes(is) 3Mbps 50ms DropTail
puts "Cell Topology"
}
Dept of CSE, RRCE. Page 33
COMPUTER NETWORKS LABORATORY 2019 - 20

proc set_link_params {t} {

global ns nodes bwUL bwDL propUL propDL buf
$ns bandwidth $nodes(bs1) $nodes(ms) $bwDL($t) simplex
$ns bandwidth $nodes(ms) $nodes(bs1) $bwUL($t) simplex
$ns delay $nodes(bs1) $nodes(ms) $propDL($t) simplex
$ns delay $nodes(ms) $nodes(bs1) $propDL($t) simplex
$ns queue-limit $nodes(bs1) $nodes(ms) $buf($t)
$ns queue-limit $nodes(ms) $nodes(bs1) $buf($t)
$ns bandwidth $nodes(bs2) $nodes(ms) $bwDL($t) simplex
$ns bandwidth $nodes(ms) $nodes(bs2) $bwUL($t) simplex
$ns delay $nodes(bs2) $nodes(ms) $propDL($t) simplex
$ns delay $nodes(ms) $nodes(bs2) $propDL($t) simplex
$ns queue-limit $nodes(bs2) $nodes(ms) $buf($t)
$ns queue-limit $nodes(ms) $nodes(bs2) $buf($t)
}

# RED and TCP parameters

Queue/RED set summarystats_ true
Queue/DropTail set summarystats_ true
Queue/RED set adaptive_ $opt(adaptive)
Queue/RED set q_weight_ 0.0
Queue/RED set thresh_ $opt(minth)
Queue/RED set maxthresh_ $opt(maxth)
Queue/DropTail set shrink_drops_ true
Agent/TCP set ecn_ $opt(ecn)
Agent/TCP set window_ $opt(window)
DelayLink set avoidReordering_ true

source web.tcl

#Create topology
switch $opt(type) {
umts {cell_topo}
}
set_link_params $opt(type)
$ns insert-delayer $nodes(ms) $nodes(bs1) [new Delayer]
$ns insert-delayer $nodes(bs1) $nodes(ms) [new Delayer]
$ns insert-delayer $nodes(ms) $nodes(bs2) [new Delayer]
$ns insert-delayer $nodes(bs2) $nodes(ms) [new Delayer]

# Set up forward TCP connection

if {$opt(flows) == 0} {
set tcp1 [$ns create-connection TCP/Sack1 $nodes(is) TCPSink/Sack1 $nodes(lp) 0]
set ftp1 [[set tcp1] attach-app FTP]
$ns at 0.8 "[set ftp1] start"
}
if {$opt(flows) > 0} {
set tcp1 [$ns create-connection TCP/Sack1 $nodes(is) TCPSink/Sack1 $nodes(lp) 0]
set ftp1 [[set tcp1] attach-app FTP]
$tcp1 set window_ 100
$ns at 0.0 "[set ftp1] start"

Dept of CSE, RRCE. Page 34

COMPUTER NETWORKS LABORATORY 2019 - 20

$ns at 3.5 "[set ftp1] stop"

set tcp2 [$ns create-connection TCP/Sack1 $nodes(is) TCPSink/Sack1 $nodes(lp) 0]
set ftp2 [[set tcp2] attach-app FTP]
$tcp2 set window_ 3
$ns at 1.0 "[set ftp2] start"
$ns at 8.0 "[set ftp2] stop"
}
proc stop {} {
global nodes opt nf
set wrap $opt(wrap)
set sid [$nodes($opt(srcTrace)) id]
set did [$nodes($opt(dstTrace)) id]
if {$opt(srcTrace) == "is"} {
set a "-a out.tr"
} else {
set a "out.tr"
}
set GETRC "../../../bin/getrc"
set RAW2XG "../../../bin/raw2xg"

exec $GETRC -s $sid -d $did -f 0 out.tr | \

$RAW2XG -s 0.01 -m $wrap -r > plot.xgr
exec $GETRC -s $did -d $sid -f 0 out.tr | \
$RAW2XG -a -s 0.01 -m $wrap >> plot.xgr

exec $GETRC -s $sid -d $did -f 1 out.tr | \

$RAW2XG -s 0.01 -m $wrap -r >> plot.xgr
exec $GETRC -s $did -d $sid -f 1 out.tr | \
$RAW2XG -s 0.01 -m $wrap -a >> plot.xgr

exec ./xg2gp.awk plot.xgr

if {!$opt(quiet)} {
exec xgraph -bb -tk -nl -m -x time -y packets plot.xgr &
}
exit 0
}
$ns at $opt(stop) "stop"
$ns run

Dept of CSE, RRCE. Page 35

COMPUTER NETWORKS LABORATORY 2019 - 20

Output:

CDMA Trace File

Dept of CSE, RRCE. Page 36

COMPUTER NETWORKS LABORATORY 2019 - 20

PART-B
Java is a general-purpose computer programming languagethat is simple,
concurrent,class-based,object-oriented language. The compiled Java code can run on all
platforms that support Java without the need for recompilation hence Java is called as
"writeonce, run anywhere" (WORA).The Java compiled intermediate output called “byte-
code” that can run on any Java virtual machine (JVM) regardless of computer architecture.
The language derives much of its syntax from C and C++, but it has fewer low-level facilities
than either of them.
In Linux operating system Java libraries are preinstalled. It’s very easy and convenient
to compile and run Java programs in Linux environment. To compile and run Java Program
is a two-step process:

1. Compile Java Program from CommandPrompt

[root@host ~]# javac Filename.java

The Java compiler (Javac) compiles java program and generates a byte-code with the
same file name and .class extension.
2. Run Java program from CommandPrompt
[root@host ~]# java Filename

The java interpreter (Java) runs the byte-code and gives the respective output. It is
important to note that in above command we have omitted the .class suffix of thebyte-
code(Filename.class).

1. Write a program for error detecting code using CRC-CCITT (16-bits).

[

Whenever digital data is stored or interfaced, data corruption might occur. Since the
beginning of computer science, developers have been thinking of ways to deal with this type
of problem. For serial data they came up with the solution to attach a parity bit to each sent
byte. This simple detection mechanism works if an odd number of bits in a byte changes, but
an even number of false bits in one byte will not be detected by the parity check .To over
come this problem developers have searched for mathematical sound mechanisms to detect
multiple false bits. The CRC calculation or cyclic redundancy check was the result of this.
Nowadays CRC calculations are used in all types of communications. All packets sent over a
network connection are checked with a CRC. Also each data block on your hard disk has a
CRC value attached to it. Modern computer world cannot do without these CRC calculations.
So let's see why they are so widely used. The answer is simple; they are powerful, detect
many types of errors and are extremely fast to calculate especially when dedicated hardware
chips are used.

Dept of CSE, RRCE. Page 37

COMPUTER NETWORKS LABORATORY 2019 - 20

The ideabehindCRCcalculationistolookatthedataasonelargebinarynumber.This number

is divided by a certain value and the remainder of the calculation is called the CRC. Dividing
in the CRC calculation at first looks to cost a lot of computing power, but it can be performed
very quickly if we use a method similar to the one learned at school. We will as an example
calculate the remainder for the character 'm'—which is 1101101 in binary notation— by
dividing it by 19 or 10011. Please note that 19 is an odd number. This is necessary as we will
see further on. Please refer to your schoolbooks as the binary calculation method here is not
very different from the decimal method you learned when you were young. It might only look
a little bit strange. Also notations differ between countries, but the method is similar.

With decimal calculations you can quickly check that 109 divided by 19 gives a quotient of 5
with 14 as the remainder. But what we also see in the scheme is that every bit extra to check
only costs one binary comparison and in 50% of the cases one binary subtraction. You can
easily increase the number of bits of the test data string—for example to 56 bits if we use our
example value "Lammert"—and the result can be calculated with56binary comparisons and
an average of 28 binary subtractions. This can be implemented in hardware directly with only
very few transistors involved .Also software algorithms can be very efficient.

All of the CRC formulas you will encounter are simply checksum algorithms based
on modulo-2 binary division where we ignore carry bits and in effect the subtraction will be
equal to an exclusive or operation. Though some differences exist in the specifics across
different CRC formulas, the basic mathematical process is always the same:

 The message bits are appended with c zero bits; this augmented message is the dividend
 A predetermined c+1-bit binary sequence, called the generator polynomial, is the divisor
 The checksum is the c-bit remainder that results from the division operation

Dept of CSE, RRCE. Page 38

COMPUTER NETWORKS LABORATORY 2019 - 20

Table 1 lists some of the most commonly used generator polynomials for 16- and 32-bit CRCs.
Remember that the width of the divisor is always one bit wider than the remainder. So, for example,
you’d use a 17-bit generator polynomial whenever a 16-bit checksum is required.

CRC-CCITT CRC-16 CRC-32

Checksum
16 bits 16 bits 32 bits
Width

Generator
10001000000100001 11000000000000101 100000100110000010001110110110111
Polynomial

International Standard CRC Polynomials

Source Code:
import java.io.*;
class Crc
{
public static void main(String args[]) throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int[ ] data;
int[ ]div;
int[ ]divisor;
int[ ]rem;
int[ ] crc;
int data_bits, divisor_bits, tot_length;
System.out.println("Enter number of data bits : ");
data_bits=Integer.parseInt(br.readLine());
data=new int[data_bits];
System.out.println("Enter data bits : ");
for(int i=0; i<data_bits; i++)
data[i]=Integer.parseInt(br.readLine());
System.out.println("Enter number of bits in divisor : ");
divisor_bits=Integer.parseInt(br.readLine());
divisor=new int[divisor_bits];
System.out.println("Enter Divisor bits : ");
for(int i=0; i<divisor_bits; i++)
divisor[i]=Integer.parseInt(br.readLine());

/* System.out.print("Data bits
are:");for(int i=0; i< data_bits;i++)

Dept of CSE, RRCE. Page 39

COMPUTER NETWORKS LABORATORY 2019 - 20

System.out.print(data[i]);
System.out.println();
System.out.print("divisor bits are : ");
for(int i=0; i< divisor_bits; i++)
System.out.print(divisor[i]);
System.out.println();

*/ tot_length=data_bits+divisor_bits-1;

div=newint[tot_length];
rem=new int[tot_length];
crc=new int[tot_length];
/*------------------ CRC GENERATION-----------------------*/
for(int i=0;i<data.length;i++)
div[i]=data[i];

System.out.print("Dividend (after appending 0's) are : ");

for(int i=0; i< div.length; i++)
System.out.print(div[i]);
System.out.println();
for(int j=0; j<div.length; j++){
rem[j] = div[j];
}
rem=divide(div, divisor, rem);
for(inti=0;i<div.length;i++) //append dividend andramainder
{
crc[i]=(div[i]^rem[i]);
}
System.out.println();
System.out.println("CRC code : ");
for(int i=0;i<crc.length;i++)
System.out.print(crc[i]);
/*-------------------ERROR DETECTION---------------------*/
System.out.println();
System.out.println("Enter CRC code of "+tot_length+" bits : ");
for(int i=0; i<crc.length; i++)
crc[i]=Integer.parseInt(br.readLine());

/* System.out.print("crc bits
are:");for(int i=0; i< crc.length;i++)
System.out.print(crc[i]);
System.out.println();
*/
for(int j=0; j<crc.length; j++){

Dept of CSE, RRCE. Page 40

COMPUTER NETWORKS LABORATORY 2019 - 20

rem[j] = crc[j];
}

rem=divide(crc, divisor, rem);

for(int i=0; i< rem.length; i++)

{
if(rem[i]!=0)
{
System.out.println("Error");
break;
}
if(i==rem.length-1)
System.out.println("No Error");
}

System.out.println("THANK YOU.... :)");

}

static int[] divide(int div[],int divisor[], int rem[])

{
int cur=0;
while(true)
{
for(int i=0;i<divisor.length;i++)
rem[cur+i]=(rem[cur+i]^divisor[i]);

while(rem[cur]==0 && cur!=rem.length-1)

cur++;

if((rem.length-cur)<divisor.length)
break;
}
return rem;
}
}

Output:
[root@localhost ~]# vi Crc.java

Dept of CSE, RRCE. Page 41

COMPUTER NETWORKS LABORATORY 2019 - 20

Dept of CSE, RRCE. Page 42

COMPUTER NETWORKS LABORATORY 2019 - 20

2. Write a program to find the shortest path between vertices using bellman-ford
algorithm.
Distance Vector Algorithm is a decentralized routing algorithm that requires that each
router simply inform its neighbors of its routing table. For each network path, the receiving
routers pick the neighbor advertising the lowest cost, then add this entry into its routing table
for re-advertisement. To find the shortest path, Distance Vector Algorithm is based on one of
two basic algorithms: the Bellman-Ford and the Dijkstra algorithms.
Routers that use this algorithm have to maintain the distance tables (which is a one-
dimension array -- "a vector"), which tell the distances and shortest path to sending packets to
each node in the network. The information in the distance table is always update by
exchanging information with the neighboring nodes. The number of data in the table equals to
that of all nodes in networks (excluded itself). The columns of table represent the directly
attached neighbors whereas the rows represent all destinations in the network. Each data
contains the path for sending packets to each destination in the network and distance/or time
to transmit on that path (we call this as "cost"). The measurements in this algorithm are the
number of hops, latency, the number of outgoing packets, etc.
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single
source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's
algorithm for the same problem, but more versatile, as it is capable of handling graphs in
which some of the edge weights are negative numbers. Negative edge weights are found in
various applications of graphs, hence the usefulness of this algorithm. If a graph contains a
"negative cycle"(i.e.a cycle whose edges sum to a negative value) that is reachable from the
source, then there is no cheapest path: any path that has a point on the negative cycle can be
made cheaper by one more walk around the negative cycle. In such a case, the Bellman–Ford
algorithm can detect negative cycles and report their existence
Source code:
import java.util.Scanner;

public class BellmanFord

{
private int D[];
private int num_ver;
public static final int MAX_VALUE = 999;

public BellmanFord(int num_ver)

{
this.num_ver = num_ver;
D = new int[num_ver + 1];
}

public void BellmanFordEvaluation(int source, int A[][])

{
for (int node = 1; node <= num_ver; node++)
{
D[node] = MAX_VALUE;

Dept of CSE, RRCE. Page 43

COMPUTER NETWORKS LABORATORY 2019 - 20

}
D[source] = 0;
for (int node = 1; node <= num_ver - 1; node++)
{
for (int sn = 1; sn <= num_ver; sn++)
{
for (int dn = 1; dn <= num_ver; dn++)
{
if (A[sn][dn] != MAX_VALUE)
{
if (D[dn] > D[sn]+ A[sn][dn])
D[dn] = D[sn] + A[sn][dn];
}
}
}
}
for (int sn = 1; sn <= num_ver; sn++)
{
for (int dn = 1; dn <= num_ver; dn++)
{
if (A[sn][dn] != MAX_VALUE)
{
if (D[dn] > D[sn]+ A[sn][dn])
System.out.println("The Graph contains negative egde cycle");
}
}
}
for (int vertex = 1; vertex <= num_ver; vertex++)
{
System.out.println("distance of source " + source + " to "+ vertex + "
is " + D[vertex]);
}
}

public static void main(String[ ] args)

{
int num_ver = 0;
int source;
Scanner scanner = new Scanner(System.in);
System.out.println("Enter the number of vertices");
num_ver = scanner.nextInt();
int A[][] = new int[num_ver + 1][num_ver + 1];
System.out.println("Enter the adjacency matrix");
for (int sn = 1; sn <= num_ver; sn++)
{
for (int dn = 1; dn <= num_ver; dn++)
{

Dept of CSE, RRCE. Page 44

COMPUTER NETWORKS LABORATORY 2019 - 20

A[sn][dn] = scanner.nextInt();
if (sn == dn)
{
A[sn][dn] = 0;
continue;
}
if (A[sn][dn] == 0)
{
A[sn][dn] = MAX_VALUE;
}
}
}
System.out.println("Enter the source vertex");
source = scanner.nextInt();
BellmanFord b = new BellmanFord (num_ver);
b.BellmanFordEvaluation(source, A);
scanner.close();
}
}

Input graph:

5
A B

3
4

C D
2

Output:

Dept of CSE, RRCE. Page 45

COMPUTER NETWORKS LABORATORY 2019 - 20

3. Using TCP/IP sockets, write a client – server program to make the client send the file
name and to make the server send back the contents of the requested file if present.
Implement the above program using as message queues or FIFOs as IPC channels.

Socket is an interface which enables the client and the server to communicate and
pass on information from one another. Sockets provide the communication mechanism
between two computers using TCP. A client program creates a socket on its end of the
communication and attempts to connect that socket to a server. When the connection is
made,the server creates socket object on it send of the communication. The client and the
server can now communicate by writing to and reading from the socket.

Source Code:

TCP Client
tcpclient.java
import java.io.*;
import java.net.*;
public class tcpclient
{
public static void main( String args[ ])throws Exception
{
Socket sock = new Socket( "127.0.0.1", 8080);

System.out.println("Connection was accepted with server");

System.out.println("Enter the file name");
BufferedReader keyRead = new BufferedReader(new InputStreamReader(System.in));
String fname = keyRead.readLine();
Dept of CSE, RRCE. Page 46
COMPUTER NETWORKS LABORATORY 2019 - 20

File f=new File(fname);

OutputStream ostream = sock.getOutputStream( );
PrintWriter pwrite = new PrintWriter(ostream, true);
pwrite.println(fname);

if(!f.exists()||f.isDirectory())

System.out.println("file doesn't exist");

System.exit(0);

// receiving the contents from server. Uses input stream

InputStream istream = sock.getInputStream();
BufferedReader socketRead = new BufferedReader(new InputStreamReader(istream));
System.out.println("Server accepted the request...receiving file......\n");

System.out.println("Content of File");

System.out.println("---------------\n");
String str;
// reading line-by-line
while((str = socketRead.readLine()) != null)
{
System.out.println(str);
}

pwrite.close(); socketRead.close(); keyRead.close();

sock.close();
}
}

TCP SERVER
tcpserver.java

import java.net.*;
import java.io.*;
public class tcpserver
{
public static void main(String[] args) throws Exception
{

ServerSocket sersock = new ServerSocket(8080);

System.out.println("Server ready for connection");
Socket sock = sersock.accept();
System.out.println("Connection is successful and wating for request");

InputStream istream = sock.getInputStream( );

Dept of CSE, RRCE. Page 47

COMPUTER NETWORKS LABORATORY 2019 - 20

BufferedReader fileRead =new BufferedReader(new InputStreamReader(istream));

String fname = fileRead.readLine( );

File f=new File(fname);

if(!f.exists())

System.out.println("client requested file doesn't exist");

System.exit(0);

System.out.println("A request for filename"+" " +fname+" "+ " is received");

BufferedReader contentRead = new BufferedReader(new FileReader(fname) );

OutputStream ostream = sock.getOutputStream( );

PrintWriter pwrite = new PrintWriter(ostream, true);

String str;
while((str = contentRead.readLine()) != null)
{
pwrite.println(str);
}
System.out.println("Request closed");
sock.close();
sersock.close();
pwrite.close();
fileRead.close();
contentRead.close();
}

Note: Create two different files Client.java and Server.java. Follow the steps given:
1. Open a terminal run the server program and provide the filename to send
2. Open one more terminal run the client program and provide the IP address of the
server. We can give local host address “127.0.0.1” as it is running on same
machine or give the IP address of the machine.
3. Send any start bit to start sending file.
4. Refer https://www.tutorialspoint.com/java/java_networking.htm for all the
parameters, methods description in socket communication.

Output:

Dept of CSE, RRCE. Page 48

COMPUTER NETWORKS LABORATORY 2019 - 20

Dept of CSE, RRCE. Page 49

COMPUTER NETWORKS LABORATORY 2019 - 20

4. Write a program on datagram socket for client/server to display the messages on

client side, typed at the server side.
A datagram socket is the one for sending or receiving point for a packet delivery
service. Each packet sent or received on a datagram socket is individually addressed and
routed. Multiple packets sent from one machine to another may be routed differently, and
may arrive in any order.

Source Code:
UDP Client
dataclient.java
import java.net.*;
public class dataclient
{
public static void main(String[] args) throws Exception
{
DatagramSocket ds = new DatagramSocket(3000);
byte[] buf = new byte[1024];
DatagramPacket dp = new DatagramPacket(buf, 1024);
ds.receive(dp);
String str = new String(dp.getData(), 0, dp.getLength());
System.out.println(str);
ds.close();
}
}

UDP Server

dataserver.java

import java.net.*;
import java.util.Scanner;
public class dataserver
{
public static void main(String[] args) throws Exception
{
DatagramSocket ds = new DatagramSocket();
System.out.println("Enter the Message");
Scanner sc=new Scanner(System.in);
String str=sc.nextLine();
InetAddress ip = InetAddress.getByName("127.0.0.1");
DatagramPacket dp = new DatagramPacket(str.getBytes(), str.length(), ip, 3000);
ds.send(dp);
ds.close();

}
}

Dept of CSE, RRCE. Page 50

COMPUTER NETWORKS LABORATORY 2019 - 20

Note: Create two different files UDPC.java and UDPS.java. Follow the following steps:
1. Open a terminal run the server program.
2. Open one more terminal run the client program, the sent message will be
received.

OUTPUT:

Dept of CSE, RRCE. Page 51

COMPUTER NETWORKS LABORATORY 2019 - 20

5. Write a program for simple RSA algorithm to encrypt and decrypt thedata.

RSA is an example of public key cryptography. It was developed by

Rivest, Shamir and Adelman. The RSA algorithm can be used for both public key
encryption and digital signatures. Its security is based on the difficulty of factoring
large integers.

The RSA algorithm's efficiency requires a fast method for performing the
modular exponentiation operation. A less efficient, conventional method includes
raising a number (the input) to a power (the secret or public key of the algorithm,
denoted e and d, respectively) and taking the remainder of the division with N. A
straight-forward implementation performs these two steps of the operation
sequentially: first, raise it to the power and second, apply modulo. The RSA
algorithm comprises of three steps, which are depicted below:

Key Generation Algorithm

1. Generate two large random primes, p and q, of approximately equal size such
that their product n =p*q
2. Compute n = p*q and Euler’s quotient function (φ) phi(n) =(p-1)(q-1).
3. Choose an integer e, 1 < e < phi, such that gcd(e, phi) =1.
4. Compute the secret exponent d, 1 < d < phi, such
that e*d ≡ 1 (modphi).
5. The public key is (e, n) and the private key is (d, n). The values of p, q,
and phi should also be keptsecret.

Encryption
Sender A does the following:-

1. Using the public key(e,n)

2. Represents the plaintext message as a positive integer M
3. Computes the cipher text C = M^e mod n.
4. Sends the cipher text C to B(Receiver).

Decryption
Recipient B does the following:-

1. Uses his private key (d, n) to compute M = C^d modn.

2. Extracts the plaintext from the integer representative m.

Source Code:
RSA Key Generation
import java.util.Scanner;

public class rsa {

public static long m,r,e,d,c;
public static int phi,n;

public static long gcd(long x, long y)

{
Dept of CSE, RRCE. Page 52
COMPUTER NETWORKS LABORATORY 2019 - 20

while(y!=0)
{
r=x%y;
x=y;
y=r;
}
return x;
}
public static void encrypt()
{

int i;
long c=1;
for(i=0;i<e;i++)
{
c=c*m%n;
}
System.out.println("\n \t encrypted:"+ c);
}
public static void decrypt()
{
int i;
long m=1;
for(i=0;i<d;i++)
{
m=m*c%n;
}
System.out.println("\n \t decrypted keyword:"+m);
}

public static void main(String[] args) {

int i,p,q;
Scanner sc = new Scanner(System.in);
System.out.println("\n Enter two prime no's:\t");
p=sc.nextInt();
q=sc.nextInt();
n=p*q;
System.out.println("The value of n="+ n);
phi=(p-1)*(q-1);
System.out.println("The value of phi="+ phi);

for(i=2;i<phi;i++)
if(gcd(i,phi)==1)
break;
e=i;
System.out.println("\n The value of e(public key)="+e);
for(i=2;i<phi;i++)

Dept of CSE, RRCE. Page 53

COMPUTER NETWORKS LABORATORY 2019 - 20

if((i*e - 1)%phi==0)
break;
d=i;
System.out.println("\n The value of d(private key)="+ d);
System.out.println("\n Enter the plain text:");
m=sc.nextLong();
encrypt();
System.out.println("\n Enter cipher text:\t");
c=sc.nextLong();
decrypt();
sc.close();
}
}
Output:

Dept of CSE, RRCE. Page 54

COMPUTER NETWORKS LABORATORY 2019 - 20

6. Write a program for congestion control using leaky bucket algorithm.

The main concept of the leaky bucket algorithm is that the output data flow remains
constant despite the variant input traffic, such as the water flow in a bucket with a small hole
at the bottom. In case the bucket contains water (or packets) then the output flow follows a
constant rate, while if the bucket is full any additional load will be lost because of spill over.
In a similar way if the bucket is empty the output will be zero.
From network perspective, leaky bucket consists of a finite queue (bucket) where all the
incoming packets are stored in case there is space in the queue, otherwise the packets are
discarded. In order to regulate the output flow, leaky bucket transmits one packet from the
queue in a fixed time (e.g. at every clock tick).In the following figure we can notice the main
rationale of leaky bucket algorithm, for both the two approaches (e.g. leaky bucket with water
(a) and with packets(b)).

While leaky bucket eliminates completely bursty traffic by regulating the incoming
data flow its main drawback is that it drops packets if the bucket is full. Also, it doesn’t take
into account the idle process of the sender which means that if the host doesn’t transmit data
for some time the bucket becomes empty without permitting the transmission of any packet.

Source Code:
import java.util.Scanner;
import java.util.*;
public class leaky {
public static int bucketsize=512;
public static void bktinput(int pktsize, int op)throws Interrupted Exception
{
if(pktsize > bucketsize)
System.out.println("\n packet discarded");
else
{

Dept of CSE, RRCE. Page 55

COMPUTER NETWORKS LABORATORY 2019 - 20

while(pktsize>op)
{
Thread.sleep(100);
System.out.println("\n bytes outputted"+ op);
pktsize = pktsize - op;
}
if(pktsize > 0)
System.out.println("\n last"+pktsize+" bytes sent");
System.out.println("\n bucket outputted scccessful\n");
}
}

public static void main(String[] args)throws InterruptedException {

// TODO Auto-generated method stub
int i, op, pktsize;
Scanner sc = new Scanner(System.in);
Random r=new Random();
System.out.println("enter output rate: \n");
op=sc.nextInt();
for(i=0;i<5;i++)
{
Thread.sleep(100);
pktsize = Math.abs(r.nextInt())%1000;
System.out.println("\n pktno:"+i+"\t pktsize:"+ pktsize);
bktinput(pktsize, op);
}
sc.close();
}

Dept of CSE, RRCE. Page 56

COMPUTER NETWORKS LABORATORY 2019 - 20

OUTPUT:

Dept of CSE, RRCE. Page 57