Dark Mode

Recent questions tagged distance-vector-routing

6 votes

2 answers

1

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

by Arjun

2.2k views

7 votes

1 answer

2

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

2.2k views

1 vote

2 answers

3

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

615 views

1 vote

1 answer

4

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

3.3k views

1 vote

0 answers

5

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

289 views

0 votes

2 answers

6

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

499 views

0 votes

0 answers

7

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

161 views

1 vote

1 answer

8

Distance vector routing Algorithm
D.

Na462 asked in Computer Networks Dec 2, 2018

by Na462

2.3k views

1 vote

1 answer

9

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

556 views

0 votes

0 answers

10

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

886 views

1 vote

0 answers

11

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

505 views

2 votes

2 answers

12

MadeEasy Test Series: Computer Networks - Distance Vector Routing

abhishek1995_cse asked in Computer Networks Oct 16, 2018

by abhishek1995_cse

854 views

0 votes

0 answers

13

Routing table size

Na462 asked in Computer Networks Sep 20, 2018

by Na462

127 views

0 votes

0 answers

14

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

567 views

0 votes

1 answer

15

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

262 views

2 votes

3 answers

16

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.2k views

0 votes

2 answers

17

ACE test_series
Is this question and solution both are wrong?

mehul vaidya asked in Computer Networks Mar 5, 2018

by mehul vaidya

394 views

4 votes

1 answer

18

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.0k views

1 vote

2 answers

19

[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.0k views

4 votes

3 answers

20

Virtual Gate Test Series: Computer Networks - Distance Vector Routing Algorithm
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 ... $(C) B - 4, C - 5, D - 4, E - 5$ $(D)$ None

Na462 asked in Computer Networks Nov 12, 2017

by Na462

1.0k views

0 votes

0 answers

21

Distance Vector
This is a snapshot from tanenbaum. What i learned from highlighted text is:- " Suppose a node A has Neighbours B and C. B and C will share its Vector with A after a specific duration of time and suppose C's Vector reaches first to A cuz ... B's Routing vector specifies a field with less distance then what i already have(yea by calculating from my position)" Am i right?

Na462 asked in Computer Networks Nov 9, 2017

by Na462

213 views

2 votes

1 answer

22

general conceptual question
Can split horizon alone prevent count to infinity problem or we must use poison reverse with split horizon ?

♥_Less asked in Computer Networks Oct 8, 2017

567 views

2 votes

1 answer

23

split horizon
suppose C-D link is broken then what will be the vector of D instantaneously ??

Sunil8860 asked in Computer Networks Sep 17, 2017

358 views

2 votes

1 answer

24

Computer Networks: Split horizon with Poisson Reverse Frouzan
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. ... horizon. In the line saying: "Node B can still advertise the value for X......." till last line.

Shubhanshu asked in Computer Networks Aug 27, 2017

657 views

1 vote

1 answer

25

CN Network Layer DV,RIP
Distance Vector(DV) is an algorithm.Routing Information Protocol(RIP) is protocol which uses DV.What to we mean when we say DV protocol? Is DV protocol another name for RIP?

Jatin18 asked in Computer Networks Aug 20, 2017

321 views

3 votes

0 answers

26

CN: Distance Vector Routing
Consider the above network uses Distance vector routing with split horizon. Assume that all the routing tables are stabilized and after sometime link C->D is broken. Now what will be the entry in the routing table of D regarding C?Assume ... Intermediate node is a node to which the source is connected directly and using that node,the source reaches the destination.

rahul sharma 5 asked in Computer Networks Aug 17, 2017

by rahul sharma 5

792 views

Page:

Recent questions tagged distance-vector-routing