New204

Section 1Computing Usable Subnets and Hosts vLab—40 Points Total * Task 1 * Task 2 * Summary Paragraph

Task 2: Step 3, Paste a screenshot of the results from your network data capture. (2.5 points)

Also print out the network diagram on two to three pages so that task information can be read.

Points:  5 questions at 40 points each for 200 points for 25% of your grade (all will be sliding scale).

In a figure all ways from S to D incorporate hosts that are outside the request zone. Accordingly, there is no surety that a way can be discovered comprising just of the hosts in a picked request zone. In this manner, if a route is not found inside of a suitable timeout period, our convention Wows S to start another route disclosure with an extended request zone – in our simulations, the extended zone incorporates the whole system space. in this case the inactivity in deciding the route to D be longer.

| Given a network topology of two or more routers and an IPv4 addressing scheme, implement static routing and confirm layer 3 connectivity.

Section A: Answer all questions. Total 42 points – each question in this section carries 3.5 points. Write the responses to ALL questions in your answer sheet.

Paths with non-zero flow amounts from origin to destination are known, which is mix of violator and common public. As model under investigation need information about all paths and relative flows for each OD (origin-destination) pair of the network.

Step 1: Construct a network diagram for the project. (NOTE: EF for activity H should be 19)

Question #1 is worth 5 points – all others are worth 1 point each. Either type your answers directly onto THIS sheet OR create a new file and number your answers 1, 2, 3, etc.

Provide an output that shows the routing table for your node after each iteration. Add a second table with two columns. One that shows the destination from your node and the second column indicating the number of hops to reach that node.

To earn points, every 9 spaces has a tab. Inside that tab, you will find a question. If you get an easy question right, you earn 5 points. For a hard question that you get right, you earn 10 points and extra shelter. However, if you get the question wrong (easy or right) you will have to lose 10 points AND go back 5 spaces.

This command will collect all Ethernet frames passing through interface eth0 and display them as 8-byte lines in hexadecimal.

A path between two nodes is denoted as d (u, v) is a sequence of node pairs that connect these two nodes. A special characteristic of a path is that all nodes and all connections on a path are distinct. If nodes are not distinct, the sequence is called trail; and if either nodes or connections are distinct within the sequence, it is called a walk. The length of a path is the number of connections in the sequence. A path is an important property of a node pair because it defines if two nodes are reachable or not and at what distance. If a path between two nodes exists, than they are reachable and vice versa. The path property is important for the calculation of various SNA measures including geodesic distance, diameter or centrality

1. For each node calculate the distance between the node N and the S of origin i.e. DNS and the distance between node N and the destination D i.e. DND.