Chapter 17 Flashcards
What are 2 ways to build routing table
1- Manual Entry
2- By software
What are 2 different methods of making routing table by software
1- Static routing
2- Dynamic routing
What happens in static routing
It builds the routing table on first boot. Routes are fixed in static routing. It is simple, low network overhead and inflexible.
What happens in dynamic routing
These routes are configurable. They can work around network failure automatically.
What is Dijkstra’s algorithm
It tells the shortest path in a network. We use weighted graph in it and sum the total of path for judgment. The shortest path will be whose weight will be lowest.
What is distributed route competition
In it, each packet switch calculates its own path by making its own routing table and send broadcast to all other packet switch periodically.
What is distance vector routing
Its an example of distributed route competition. In it every packet switch sends periodic update to next hop as like distributed route competition plus distance.
What is vector-distance algorithm
It is for find shortest possible route.
What is link-state routing or open shortest path first (OSPF) / SPF
It is same as distributed route competition with a difference that packet switch also maintains its link state information and keep broadcast it to others. And other maintain that information inside their tables. It is called link-state routing.
What is link state algorithm
It is complex and used in OSPF
What is RIP
Routing information protocol used in distance vector routing.
Does ARPANET converted into DARPANET
Yes, Defence Advanced research projects agency
What is first WAN
ARPANET in 1960
What is first early standard for connection-oriented network
X.25
Which WAN technology deliver blocks of data
Frame Relay
