# Recent questions tagged routing 1 vote
1
Which NetWare protocol provides link - state routing ? $NLSP$ $RIP$ $SAP$ $NCP$
1 vote
2
True / False ) LSR uses dijkstra algorithm ? ) LSR working is similar to dijkstra algorithm ? ) DVR uses bellman algorithm for finding the shortest distance to other routers/hops?
3
Let $N$ be the number of nodes and $M$ be the number of edges. For Link state routing how many message exchanges (roughly, explained as a function of the above parameters) need to be exchanged to build the topology at each and every node in the network? $\text{Min } (N+M, N*M)$ $\text{Max } (N+M, N*M)$ $N*M$ $N+M$
4
Which of the following statements are True ?
5
D.
6
7
At the beginning each node knows only the distances to its immediate neighbors. In step 1, each node exchanges its routing table with all of its neighbors and all update their routing tables accordingly. In step 2, step 1 repeats. After step 2, at node A, what are the costs ... of a new minimum cost path to D? What will be the new value of the B-C link. Assume cost values are always >=1.
8
statement : distance routing algorithm is adaptive algorithm which consider the load on the network whether the given statement is true or not ?
9
RIP and OSPF are which layer protocols ?
10
Routing Protocols RIP and OSPF are implemented At APPLICATION LAYER.(Correct me if I am wrong) But the work of routing - Creating table which decides upon optimum paths among available path. It is done at router right ? How this protocols works till Application layer
11
12
13
Why do we use Dijkstra algorithm in Link State Routing Protocol? I understand that it is essential to compute the shortest path to every other node, but is Dijkstra algorithm run for each system in the graph and does each node have its own Shortest Path Tree?
1 vote
14
Consider the following routing table of a router. Consider the following three IP addresses. How are the packets with above three destination IP addresses are forwarded? (A) 1->D, 2->B, 3->B (B) 1->D, 2->B, 3->D (C) 1->B, 2->D, 3->D (D) 1->D, 2->D, 3->D
15
A router has $3$ interfaces on which $3$ IP addresses are configured. How many route entry would it have on it’s routing table. None Based on the number of networks configured $3$ directly connected networks None of the above
1 vote
16
Correct or Incorrect: The count to infinity problem may arise in a distance vector routing protocol even when the network never gets disconnected. The given answer says that this statement is incorrect. But I think the problem arises even when the weight of link goes up(without the network being disconnected). As shown in this stackoverflow answer: https://stackoverflow.com/a/13523982/6430403
17
Which of the following is TRUE ? S1: Non adaptive algorithms do not take into account the traffic and change in topology S2: Dynamic algorithm reflect their routing and decisions to reflect change in topology S3: link state and flooding are Non adaptive algorithms S4: Shortest path routing is adaptive routing
18
19
20
Consider a router is working based on the Distance Vector Routing Algorithm. Consider the five-node network of the following figure. Assume all nodes building distance from that node to $A$ (number of hops) and after initial set up, suddenly either $A$ goes down or the link between $A$ and $B$ is cut. What are the distance ... $(C) B - 4, C - 5, D - 4, E - 5$ $(D)$ None
21
74.Which of the following routing technique/ techniques is /are used in distributed systems? (a)Fixed Routing (b) Virtual Routing (c)Dynamic Routing Code: (a) only (a) and (b) only (c)only All (a),(b),(c)
22
Consider hierarchal routing with 4800 routers, they are divided in hierarchal as clusters, regions, routers. What is the minimum size of routing for three level hierarchal? 5,48,20 3,80,20 15,16,20 5,24,40
23
Can split horizon alone prevent count to infinity problem or we must use poison reverse with split horizon ?
24
In S4 it is given that Router forwards the packet to higher hop on the path to destination. I just want to know what do they mean by higher hop.AFAIK router always choose the best path for the forwarding packet which i think is the shortest path.
25
As soon as I have studied I got that count to infinity problem will not occur if A advertise its window first to B before B can. As a result B gets information that X is un reachable now, and system will be in stable state. Screen shot of above theory:- Now I also ... in understanding what is split horizon. In the line saying: "Node B can still advertise the value for X......." till last line.
26
what are the properties that routing protocol should satisfy?