Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
8 Cards in this Set
- Front
- Back
|
The first router that learns of a link-state topology change forwards the
|
information so that all other routers can use it for updates
|
|
|
Common routing information is sent to all routers in the internetwork. To achieve convergence,
|
each router learns about its neighbor routers
|
|
|
the name of each neighbor router, the interface status, and the cost of the link to the neighbor
|
are all learned to acheive convergence
|
|
|
router constructs an LSA packet that lists this information along with new neighbors, changes in link costs, and links that are no longer valid. The LSA packet is then
|
sent out so that all other routers receive it
|
|
|
When a router receives an LSA, it updates the routing table with the
|
most recent information
|
|
|
Accumulated data is used to create a map of the internetwork and the SPF algorithm is used to
|
to calculate the shortest path to other networks
|
|
|
Each time an LSA packet causes a change to the link-state database, SPF recalculates
|
the best paths and updates the routing table
|
|
|
The three main concerns related to link-state protocols are
|
Processor overhead
Memory requirements Bandwidth consumption |
