Title: Class Outline 24
Course: KVCC CPT128 > Section: Class Outlines

1.      Routing Algorithms

a.      Session Routing

b.      Routing & Forwarding

c.      Two classes

i.           Nonadaptive/Static Routing

ii.           Adaptive/Dynamic Routing

d.      Optimality Principle

i.           Sink Trees

e.      Shortest Path Algorithm

f.       Flooding

g.      Distance Vector Routing

h.      Count to Infinity Problem

i.        Link State Routing

i.           Learn neighbors

ii.           Set the distance or cost

iii.           Create a packet with this information

iv.           Distribute packet

v.           Determine shortest path to each router

Attached Files: | - KVCC CPT128_FundNetworkAdmin_Outline 24.pdf