PURIHIN, DANN KERVIN M.

BSIT401A

Series Path
Routes: R1 > R2 > R3 > R7 > R8 > 10
Hop Cost Route: 20 + 1 + 5 + 1 + 10 = 37 (UDP)
For me the fastest is the (UDP) the red mark is a broken line so the fastest way to determine
the short way from “R1”to the “R10”. It unsafe if you think but it can go the other way, but it
will take a long route.
PURIHIN, DANN KERVIN M. BSIT401A

Series Path

Routes: R1 > R2 > R7 > R8 > R10

Hop Cost Route: 20 + 30 + 1 + 10 = 61 (TCP)

The (TCP) is the safe way to go to” R10” from “R1”. the TCP is us to ensure
A safe way to carry a data to the finish path. This is the safe way to the “R10” because a red
mark is broken line that will avoid a path to go, so this is the best and safe way to the finish
path that using TCP.