1 SEMESTER I Problem Solving Using C Sub. 49 Here node # 2 act as a router. Any traffic to or from the LAN passes through it. Consider node # 1 running a FTP server, and node # 5 is downloading a file of size 4 MB. However, the link between node # 2 and # 3 is fault. It drops packets with a fixed probability of 0.2.

WMI Explorer 2014 released! The latest version of the WMI Explorer is available now on our website. Here are just a few highlights from the features in this release: Read More. January 16, 2014 / by Alex Riedel / Community Tools, Software News, Windows PowerShell / 8 Comments.

Implement a link error model to reflect this. It may be noted here that the file download time will be more than the we had in exercise # 2 of experiment # 1. Try different values of the simulation time to ensure that the file has been entirely transferred. Is the plot of bytes received a linear curve or non-linear? Presence of link errors cause one or more packets to be retransmitted. Verify this from the 'Packet Retransmissions' plot. Measuring Network Performances Bottleneck in the network Consider a dumbbell topology with eight nodes as shown as in the following figure.

Consider nodes# 2 and 3 to be two routers connecting two different networks. When the bandwidth of the link 2-3 is much lower than the sum of bandwidths of the other links in the network, it act as a bottleneck.

Assume node # 0 running a FTP application (over TCP) and sending data to node # 6. Node # 1 is sending CBR data node # 7.

Assume all the links except 2-3 has a bandwidth of 1 Mb, propagation delay of 10ms and queue type as DropTail. (All are duplex links). 50 Tasks: The link 2-3 has a propagation delay of 10 ms. Vary it's bandwidth from 0.5 Mb to 2.5 Mb in steps of 0.25Mb. Compute the throughput for node # 3 in each case Plot the throughput vs. Bandwidth data in the 'Custom Plot' section below Based on the above plots, suggest what should be the recommended bandwidth of the link 2-3. Now, plot the end-to-end delay between nodes 0 and 6 for the above chosen values of link 2-3 bandwidth.

Revisit your previous answer (i.e. Optimum bandwidth of link 2-3) based on these graphs. Measuring Network Performances 6. Bandwidth sharing between TCP and UDP Consider the dumbbell topology from our previous exercise: Node # 0 is a TCP source, and the corresponding sink is at node # 6. Node # 1 is a UDP source (CBR traffic) with a null agent attached to node # 7. These two traffic flows through the common link 2-3.

The aim of this exercise is to examine how TCP and UDP share the bandwidth between themselves when the rate of CBR traffic is changed. Set the TCP packet size to 1460 B. The UDP and CBR packet sizes are 1500 B. Diamond D Grown Men Talk Rar. All the links in the network have same bandwidths (say, 4 Mb), delay and queue types.

Part 1: Set the initial rate of CBR traffic to 0.5 Mb. Run the simulation, and plot the 'Bytes Received' by node #s 4 and 5 (sinks for TCP and UDP traffic). Now, increment the rate up to 4 Mb, the link bandwidth, in steps of 0.5 Mb. Run the simulation and plot the graphs again. How does the graphs change after each run? In particular, what's the nature of the graphs when the rate of CBR traffic is 50% of the bandwidth?

Part 2: Behaviour of UDP Reduce the bandwidth of the link 2-3 to say, 2 Mb. Repeat the above steps and observe the graphs in this case. From the graphs plotted observe how UDP occupies a larger portion of the bandwidth. How does the behaviour change for other variations of TCP (Newreno, Vegas)? 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 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 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 MAC protocol. NowAnalyze the trace file and determine when the use of second route commence, and Plot the number of packets received by each node over the entire time duration of the simulation 8.

Simulate a wired network and demonstrate Distance Vector Routing algorithm. Simulate a network which will create congestion in the network.with the trace file created identfy the points at which congestion occurs by writing sed / awk scripts. Also write a mechanism to correct/control the congestion.

Note: Network Free and open source software simulators like NS2 / NS3 could be used. If NS2 is used tcl scripting should be introduced. If NS3 is used c++ with python has to be introduced during first two or three weeks of the labs. Only above 9 experiments should be included for the laboratory exam. To be incorporated to the programs given below: Program 3: hop count plot need not be implemented due to time constraints.

Program 6: implementation of behavior of UDP (Part2) not required. Program 9: For corrective control mechanism TCP NewReno is sufficient.

Assumptions to be made for the TCL programs from 1 to 9.