Computer Networks LAB MANUAL R20

St.
Martin's Engineering College

An Autonomous Institution
NBA & NAAC A+ Accredited
Dhulapally, Secunderabad-500 100
www.smec.ac.in
LAB MANUAL
YEAR : 2020-21
REGULATION : R20
COURSE NAME : COMPUTER NETWORKS LAB
COURSE CODE: CS506PC
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

St. Martin's Engineering College
An Autonomous Institution
NBA & NAAC A+ Accredited
Dhulapally, Secunderabad-500 100
www.smec.ac.in
INDEX
S.NO NAME OF PROGRAM
1 Vision and Mission of Institution and Department
2 COs, POs, PSOs & PEOs
3 Syllabus
4 List of Experiments
5 Programs
6 Contents beyond Syllabus

3
Vision and Mission of the Department and Institute
To become an institute of excellence by creating high quality and

innovating engineering and management professionals who would
Vision of the Institute
take the world into their stride through sustainable growth in
technology and management.
To instill moral values and promote technological, intellectual and

ethical environment to the students with an in-depth and exceptional
education that makes them employment ready as per the emerging
Mission of the Institute trends in industry and to invoke the desire of innovation as a process
of life•long learning for a successful career in engineering and
management.
To evolve the department of computer science and engineering as a

Vision of the center of academic excellence with latest technologies to transform
Department
students into innovative global leaders.
M1: To produce competitive graduates having creative skills and

ethical values to succeed in their fields as well as the foundation for
lifelong learning.
Mission of the
M2: By promoting research and development activities in
Department
collaboration with reputed industries and laboratories.
M3: To analyze, design and develop high quality software systems

using the appropriate theory, principles, tools and processes.
Dept. of CSE CS506PC: COMPUTER NETWORKS LAB

4
COs, POs, PSOs & PEOs
S. NO. Course Objectives
1 To understand the working principle of various communication protocols
To understand the network simulator environment and visualize a network

2 topology and Observe its performance
3 To analyze the traffic flow and the contents of protocol frames

5
Course Outcomes
S. NO. Course Outcomes BTL
CO1 Implement data link layer farming methods
CO2 Analyze error detection and error correction codes.
CO3 Implement and analyze routing and congestion issues in network

design
Implement Encoding and Decoding techniques used in
CO4 presentation layer
CO5 To be able to work with different network tools

PROGRAM OUTCOMES
S. Program Outcomes Level Expertise a

ssessed by
NO.
Engineering knowledge: Apply the

knowledge of mathematics, science,
Assignment,
PO1 engineering fundamentals, and an engineering 3
Tutorials
specialization to the solution of complex
engineering problems.
Problem analysis: Identify, formulate,

review research literature, and analyze
complex engineering problems reaching Assignment,
PO2 3
substantiated conclusions using first Tutorials
principles of mathematics, natural sciences,
and engineering sciences.
Design/development of solutions: Design

solutions for complex engineering problems
and design system components or processes
Assignment,
PO3 that meet the specified needs with appropriate 3
Tutorials
consideration for the public health and safety,
and the cultural, societal, and environmental
considerations.
Conduct investigations of complex

problems: Use research-based knowledge
and research methods including design of
PO4 2 Assignments
experiments, analysis and interpretation of
data, and synthesis of the information to
provide valid conclusions.

7
Modern tool usage: Create, select, and apply

appropriate techniques, resources, and
modern engineering and IT tools including
PO5 2 Assignments
prediction and modeling to complex
engineering activities with an understanding
of the limitations.
The engineer and society: Apply reasoning

informed by the contextual knowledge to
assess societal, health, safety, legal and Assignment,
PO6 3
cultural issues and the consequent Tutorials
responsibilities relevant to the professional
engineering practice.
Environment and sustainability:

Understand the impact of the professional
engineering solutions in societal and
PO7 3 Guest Lectures
environmental contexts, and demonstrate the
knowledge of, and need for sustainable
development.
Ethics: Apply ethical principles and commit

PO8 to professional ethics and responsibilities and 1 --
norms of the engineering practice.
Individual and team work: Function

effectively as an individual, and as a member
PO9 1 --
or leader in diverse teams, and in
multidisciplinary settings
Communication: Communicate effectively

on complex engineering activities with the
PO10 engineering community and with society at 1 --
large, such as, being able to comprehend and
write effective reports and design

8
documentation, make effective presentations,

and give and receive clear instructions.
Project management and finance:

Demonstrate knowledge and understanding of
the engineering and management principles
PO11 and apply these to one’s own work, as a 1 --
member and leader in a team, to manage
projects and in multidisciplinary
environments
Life-long learning: Recognize the need for,

and have the preparation and ability to engage
PO12 3 Guest Lectures
in independent and life-long learning in the
broadest context of technological change.
1- None 2- Supportive 3- Highly Related

PROGRAM EDUCATIONAL OBJECTIVES
PEO No. Program Educational Objectives
To apply engineering processes and practices to software and hardware systems

PEO1
skillfully and efficiently.
Ability to understand and analyze engineering issues in a broader prospective

PEO2
with ethical responsibility.
To prepare students to fit into any industry associated with developing and
PEO3
implementation of software products or technologies.
To equip the graduates with ability to analyze, design and test the novel
PEO4
products.
PROGRAM SPECIFIC OUTCOMES
S. No. Program Specific Outcomes Level Expertise & assessed by
Proficiency skill: Potential to understand,

Implement and conduct research in various
PSO1 3 Lecture, Assignments
sub domains of Computer Science &
Engineering.
Analytical skills: Capability to apply

PSO2 theoretical knowledge to practical 3 Lecture, Assignments
implementation for a quality product.
Successful Career and

Entrepreneurship: Preparedness to adopt
PSO3 new technology with unprecedented ideas 1 ----
to be a successful entrepreneur besides a
zeal towards higher studies
1- None 2- Supportive 3- Highly Related

R20 B.TECH CSE III YEAR
CS506PC: COMPUTER NETWORKS AND WEB TECHNOLOGIES LAB
III Year B.Tech. CSE I-Sem LTPC
0 0 3 1.5
Course Objectives
1. To understand the working principle of various communication protocols.

2. To understand the network simulator environment and visualize a network topology and
Observe its performance
3. To analyze the traffic flow and the contents of protocol frames
Course Outcomes
1. Implement data link layer farming methods
2. Analyze error detection and error correction codes.
3. Implement and analyze routing and congestion issues in network design.
4. Implement Encoding and Decoding techniques used in presentation layer
5. To be able to work with different network tools
List of Experiments
1. Implement the data link layer framing methods such as character, character-stuffing and bit
Stuffing.
2. Write a program to compute CRC code for the polynomials CRC-12, CRC-16 and CRC CCIP
3. Develop a simple data link layer that performs the flow control using the sliding window
protocol, and loss recovery using the Go-Back-N mechanism.
4. Implement Dijsktra’s algorithm to compute the shortest path through a network
5. Take an example subnet of hosts and obtain a broadcast tree for the subnet.
6. Implement distance vector routing algorithm for obtaining routing tables at each node.
7. Implement data encryption and data decryption
8. Write a program for congestion control using Leaky bucket algorithm.
9. Write a program for frame sorting technique used in buffers.
10. Wire shark

i. Packet Capture Using Wire shark
ii. Starting Wire shark
iii. Viewing Captured Traffic
iv. Analysis and Statistics & Filters.

11. How to run Nmap scan
12. Operating System Detection using Nmap
13. Do the following using NS2 Simulator

i. NS2 Simulator-Introduction
ii. Simulate to Find the Number of Packets Dropped
iii. Simulate to Find the Number of Packets Dropped by TCP/UDP
iv. Simulate to Find the Number of Packets Dropped due to Congestion
v. Simulate to Compare Data Rate & Throughput.
vi. Simulate to Plot Congestion for Different Source/Destination
vii. Simulate to Determine the Performance with respect to Transmission of Packets

1. Implement the data link layer framing methods such as character, character-stuffing
and bit stuffing
Write a C program to implement the data link layer framing methods
such as bit stuffing.
Source Code:
#include<stdio.h>
#include<conio.h>
#include<string.h>
void main()
{
int a[20],b[30],i,j,k,count,n;
clrscr();
printf("enter frame length:");
scanf("%d",&n);
pritf("enter input frame(0's&1's only):");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
i=0;count=1;j=0;
while(i<n)
{
if(a[i]==1)
{
b[j]=a[i];
for(k=i+1;a[k]==1&&k<n&&count<5;k ++)
{
j++;
b[j]=a[k];
count++;
if(count==5)
{
j++;
b[j]=0;
}
i=k;
}
}
else
{
b[j]=a[i];
}
i++;
j++;
}

printf("After stuffing the frame is:");
for(i=0;i<j;i++)
printf("%d",b[i]);
getch();
}
Output:
Enter the number of

bits: 10
1
0
1
0
1
1
1
1
1
1
1
Data after stuffing: 10101111101
Write a C program to implement the data link layer framing method
such as character stuffing.
Program Code: //Program for Character Stuffing
#include<stdio.h>
#include<string.h>
#include<process.h>
void main()
{
int i=0,j=0,n,pos;
char a[20],b[50],ch;
printf("Enter string\n");
scanf("%s",&a);
n=strlen(a);
printf("Enter position\n");
scanf("%d",&pos);
if(pos>n)
{
printf("invalid position, Enter again :");
scanf("%d",&pos);}
printf("Enter the character\n");
ch=getche();

b[0]='d';
b[1]='l';
b[2]='e';
b[3]='s';
b[4]='t';
b[5]='x';
j=6;
while(i<n)
{
if(i==pos-1)
{
b[j]='d';
b[j+1]='l';
b[j+2]='e';
b[j+3]=ch;
b[j+4]='d';
b[j+5]='l';
b[j+6]='e';
j=j+7;
}
if(a[i]=='d' && a[i+1]=='l' && a[i+2]=='e')
{
b[j]='d';
b[j+1]='l';
b[j+2]='e';
j=j+3;
}
b[j]=a[i];
i++;
j++;
}
b[j]='d';
b[j+1]='l';
b[j+2]='e';
b[j+3]='e';
b[j+4]='t';
b[j+5]='x';
b[j+6]='\0';
printf("\nframe after stuffing:\n");
printf("%s",b);
}
Program Output:
Enter string
MLRITM

Enter position
2
Enter the character
frame after stuffing:
dlestxMdldleLRITMdleetx

2. Write a program to compute CRC code for the polynomials CRC-12, CRC-16 and CRC
CCIP
// program for Cyclic Redundancy Check

#include<stdio.h>
#include<conio.h>
int main(void)
{
int data[50],div[16],rem[16];
int datalen, divlen, i,j,k;
int ch;
clrscr();
printf("Enter the data: ");
i = 0;
while((ch = fgetc(stdin)) != '\n')
{
if(ch == '1')
data[i] = 1;
else
data[i] = 0;
i++;
}
datalen = i;
printf("\nEnter the divisor: ");
i = 0;
while((ch = fgetc(stdin)) != '\n')
{
if(ch == '1')
div[i] = 1;
else
div[i] = 0;
i++;
}
divlen = i;
for(i = datalen ; i < datalen + divlen - 1 ; i++)
data[i] = 0;
datalen = datalen + divlen - 1;
for(i = 0 ; i < divlen ; i++)
rem[i] = data[i];
k = divlen-1;
while(k < datalen)

if(rem[0] == 1)
{
for(i = 0 ; i < divlen ; i++)
rem[i] = rem[i] ^ div[i];
}
else
{
if(k == datalen-1)
break;
for(i = 0 ; i < divlen-1 ; i++)
{
rem[i] = rem[i+1];
printf("%d",rem[i]);
}
rem[i] = data[++k];
printf("%d\n",rem[i]);
}
j=1;
for(i = datalen - divlen + 1 ; i < datalen ; i++)
{
data[i] = rem[j++];
}
printf("\nThe data to be sent is\n");
for(i = 0 ; i < datalen ; i++)
printf("%d",data[i]);
getch();
return 0;
}
OUTPUT:
Enter the data: 10101111 Enter the divisor: 1011
0011
0111
1111
1001
0100
1000
0110
The data to be sent is 10101111110

3. Develop a simple data link layer that performs the flow control using the sliding window
protocol, and loss recovery using the Go-Back-N mechanism
SLIDING WINDOW PROTOCOL,

#include<stdio.h>
int main()
{
int windowsize,sent=0,ack,i;
printf("enter window size\n");
scanf("%d",&windowsize);
while(1)
{
for( i = 0; i < windowsize; i++)
{
printf("Frame %d has been transmitted.\n",sent);
sent++;
if(sent == windowsize)
break;
}
printf("\nPlease enter the last Acknowledgement received.\n");
scanf("%d",&ack);
if(ack == windowsize)
break;
else
sent = ack;
}
return 0;
}
output:-
Output
Enter window size: 3
Enter number of frames to transmit: 5
Enter 5 frames: 12 5 89 4 6
With sliding window protocol the frames will be sent in the following manner (assuming
no corruption of frames)
After sending 3 frames at each stage sender waits for acknowledgement sent by the
receiver
12 5 89
Acknowledgement of above frames sent is received by sender
46
Acknowledgement of above frames sent is received by sender

GO BACK N PROTOCOL
#include<stdio.h>
int main()
{
int windowsize,sent=0,ack,i;
printf("enter window size\n");
scanf("%d",&windowsize);
while(1)
{
for( i = 0; i < windowsize; i++)
{
printf("Frame %d has been transmitted.\n",sent);
sent++;
if(sent == windowsize)
break;
}
printf("\nPlease enter the last Acknowledgement received.\n");
scanf("%d",&ack);
if(ack == windowsize)
break;
else
sent = ack;
}
return 0;
}
output:-
enter window size
8
Frame 0 has been transmitted.
Please enter the last Acknowledgement received.
2

Please enter the last Acknowledgement received.

8

4. Implement Dijsktra’s algorithm to compute the shortest path through a network
Write a C program to Implement Dijkstra’s Algorithm to compute the

shortest path through a given path.
#include<stdio.h>
#include<conio.h>
#define INFINITY
#define MAX 10
void dijkstra(int G[MAX][MAX],int
n,int startnode);
int main()
{
int G[MAX][MAX],i,j,n,u; printf("Enter no. of vertices:");
scanf("%d",&n);
printf("\nEnter the adjacency matrix:\n");
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%d",&G[i][j]
);
printf("\nEnter the starting node:");
scanf("%d",&u);
dijkstra(G,n,u); return 0;
}
void dijkstra(int G[MAX][MAX],int n,int startnode)
{
int
cost[MAX][MAX],distance[MAX],pred
[MAX];
int visited[MAX],count,mindistance,nextnode,i,j;
//pred[] stores the predecessor of each node
//count gives the number of nodes seen so far
//create the cost matrix
for(i=0;i<n;i++)
for(j=0;j<n;j++) if(G[i][j]==0)
cost[i][j]=INFINITY; else
cost[i][j]=G[i][j];
//initialize pred[],distance[] and visited[]
for(i=0;i<n;i++)
{
distance[i]=cost[startnode][i];
pred[i]=startnode; visited[i]=0;
}
distance[startnode]=0;
visited[startnode]=1; count=1;

while(count<n-1)
{
mindistance=INFINITY;
//nextnode gives the node at
minimum distance for(i=0;i<n;i++)
if(distance[i]<mindistance&&!visited[i])
{
mindistance=dista
nce[i];
nextnode=i;
}
//check if a better path exists through
nextnode visited[nextnode]=1;
for(i=0;i<n;i++) if(!visited[i])
if(mindistance+cost[nextnode][i]<distance[i])
{
distance[i]=mindistance+cost[nextnode][i];
pred[i]=nextnode;
}
count++;
}
//print the path and distance of each node
for (i=0;i<n;i++)
if(i!=startnode)
{
printf("\nDistance of node%d=%d",i,distance[i]);
printf("\nPath=%d",i);
j=i;
do
{
j=pred[j];
printf("<-%d",j);
}while(j!=startnode);
}
}

5. Take an example subnet of hosts and obtain a broadcast tree for the subnet.
#include<stdio.h>
int a[10][10],n;
main()
{
int i,j,root; clrscr();
printf("Enter no.of nodes:");
scanf("%d",&n);
printf("Enter adjacent matrix\n");
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
printf("Enter connecting of %d>%d::",i,j);
scanf("%d",&a[i][j]);
}
printf("Enter root node:"); scanf("%d",&root);
adj(root);
}
adj(int k)
{
int i,j;
printf("Adjacent node of root node::\n");
printf("%d\n",k);
for(j=1;j<=n;j++)
{
if(a[k][j]==1 || a[j][k]==1) printf("%d\t",j);
}
printf("\n"); for(i=1;i<=n;i++)
{
if((a[k][j]==0) && (a[i][k]==0) && (i!=k))
printf("%d",i);
}
} OUTPUT:
Enter no.of nodes: 5 Enter adjacent matrix
Enter connecting of 1–>1::0 Enter connecting of 1–>2::1 Enter connecting of 1–>3::1
Enter connecting of 5–>2::0
Enter root node:2
Adjacent node of root node:
2
134
5

6. Implement distance vector routing algorithm for obtaining routing tables at each node.
#include<stdio.h>
struct node
{
unsigned dist[20];
unsigned from[20];
}rt[10];
int main()
{
int dmat[20][20];
int n,i,j,k,count=0;
printf("\nEnter the number of nodes : ");
scanf("%d",&n);
printf("\nEnter the cost matrix :\n");
for(i=0;i<n;i++)
for(j=0;j<n;j++)
{
scanf("%d",&dmat[i][j]);
dmat[i][i]=0;
rt[i].dist[j]=dmat[i][j];
rt[i].from[j]=j;
}
do
{
count=0;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
for(k=0;k<n;k++)
if(rt[i].dist[j]>dmat[i][k]+rt[k].dist[j])
{
rt[i].dist[j]=rt[i].dist[k]+rt[k].dist[j];
rt[i].from[j]=k;
count++;
}
}while(count!=0);
for(i=0;i<n;i++)
{
printf("\n\nState value for router %d is \n",i+1);
for(j=0;j<n;j++)
{
printf("\t\nnode %d via %d Distance%d",j+1,rt[i].from[j]+1,rt[i].dist[j]);
}
}
printf("\n\n");
}

OUTPUT:
[cseb332@Insat5E ~]$ cc dst.c

[cseb332@Insat5E ~]$ ./a.out
Enter the number of nodes : 4

Enter the cost matrix:
0 3 5 99
3 0 99 1
5402
99 1 2 0
State value for router 1 is
node 1 via 1 Distance0



7. Implement data encryption and data decryption
#include<stdio.h>
#include<conio.h>
#include<string.h>
int p10[]={3,5,2,7,4,10,1,9,8,6},
p8[]={6,3,7,4,8,5,10,9},
p4[]={2,4,3,1};
int ip[]={2,6,3,1,4,8,5,7},
ipinv[]={4,1,3,5,7,2,8,6},
ep[]={4,1,2,3,2,3,4,1};
int s0[][4]={{1,0,3,2,},{3,2,1,0},{0,2,1,3,},{3,1,3,2}};
int s1[][4]={{0,1,2,3},{2,0,1,3},{3,0,1,0},{2,1,0,3}};
void permute(char op[],char
ip[],int p[], int n){ int i;
for(i=0;i<n;i++) op[i]=ip[p[i]-1]; op[i]='\0';
}
void circularls(char pr[],int n){ int i;
char ch=pr[0]; for(i=0;i<n-1;i++) pr[i]=pr[i+1]; pr[i]=ch;
}
void keygen(char k1[],char k2[],char key[]){ char keytemp[11];
permute(keytemp,key,p10,10;
circularls(keytemp,5);
circularls(keytemp+5,5);
permute(k1,keytemp,p8,8);
permute(k2,keytemp,p8,8);
}
void xor(char op[],char ip[]){ int i;
for(i=0;i<strlen(op)&&i<str
len(ip);i++) op[i]=(op[i]-
'0')^(ip[i]-'0')+'0';
}
void sbox(char op[],char ip[],int s[][4]) { int value;
value=s[(ip[0]-'0')*2+(ip[3]-'0')][(ip[1]-'0')*2+(ip[2]-'0')];
op[0]=value/2+'0'; op[1]=value%2+'0'; op[2]='\0';
}
void fk(char op[],char ip[],char k[])
{
char l[5],r[5],tmp[9],tmp1[9],tmp2[9]; strncpy(l,ip,4);
l[4]='\0';
strncpy(r,ip+4,4); r[4]='\0';

permute(tmp,r,ep,8); xor(tmp,k);
sbox(tmp1,tmp,s0); sbox(tmp2,tmp+4,s1); strcat(tmp1,tmp2); permute(tmp,tmp1,p4,4);
xor(tmp,l);
strcat(tmp,r); strcpy(op,tmp);
}
void sw(char pr[]) { char tmp[9]; strncpy(tmp,pr+4,4); strncpy(tmp+4,pr,4); tmp[8]='\0';
strcpy(pr,tmp);
}
void main()
{
char key[11],k1[9],k2[9],plain[9],cipher[9],tmp[9]; clrscr();
printf("enter 10 bit key:"); gets(key);
if(strlen(key)!=10) printf("invalid key length !!"); else
{
keygen(k1,k2,key); printf("sub key k1::"); puts(k1); printf("subkey k2::"); puts(k2);
printf("enter 8 bit plain text:"); gets(plain);
if(strlen(plain)!=8) printf("invalid length plain text !!"); permute(tmp,plain,ip,8);
fk(cipher,tmp,k1); sw(cipher); fk(tmp,cipher,k2); permute(cipher,tmp,ipinv,8);
printf("cipher teaxt is::"); puts(cipher);
/* decryption process*/ permute(tmp,cipher,ip,8); fk(plain,tmp,k2); sw(plain);
fk(tmp,plain,k1); permute(plain,tmp,ipinv,8); printf("decrypted text is::"); puts(plain);
}
getch();
}
OUTPUT:
Enter 10 bit key: 1456987203 Sub key k1::17062538
Sub key k2::25893401
Enter 8 bit plain text: computer Cipher text is::epfnmrct
Decrypted text is::computer

8. Write a program for congestion control using Leaky bucket algorithm.
#include<stdio.h>
#include<string.h>
int min(int x,int y)
{
if(x<y)
return x;
else
return y;
}
int main()
{
int drop=0,mini,nsec,cap,count=0,i,inp[25],process;
syste("clear");
printf("Enter The Bucket Size\n");
scanf("%d",&cap);
printf("Enter The Processing Rate\n");
scanf("%d",&process);
printf("Enter The No. Of Seconds You Want To Stimulate\n");
scanf("%d",&nsec);
for(i=0;i<nsec;i++)
{
printf("Enter The Size Of The Packet Entering At %d sec\n",i+1);
scanf("%d",&inp[i]);
}
printf("\nSecond|Packet Recieved|Packet Sent|Packet Left|Packet Dropped|\n");
printf(" \n");
for(i=0;i<nsec;i++)
{
count+=inp[i];
if(count>cap)
{
drop=count-cap;
count=cap;
}
printf("%d",i+1);
printf("\t%d",inp[i]);
mini=min(count,process);
printf("\t\t%d",mini);
count=count-mini;
printf("\t\t%d",count);
printf("\t\t%d\n",drop);
drop=0;
}
for(;count!=0;i++)

{
if(count>cap)
{
drop=count-cap;
count=cap;
}
printf("%d",i+1);
printf("\t0");
mini=min(count,process);
printf("\t\t%d",mini);
count=count-mini;
printf("\t\t%d",count);
printf("\t\t%d\n",drop);
}
}
$ cc –o Congestion Congestion.c
$ ./Congestion
Enter The Bucket Size
5
Enter The Processing Rate
2
Enter The No. Of Seconds You Want To Stimulate
3
Enter The Size Of The Packet Entering At 1 sec
5
4
3
Second|Packet Recieved|Packet Sent|Packet Left|Packet Dropped|
1 5 2 3 0
2 4 2 3 2
3 3 2 3 1
4 0 2 1 0
5 0

9. Write a program for frame sorting technique used in buffers.
#include<stdio.h>
#include<string.h>
#define FRAM_TXT_SIZ 3
#define MAX_NOF_FRAM 127
char str[FRAM_TXT_SIZ*MAX_NOF_FRAM];
struct frame // structure maintained to hold frames
{ char text[FRAM_TXT_SIZ];
int seq_no;
}fr[MAX_NOF_FRAM], shuf_ary[MAX_NOF_FRAM];
int assign_seq_no() //function which splits message
{ int k=0,i,j; //into frames and assigns sequence no
for(i=0; i < strlen(str); k++)
{ fr[k].seq_no = k;
for(j=0; j < FRAM_TXT_SIZ && str[i]!='\0'; j++)
fr[k].text[j] = str[i++];
}
printf("\nAfter assigning sequence numbers:\n");
for(i=0; i < k; i++)
printf("%d:%s ",i,fr[i].text);
return k; //k gives no of frames
}
void generate(int *random_ary, const int limit) //generate array of random nos
{ int r, i=0, j;
while(i < limit)
{ r = random() % limit;
for(j=0; j < i; j++)

if( random_ary[j] == r )
Break;
if( i==j ) random_ary[i++] = r;
}}
void shuffle( const int no_frames ) // function shuffles the frames
{
int i, k=0, random_ary[no_frames];
generate(random_ary, no_frames);
for(i=0; i < no_frames; i++)
shuf_ary[i] = fr[random_ary[i]];

printf("\n\nAFTER SHUFFLING:\n");
for(i=0; i < no_frames; i++)
printf("%d:%s ",shuf_ary[i].seq_no,shuf_ary[i].text);
}
void sort(const int no_frames) // sorts the frames
{
int i,j,flag=1;
struct frame hold;
for(i=0; i < no_frames-1 && flag==1; i++) // search for frames in sequence
{
flag=0;
for(j=0; j < no_frames-1-i; j++) //(based on seq no.) and display
if(shuf_ary[j].seq_no > shuf_ary[j+1].seq_no)
{
hold = shuf_ary[j];
shuf_ary[j] = shuf_ary[j+1];
shuf_ary[j+1] = hold;
flag=1;
}
}
}
int main()
{
int no_frames,i;
printf("Enter the message: ");
gets(str);
no_frames = assign_seq_no();
shuffle(no_frames);
sort(no_frames);
printf("\n\nAFTER SORTING\n");
for(i=0;i<no_frames;i++)
printf("%s",shuf_ary[i].text);
printf("\n\n");
}
[root@localhost nwcn]# ./a.out

Enter the message: Welcome To Acharya Institute of Technology
After assigning sequence numbers:
0:Wel 1:com 2:e T 3:o A 4:cha 5:rya 6: In 7:sti 8:tut 9:e o 10:f T 11:ech 12:nol 13:ogy
AFTER SHUFFLING:

1:com 4:cha 9:e o 5:rya 3:o A 10:f T 2:e T 6: In 11:ech 13:ogy 0:Wel 8:tut 12:nol 7:sti
AFTER SORTING
Welcome To Acharya Institute of Technology

10. Wire shark
i. Packet Capture Using Wire shark
ii. Starting Wire shark
iii. Viewing Captured Traffic
iv. Analysis and Statistics & Filters.
Capturing Packets
After downloading and installing Wires hark, you can launch it and double-click the name of a
network interface under Capture to start capturing packets on that interface. For example, if you
want to capture traffic on your wireless network, click your wireless interface. You can configure
advanced features by clicking Capture > Options, but this isn’t necessary for now

Inspecting Packets
Click a packet to select it and you can dig down to view its details.
Start Wires hark, click on Statistics.
How to do it…
1. From the Statistics menu, choose Capture File Properties:

11. How to run Nmap scan
Nmap is one of the most popular network mappers in the infosec world. It’s utilized by cyber
security professionals and newbies alike to audit and discover local and remote open ports, as
well as hosts and network information.
Nmap can be used to:
 Create a complete computer network map.

 Find remote IP addresses of any hosts.
 Get the OS system and software details.
 Detect open ports on local and remote systems.
 Audit server security standards.
 Find vulnerabilities on remote and local hosts.
Nmap command examples
Let’s get to know a few useful command-line based scans that can be performed using Nmap.
1. Basic Nmap Scan against IP or host
nNow, if you want to scan a hostname, simply replace the IP for the host, as you see below:
nmap cloudflare.com
These kinds of basic scans are perfect for your first steps when starting with Nmap
2. Scan specific ports or scan entire port ranges on a local or remote server
nmap -p 1-65535 localhost
In this example, we scanned all 65535 ports for our localhost computer.
Nmap is able to scan all possible ports, but you can also scan specific ports, which will report
faster results. See below:
nmap -p 80,443 8.8.8.8

12. Operating System Detection using Nmap
Detect OS and services
This is the command to scan and search for the OS (and the OS version) on a host. This
command will provide valuable information for the enumeration phase of your network security
assessment (if you only want to detect the operating system, type nmap -O 192.168.0.9):
nmap -A 192.168.0.9
Standard service detection
This is the command to scan for running service. Nmap contains a database of about 2,200 well-
known services and associated ports. Examples of these services are HTTP (port 80), SMTP
(port 25), DNS (port 53), and SSH (port 22):
nmap -sV 192.168.0.9

13. Do the following using NS2 Simulator
i. NS-2 Simulator Introduction
NS2 stands for Network Simulator Version 2. It is an open-source event-driven simulator

designed specifically for research in computer communication networks.
Features of NS2
1. It is a discrete event simulator for networking research.
2. It provides substantial support to simulate bunch of protocols like TCP, FTP, UDP, https and
DSR.
3. It simulates wired and wireless network.
4. It is primarily Unix based.
5. Uses TCL as its scripting language.
6. Otcl: Object oriented support
7. Tclcl: C++ and otcl linkage
8. Discrete event scheduler
Basic Architecture
NS2 consists of two key languages: C++ and Object-oriented Tool Command Language
(Outcall). While the C++ defines the internal mechanism (i.e., a backend) of the simulation
objects, the OTcl sets up simulation by assembling and configuring the objects as well as
scheduling discrete events. The C++ and the OTcl are linked together using TclCL

ii. Simulate to Find the Number of Packets
Create a new Simulation Instance

set ns [new Simulator]
set bandwidth 1.75Mb
#Turn on the Trace and the animation files
set f [open out.tr w]
set nf [open out.nam w]
$ns trace-all $f
$ns namtrace-all $nf
#Define the finish procedure to perform at the end of the simulation
proc finish {} {
global f nf ns
$ns flush-trace
close $f
close $nf
exec nam out.nam &
#exec awk -f 1.awk out.tr &
exit 0
}
#Create the nodes
set n0 [$ns node]
set n1 [$ns node]
set n2 [$ns node]
#Label the nodes

$n0 label "TCP Source"
$n1 label "UDP Source"
$n2 label "Sink"
#Set the color
$ns color 1 red
$ns color 2 yellow
#Create the Topology
$ns duplex-link $n0 $n1 $bandwidth 10ms DropTail
$ns duplex-link $n1 $n2 1.75Mb 20ms DropTail
#Attach a Queue of size N Packets between the nodes n1 n2
$ns queue-limit $n1 $n2 10
#Make the Link Orientation
$ns duplex-link-op $n0 $n1 orient right

#Create a UDP Agent and attach to the node n1
set udp0 [new Agent/UDP]
$ns attach-agent $n0 $udp0
#Create a CBR Traffic source and attach to the UDP Agent
set cbr0 [new Application/Traffic/CBR]
$cbr0 attach-agent $udp0
#Specify the Packet Size and interval
$cbr0 set packetSize_ 500
$cbr0 set interval_ 0.005
#Create a Null Agent and attach to the node n2
set null0 [new Agent/Null]
$ns attach-agent $n2 $null0
#Connect the CBR Traffic source to the Null agent
$ns connect $udp0 $null0
#Create a TCP agent and attach to the node n0
set tcp0 [new Agent/TCP]
$ns attach-agent $n0 $tcp0
#Create a FTP source and attach to the TCP agent
set ftp0 [new Application/FTP]
#Attach the FTP source to the TCP Agent
$ftp0 attach-agent $tcp0
#Create a TCPSink agent and attach to the node n2
set sink [new Agent/TCPSink]
$ns attach-agent $n2 $sink
#Specify the Max file Size in Bytes
$ftp0 set maxPkts_ 1000
#Connect the TCP Agent with the TCPSink
$ns connect $tcp0 $sink
$udp0 set class_ 1
$tcp0 set class_ 2
#Schedule the Events
$ns at 0.1 "$cbr0 start"
$ns at 1.0 "$ftp0 start"
$ns at 4.0 "$ftp0 stop"
$ns at 4.5 "$cbr0 stop"
$ns at 5.0 "finish"
$ns run

Now run the code using
ns filename.tcl
you will get something like this:
iii. Simulate to Find the Number of Packets Dropped by TCP/UDP
Create a new Simulation Instance

$ns trace-all $f
proc finish {} {
global f nf ns
$ns flush-trace
close $f
close $nf
exec nam out.nam &
exit 0
}
#Create the nodes
set n0 [$ns node]
set n1 [$ns node]
set n2 [$ns node]
#Label the nodes
$n2 label "Sink"
#Set the color
$ns color 1 red

$ns color 2 yellow
$udp0 set class_ 1
$tcp0 set class_ 2

Dept. of CSE CS506PC: COMPUTER NETWORKS & LAB

$ns at 5.0 "finish"
$ns run
iv. Simulate to Find the Number of Packets Dropped due to Congestion

#Create a new Simulation Instance
$ns trace-all $f
proc finish {} {
global f nf ns
$ns flush-trace
close $f
close $nf
exec nam out.nam &
exit 0
}
#Create the nodes
set n0 [$ns node]
set n1 [$ns node]
set n2 [$ns node]
#Label the nodes

$n2 label "Sink"
#Set the color

$ns color 1 red
$ns color 2 yellow

$udp0 set class_ 1
$tcp0 set class_ 2
$ns at 5.0 "finish"
$ns run
v. Simulate to Compare Data Rate & Throughput
# Filename: sample27.tcl
# Simulator Instance Creation
#Fixing the co-ordinate of simulation area

set val(x) 500
set val(y) 500
# Define options
set val(chan) Channel/WirelessChannel ;# channel type
set val(prop) Propagation/TwoRayGround ;# radio-propagation model
set val(netif) Phy/WirelessPhy ;# network interface type
set val(mac) Mac/802_11 ;# MAC type
set val(ifq) Queue/DropTail/PriQueue ;# interface queue type
set val(ll) LL ;# link layer type

set val(ant) Antenna/OmniAntenna ;# antenna model
set val(ifqlen) 50 ;# max packet in ifq
set val(nn) 3 ;# number of mobilenodes
set val(rp) AODV ;# routing protocol
set val(x) 500 ;# X dimension of topography
set val(y) 500 ;# Y dimension of topography
set val(stop) 10.0 ;# time of simulation end
# set up topography object

set topo [new Topography]
$topo load_flatgrid $val(x) $val(y)
#Nam File Creation nam – network animator

set namfile [open sample27.nam w]
#Tracing all the events and cofiguration

$ns namtrace-all-wireless $namfile $val(x) $val(y)
#Trace File creation

set tracefile [open sample27.tr w]
#Tracing all the events and cofiguration

$ns trace-all $tracefile
# general operational descriptor- storing the hop details in the network

create-god $val(nn)
# configure the nodes

$ns node-config -adhocRouting $val(rp) \
-llType $val(ll) \
-macType $val(mac) \
-ifqType $val(ifq) \
-ifqLen $val(ifqlen) \
-antType $val(ant) \
-propType $val(prop) \
-phyType $val(netif) \
-channelType $val(chan) \
-topoInstance $topo \
-agentTrace ON \
-routerTrace ON \

-macTrace OFF \
-movementTrace ON
# Node Creation
for {set i 0} {$i < 3} {incr i} {
set node_($i) [$ns node]

$node_($i) color black
#Location fixing for a single node
$node_(0) set X_ 258

$node_(0) set Y_ 222
$node_(0) set Z_ 0
for {set i 1} {$i < 3} {incr i} {
$node_($i) set X_ [expr rand()*$val(x)]

$node_($i) set Y_ [expr rand()*$val(y)]
$node_($i) set Z_ 0
}
# Label and coloring
for {set i 0} {$i < 3} {incr i} {
$ns at 0.1 "$node_($i) color blue"

$ns at 0.1 "$node_($i) label Node$i"
}
#Size of the node
for {set i 0} {$i < 3} {incr i} {
$ns initial_node_pos $node_($i) 30
}
#******************************Defining Communication Between node0 and all nodes
****************************8

for {set i 1} {$i < 3} {incr i} {
# Defining a transport agent for sending

set udp [new Agent/UDP]
# Attaching transport agent to sender node

$ns attach-agent $node_($i) $udp
# Defining a transport agent for receiving

set null [new Agent/Null]
# Attaching transport agent to receiver node

$ns attach-agent $node_(0) $null
#Connecting sending and receiving transport agents

$ns connect $udp $null
#Defining Application instance

set cbr [new Application/Traffic/CBR]
# Attaching transport agent to application agent

$cbr attach-agent $udp
#Packet size in bytes and interval in seconds definition

$cbr set packetSize_ 512
$cbr set interval_ 0.1
# data packet generation starting time

$ns at 1.0 "$cbr start"
# data packet generation ending time

#$ns at 6.0 "$cbr stop"
}
# ending nam and the simulation
$ns at $val(stop) "$ns nam-end-wireless $val(stop)"
$ns at $val(stop) "stop"
#Stopping the scheduler

$ns at 10.01 "puts \"end simulation\" ; $ns halt"
#$ns at 10.01 "$ns halt"

exec awk -f Throughput.awk sample27.tr > Throughput.tr &
#Starting scheduler
$ns run
#filename:Throughput.awk
#——— Formula ————:
Throughput = received_data*8/DataTransmissionPeriod
#——— AWK script Format——–#

The script has the following format:
BEGIN {}
{
content
}
END {}
Begin part comprises of initialization of variable.
Commands in the content part scan every row of trace file only once.
Ex:
if (pattern) {
action;
}
If the pattern is matched with the line in the trace in the trace file specified action will be
performed.
In the END part final calculation is performed on the data obtained from the content part.
#——— Steps ————:
1. set pattern and action for received data

2. apply the received data value in the formula to calculate throughput in bits/s
Execution:
ns sample27.tcl

vi. Simulate to Plot Congestion for Different Source/Destination

set nf [open "lab3.nam" w]
set tf [open "lab3.tr" w]
$ns trace-all $tf
set n0 [$ns node]
$n0 label "src1"
$n0 color "magenta"
set n1 [$ns node]

$n1 color "red"
set n2 [$ns node]
$n2 label "src2"
$n2 color "magenta"
set n4 [$ns node]
$n4 color "red"
set n3 [$ns node]
$n3 label "dest2"
$n3 color "blue"
set n5 [$ns node]
$n5 label "dest1"

$n5 color "blue"
$ns make-lan "$n0 $n1 $n2 $n3 $n4" 100Mb 10ms LL Queue/DropTail Mac/802_3
$ns duplex-link $n4 $n5 100Mb 10ms DropTail
$ftp0 set packetSize_ 1000
$ftp0 set interval_ 0.005
set Sink0 [new Agent/TCPSink]
$ns attach-agent $n5 $Sink0
$ns connect $tcp0 $Sink0
set ftp1 [ new Application/FTP]
$ftp1 set packetSize_ 10000
$ftp1 set interval_ 0.0005
set Sink1 [new Agent/TCPSink]
$ns attach-agent $n3 $Sink1
$ns connect $tcp1 $Sink1
set file0 [open "file0.tr" w]
$tcp0 attach $file0
set file1 [open "file1.tr" w]
$tcp1 attach $file1
$tcp0 trace cwnd_
$tcp1 trace cwnd_
proc finish { } {
global ns nf tf
$ns flush-trace
close $nf
close $tf
exec nam lab3.nam &
exit 0
}

$ns at 2.9 "finish"
$ns run
AWK file (Open a new editor using “gedit command” and write awk file and save with “.awk”
extension)
cwnd:- means congestion window
BEGIN{
}
{
if($6 == "cwnd_")
{
printf("%f\t%f\n",$1,$7);
}
}
END{
}
vii. Simulate to Determine the Performance with respect to Transmission of Packets
# basic1.tcl simulation: A---R---B
#Create a simulator object

#Open the nam file basic1.nam and the variable-trace file basic1.tr
set namfile [open basic1.nam w]
$ns namtrace-all $namfile
set tracefile [open basic1.tr w]
$ns trace-all $tracefile
#Define a 'finish' procedure

proc finish {} {
global ns namfile tracefile
$ns flush-trace
close $namfile
close $tracefile
exit 0
}

#Create the network nodes
set A [$ns node]
set R [$ns node]
set B [$ns node]
#Create a duplex link between the nodes
$ns duplex-link $A $R 10Mb 10ms DropTail

$ns duplex-link $R $B 800Kb 50ms DropTail
# The queue size at $R is to be 7, including the packet being sent

$ns queue-limit $R $B 7
# some hints for nam

# color packets of flow 0 red
$ns color 0 Red
$ns duplex-link-op $A $R orient right
$ns duplex-link-op $R $B orient right
$ns duplex-link-op $R $B queuePos 0.5
# Create a TCP sending agent and attach it to A

set tcp0 [new Agent/TCP/Reno]
# We make our one-and-only flow be flow 0
$tcp0 set class_ 0
$tcp0 set window_ 100
$tcp0 set packetSize_ 960
$ns attach-agent $A $tcp0
# Let's trace some variables

$tcp0 attach $tracefile
$tcp0 tracevar cwnd_
$tcp0 tracevar ssthresh_
$tcp0 tracevar ack_
$tcp0 tracevar maxseq_
#Create a TCP receive agent (a traffic sink) and attach it to B

set end0 [new Agent/TCPSink]
$ns attach-agent $B $end0
#Connect the traffic source with the traffic sink

$ns connect $tcp0 $end0
#Schedule the connection data flow; start sending data at T=0, stop at T=10.0

set myftp [new Application/FTP]
$myftp attach-agent $tcp0
$ns at 0.0 "$myftp start"
$ns at 10.0 "finish"
#Run the simulation

$ns run

Computer Networks LAB MANUAL R20

Uploaded by

Copyright:

Available Formats

Computer Networks LAB MANUAL R20

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Computer Networks LAB MANUAL R20

Uploaded by

Copyright:

Available Formats

St.

Martin's Engineering College

COURSE NAME : COMPUTER NETWORKS LAB

COURSE CODE: CS506PC

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

S.NO NAME OF PROGRAM

1 Vision and Mission of Institution and Department

2 COs, POs, PSOs & PEOs

6 Contents beyond Syllabus

Vision and Mission of the Department and Institute

To become an institute of excellence by creating high quality and

To instill moral values and promote technological, intellectual and

To evolve the department of computer science and engineering as a

M1: To produce competitive graduates having creative skills and

M3: To analyze, design and develop high quality software systems

Dept. of CSE CS506PC: COMPUTER NETWORKS LAB

COs, POs, PSOs & PEOs

S. NO. Course Objectives

1 To understand the working principle of various communication protocols

To understand the network simulator environment and visualize a network

3 To analyze the traffic flow and the contents of protocol frames

Dept. of CSE CS506PC: COMPUTER NETWORKS LAB

S. NO. Course Outcomes BTL

CO1 Implement data link layer farming methods

CO2 Analyze error detection and error correction codes.

CO3 Implement and analyze routing and congestion issues in network

CO5 To be able to work with different network tools

Dept. of CSE CS506PC: COMPUTER NETWORKS LAB

S. Program Outcomes Level Expertise a

Engineering knowledge: Apply the

Problem analysis: Identify, formulate,

Design/development of solutions: Design

Conduct investigations of complex

Dept. of CSE CS506PC: COMPUTER NETWORKS LAB

Modern tool usage: Create, select, and apply

The engineer and society: Apply reasoning

Environment and sustainability:

Ethics: Apply ethical principles and commit

Individual and team work: Function

Communication: Communicate effectively

Dept. of CSE CS506PC: COMPUTER NETWORKS LAB

documentation, make effective presentations,

Project management and finance:

Life-long learning: Recognize the need for,

1- None 2- Supportive 3- Highly Related

Dept. of CSE CS506PC: COMPUTER NETWORKS LAB

PEO No. Program Educational Objectives

To apply engineering processes and practices to software and hardware systems

Ability to understand and analyze engineering issues in a broader prospective

PROGRAM SPECIFIC OUTCOMES

S. No. Program Specific Outcomes Level Expertise & assessed by

Proficiency skill: Potential to understand,

Analytical skills: Capability to apply

Successful Career and

1- None 2- Supportive 3- Highly Related

Dept. of CSE CS506PC: COMPUTER NETWORKS LAB

1. To understand the working principle of various communication protocols.

4. Implement Dijsktra’s algorithm to compute the shortest path through a network