CN Exam
CN Exam
11• Which port number does DHCP use for the server?
a) 67
b) 68
c) 69
d) 80
12• Which of the following is NOT a message type used
in DHCP?
a) DHCPDISCOVER
b) DHCPREQUEST
c) DHCPFORWARD
d) DHCPOFFER
Chapter-18
Chapter-20
Distance Vectors
• The concept of a distance vector is the rationale for the
name distance-vector routing.
• A least-cost tree is a combination of least-cost paths
from the root of the tree to all destinations.
• These paths are graphically glued together to form the
tree. Distance-vector routing unglues these paths and
creates a distance vector, a one-dimensional array to
represent the tree.
• Note that the name of the distance vector defines the
root, the indexes define the destinations, and the value
of each cell defines the least cost from the root to the
destination.
Link-State Routing
• Link-state (LS) routing uses the term link-state to define
the characteristic of a link (an edge) that represents a
network in the internet.
• In this algorithm the cost associated with an edge
defines the state of the link.
• Links with lower costs are preferred to links with higher
costs; if the cost of a link is infinity, it means that the link
does not exist or has been broken.
Chapter-21
Chapter-22