Note: Implement the following Computer Networks concepts using C/C++
1. Write a program for distance vector algorithm to find suitable path for transmission.
2. Using TCP/IP sockets, write a client-server program to make the client send the file name and to make the server send back the contents of the requested file if present.
3. Implement the above program using message queues or FIFOs as IPC channels.
4. Write a program for Hamming code generation for error detection and correction.
5. Write a program for congestion control using leaky bucket algorithm.
Note: Simulate the following Computer Networks concepts using any network simulators.
1.Simulate a three nodes point — to — point network with duplex links between them. Set the queue size and vary the bandwidth and find the number of packets dropped.
2. Simulate the network with five nodes n0, n1, n2, n3, n4, forming a star topology. The node n4 is at the center. Node n0 is a TCP source, which transmits packets to node n3 (a TCP sink) through the node n4. Node n1 is another traffic source, and sends UDP packets to node n2 through n4. The duration of the simulation time is 10 seconds.
3.Simulate to study transmission of packets over Ethernet LAN and determine the number of packets drop destination.
4. Write a TCL Script to simulate working of multicasting routing protocol and analyze the throughput of the network.
5. Simulate the different types of internet traffic such as FTP and TELNET over a wired network and analyze the packet drop and packet delivery ratio in the network.
6. Simulate the transmission of ping messages over a network topology consisting of 6 nodes and find the number of packets dropped due to congestion.
7. Write a TCL script to simulate the following scenario with ns2 simulator. Consider six nodes, (as shown in the figure below) moving within a flat topology of 700m x 700m. The initial positions of nodes are 0 (150,300),1 (300,500),2 (500,500),3 (300,100),4(500,100) and 5(650,300) respectively.
A TCP connection is initiated between node 0 (source) and node 5 (destination) through node 3 and node 4 i.e the route is 0-3-4-5. At time t = 3 seconds the FTP application runs over it. After time t=4.0 sec, node 3 (300,100) moves towards node 1 (300,500) with a speed of 5.0m/sec and after some time the path break, then the data transmit with a new path via node 1 and node 2 i.e the new route 0-1-2-5. The simulation lasts for 60 secs. In the above said case both the route has equal cost. Use DSR as the routing protocol and the IEEE 802.11 MAC protocol.
Note 1: InthepracticalExaminationstudent has to executeone programfromPART-A and one from PARTB.
Note 2: Change of program is not permitted in the Practical Examination.