INDEX

Exp No Page No
Name of the Experiment

Learn to use commands like tcpdump, netstat, ifconfig, nslookup and 1

traceroute. Capture ping and traceroute PDUs using a network protocol
1
analyzer and examine

Write a HTTP web client program to download a web page using TCP 6
2
sockets
Applications using TCP sockets: Echo client and echo server
3 10
Applications using TCP sockets: Chat
4 14
Applications using TCP sockets: File
5 18
Transfer

6 Simulation of DNS using UDP sockets. 22

Write a code simulating ARP protocols 26

7

8 Write a code simulating RARP protocols 29

Study of Network simulator (NS) and Simulation of Congestion Control 33

9 Algorithms using NS

Study of TCP/UDP performance using Simulation tool. 36

10

Simulation of Distance Vector Routing algorithm. 41

11

Simulation of Link State Routing algorithm. 47

12

Performance evaluation of Routing protocols using 50

13 Simulation tool.
Simulation of error correction code (like CRC) 61
14

Simulation of Go Back N Protocol 66

15
Carrier Sense Multiple Access

1
 Ex. No : 1 Learn to use commands like tcpdump, netstat, ifconfig, nslookup
and traceroute. Capture ping and traceroute PDUs using a
network protocol analyzer and examine.

AIM :
To Learn to use commands like tcpdump, netstat, ifconfig, nslookup and traceroute
ping.

COMMANDS :
1. Tcpdump:
Display traffic between 2 hosts:
To display all traffic between two hosts (represented by variables host1 and host2): #
tcpdump host host1 and host2
Display traffic from a source or destination host only:
To display traffic from only a source (src) or destination (dst) host:
# tcpdump src host
# tcpdump dst host
Display traffic for a specific protocol
Provide the protocol as an argument to display only traffic for a specific protocol, for
example tcp, udp, icmp, arp
# tcpdump protocol
For example to display traffic only for the tcp traffic :
# tcpdump tcp
Filtering based on source or destination port
To filter based on a source or destination port:
# tcpdump src port ftp
# tcpdump dst port http

1
2. Netstat
Netstat is a common command line TCP/IP networking available in most versions of
Windows, Linux, UNIX and other operating systems. Netstat provides information and
statistics about protocols in use and current TCP/IP network connections. The Windows
help screen (analogous to a Linux or UNIX for netstat reads as follows:
displays protocol statistics and current TCP/IP network connections.
#netstat

3. ipconfig
In Windows, ipconfig is a console application designed to run from the Windows
command prompt. This utility allows you to get the IP address information of a Windows
computer.
Using ipconfig
From the command prompt, type ipconfig to run the utility with default options. The
output of the default command contains the IP address, network mask, and gateway for
all physical and virtual
network adapter.

2
#ipconfig

4. nslookup
The nslookup (which stands for name server lookup) command is a network utility
program used to obtain information about internet servers. It finds name server
information for domains by querying the Domain Name System. The nslookup command
is a powerful tool for diagnosing DNS problems. You know you're experiencing a DNS
problem when you can access a resource by specifying its IP address but not its
DNS name.
#nslookup

5. Trace route:
Traceroute uses Internet Control Message Protocol (ICMP) echo packets with
variable time to live (TTL) values. The response time of each hop is calculated. To
guarantee accuracy, each hop is queried multiple times (usually three times) to better
measure the response of that particular hop. Traceroute is a network diagnostic tool used
to track the pathway taken by a packet on an IP network from source to destination.
Traceroute also records the time taken for each hop the packet makes
during its route to the destination. Traceroute uses Internet Control Message Protocol
(ICMP) echo packets with variable time to live (TTL) values. The response time of each

3
hop is calculated. To guarantee accuracy, each hop is queried multiple times (usually
three times) to better measure the response of that particular hop. Traceroute
sends packets with TTL values that gradually increase from packet to packet, starting
with TTL value of one. Routers decrement TTL values of packets by one when routing
and discard packets whose TTL value has reached zero, returning the ICMP error
message ICMP Time Exceeded. For the first set of packets, the first router receives the
packet, decrements the TTL value and drops the packet because it then has TTL value
zero. The router sends an ICMP Time Exceeded message back to the source. The next set
of packets are given a TTL value of two, so the first router
forwards the packets, but the second router drops them and replies with ICMP Time
Exceeded.
Proceeding in this way, traceroute uses the returned ICMP Time Exceeded messages
to build a list of routers that packets traverse, until the destination is reached and returns
an ICMP Echo Reply message. With the tracert command shown above, we're asking
tracert to show us the path from the local computer all the way to the network device with
the hostname
www.google.com.

#tracert google.com

4
6. Ping:
The ping command sends an echo request to a host available on the network. Using this
command, you can check if your remote host is responding well or not. Tracking and
isolating hardware and software problems. Determining the status of the network and
various foreign hosts. The ping command is usually used as a simple way to verify that a
computer can communicate over the network with another computer or network device.
The ping command operates by sending Internet Control Message Protocol (ICMP) Echo
Request messages to the destination computer and waiting for a response

# ping172.16.6.2

RESULT:
Thus the various networks commands like tcpdump, netstat, ifconfig, nslookup and
traceroute ping are executed successfully

5
 Ex. No : 2 Write a HTTP web client program to download a web page using TCP

AIM :
To write a java program for socket for HTTP for web page upload and download .

ALGORITHM:

Client:
1. Start.
2. Create socket and establish the connection with the server.
3. Read the image to be uploaded from the disk
4. Send the image read to the server
5. Terminate the connection
6. Stop.

Server:
1. Start
2. Create socket, bind IP address and port number with the created socket and
make server a listening server.
3. Accept the connection request from the client
4. Receive the image sent by the client.
5. Display the image.
6. Close the connection.
7. Stop

6
PROGRAM:
Client:
import javax.swing.*;
import java.net.*;
import java.awt.image.*;
import javax.imageio.*;
import java.io.*;
import java.awt.image.BufferedImage;
import java.io.ByteArrayOutputStream;
import java.io.File;
import java.io.IOException;
import javax.imageio.ImageIO;

public class Client {

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

Socket soc;
BufferedImage img = null;
soc = new Socket("localhost", 4000);
System.out.println("Client is running.");

try {
System.out.println("Reading image from disk. ");
img = ImageIO.read(new
File("digital_image_processing.jpg")); ByteArrayOutputStream
baos = new ByteArrayOutputStream(); ImageIO.write(img,
"jpg", baos);
baos.flush();
byte[] bytes = baos.toByteArray();
baos.close();
System.out.println("Sending image to server.");
OutputStream out = soc.getOutputStream();
DataOutputStream dos = new DataOutputStream(out);
dos.writeInt(bytes.length);
dos.write(bytes, 0, bytes.length);
System.out.println("Image sent to server. ");
dos.close();
out.close();

7
} catch (Exception e) {

8
 System.out.println("Exception: " + e.getMessage());

soc.close();
}
soc.close();
}
}

SERVER:
import java.net.*;
import java.io.*;
import java.awt.image.*;
import javax.imageio.*;
import javax.swing.*;

class Server {
public static void main(String args[]) throws Exception {
ServerSocket server = null;
Socket socket;
server = new ServerSocket(4000);
System.out.println("Server Waiting for image");
socket = server.accept();
System.out.println("Client connected.");
InputStream in = socket.getInputStream();
DataInputStream dis = new DataInputStream(in);
int len = dis.readInt();
System.out.println("Image Size: " + len / 1024 + "KB");
byte[] data = new byte[len];
dis.readFully(data);
dis.close();
in.close();
InputStream ian = new
ByteArrayInputStream(data); BufferedImage
bImage = ImageIO.read(ian); JFrame f = new
JFrame("Server");
ImageIcon icon = new ImageIcon(bImage);
JLabel l = new JLabel();
l.setIcon(icon);
f.add(l);

9
f.pack();

10
 f.setVisible(true);
}
}

OUTPUT:
When you run the client code, following output screen would appear on client side.

RESULT:
Thus the socket program for HTTP for web page upload and download was
developed and executed successfully.

11
 Ex. No : 3
Applications using TCP sockets: Echo client and echo server

AIM :
To write a java program for application using TCP Sockets Link.

ALGORITHM:
Client:
1. Start
2. Create the TCP socket
3. Establish connection with the server
4. Get the message to be echoed from the user
5. Send the message to the server
6. Receive the message echoed by the server
7. Display the message received from the server
8. Terminate the connection
9. Stop
Server:
1. Start
2. Create TCP socket, make it a listening socket
3. Accept the connection request sent by the client for connection establishment
4. Receive the message sent by the client
5. Display the received message
6. Send the received message to the client from which it receives
7. Close the connection when client initiates termination and server becomes a
listening server, waiting for clients.
8. Stop.

12
PROGRAM:
EServer.java
import java.net.*;
import java.io.*;

public class EServer {

public static void main(String args[]) {
ServerSocket s = null;
String line;
DataInputStream is;
PrintStream ps;
Socket c = null;
try {
s = new ServerSocket(9000);
} catch (IOException e) {

System.out.println(e);

}
try {

c = s.accept();
is = new DataInputStream(c.getInputStream());

ps = new PrintStream(c.getOutputStream());
while (true) {
line = is.readLine();
ps.println(line);
}
} catch (IOException e) {
System.out.println(e);
}
}
}

13
EClient.java
import java.net.*;
import java.io.*;

public class EClient {

public static void main(String arg[]) {
Socket c = null;
String line;
DataInputStream is, is1;
PrintStream os;
try {
InetAddress ia = InetAddress.getLocalHost();
c = new Socket(ia, 9000);
} catch (IOException e) {
System.out.println(e);

}
try {

os = new PrintStream(c.getOutputStream());
is = new DataInputStream(System.in);
is1 = new DataInputStream(c.getInputStream());
while (true) {
System.out.println("Client:");
line = is.readLine();
os.println(line);
System.out.println("Server:" + is1.readLine());
}
} catch (IOException e) {
System.out.println("Socket Closed!");
}
}
}

14
OUTPUT:
Server:
C:\Program Files\Java\jdk1.5.0\bin>javac EServer.java
C:\Program Files\Java\jdk1.5.0\bin>java EServer C:\
Program Files\Java\jdk1.5.0\bin>Client
C:\Program Files\Java\jdk1.5.0\bin>javac EClient.java
C:\Program Files\Java\jdk1.5.0\bin>java EClient
Client: Hai Server
Server:Hai Server
Client: Hello
Server:Hello
Client:end
Server:end
Client:ds
Socket Closed!

RESULT:
Thus the java application program using TCP Sockets was developed and executed
successfully.

15
 Ex. No : 4
Applications using TCP sockets: Chat

AIM:
To write a java program for application using TCP Sockets Link for Chat
Application.

ALGORITHM:
Client:
1. Start
2. Create the UDP datagram socket
3. Get the request message to be sent from the user
4.Send the request message to the server
5. If the request message is ―END‖ go to step 10
6. Wait for the reply message from the server
7.Receive the reply message sent by the server
8.Display the reply message received from the server
9.Repeat the steps from 3 to 8
10.Stop

Server:
1. Start
2. Create UDP datagram socket, make it a listening
socket 3.Receive the request message sent by the client
4. If the received message is ―END‖ go to step 10
5. Retrieve the client‘s IP address from the request message
received 6.Display the received message
7.Get the reply message from the user
8.Send the reply message to the client

16
 9.Repeat the steps from 3 to 8.
10.Stop.

PROGRAM:
UDPserver.java
import java.io.*;
import java.net.*;

class UDPserver {
public static DatagramSocket ds;
public static byte buffer[] = new byte[1024];
public static int clientport = 789, serverport = 790;

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

ds = new DatagramSocket(clientport);
System.out.println("press ctrl+c to quit the program");
BufferedReader dis = new BufferedReader(new InputStreamReader(System.in));
InetAddress ia = InetAddress.geyLocalHost();
while (true) {
DatagramPacket p = new DatagramPacket(buffer, buffer.length);
ds.receive(p);
String psx = new String(p.getData(), 0, p.getLength());
System.out.println("Client:" + psx);
System.out.println("Server:");
String str = dis.readLine();
if (str.equals("end"))
break;
buffer = str.getBytes();
ds.send(new DatagramPacket(buffer, str.length(), ia, serverport));
}
}
}

17
UDPclient.java
import java.io.*;
import java.net.*;

class UDPclient {
public static DatagramSocket ds;
public static int clientport = 789, serverport = 790;

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

byte buffer[] = new byte[1024];
ds = new DatagramSocket(serverport);
BufferedReader dis = new BufferedReader(new InputStreamReader(System.in));
System.out.println("server waiting");
InetAddress ia = InetAddress.getLocalHost();
while (true) {
System.out.println("Client:");
String str = dis.readLine();
if (str.equals("end"))
break;
buffer = str.getBytes();
ds.send(new DatagramPacket(buffer, str.length(), ia, clientport));
DatagramPacket p = new DatagramPacket(buffer,
buffer.length); ds.receive(p);
String psx = new String(p.getData(), 0,
p.getLength()); System.out.println("Server:" + psx);
}
}
}

18
OUTPUT:
Server
C:\Program Files\Java\jdk1.5.0\bin>javac UDPserver.java C:\
Program Files\Java\jdk1.5.0\bin>java UDPserver
press ctrl+c to quit the program Client:Hai Server
Server:Hello Client
Client:How are You
Server:I am Fine
Client
C:\Program Files\Java\jdk1.5.0\bin>javac UDPclient.java
C:\Program Files\Java\jdk1.5.0\bin>java UDPclient
server waiting
Client:Hai Server
Server:Hello Clie
Client:How are You
Server:I am Fine
Client:end

RESULT:
Thus the java application program using TCP Sockets was developed and executed
successfully.

19
 Ex. No : 5
Applications using TCP sockets: File Transfer

AIM:
To write a java program for file transfer using TCP Sockets.

ALGORITHM:
Server:
1.Import java packages and create class file server.
2.Create a new server socket and bind it to the port.
3.Accept the client connection
4.Get the file name and stored into the BufferedReader.
5.Create a new object class file and realine.
6.If file is exists then FileReader read the content until EOF is reached.
7.Stop the program.
Client:
1.Import java packages and create class file server.
2.Create a new server socket and bind it to the port.
3.Now connection is established.
4. The object of a BufferReader class is used for storing data content which has
been retrieved from socket object.
5. The connection is closed.
6.Stop the program.

PROGRAM:
File Server :
import java.io.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.OutputStream;
import java.net.InetAddress;

20
import java.net.ServerSocket;import java.net.Socket

public class FileServer {

public static void main(String[] args) throws Exception {
// Initialize Sockets
ServerSocket ssock = new ServerSocket(5000);
Socket socket = ssock.accept();
// The InetAddress specification
InetAddress IA = InetAddress.getByName("localhost");

// Specify the file

File file = new File("e:\\Bookmarks.html");
FileInputStream fis = new
FileInputStream(file);
BufferedInputStream bis = new BufferedInputStream(fis); // Get socket's output stream
OutputStream os = socket.getOutputStream(); // Read File Contents into contents array
byte[] contents;
long fileLength = file.length();
long current = 0;
long start = System.nanoTime();
while (current != fileLength) {
int size = 10000;
if (fileLength - current >= size)
current += size;
else {
size = (int) (fileLength - current);
current = fileLength;
}
contents = new byte[size];

bis.read(contents, 0, size);
os.write(contents);
System.out.print("Sending file ... " + (current * 100) / fileLength + "% complete!");
}
os.flush();
// File transfer done. Close the socket connection! socket.close();
ssock.close();
System.out.println("File sent succesfully!");
}
}
21
File Client:
import java.io.BufferedOutputStream;
import java.io.FileOutputStream;
import java.io.InputStream;
import java.net.InetAddress;
import java.net.Socket;

public class FileClient {

public static void main(String[] args) throws Exception {
// Initialize socket
Socket socket = new Socket(InetAddress.getByName("localhost"), 5000);
byte[] contents = new byte[10000];
// Initialize the FileOutputStream to the output file's full path.
// FileOutputStream fos = new FileOutputStream("e:\\Bookmarks1.html");
BufferedOutputStream bos = new BufferedOutputStream(fos);
InputStream is = socket.getInputStream();
// No of bytes read in one read() call int bytesRead = 0;
while ((bytesRead = is.read(contents)) != -1)
bos.write(contents, 0, bytesRead);
bos.flush();
socket.close();
System.out.println("File saved successfully!");
}
}

OUTPUT:
Server:
E:\nwlab>java FileServer
Sending file ... 9% complete!
Sending file ... 19% complete!
Sending file ... 28% complete!
Sending file ... 38% complete!
Sending file ... 47% complete!
Sending file ... 57% complete!
Sending file ... 66% complete!
Sending file ... 76% complete!

22
 Sending file ... 86% complete!
Sending file ... 95% complete!
Sending file ... 100% complete!
File sent successfully!

Client:
E:\nwlab>client E:\
nwlab>java FileClient
File saved successfully!
E:\nwlab>

RESULT:
Thus the java application program using TCP Sockets was developed and executed
successfully.

23
 Ex. No : 6 Simulation of DNS using UDP Sockets

AIM:
To write a java program for DNS application

ALGORITHM:
Server:
1. Start
2. Create UDP datagram socket
3. Create a table that maps host name and IP address
4.Receive the host name from the client
5.Retrieve the client‘s IP address from the received datagram
6.Get the IP address mapped for the host name from the table.
7.Display the host name and corresponding IP address
8.Send the IP address for the requested host name to the client
9.Stop.
Client:
1. Start
2. Create UDP datagram socket.
3.Get the host name from the client
4.Send the host name to the server
5.Wait for the reply from the server
6.Receive the reply datagram and read the IP address for the requested host name
7.Display the IP address.
8.Stop.

24
PROGRAM:
DNS Server.java
import java.io.*;
import java.net.*;

public class udpdnsserver {

private static int indexOf(String[] array, String str) {
str = str.trim();
for (int i = 0; i < array.length; i++) {
if (array[i].equals(str))
return i;
}
return -1;
}

public static void main(String arg[]) throws IOException {

String[] hosts = { "yahoo.com", "gmail.com", "cricinfo.com", "facebook.com" };
String[] ip = { "68.180.206.184", "209.85.148.19", "80.168.92.140", "69.63.189.16" };
System.out.println("Press Ctrl + C to Quit");
while (true) {
DatagramSocket serversocket = new DatagramSocket(1362);
byte[] senddata = new byte[1021];
byte[] receivedata = new byte[1021];
DatagramPacket recvpack = new DatagramPacket(receivedata, receivedata.length);
serversocket.receive(recvpack);
String sen = new String(recvpack.getData());

InetAddress ipaddress = recvpack.getAddress();

int port = recvpack.getPort();
String capsent;
System.out.println("Request for host " + sen);
if (indexOf(hosts, sen) != -1)
capsent = ip[indexOf(hosts, sen)];
else
capsent = "Host Not Found";
senddata = capsent.getBytes();
DatagramPacket pack = new DatagramPacket(senddata, senddata.length, ipaddress, port);
serversocket.send(pack);
serversocket.close();

25
 }
}
}

UDP DNS Client java

import java.io.*;
import java.net.*;

public class udpdnsclient {

public static void main(String args[]) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
DatagramSocket clientsocket = new DatagramSocket();
InetAddress ipaddress;
if (args.length == 0)
ipaddress = InetAddress.getLocalHost();
else
ipaddress = InetAddress.getByName(args[0]);
byte[] senddata = new byte[1024];
byte[] receivedata = new byte[1024];
int portaddr = 1362;
System.out.print("Enter the hostname : ");
String sentence = br.readLine();
Senddata = sentence.getBytes();
DatagramPacket pack = new DatagramPacket(senddata, senddata.length, ipaddress, portaddr);

clientsocket.send(pack);
DatagramPacket recvpack = new DatagramPacket(receivedata, receivedata.length);
clientsocket.receive(recvpack);
String modified = new String(recvpack.getData());
System.out.println("IP Address: " + modified);
clientsocket.close();

}
}

26
OUTPUT:
Server:
javac udpdnsserver.java
java udpdnsserver
Press Ctrl + C to Quit
Request for host yahoo.com
Request for host cricinfo.com
Request for host youtube.com

Client:
>javac udpdnsclient.java
>java udpdnsclient
Enter the hostname : yahoo.com
IP Address: 68.180.206.184
>java udpdnsclient
Enter the hostname : cricinfo.com
IP Address: 80.168.92.140
>java udpdnsclient
Enter the hostname : youtube.com
IP Address: Host Not Found

RESULT:
Thus the java application program using UDP Sockets to implement DNS was
developed and executed successfully

27
 Ex. No : 7 Write a code simulating ARP protocols

AIM:
To write a java program for simulating ARP and RARP protocols using TCP.

ALGORITHM:
Client:
1. Start the program
2. Create socket and establish connection with the server.
3. Get the IP address to be converted into MAC address from the user.
4.Send this IP address to server.
5.Receive the MAC address for the IP address from the server.
6.Display the received MAC address
7.Terminate the connection
Server:
1. Start the program
2. Create the socket, bind the socket created with IP address and port number and
make it a listening socket.
3. Accept the connection request when it is requested by the client.
4. Server maintains the table in which IP and corresponding MAC addresses are
stored.
5. Receive the IP address sent by the client.
6. Retrieve the corresponding MAC address for the IP address and send it to the
client.
7. Close the connection with the client and now the server becomes a listening server
waiting for the connection request from other clients
8. Stop

28
PROGRAM:
Client:
import java.io.*;
import java.net.*;
import java.util.*;

class Clientarp {
public static void main(String args[]) {
try {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
Socket clsct = new Socket("127.0.0.1", 139);
DataInputStream din = new DataInputStream(clsct.getInputStream());
DataOutputStream dout = new DataOutputStream(clsct.getOutputStream());
System.out.println("Enter the Logical address(IP):");
String str1 = in.readLine();
dout.writeBytes(str1 + '\n');
String str = din.readLine();

System.out.println("The Physical Address is: " + str);

clsct.close();
} catch (Exception e) {
System.out.println(e);
}
}
}

Server:
import java.io.*;
import java.net.*;
import java.util.*;

class Serverarp {
public static void main(String args[]) {
try {
ServerSocket obj = new ServerSocket(139);
Socket obj1 = obj.accept();
while (true) {
DataInputStream din = new DataInputStream(obj1.getInputStream());

29
 DataOutputStream dout = new DataOutputStream(obj1.getOutputStream());
String str = din.readLine();
String ip[] = { "165.165.80.80", "165.165.79.1" };
String mac[] = { "6A:08:AA:C2", "8A:BC:E3:FA" };
for (int i = 0; i < ip.length; i++) {
if (str.equals(ip[i])) {
dout.writeBytes(mac[i] + '\n');
break;
}
}
obj.close();
}
} catch (Exception e) {

System.out.println(e);
}
}}}

OUTPUT:
E:\networks>java Serverarp
E:\networks>java Clientarp
Enter the Logical address(IP):
165.165.80.80
The Physical Address is: 6A:08:AA:C2

RESULT :
Thus the program for implementing to display simulating ARP protocols was
executed successfully and output is verified.

30
 Ex. No : 8 Write a code simulating RARP protocols

AIM:
To write a Program for Reverse Address Resolution Protocol (RARP) using UDP

ALGORITHM:
Client:
1.Start the program
2.Create datagram socket
3.Get the MAC address to be converted into IP address from the user.
4.Send this MAC address to server using UDP datagram.
5.Receive the datagram from the server and display the corresponding IP address.
6.Stop
Server:
1. Start the program.
2. Server maintains the table in which IP and corresponding MAC addresses are
stored.
3. Create the datagram socket
4. Receive the datagram sent by the client and read the MAC address sent.
5.Retrieve the IP address for the received MAC address from the table.
6.Display the corresponding IP address.
7.Stop

PROGRAM:
Client:
import java.io.*;
import java.net.*;
import java.util.*;

31
class Clientrarp12 {
public static void main(String args[]) {
try {
DatagramSocket client = new DatagramSocket();
InetAddress addr = InetAddress.getByName("127.0.0.1");
byte[] sendbyte = new byte[1024];
byte[] receivebyte = new byte[1024];
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter the Physical address (MAC):");
String str = in.readLine();
sendbyte = str.getBytes();
DatagramPacket sender = new DatagramPacket(sendbyte, sendbyte.length, addr, 1309);
client.send(sender);
DatagramPacket receiver = new DatagramPacket(receivebyte, receivebyte.length);
client.receive(receiver);
String s = new String(receiver.getData());
System.out.println("The Logical Address is(IP): " + s.trim());
client.close();
} catch (Exception e) {
System.out.println(e);
}
}
}

Server:
import java.io.*;
import java.net.*;
import java.util.*;

class Serverrarp12 {
public static void main(String args[]) {
try {
DatagramSocket server = new DatagramSocket(1309);
while (true) {
byte[] sendbyte = new byte[1024];
byte[] receivebyte = new byte[1024];
DatagramPacket receiver = new DatagramPacket(receivebyte, receivebyte.length);
server.receive(receiver);
String str = new String(receiver.getData());

32
 String s = str.trim();
InetAddress addr = receiver.getAddress();
int port = receiver.getPort();
String ip[] = { "165.165.80.80", "165.165.79.1" };
String mac[] = { "6A:08:AA:C2", "8A:BC:E3:FA" };
for (int i = 0; i < ip.length; i++) {
if (s.equals(mac[i])) {
sendbyte = ip[i].getBytes();
DatagramPacket sender = new DatagramPacket(sendbyte, sendbyte.length, addr,
port);
server.send(sender);
break;

33
 }
}
break;
}
} catch (Exception e) {
System.out.println(e);
}
}
}

OUTPUT:
I:\ex>java Serverrarp12
I:\ex>java Clientrarp12
Enter the Physical address (MAC): 6A:08:AA:C2
The Logical Address is(IP): 165.165.80.80

RESULT :
Thus the program for implementing to display simulating RARP protocols was
executed successfully and output is verified.

34
 Ex. No : 9 Study of Network simulator (NS) and Simulation of
Congestion Control Algorithms using NS

AIM:
To Study Network simulator (NS).and Simulation of Congestion Control Algorithms
using NS

PROGRAM:
#include <wifi_lte/wifi_lte_rtable.h>
struct r_hist_entry *elm, *elm2;
int num_later = 1;
elm = STAILQ_FIRST(&r_hist_);
while (elm != NULL && num_later <= num_dup_acks_)
{
num_later;
elm = STAILQ_NEXT(elm, linfo_);
}
if (elm != NULL)
{
elm = findDataPacketInRecvHistory(STAILQ_NEXT(elm, linfo_));
if (elm != NULL)
{
elm2 = STAILQ_NEXT(elm, linfo_);
while (elm2 != NULL)
{
if (elm2->seq_num_ < seq_num && elm2->t_recv_ <
time)
{
STAILQ_REMOVE(&r_hist_, elm2, r_hist_entry, linfo_);
delete elm2;
}
else
elm = elm2;
elm2 = STAILQ_NEXT(elm, linfo_);
}

35
 }
}
}
void DCCPTFRCAgent::removeAcksRecvHistory()
{
struct r_hist_entry *elm1 = STAILQ_FIRST(&r_hist_);
struct r_hist_entry *elm2;
int num_later = 1;
while (elm1 != NULL && num_later <= num_dup_acks_)
{
num_later;
elm1 = STAILQ_NEXT(elm1, linfo_);
}
if (elm1 == NULL)
return;
elm2 = STAILQ_NEXT(elm1, linfo_);
while (elm2 != NULL)
{
if (elm2->type_ == DCCP_ACK)
{
STAILQ_REMOVE(&r_hist_, elm2, r_hist_entry, linfo_);
delete elm2;
}
else
{
elm1 = elm2;
}
elm2 = STAILQ_NEXT(elm1, linfo_);
}
}
inline r_hist_entry
*
DCCPTFRCAgent::findDataPacketInRecvHistory(r_hist_entry *start)
{
while (start != NULL && start->type_ == DCCP_ACK)
start = STAILQ_NEXT(start, linfo_);
return start;
}

36
RESULT:
Thus we have Studied Network simulator (NS) and Simulation of Congestion Control
Algorithms using NS.

37
 Ex. No : 10 Study of TCP/UDP performance using Simulation tool.

AIM:
To simulate the performance of TCP/UDP using NS2.

TCP PERFORMANCE ALGORITHM:

1. Create a Simulator object.
2. Set routing as dynamic.
3. Open the trace and nam trace files.
4. Define the finish procedure.
5. Create nodes and the links between them.
6. Create the agents and attach them to the nodes.
7. Create the applications and attach them to the tcp agent.
8. Connect tcp and tcp sink.
9. Run the simulation.

PROGRAM:
set ns [new Simulator]
$ns color 0 Blue
$ns color 1 Red
$ns color 2 Yellow set n0 [$ns node] set n1 [$ns node] set n2 [$ns node] set n3 [$ns node]
set f [open tcpout.tr w]
$ns trace-all $f
set nf [open tcpout.nam w]
$ns namtrace-all $nf
$ns duplex-link $n0 $n2 5Mb 2ms DropTail
$ns duplex-link $n1 $n2 5Mb 2ms DropTail
$ns duplex-link $n2 $n3 1.5Mb 10ms DropTail
$ns duplex-link-op $n0 $n2 orient right-up
$ns duplex-link-op $n1 $n2 orient right-down
$ns duplex-link-op $n2 $n3 orient right
$ns duplex-link-op $n2 $n3 queuePos 0.5 set tcp [new Agent/TCP]

38
 $tcp set class_ 1
set sink [new Agent/TCPSink]
$ns attach-agent $n1 $tcp
$ns attach-agent $n3 $sink
$ns connect $tcp $sink
set ftp [new Application/FTP]
$ftp attach-agent $tcp
$ns at 1.2 "$ftp start"
$ns at 1.35 "$ns detach-agent $n1 $tcp ; $ns detach-agent $n3 $sink"
$ns at 3.0 "finish" proc finish {} {
global ns f nf
$ns flush-trace close $f
close $nf
puts "Running nam.."
exec xgraph tcpout.tr -geometry 600x800 & exec nam tcpout.nam &
exit 0
}
$ns run

OUTPUT:

39
UDP PERFORMANCE:
ALGORITHM:
1. Create a Simulator object.
2. Set routing as dynamic.
3. Open the trace and nam trace files.
4. Define the finish procedure.
5. Create nodes and the links between them.
6. Create the agents and attach them to the nodes.
7. Create the applications and attach them to the UDP agent.
8. Connect udp and null agents.
9. Run the simulation.

PROGRAM:
set ns [new Simulator]
$ns color 0 Blue
$ns color 1 Red
$ns color 2 Yellow set n0 [$ns node] set n1 [$ns node] set n2 [$ns node] set n3 [$ns node]
set f [open udpout.tr w]
$ns trace-all $f
set nf [open udpout.nam w]
$ns namtrace-all $nf
$ns duplex-link $n0 $n2 5Mb 2ms DropTail
$ns duplex-link $n1 $n2 5Mb 2ms DropTail
$ns duplex-link $n2 $n3 1.5Mb 10ms DropTail
$ns duplex-link-op $n0 $n2 orient right-up
$ns duplex-link-op $n1 $n2 orient right-down
$ns duplex-link-op $n2 $n3 orient right
$ns duplex-link-op $n2 $n3 queuePos 0.5 set udp0 [new Agent/UDP]
$ns attach-agent $n0 $udp0
set cbr0 [new Application/Traffic/CBR]
$cbr0 attach-agent $udp0 set udp1 [new Agent/UDP]
$ns attach-agent $n3 $udp1
$udp1 set class_ 0
set cbr1 [new Application/Traffic/CBR]
$cbr1 attach-agent $udp1 set null0 [new Agent/Null]
$ns attach-agent $n1 $null0 set null1 [new Agent/Null]

40
 $ns attach-agent $n1 $null1
$ns connect $udp0 $null0
$ns connect $udp1 $null1
$ns at 1.0 "$cbr0 start"
$ns at 1.1 "$cbr1 start"
puts [$cbr0 set packetSize_] puts [$cbr0 set interval_]
$ns at 3.0 "finish" proc finish {} {
global ns f nf
$ns flush-trace close $f
close $nf
puts "Running nam.." exec nam udpout.nam & exit 0
}
$ns run

OUTPUT:

41
RESULT :
Thus the study of TCP/UDP performance is done successfully.

42
 Ex. No : 11 Simulation of Distance Vector Routing algorithm

AIM:
To simulate the Distance vector routing protocols using NS2.

ALGORITHM:
1. Create a simulator object
2. Set routing protocol to Distance Vector routing
3. Trace packets on all links onto NAM trace and text trace file
4. Define finish procedure to close files, flush tracing and run NAM
5. Create eight nodes
6. Specify the link characteristics between nodes
7. Describe their layout topology as a octagon
8. Add UDP agent for node n1
9. Create CBR traffic on top of UDP and set traffic parameters.
10. Add a sink agent to node n4
11. Connect source and the sink
12. Schedule events as follows:
a. Start traffic flow at 0.5
b. Down the link n3-n4 at 1.0
c. Up the link n3-n4 at 2.0
d. Stop traffic at 3.0
e. Call finish procedure at 5.0
13. Start the scheduler
14. Observe the traffic route when link is up and down
15. View the simulated events and trace file analyze it
16. Stop

43
PROGRAM:
#Distance vector routing protocol – distvect.tcl
#Create a simulator object
set ns [new Simulator]
#Use distance vector routing
$ns rtproto DV
#Open the nam trace file set nf [open out.nam w]
$ns namtrace-all $nf # Open tracefile
set nt [open trace.tr w]
$ns trace-all $nt
#Define 'finish' procedure
proc finish {}
{
global ns nf
$ns flush-trace
#Close the trace file
close $nf
#Execute nam on the trace file
exec nam -a out.nam &
exit 0
}
# Create 8 nodes
set n1 [$ns node]
set n2 [$ns node]
set n3 [$ns node]
set n4 [$ns node]
set n5 [$ns node]
set n6 [$ns node]
set n7 [$ns node]
set n8 [$ns node]
# Specify link characterestics
$ns duplex-link $n1 $n2 1Mb 10ms DropTail
$ns duplex-link $n2 $n3 1Mb 10ms DropTail
$ns duplex-link $n3 $n4 1Mb 10ms DropTail
$ns duplex-link $n4 $n5 1Mb 10ms DropTail
$ns duplex-link $n5 $n6 1Mb 10ms DropTail
$ns duplex-link $n6 $n7 1Mb 10ms DropTail
$ns duplex-link $n7 $n8 1Mb 10ms DropTail
$ns duplex-link $n8 $n1 1Mb 10ms DropTail

44
# specify layout as a octagon
$ns duplex-link-op $n1 $n2 orient left-up
$ns duplex-link-op $n2 $n3 orient up
$ns duplex-link-op $n3 $n4 orient right-up
$ns duplex-link-op $n4 $n5 orient right
$ns duplex-link-op $n5 $n6 orient right-down
$ns duplex-link-op $n6 $n7 orient down
$ns duplex-link-op $n7 $n8 orient left-down
$ns duplex-link-op $n8 $n1 orient left
#Create a UDP agent and attach it to node n1 set udp0 [new Agent/UDP]
$ns attach-agent $n1 $udp0
#Create a CBR traffic source and attach it to udp0
set cbr0 [new Application/Traffic/CBR]
$cbr0 set packetSize_ 500
$cbr0 set interval_ 0.005
$cbr0 attach-agent $udp0
#Create a Null agent (a traffic sink) and attach it to node n4 set null0 [new Agent/Null]
$ns attach-agent $n4 $null0
#Connect the traffic source with the traffic sink
$ns connect $udp0 $null0
#Schedule events for the CBR agent and the network dynamics
$ns at 0.0 "$n1 label Source"
$ns at 0.0 "$n4 label Destination"
$ns at 0.5 "$cbr0 start"
$ns rtmodel-at 1.0 down $n3 $n4
$ns rtmodel-at 2.0 up $n3 $n4
$ns at 4.5 "$cbr0 stop"
#Call the finish procedure after 5 seconds of simulation time
$ns at 5.0 "finish" #Run the simulation
$ns run

45
OUTPUT:
$ ns distvect.tcl

46
47
RESULT:
Thus the simulation for Distance vector routing protocols was done using NS2.

48
 Ex. No : 12 Simulation of Link State Routing algorithm.

AIM:
To simulate the Link state routing protocols using NS2.

ALGORITHM:
1. Create a Simulator object.
2. Set routing as dynamic.
3. Open the trace and nam trace files.
4. Define the finish procedure.
5. Create nodes and the links between them.
6. Create the agents and attach them to the nodes.
7. Create the applications and attach them to the udp agent.
8. Connect udp and null..
9. At 1 sec the link between node 1 and 2 is broken.
10. At 2 sec the link is up again.
11. Run the simulation.

PROGRAM:
set ns [new Simulator]
$ns rtproto LS
set nf [open linkstate.nam w]
$ns namtrace-all $nf
set f0 [open linkstate.tr w]
$ns trace-all $f0 proc finish {} {
global ns f0 nf
$ns flush-trace
close $f0
close $nf
exec nam linkstate.nam & exit 0

49
 }
for {set i 0} {$i <7} {incr i}
{ set n($i) [$ns node]
}
for {set i 0} {$i <7} {incr i} {
$ns duplex-link $n($i) $n([expr ($i+1)%7]) 1Mb 10ms DropTail
}
set udp0 [new Agent/UDP]
$ns attach-agent $n(0) $udp0
set cbr0 [new Application/Traffic/CBR]
$cbr0 set packetSize_ 500
$cbr0 set interval_ 0.005
$cbr0 attach-agent $udp0 set null0 [new Agent/Null]
$ns attach-agent $n(3) $null0
$ns connect $udp0 $null0
$ns at 0.5 "$cbr0 start"
$ns rtmodel-at 1.0 down $n(1) $n(2)
$ns rtmodel-at 2.0 up $n(1) $n(2)
$ns at 4.5 "$cbr0 stop"
$ns at 5.0 "finish"
$ns run

OUTPUT:

50
RESULT:
Thus the Link state routing protocols was done using NS2.

51
 Ex. No : 13 Performance Evaluation of Routing protocols using
Simulation tool.

AIM:
To write a ns2 program for implementing unicast routing protocol.

(a) UNICAST ROUTING PROTOCOL

ALGORITHM:
1. Start the program.
2. Declare the global variables ns for creating a new simulator.
3. Set the color for packets.
4. Open the network animator file in the name of file2 in the write mode.
5. Open the trace file in the name of file 1 in the write mode.
6. Set the unicast routing protocol to transfer the packets in network.
7. Create the required no of nodes.
8. Create the duplex-link between the nodes including the delay time, bandwidth
and dropping queue mechanism.
9. Give the position for the links between the nodes.
10. Set a tcp reno connection for source node.
11. Set the destination node using tcp sink.
12. Setup a ftp connection over the tcp connection.
13. Down the connection between any nodes at a particular time.
14. Reconnect the downed connection at a particular time.
15. Define the finish procedure.
16. In the definition of the finish procedure declare the global variables ns, file1, and
file2.
17. Close the trace file and name file and execute the network animation file.
18. At the particular time call the finish procedure.
19. Stop the program.

52
PROGRAM:
set ns [new Simulator]
#Define different colors for data flows (for NAM)
$ns color 1 Blue
$ns color 2 Red
#Open the Trace file
set file1 [open out.tr w]
$ns trace-all $file1
#Open the NAM trace file
set file2 [open out.nam w]
$ns namtrace-all $file2
#Define a 'finish' procedure proc finish {}
{
global ns file1 file2
$ns flush-trace close $file1 close $file2
exec nam out.nam &
exit 3
}
# Next line should be commented out to have the static routing
$ns rtproto DV
#Create six nodes
set n0 [$ns node]
set n1 [$ns node]
set n2 [$ns node]
set n3 [$ns node]
set n4 [$ns node]
set n5 [$ns node]
#Create links between the nodes
$ns duplex-link $n0 $n1 0.3Mb 10ms DropTail
$ns duplex-link $n1 $n2 0.3Mb 10ms DropTail
$ns duplex-link $n2 $n3 0.3Mb 10ms DropTail
$ns duplex-link $n1 $n4 0.3Mb 10ms DropTail
$ns duplex-link $n3 $n5 0.5Mb 10ms DropTail
$ns duplex-link $n4 $n5 0.5Mb 10ms DropTail

#Give node position (for NAM)

$ns duplex-link-op $n0 $n1 orient right
$ns duplex-link-op $n1 $n2 orient right
$ns duplex-link-op $n2 $n3 orient up

53
 $ns duplex-link-op $n1 $n4 orient up-left
$ns duplex-link-op $n3 $n5 orient left-up
$ns duplex-link-op $n4 $n5 orient right-up

#Setup a TCP connection

set tcp [new Agent/TCP/Newreno]
$ns attach-agent $n0 $tcp
set sink [new Agent/TCPSink/DelAck]
$ns attach-agent $n5 $sink
$ns connect $tcp $sink
$tcp set fid_ 1

#Setup a FTP over TCP connection set ftp [new Application/FTP]

$ftp attach-agent $tcp
$ftp set type_ FTP
$ns rtmodel-at 1.0 down $n1 $n4
$ns rtmodel-at 4.5 up $n1 $n4
$ns at 0.1 "$ftp start"
$ns at 6.0 "finish"
$ns run

OUTPUT:

54
55
(b) MULTICASTING ROUTING PROTOCOL

AIM:
To write a ns2 program for implementing multicasting routing protocol.

ALGORITHM:
1. Start the program.
2. Declare the global variables ns for creating a new simulator.
3. Set the color for packets.
4. Open the network animator file in the name of file2 in the write mode.
5. Open the trace file in the name of file 1 in the write mode.
6. Set the multicast routing protocol to transfer the packets in network.
7. Create the multicast capable no of nodes.
8. Create the duplex-link between the nodes including the delay time,bandwidth and
dropping queue mechanism.
9. Give the position for the links between the nodes.
10. Set a udp connection for source node.
11. Set the destination node ,port and random false for the source and destination
files.
12. Setup a traffic generator CBR for the source and destination files.
13. Down the connection between any nodes at a particular time.
14. Create the receive agent for joining and leaving if the nodes in the group.
15. Define the finish procedure.
16. In the definition of the finish procedure declare the global variables.
17. Close the trace file and namefile and execute the network animation file.
18. At the particular time call the finish procedure.
19. Stop the program.

56
PROGRAM:
# Create scheduler
#Create an event scheduler wit multicast turned on set ns [new Simulator -multicast on]
#$ns multicast
#Turn on Tracing
set tf [open output.tr w]
$ns trace-all $tf
# Turn on nam Tracing
set fd [open mcast.nam w]
$ns namtrace-all $fd
# Create nodes
set n0 [$ns node]
set n1 [$ns node]
set n2 [$ns node]
set n3 [$ns node]
set n4 [$ns node]
set n5 [$ns node]
set n6 [$ns node]
set n7 [$ns node]
# Create links
$ns duplex-link $n0 $n2 1.5Mb 10ms DropTail
$ns duplex-link $n1 $n2 1.5Mb 10ms DropTail
$ns duplex-link $n2 $n3 1.5Mb 10ms DropTail
$ns duplex-link $n3 $n4 1.5Mb 10ms DropTail
$ns duplex-link $n3 $n7 1.5Mb 10ms DropTail
$ns duplex-link $n4 $n5 1.5Mb 10ms DropTail
$ns duplex-link $n4 $n6 1.5Mb 10ms DropTail
# Routing protocol: say distance vector #Protocols: CtrMcast, DM, ST, BST set mproto DM
set mrthandle [$ns mrtproto $mproto {}]
# Allocate group addresses set group1 [Node allocaddr] set group2 [Node allocaddr]
# UDP Transport agent for the traffic source set udp0 [new Agent/UDP]
$ns attach-agent $n0 $udp0
$udp0 set dst_addr_ $group1
$udp0 set dst_port_ 0
set cbr1 [new Application/Traffic/CBR]
$cbr1 attach-agent $udp0
# Transport agent for the traffic source set udp1 [new Agent/UDP]
$ns attach-agent $n1 $udp1
$udp1 set dst_addr_ $group2

57
$udp1 set dst_port_ 0
set cbr2 [new Application/Traffic/CBR]
$cbr2 attach-agent $udp1
# Create receiver
set rcvr1 [new Agent/Null]
$ns attach-agent $n5 $rcvr1
$ns at 1.0 "$n5 join-group $rcvr1 $group1" set rcvr2 [new Agent/Null]
$ns attach-agent $n6 $rcvr2
$ns at 1.5 "$n6 join-group $rcvr2 $group1" set rcvr3 [new Agent/Null]
$ns attach-agent $n7 $rcvr3
$ns at 2.0 "$n7 join-group $rcvr3 $group1" set rcvr4 [new Agent/Null]
$ns attach-agent $n5 $rcvr1
$ns at 2.5 "$n5 join-group $rcvr4 $group2" set rcvr5 [new Agent/Null]
$ns attach-agent $n6 $rcvr2
$ns at 3.0 "$n6 join-group $rcvr5 $group2" set rcvr6 [new Agent/Null]
$ns attach-agent $n7 $rcvr3
$ns at 3.5 "$n7 join-group $rcvr6 $group2"
$ns at 4.0 "$n5 leave-group $rcvr1 $group1"
$ns at 4.5 "$n6 leave-group $rcvr2 $group1"
$ns at 5.0 "$n7 leave-group $rcvr3 $group1"
$ns at 5.5 "$n5 leave-group $rcvr4 $group2"
$ns at 6.0 "$n6 leave-group $rcvr5 $group2"
$ns at 6.5 "$n7 leave-group $rcvr6 $group2"
# Schedule events
$ns at 0.5 "$cbr1 start"
$ns at 9.5 "$cbr1 stop"
$ns at 0.5 "$cbr2 start"
$ns at 9.5 "$cbr2 stop"

#post-processing
$ns at 10.0 "finish" proc finish {}
{
global ns tf
$ns flush-trace
close $tf
exec nam mcast.nam & exit 0
}

# For nam

58
#Colors for packets from two mcast groups
$ns color 10 red
$ns color 11 green
$ns color 30 purple
$ns color 31 green

# Manual layout: order of the link is significant!

#$ns duplex-link-op $n0 $n1 orient right
#$ns duplex-link-op $n0 $n2 orient right-up
#$ns duplex-link-op $n0 $n3 orient right-down
# Show queue on simplex link n0->n1
#$ns duplex-link-op $n2 $n3 queuePos 0.5

# Group 0 source
$udp0 set fid_ 10
$n0 color red
$n0 label "Source 1"

# Group 1 source
$udp1 set fid_ 11
$n1 color green
$n1 label "Source 2"
$n5 label "Receiver 1"
$n5 color blue
$n6 label "Receiver 2"
$n6 color blue
$n7 label "Receiver 3"
$n7 color blue
#$n2 add-mark m0 red
#$n2 delete-mark m0"

# Animation rate
$ns set-animation-rate 3.0ms
$ns run

59
OUTPUT:

60
61
RESULT:
Thus the case study about the different routing algorithms to select the network path
with its optimum and economical during data transfer is done.

62
 Ex. No : 14 Simulation of Error Detection Code (like CRC)

AIM:
To implement error checking code using java.

ALGORITHM:
1. Start the Program
2. Given a bit string, append 0S to the end of it (the number of 0s is the same as
the degree of the generator polynomial) let B(x) be the polynomial corresponding to B.
3. Divide B(x) by some agreed on polynomial G(x) (generator polynomial) and
determine the remainder R(x). This division is to be done using Modulo 2 Division.
4. Define T(x) = B(x) –R(x)
5. (T(x)/G(x) => remainder 0)
6. Transmit T, the bit string corresponding to T(x).
7. Let T‘ represent the bit stream the receiver gets and T‘(x) the associated
polynomial. The receiver divides T1(x) by G(x). If there is a 0 remainder, the receiver
concludes T = T‘ and no error occurred otherwise, the receiver concludes an error
occurred and requires a retransmission
8. Stop the Program

PROGRAM:

import java.io.*;

class crc_gen {
public static void main(String args[]) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int[] data;
int[] div;
int[] divisor;

63
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++)
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 = new int[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 (int i = 0; i < div.length; i++) {

64
 // append dividend and remainder 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++) {
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;

65
 }
return rem;
}
}

OUTPUT :
Enter number of data bits :
7
Enter data bits :
1
0
1
1
0
0
1
Enter number of bits in divisor :
3
Enter Divisor bits :
1
0
1
Dividend (after appending 0's) are : 101100100
CRC code :
101100111
Enter CRC code of 9 bits : 1
0
1
1
0
0
1

66
0
1
crc bits are : 101100101 Error
THANK YOU)
BUILD SUCCESSFUL (total time: 1 minute 34 seconds)

RESULT:
Thus the above program for error checking code using was executed successfully.

67
 Ex. No : 15 TOPIC BEYOND SYLLABUS

a. Simulation of Go Back N protocol

AIM:
To Simulate and to study of Go Back N protocol

ALGORITHM:
1. The source node transmits the frames continuously.
2. Each frame in the buffer has a sequence number starting from 1 and increasing up
to the window size.
3. The source node has a window i.e. a buffer to store the frames. This buffer size is
the number of frames to be transmitted continuously.
4. The size of the window depends on the protocol designer.
5. For the first frame, the receiving node forms a positive acknowledgement if the
frame is received without error.
6. If subsequent frames are received without error (up to window size) cumulative
positive acknowledgement is formed.
7. If the subsequent frame is received with error, the cumulative acknowledgment
error-free frames are transmitted. If in the same window two frames or more frames are
received with error, the second and the subsequent error frames are neglected. Similarly
even the frames received without error after the receipt of a frame with error are
neglected.
8. The source node retransmits all frames of window from the first error frame.
9.If the frames are errorless in the next transmission and if the acknowledgment is
error free, the window slides by the number of error-free frames being transmitted.
10.If the acknowledgment is transmitted with error, all the frames of window at
source are retransmitted, and window doesn‘t slide.
11.This concept of repeating the transmission from the first error frame in the window
is called as GOBACKN transmission flow control protocol.
68
PROGRAM :
#send packets one by one
set ns [new Simulator]
set n0 [$ns node]
set n1 [$ns node]
set n2 [$ns node]
set n3 [$ns node]
set n4 [$ns node]
set n5 [$ns node] $n0 color "purple" $n1 color "purple" $n2 color "violet" $n3 color "violet" $n4 color
"chocolate" $n5 color "chocolate" $n0 shape box ;
$n1 shape box ; $n2 shape box ; $n3 shape box ; $n4 shape box ; $n5 shape box ;
$ns at 0.0 "$n0 label SYS0"
$ns at 0.0 "$n1 label SYS1"
$ns at 0.0 "$n2 label SYS2"
$ns at 0.0 "$n3 label SYS3"
$ns at 0.0 "$n4 label SYS4"
$ns at 0.0 "$n5 label SYS5"
set nf [open goback.nam w] $ns namtrace-all $nf set f [open goback.tr w] $ns trace-all $f
$ns duplex-link $n0 $n2 1Mb 20ms DropTail $ns duplex-link-op $n0 $n2 orient right-down $ns queue-limit
$n0 $n2 5
$ns duplex-link $n1 $n2 1Mb 20ms DropTail $ns duplex-link-op $n1 $n2 orient right-up $ns duplex-link $n2
$n3 1Mb 20ms DropTail $ns duplex-link-op $n2 $n3 orient right
$ns duplex-link $n3 $n4 1Mb 20ms DropTail $ns duplex-link-op $n3 $n4 orient right-up $ns duplex-link $n3
$n5 1Mb 20ms DropTail $ns duplex-link-op $n3 $n5 orient right-down Agent/TCP set_nam_tracevar_true
set tcp [new Agent/TCP] $tcp set fid 1
$ns attach-agent $n1 $tcp
set sink [new Agent/TCPSink] $ns attach-agent $n4 $sink $ns connect $tcp $sink set ftp [new
Application/FTP] $ftp attach-agent $tcp
$ns at 0.05 "$ftp start"
$ns at 0.06 "$tcp set windowlnit 6"
$ns at 0.06 "$tcp set maxcwnd 6"
$ns at 0.25 "$ns queue-limit $n3 $n4 0"
$ns at 0.26 "$ns queue-limit $n3 $n4 10"
$ns at 0.305 "$tcp set windowlnit 4"
$ns at 0.305 "$tcp set maxcwnd 4"
$ns at 0.368 "$ns detach-agent $n1 $tcp ; $ns detach-agent $n4 $sink"
$ns at 1.5 "finish"
$ns at 0.0 "$ns trace-annotate \"Goback N end\""
$ns at 0.05 "$ns trace-annotate \"FTP starts at 0.01\""

69
 $ns at 0.06 "$ns trace-annotate \"Send 6Packets from SYS1 to SYS4\""
$ns at 0.26 "$ns trace-annotate \"Error Occurs for 4th packet so not sent ack for the Packet\""
$ns at 0.30 "$ns trace-annotate \"Retransmit Packet_4 to 6\""
$ns at 1.0 "$ns trace-annotate \"FTP stops\"" proc finish {} {
global ns nf
$ns flush-trace close $nf
puts "filtering..."
#exec tclsh../bin/namfilter.tcl goback.nam #puts "running nam..."
exec nam goback.nam & exit 0
}
$ns run.

OUTPUT:

70
RESULT:
Thus the Go back N and Selective Repeat protocols were Simulated and studied

71
 b. CARRIER SENSE MULTIPLE ACCESS

AIM:
To write a ns2 program for implementing carrier sense multiple access.

ALGORITHM:
1. Start the program.
2. Declare the global variables ns for creating a new simulator.
3. Set the color for packets.
4. Open the network animator file in the write mode.
5. Open the trace file and the win file in the write mode.
6. Transfer the packets in network.
7. Create the capable no of nodes.
8. Create the duplex-link between the nodes including the delay time,bandwidth and
dropping queue mechanism.
9. Give the position for the links between the nodes.
10. Set a tcp connection for source node.
11. Set the destination node using tcp sink.
12. Set the window size and the packet size for the tcp.
13. Set up the ftp over the tcp connection.
14. Set the udp and tcp connection for the source and destination.
15. Create the traffic generator CBR for the source and destination files.
16. Define the plot window and finish procedure.
17. In the definition of the finish procedure declare the global variables.
18. Close the trace file and namefile and execute the network animation file.
19. At the particular time call the finish procedure.
20. Stop the program.

72
PROGRAM :
set ns [new Simulator]
$ns color 1 blue
$ns color 2 red
set fi1 [open out.tr w]
set winfile [open WinFile w]
$ns trace-all $fi1
set fi2 [open out.nam w]
$ns namtrace-all $fi2 proc finish {}
{
global ns fi1 fi2
$ns flush-trace close $fi1 close $fi2
exec nam out.nam & exit 0
}
set n0 [$ns node] set n1 [$ns node] set n2 [$ns node]
set n3 [$ns node] set n4 [$ns node] set n5 [$ns node]
$n1 color red
$n1 shape box
$ns duplex-link $n0 $n2 2Mb 10ms DropTail
$ns duplex-link $n1 $n2 2Mb 10ms DropTail
$ns simplex-link $n2 $n3 0.3Mb 100ms DropTail
$ns simplex-link $n3 $n2 0.3Mb 100ms DropTail
set lan [$ns newLan "$n3 $n4 $n5" 0.5Mb 40ms LL Queue/DropTail MAC/Csma/Cd Channel] set tcp [new
Agent/TCP/Newreno]
$ns attach-agent $n0 $tcp
set sink [new Agent/TCPSink/DelAck]
$ns attach-agent $n4 $sink
$ns connect $tcp $sink
$tcp set fid_ 1
$tcp set window_ 8000
$tcp set packetsize_ 552
set ftp [new Application/FTP]
$ftp attach-agent $tcp
$ftp set type_ FTP
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

73
 set cbr [new Application/Traffic/CBR]
$cbr attach-agent $udp
$cbr set type_ CBR
$cbr set packet_size_ 1000
$cbr set rate_ 0.01mb
$cbr set random_ false
$ns at 0.1 "$cbr start"
$ns at 1.0 "$ftp start"
$ns at 24.0 "$ftp stop"
$ns at 24.5 "$cbr stop"
proc plotwindow { tcpSource file }
{
global ns set time 0.1
set now [$ns now]
set cwnd [$tcpSource set cwnd_]
set wnd [$tcpSource set window_]
puts $file "$now $cwnd"
$ns at [expr $now+$time] "plotwindow $tcpSource $file"
}
$ns at 1.0 "plotwindow $tcp $winfile"
$ns at 5 "$ns trace-annotate \"packet drop\""
$ns at 125.0 "finish"
$ns run

OUTPUT:

74
75
RESULT:
Thus the carrier sense multiple access are implemented and executed successfully

76