Computer Networks Answers

Section B (Design Works)

 Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network.

a. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.

  Iteration

0 1 2 3 4 5 6 7 8 9

Nodes

[6]

[6,3]

[6,3,2] [6,3,2,1] [6,3,2,1,4] [6,3,2,1,4,5] [6,3,2,1,4,5,7] [6,3,2,1,4,5,7,8] [6,3,2,1,4,5,7,8,9] [6,3,2,1,4,5,7,8,9,10]

R1 R2 R3 R4 R5 R7 R8 R9 R10

                 –...2/3

b. Build/Sketch the new Dijkstra Shortest Path Tree.

Preferred utilities, frameworks:

- laravel 8

- isc-dhcp-server

- bind9

- hostapd

- apache

- mysql

- expressjs

- tailwindcss

- ubuntu server

Sample scenarios:

1. Client 1 connect to Open WiFi in the public name “Affordable WiFi” using smart phone.

2. Then he open the browser, visit youtube and a captive portal appeared.

3. Captive portal shows some options like:

1. 1 USD = 15 minutes of internet access

2. 2 USD = 40 minutes of internet access

4. Client 1 tap the first option (1 USD = 15 minutes of internet access)

5. Admin 1 will receive the request and saw the option Client 1 chose

6. Admin 1 will wait for Client 1 to pay 1 USD

7. Once Admin 1 received 1 USD physically over the counter, Admin 1 will tap allow on his 

smart phone

8. Client 1 will try again to visit youtube and is successful in doing so

9. 15 minutes had passed and then Client 1 was redirected again to the captive portal

Tabulate a Distance Vector Routing Table with the following headings; Destination, Route, Least Cost and Next Hop using the table below.

Destination

Route

Least Cost

Next Hop

Customer 1

Customer 2

Customer 3

Customer 4

Customer 5

Customer 7

Customer 8

Customer 9

Customer 10

Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network.

a. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.

Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network.

a. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.

  Iteration

0 1 2 3 4 5 6 7 8 9

Nodes

[6]

[6,3]

[6,3,2] [6,3,2,1] [6,3,2,1,4] [6,3,2,1,4,5] [6,3,2,1,4,5,7] [6,3,2,1,4,5,7,8] [6,3,2,1,4,5,7,8,9] [6,3,2,1,4,5,7,8,9,10]

R1 R2 R3 R4 R5 R7 R8 R9 R10

Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network.

a. Tabulate the executed iteration for the Dijkstra Algorithm using the table below

As a network engineer , what would be your conclusion of what a least cost algorithm serves with regards to packet transmission ? Hint : Think about hops and paths

At what point are Signature - based Intrusion Detection Systems very ineffective ?

During COVID pandemic lock down , most structured business networks were able to support TCP based traffic services like remote desktop and other messaging services to accommodate telecommuting or working from home . Which ATM service categories supported those services traffic ?

The random waiting time before retransmission after a jamming signal in CSMA/CD is referred as