Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged distance-vector-routing
0
votes
1
answer
1
Test series
Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram. All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its routing table initialized to contain ... in this case should i consider both of then or just one of them that is having less number of hops in between?
Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram.All the routers use the distance vector based routing alg...
MonuKhan
1.2k
views
MonuKhan
asked
Jan 19, 2023
Computer Networks
computer-networks
distance-vector-routing
test-series
+
–
0
votes
1
answer
2
Distance vector Routing
Asynchronous: It does not require that all of its nodes operate in the lock step with each other. What does this mean?
Asynchronous: It does not require that all of its nodes operate in the lock step with each other.What does this mean?
RamaSivaSubrahmanyam
419
views
RamaSivaSubrahmanyam
asked
Oct 27, 2022
Computer Networks
computer-networks
distance-vector-routing
+
–
0
votes
1
answer
3
Computer Networks (Routing Algorithm)
St.No. Routing Protocols Persistent looping Count to infinity problem I Distance vector routing protocol (DVRP) Yes Yes II Split horizon in DVR No Yes III Split horizon with poison reverse in DVR No No IV Link State Routing Protocol (LSRP) No No Which ... as Persistent looping and count to infinity are the same thing. Only IV II and IV All of I,II,III and IV
St.No.Routing ProtocolsPersistent loopingCount to infinity problemIDistance vector routing protocol (DVRP)YesYesIISplit horizon in DVRNoYesIIISplit horizon with poison re...
Souvik33
1.0k
views
Souvik33
asked
Oct 25, 2022
Computer Networks
computer-networks
routing
distance-vector-routing
link-state-routing
+
–
22
votes
2
answers
4
GATE CSE 2022 | Question: 47
Consider a network with three routers $\text{P, Q, R}$ shown in the figure below. All the links have cost of unity. The routers exchange distance vector routing information and have converged on the routing tables, after which the link $\text{Q-R}$ ... off to one decimal place) between $\text{P}$ and $\text{Q},$ leading to count-to-infinity problem, is _______________.
Consider a network with three routers $\text{P, Q, R}$ shown in the figure below. All the links have cost of unity.The routers exchange distance vector routing informatio...
Arjun
10.1k
views
Arjun
asked
Feb 15, 2022
Computer Networks
gatecse-2022
numerical-answers
computer-networks
routing
distance-vector-routing
2-marks
+
–
13
votes
1
answer
5
GATE CSE 2021 Set 2 | Question: 45
Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is shown below. The objective is to find the shortest-cost path from the router $R$ to routers $P$ and $Q$. Assume that $R$ does not initially ... a packet from $R$ to $P$ is $Y$ The next hop router for a packet from $R$ to $Q$ is $Z$
Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is shown below.The objective is to find ...
Arjun
5.2k
views
Arjun
asked
Feb 18, 2021
Computer Networks
gatecse-2021-set2
multiple-selects
computer-networks
distance-vector-routing
2-marks
+
–
0
votes
1
answer
6
UGC NET CSE | December 2007 | Part 2 | Question: 30
An example of an adaptive routing algorithm is : distance vector routing flooding selective flooding shortest path routing
An example of an adaptive routing algorithm is :distance vector routingfloodingselective floodingshortest path routing
go_editor
1.3k
views
go_editor
asked
Mar 28, 2020
Computer Networks
ugcnetcse-dec2007-paper2
algorithms
distance-vector-routing
+
–
1
votes
4
answers
7
UGC NET CSE | January 2017 | Part 2 | Question: 29
Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated __________. automatically by server by exchanging information with neighbour nodes with back up database
Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated __________.automaticallyby serverby ...
go_editor
1.9k
views
go_editor
asked
Mar 24, 2020
Computer Networks
ugcnetjan2017ii
computer-networks
distance-vector-routing
+
–
1
votes
1
answer
8
Andrew S. Tanenbaum Edition 5th Exercise 5 Question 6 (Page No. 490)
Consider the network of Figure. Distance vector routing is used, and the following vectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10); and from E: (7, 6, 3, 9, 0 ... , and E, are 6, 3, and 5, respectively. What is C's new routing table? Give both the outgoing line to use and the cost.
Consider the network of Figure. Distance vector routing is used, and the followingvectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12,6, 0...
ajaysoni1924
12.3k
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
tanenbaum
data-link-layer
distance-vector-routing
+
–
1
votes
0
answers
9
Made Easy CBT 19
What is optimal and Estimated Cost here, and why eliminate option A and C, why option B is correct.
What is optimal and Estimated Cost here, and why eliminate option A and C, why option B is correct.
Raja Rawal
426
views
Raja Rawal
asked
Jan 15, 2019
Computer Networks
cbt-2019
computer-networks
distance-vector-routing
+
–
0
votes
2
answers
10
What is difference between Flooding and Broadcasting ?
Distance vector uses broadcasting for transfer of vectors among it neighbors. but can it use flooding for this purpose. i am getting confused between flooding and broadcasting.
Distance vector uses broadcasting for transfer of vectors among it neighbors. but can it use flooding for this purpose. i am getting confused between flooding and broadca...
Jafar Sarif
829
views
Jafar Sarif
asked
Jan 10, 2019
Computer Networks
computer-networks
distance-vector-routing
+
–
0
votes
0
answers
11
Self doubt
Where can I get a question similar to this one asked in gate 2011? Where they ask what will happen to the routing table of a node(after some round of exchanges ) ,when a link goes down. If you have any pls share. https://gateoverflow.in/2160/gate2011-52
Where can I get a question similar to this one asked in gate 2011? Where they ask what will happen to the routing table of a node(after some round of exchanges ) ,when a ...
amitqy
345
views
amitqy
asked
Dec 23, 2018
Computer Networks
distance-vector-routing
computer-networks
+
–
1
votes
1
answer
12
Distance vector routing Algorithm
D.
D.
Na462
3.0k
views
Na462
asked
Dec 2, 2018
Computer Networks
computer-networks
distance-vector-routing
routing
+
–
1
votes
1
answer
13
Number of messages in DVRP
In distance vector, suppose we define a round as an interval during which each node exchanges with its neighbor its routing table information. Assume N number of nodes and E number of edges in the graph. How many messages are exchanged in a round as a ... ? Express it as a function of N, E and d. Also assume that the network topology does not change during the rounds.
In distance vector, suppose we define a round as an interval during which each node exchanges with its neighbor its routing table information. Assume N number of nodes an...
John Doe
1.0k
views
John Doe
asked
Nov 24, 2018
Computer Networks
computer-networks
distance-vector-routing
+
–
0
votes
0
answers
14
Distance vector routing protocol
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, ... minimum cost path to D? What will be the new value of the B-C link. Assume cost values are always >=1.
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 ...
John Doe
1.4k
views
John Doe
asked
Nov 24, 2018
Computer Networks
computer-networks
distance-vector-routing
routing
+
–
1
votes
1
answer
15
distance routing algorithm
statement : distance routing algorithm is adaptive algorithm which consider the load on the network whether the given statement is true or not ?
statement : distance routing algorithm is adaptive algorithm which consider the load on the networkwhether the given statement is true or not ?
Gurdeep Saini
888
views
Gurdeep Saini
asked
Nov 9, 2018
Computer Networks
computer-networks
distance-vector-routing
routing
+
–
2
votes
2
answers
16
MadeEasy Test Series: Computer Networks - Distance Vector Routing
abhishek1995_cse
1.4k
views
abhishek1995_cse
asked
Oct 16, 2018
Computer Networks
computer-networks
distance-vector-routing
made-easy-test-series
+
–
0
votes
0
answers
17
Routing table size
Na462
217
views
Na462
asked
Sep 20, 2018
Computer Networks
computer-networks
distance-vector-routing
+
–
0
votes
0
answers
18
Link State Routing
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?
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 algor...
Parimal Paritosh
1.0k
views
Parimal Paritosh
asked
Jul 2, 2018
Computer Networks
computer-networks
routing
link-state-routing
distance-vector-routing
+
–
0
votes
1
answer
19
Routing
Can distance vector routing implementation is possible with delay? usually, is it done by hop-count? also, Can link state routing implementation is possible with hop-count? usually, is it done by delay?
Can distance vector routing implementation is possible with delay?usually, is it done by hop-count?also, Can link state routing implementation is possible with hop-count?...
Jaydeep gupta 1
401
views
Jaydeep gupta 1
asked
May 21, 2018
Computer Networks
computer-networks
distance-vector-routing
link-state-routing
+
–
2
votes
3
answers
20
MadeEasy Test Series 2017: Computer Networks - Distance Vector Routing
Consider the following statements, when a distance vector routing protocol finding minimum cost paths suffers from count to infinity problem: S1 : The count-to-infinity problem may arise in distance vector routing protocol, when network gets disconnected. S2 : ... (A) Only S1 AND S3 (B) Only S2 AND S3 (C) Only S2 (D) All of them
Consider the following statements, when a distance vector routing protocol finding minimum cost paths suffers from count to infinity problem:S1 : The count-to-infinity pr...
Kartavya Kothari
1.8k
views
Kartavya Kothari
asked
Apr 30, 2018
Computer Networks
made-easy-test-series
computer-networks
distance-vector-routing
+
–
0
votes
2
answers
21
ACE test_series
Is this question and solution both are wrong?
Is this question and solution both are wrong?
mehul vaidya
1.1k
views
mehul vaidya
asked
Mar 5, 2018
Computer Networks
computer-networks
distance-vector-routing
+
–
4
votes
1
answer
22
Distance vector routing
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 ... up(without the network being disconnected). As shown in this stackoverflow answer: https://stackoverflow.com/a/13523982/6430403
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 tha...
Rishabh Gupta 2
2.7k
views
Rishabh Gupta 2
asked
Jan 5, 2018
Computer Networks
computer-networks
distance-vector-routing
count-to-infinity
routing
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
