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;
21 Cards in this Set
- Front
- Back
|
Routing |
-The act of moving information from a source to destination, layer 3
-Determining optimal path to destination -Transporting packets across network |
|
|
Routing Algorithms |
Calculates optimal path effected by the following -Optimality -Simplicity -Robust -Convergence -Flexibility |
|
|
Optimality |
This is the capability and criteria in selecting the optimal path |
|
|
Simplicity |
These algorithms are overhead so they must not take up to many resources of the router |
|
|
Convergence |
This the process of agreement, by all routers, optimal paths. This process must occur quickly |
|
|
Flexibility |
They should be able to adapt quickly to changing circumstance |
|
|
Static Routing |
-These are mappings that the network engineer has manually coded into the routing device -These mappings do not change unless they are manually changed -Simple to design and work well where network design is simple |
|
|
Dynamic |
-Uses a routing table -Path changes and routing table updates are made automatically |
|
|
Single PathVs Multipath |
Does the routing protocol allow for multiple paths to destination |
|
|
Flat vs Hierarchical |
-In a flat environment all router are all peers -In hierarchical some routers form the backbone -Some routers can talk to all while other routers can only talk to their specific area |
|
|
Link State Vector |
-Routers send their own routing information to all routers within the network -Has faster convergence but use more resources of the router |
|
|
Path Length |
This calculates the cost associated with each link |
|
|
Reliability |
The dependability of a network link |
|
|
Routing Delay |
The amount it takes to more a packer from source to destination |
|
|
Bandwidth |
The traffic capacity of the link |
|
|
Load |
Determines how busy a router is |
|
|
Communication cost |
The cost in dollars for moving a packet across the line |
|
|
List the routing metrics that are used to determine optimal path |
Path Length Reliability Routing Delay Bandwidth load communication cost |
|
|
Route Poisoning |
once a link has failed a very large metric is used for that route |
|
|
Split horizon |
Routing information is never sent out the interface it was received on |
|
|
Hold Down Timer |
When learning that a route has failed, ignore any information about an alternative route to the subnet for a time equal to the hold down timer |
