|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
n |
Overview
|
|
|
|
– |
designed
for tree-structured Internet
|
|
|
|
– |
concerned
with reachability, not optimal routes
|
|
|
n |
Protocol
messages
|
|
|
|
– |
neighbor
acquisition: one router requests that another
|
|
|
be
its peer; peers exchange reachability information
|
|
|
|
– |
neighbor
reachability: one router periodically tests to
|
|
|
|
see
if the other router is still reachable; exchange
|
|
|
|
HELLO/ACK
messages; uses a k-out-of-n rule
|
|
|
|
– |
routing
updates: peers periodically exchange their
|
|
|
|
routing
tables (distance-vector)
|
|