Dark Mode

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?

MonuKhan asked in Computer Networks Jan 19

133 views

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?

RamaSivaSubrahmanyam asked in Computer Networks Oct 27, 2022

by RamaSivaSubrahmanyam

113 views

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

Souvik33 asked in Computer Networks Oct 26, 2022

295 views

18 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 _______________.

Arjun asked in Computer Networks Feb 15, 2022

by Arjun

4.8k views

9 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$

Arjun asked in Computer Networks Feb 18, 2021

by Arjun

3.0k views

1 vote

4 answers

6

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

go_editor asked in Computer Networks Mar 24, 2020

975 views

1 vote

1 answer

7

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.

ajaysoni1924 asked in Computer Networks Mar 16, 2019

by ajaysoni1924

5.6k views

1 vote

0 answers

8

Made Easy CBT 19
What is optimal and Estimated Cost here, and why eliminate option A and C, why option B is correct.

Raja Rawal asked in Computer Networks Jan 15, 2019

325 views

0 votes

2 answers

9

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.

Jafar Sarif asked in Computer Networks Jan 10, 2019

572 views

0 votes

0 answers

10

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

amitqy asked in Computer Networks Dec 23, 2018

by amitqy

226 views

1 vote

1 answer

11

Distance vector routing Algorithm
D.

Na462 asked in Computer Networks Dec 2, 2018

by Na462

2.5k views

1 vote

1 answer

12

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.

John Doe asked in Computer Networks Nov 24, 2018

649 views

0 votes

0 answers

13

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.

John Doe asked in Computer Networks Nov 24, 2018

1.0k views

1 vote

0 answers

14

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 ?

Gurdeep Saini asked in Computer Networks Nov 9, 2018

by Gurdeep Saini

577 views

2 votes

2 answers

15

MadeEasy Test Series: Computer Networks - Distance Vector Routing

abhishek1995_cse asked in Computer Networks Oct 16, 2018

by abhishek1995_cse

972 views

0 votes

0 answers

16

Routing table size

Na462 asked in Computer Networks Sep 20, 2018

by Na462

159 views

0 votes

0 answers

17

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?

Parimal Paritosh asked in Computer Networks Jul 3, 2018

by Parimal Paritosh

687 views

0 votes

1 answer

18

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?

Jaydeep gupta 1 asked in Computer Networks May 21, 2018

by Jaydeep gupta 1

293 views

2 votes

3 answers

19

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

Kartavya Kothari asked in Computer Networks Apr 30, 2018

by Kartavya Kothari

1.4k views

0 votes

2 answers

20

ACE test_series
Is this question and solution both are wrong?

mehul vaidya asked in Computer Networks Mar 5, 2018

by mehul vaidya

603 views

4 votes

1 answer

21

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

Rishabh Gupta 2 asked in Computer Networks Jan 5, 2018

by Rishabh Gupta 2

2.3k views

1 vote

2 answers

22

[MadeEasy] the routing table of D in DVR Routing Algorithm / Tables
For a given network below, the routing tables of four nodes A, B, E and G are shown. Suppose that D has estimated its delay to its neighbors A, B, E and G as 3, 1, 1 and 1 msec respectively and updates its routing table using distance vector routing technique: the routing table of D is

techbrk3 asked in Computer Networks Jan 5, 2018

1.3k views

Page:

Recent questions tagged distance-vector-routing