Save
Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account. Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
focusNode
Didn't know it?
click below
 
Knew it?
click below
Don't Know
Remaining cards (0)
Know
0:00
edit
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

NETW204 Ch 10

Link-State Routing Protocols

QuestionAnswer
Link-state Routing Protocol Routers exchange info about the reachability of other networks & the cost to reach them. They use Dijkstra's algorithm to calc shortest paths to a destination & update other routers with whom they are connected only when their routing tables change.
Shortest Path First (SPF) Algorithm Routing algorithm that iterates on the length of path to determine a shortest-path spanning tree. Commonly used in link-state routing algorithms. Sometimes called Dijkstra's algorithm.
Link-state Packet (LSP) Also known as link-state advertisement (LAS). Broadcast packets used by link-state protocols that contains info about neighbors and path costs. LSAs are used by the receiving routers to maintain their routing tables.
Link-state Database A table used in OSPF that is a representation of the topology of the autonomous system. It is the method by which routers "see" the state of the links in the autonomous system.
Which routing protocol is considered a link-state protocol? RIPv1, RIPv2, EIGRP, IS-IS, or BGP? IS-IS
List 3 mechanisms that are used by link-state routing protocols to build and maintain routing tables. Hello packets, Link-state Packets, & Shortest path first algorithm
Hardware intensive: distance vector routing protocol or link-state routing protocol? Link-state
Uses Bellman-Ford algorithm: distance vector routing protocol or link-state routing protocol? Distance vector
Fast convergence: distance vector routing protocol or link-state routing protocol? Link-state
Uses timed updates: distance vector routing protocol or link-state routing protocol? Distance vector
Builds complete topology: distance vector routing protocol or link-state routing protocol? Link-state
Referred to at times as "routing by rumor": distance vector routing protocol or link-state routing protocol? Distance vector
Uses Dijkstra's algorithm: distance vector routing protocol or link-state routing protocol? Link-state
What is one advantage of link-state protocols over most distance vector protocols? Faster convergence
Why do link-state protocols converge faster than most distance vector protocols? Distance vector protocols compute their routing tables before sending routing updates; link-state protocols do not.
What information is contained in LSPs sent by link-state routers to their neighbors? The state of directly connected links.
What is one disadvantage of link-state protocols over distance vector protocols? Higher processing requirements.
After two OSPF routers have exchanged Hello packets and formed an adjacency, what is the next thing to occur? They will start sending link-state packets to each other.
How does a router learn about a directly connected network? When the administrator assigns an IP address and subnet mask to the interface.
Why is a distance vector routing protocol like a road sign? Routers that use distance vector routing protocols only have info regarding distance (metric) of the network and which next-hop router (vector) to forward those packets to. These routers do not see the network beyond their directly connected neighbors.
Why is a link-state routing protocol like a road map? Routers using link-state routing protocols exchange link-state info. This allows the SPF algorithm to build and SPF tree or a topological map of the network. These routers can see the network beyond their directly connected neighbors.
What algorithm do link-state routing protocols use? Link-state routing protocols use the shortest path first (SPF) algorithms, which was developed by E.W. Dijkstra.
In link-state routing terminology, what is a link? A link is an interface on a router.
In link-state routing terminology, what is a link-state? A link state is the information regarding that link. This can include the router's IP address, the type of network, the cost of the link, and whether any neighboring routers are on that link.
In link-state routing terminology, what is a neighbor, and how are neighbors discovered? A neighbor is a router that shares a link, a directly connected network, with another router. Routers discover their neighbors by using the Hello packets of a specific routing protocol.
What does the link-state flooding process do? What is the end result of this process? Whenever a router receives an LSP from another neighbor, it immediately sends this LSP out all interfaces except for the interface from which it was received. The result is that all routers in the routing raea will receive this LSP.
Where are LSPs stored, and how are they used? Routers store LSPs in link-state databases, also known as topological databases. The SPF algorithm is run using these LSPs to create the SPF spanning tree and determine the shortest path to each network.
Created by: AZ4ME
Popular Computers sets

 

 



Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!
"Know" box contains:
Time elapsed:
Retries:
restart all cards