Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

You must provide explanations explaining your work. QUESTION 1 (a) Figure 3 shows a network address design using classful and classless (CIDR) addressing scheme for

You must provide explanations explaining your work.

image text in transcribed

QUESTION 1 (a) Figure 3 shows a network address design using classful and classless (CIDR) addressing scheme for an organization. Answer the following. 10.5.2.0/24 LA 10.5.0.0/24 Fa0/1 10.3.1.0/24 Fa0/0 Fa0/0 SO/0/0 SO/0/0 R2 192.168.1.0/30 Fa 1/1 R1 Fa1/0 10.5.3.0/24 10.5.1.0/24 i) List THREE (3) subnet addresses that implement classful addressing scheme. What class does this address is categorized? [2 marks] ii) State one subnet address that uses CIDR. What is the subnet mask value? [2 marks] iii) An ISP assigns a host in a subnet the address 10.3.1.100/24. Suppose this subnet only has 200 hosts. Calculate: [4 marks] the subnet mask (dotted decimal) the subnet address the number of addresses still unused (b) Figure 4 shows the four-step process involved in the DHCP client-server interaction when a newly arrived host acquires network setting from DHCP server. Give the four steps in the CORRECT ORDER. [2 marks] Client DHCP Server i) ii) iii) iv) Figure 4: DHCP client-server interaction. (c) Consider a network topology as in Figure 5. Answer the following questions. D 13 B 25 A & F & N E 34 Figure 5: Routers and link cost value 1) Reproduce Table 1 in your answer booklet to show the operation of Dijkstra's algorithm in computing least cost path from A to F. [7 marks] Table 1: Least cost path Step N 0 A D(B), p(B) 5, A D, p 8, A D(D), p(D) D(E), p(E) 13, A D(F), p(F) 34, A ii) Assume Table 2 is the result of an operation of Dijkstra's on Figure 6. Construct forwarding table for node E. Determine least cost paths from node E to A. [5 marks] Table 2: Least cost path D(A), p(A) Da, pa D(F), p(F) 2, E 00 00 D(D), p(D) 3, E 3, E 00 N' E EF EFD EFDC EFDCB EFDCBA D(B), p(B) 10, E 5, F 5, F 5, F 5, D 7, D 7, D 7, D 3 B 3 10 2 A E F 2 4 D Figure 6: Routers and link cost value QUESTION 1 (a) Figure 3 shows a network address design using classful and classless (CIDR) addressing scheme for an organization. Answer the following. 10.5.2.0/24 LA 10.5.0.0/24 Fa0/1 10.3.1.0/24 Fa0/0 Fa0/0 SO/0/0 SO/0/0 R2 192.168.1.0/30 Fa 1/1 R1 Fa1/0 10.5.3.0/24 10.5.1.0/24 i) List THREE (3) subnet addresses that implement classful addressing scheme. What class does this address is categorized? [2 marks] ii) State one subnet address that uses CIDR. What is the subnet mask value? [2 marks] iii) An ISP assigns a host in a subnet the address 10.3.1.100/24. Suppose this subnet only has 200 hosts. Calculate: [4 marks] the subnet mask (dotted decimal) the subnet address the number of addresses still unused (b) Figure 4 shows the four-step process involved in the DHCP client-server interaction when a newly arrived host acquires network setting from DHCP server. Give the four steps in the CORRECT ORDER. [2 marks] Client DHCP Server i) ii) iii) iv) Figure 4: DHCP client-server interaction. (c) Consider a network topology as in Figure 5. Answer the following questions. D 13 B 25 A & F & N E 34 Figure 5: Routers and link cost value 1) Reproduce Table 1 in your answer booklet to show the operation of Dijkstra's algorithm in computing least cost path from A to F. [7 marks] Table 1: Least cost path Step N 0 A D(B), p(B) 5, A D, p 8, A D(D), p(D) D(E), p(E) 13, A D(F), p(F) 34, A ii) Assume Table 2 is the result of an operation of Dijkstra's on Figure 6. Construct forwarding table for node E. Determine least cost paths from node E to A. [5 marks] Table 2: Least cost path D(A), p(A) Da, pa D(F), p(F) 2, E 00 00 D(D), p(D) 3, E 3, E 00 N' E EF EFD EFDC EFDCB EFDCBA D(B), p(B) 10, E 5, F 5, F 5, F 5, D 7, D 7, D 7, D 3 B 3 10 2 A E F 2 4 D Figure 6: Routers and link cost value

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Inductive Databases And Constraint Based Data Mining

Authors: Saso Dzeroski ,Bart Goethals ,Pance Panov

2010th Edition

1489982175, 978-1489982179

More Books

Students also viewed these Databases questions

Question

Find I and Vab in the circuit of Fig. 2.79?

Answered: 1 week ago

Question

Define Management or What is Management?

Answered: 1 week ago

Question

What do you understand by MBO?

Answered: 1 week ago

Question

=+ What are the information and consultation requirements?

Answered: 1 week ago

Question

=+ Should the MNE belong (why, why not)?

Answered: 1 week ago