Scribd
Upload
8 views5 pages

Lab Questions

The document outlines various laboratory exercises for the Computer Networks Laboratory at Vidya Vikas Institute of Engineering and Technology, Mysuru. It includes tasks such as implementing point-to-point networks with varying node counts, analyzing network performance, applying TCP and UDP agents, and implementing various protocols like Dijkstra's algorithm and CRC code verification. Additionally, it covers congestion control techniques and error handling in network communications.

Uploaded by

Shilpa Rohith
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views5 pages

Lab Questions

The document outlines various laboratory exercises for the Computer Networks Laboratory at Vidya Vikas Institute of Engineering and Technology, Mysuru. It includes tasks such as implementing point-to-point networks with varying node counts, analyzing network performance, applying TCP and UDP agents, and implementing various protocols like Dijkstra's algorithm and CRC code verification. Additionally, it covers congestion control techniques and error handling in network communications.

Uploaded by

Shilpa Rohith
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU

DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING


COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement a point to point network with four nodes and duplex links between them. Analyze the netwo
performance by setting the queue size and varying the bandwidth.
2. Write a program for a HLDC frame to perform the Bit stuffing

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)
1. Implement a point to point network with five nodes and duplex links between them. Analyze the network
performance by setting the queue size and varying the bandwidth.
2. Write a program for a HLDC frame to perform the Character stuffing

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement a point to point network with Three nodes and duplex links between them. Analyze the
network performance by setting the queue size and varying the bandwidth
2. Implement Dijkstra’s algorithm to compute the shortest routing path.

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. For the given data, use CRC-CCITT polynomial to obtain CRC code. Verify the program for Without
error
2. Implement a four node point to point network with links n0-n2, n1-n2 and n2-n3. Apply TCP agent
between n0-n3 and UDP between n1-n3. Apply relevant applications over TCP and UDP agents
changing the parameter and determine the number of packets sent by TCP/UDP.

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. For the given data, use CRC-CCITT polynomial to obtain CRC code. Verify the program for With
error
2. Implement a four node point to point network with links n0-n2, n1-n2 and n2-n3. Apply TCP agent
between n0-n3 and UDP between n1-n3. Apply relevant applications over TCP and UDP agents
changing the parameter and determine the number of packets sent by TCP/UDP.

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1.For the given data, use CRC-CCITT polynomial to obtain CRC code. Verify the program for With
error
2.Implement a Five node point to point network with links n0-n1, n1-n2 , n3-n4 and n2-n3. Apply
TCP agent between n0-n3 and UDP between n1-n3. Apply relevant applications over TCP and UDP
agents changing the parameter and determine the number of packets sent by TCP/UDP.
VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU
DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. For the given data, use CRC-CCITT polynomial to obtain CRC code. Verify the program for Without
error
2. Implement Ethernet LAN using n (6) nodes. Compare the throughput by changing the error rate
and data rate.

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. For the given data, use CRC-CCITT polynomial to obtain CRC code. Verify the program for With
error
2. Implement Ethernet LAN using n (8) nodes. Compare the throughput by changing the error rate
and data rate.

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. For the given data, use CRC-CCITT polynomial to obtain CRC code. Verify the program for With
error
2. Implementation of Stop and Wait Protocol.

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement Ethernet LAN using n nodes and assign multiple traffic to the nodes and obtain
congestion window for different sources/ destinations.
2. Implementation of Sliding Window Protocol.

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implementation of Link state routing algorithm.


2. Implementation of Sliding Window Protocol.

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implementation of Link state routing algorithm.


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

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implementation of Link state routing algorithm.


2. Write a program for a HLDC frame to perform the Bit stuffing

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement Ethernet LAN using n nodes and assign multiple traffic to the nodes and obtain
congestion window for different sources/ destinations.
2. Write a program for a HLDC frame to perform the Character stuffing

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement a point to point network with Six nodes and duplex links between them. Analyze the
network performance by setting the queue size and varying the bandwidth.
2. Write a program for a HLDC frame to perform the Character stuffing

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement a point to point network with Three nodes and duplex links between them. Analyze
the network performance by setting the queue size and varying the bandwidth.
2. Implement Dijkstra’s algorithm to compute the shortest routing path.

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement a point to point network with Five nodes and duplex links between them. Analyze the
network performance by setting the queue size and varying the bandwidth.
2. Implement Dijkstra’s algorithm to compute the shortest routing path.

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement a four node point to point network with links n0-n2, n1-n2 and n2-n3. Apply TCP
agent between n0-n3 and UDP between n1-n3. Apply relevant applications over TCP and UDP
agents changing the parameter and determine the number of packets sent by TCP/UDP.
2. Implement Dijkstra’s algorithm to compute the shortest routing path.

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement a Three node point to point network with links n0-n2, n1-n2 and n2-n1. Apply TCP
agent between n0-n2 and UDP between n1-n2. Apply relevant applications over TCP and UDP
agents changing the parameter and determine the number of packets sent by TCP/UDP.
2. Implementation of Stop and Wait Protocol
VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU
DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement a Five node point to point network with links n0-n2, n1-n2 , n2-n3 and n2-n1. Apply
TCP agent between n0-n2 and UDP between n1-n2. Apply relevant applications over TCP and UDP
agents changing the parameter and determine the number of packets sent by TCP/UDP.
2. Implementation of Sliding Window Protocol

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement Ethernet LAN using n 7 nodes. Compare the throughput by changing the error rate and
data rate.
2. Implementation of Sliding Window Protocol

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement Ethernet LAN using n (6-10) nodes. Compare the throughput by changing the error rate
and data rate.
2. Implementation of Stop and Wait Protocol

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. Implement Dijkstra’s algorithm to compute the shortest routing path.


2. Implementation of Stop and Wait Protocol

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. For the given data, use CRC-CCITT polynomial to obtain CRC code. Verify the program for the cases
a. Without error b. With error
2. Write a program for congestion control using leaky bucket algorithm.

VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. For the given data, use CRC-CCITT polynomial to obtain CRC code. Verify the program for the
cases a. Without error b. With error
2. Implement Dijkstra’s algorithm to compute the shortest routing path.
VIDYA VIKAS INSTITUTE OF ENGINEERING AND TECHNOLOGY,MYSURU
DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING
COMPUTER NETWORKS LABORATORY (17ECL68)

1. For the given data, use CRC-CCITT polynomial to obtain CRC code. Verify the program for the
cases a. Without error b. With error
2. Implementation of Link state routing algorithm.

You might also like