COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
a host
|
|
|
a network
|
|
|
a packet
|
|
|
none of the mentioned
|
Detailed explanation-1: -Link state routing is a method in which each router shares its neighbourhood’s knowledge with every other router in the internetwork. In this algorithm, each router in the network understands the network topology then makes a routing table depend on this topology.
Detailed explanation-2: -Examples of Link state routing protocols include OSPF-Open Shortest Path First and IS-IS-Intermediate System to Intermediate System. There are also routing protocols that are considered to be hybrid in the sense that they use aspects of both distance vector and link state protocols.
Detailed explanation-3: -After a topology change, a link state protocol will converge faster than a distance vector protocol. Therefore option 4 is correct.