Recent questions tagged distance-vector-routing

0 votes

1 answer

1

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.

asked Mar 16, 2019 in Computer Networks by ajaysoni1924 Boss (10.9k points) | 68 views

0 votes

0 answers

2

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

asked Jan 15, 2019 in Computer Networks by Raja Rawal Junior (647 points) | 129 views

0 votes

1 answer

3

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.

asked Jan 10, 2019 in Computer Networks by Jafar Sarif Junior (579 points) | 82 views

0 votes

0 answers

4

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

asked Dec 23, 2018 in Computer Networks by amitqy Active (1.9k points) | 33 views

0 votes

1 answer

5

Distance vector routing Algorithm
D.

asked Dec 2, 2018 in Computer Networks by Na462 Loyal (7.1k points) | 419 views

0 votes

1 answer

6

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.

asked Nov 24, 2018 in Computer Networks by John Doe (11 points) | 86 views

0 votes

0 answers

7

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.

asked Nov 24, 2018 in Computer Networks by John Doe (11 points) | 132 views

0 votes

0 answers

8

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 ?

asked Nov 9, 2018 in Computer Networks by Gurdeep Saini Boss (10.6k points) | 119 views

0 votes

0 answers

9

MadeEasy Test Series: Computer Networks - Distance Vector Routing

asked Oct 16, 2018 in Computer Networks by abhishek1995_cse (111 points) | 110 views

0 votes

0 answers

10

Routing table size

asked Sep 20, 2018 in Computer Networks by Na462 Loyal (7.1k points) | 40 views

0 votes

0 answers

11

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?

asked Jul 3, 2018 in Computer Networks by Parimal Paritosh (243 points) | 165 views

0 votes

1 answer

12

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?

asked May 21, 2018 in Computer Networks by Jaydeep gupta 1 (65 points) | 71 views

0 votes

2 answers

13

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

asked Apr 30, 2018 in Computer Networks by Kartavya Kothari (125 points) | 255 views

+1 vote

1 answer

14

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

asked Jan 5, 2018 in Computer Networks by Rishabh Gupta 2 Boss (18k points) | 527 views

+1 vote

2 answers

15

[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

asked Jan 5, 2018 in Computer Networks by techbrk3 (409 points) | 253 views

+2 votes

2 answers

16

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

asked Nov 12, 2017 in Computer Networks by Na462 Loyal (7.1k points) | 310 views

0 votes

0 answers

17

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?

asked Nov 9, 2017 in Computer Networks by Na462 Loyal (7.1k points) | 62 views

0 votes

1 answer

18

ace test series

asked Oct 31, 2017 in Computer Networks by rohit vishkarma Active (1.1k points) | 121 views

+2 votes

1 answer

19

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

asked Oct 8, 2017 in Computer Networks by ♥_Less Junior (939 points) | 165 views

+1 vote

1 answer

20

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

asked Sep 17, 2017 in Computer Networks by Sunil8860 (-113 points) | 129 views

+2 votes

1 answer

21

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.

asked Aug 27, 2017 in Computer Networks by Shubhanshu Boss (18.3k points) | 323 views

+1 vote

1 answer

22

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?

asked Aug 20, 2017 in Computer Networks by Jatin18 (249 points) | 145 views

+3 votes

0 answers

23

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.

asked Aug 17, 2017 in Computer Networks by rahul sharma 5 Boss (25.6k points) | 294 views

0 votes

0 answers

24

distance vector routing
Suppose that forwarding table are all established then, What will be the table for A immediately after the link A-E goes down? Is it that the distance to all other nodes is marked infinite? If it not so, then how the table for node A finally gets stabilized?

asked May 23, 2017 in Computer Networks by prasoon raghav Junior (535 points) | 360 views

+1 vote

0 answers

25

Peterson and Davie
Suppose that forwarding tables are all established and then C-E link fails. Question : What update will be there in the C and E tables after failure and which tables information will be exchanged? what will be the table of A after C and E have reported the news?

asked May 13, 2017 in Computer Networks by prasoon raghav Junior (535 points) | 108 views

+2 votes

1 answer

26

CN:Routing Table using RIP Protocol

asked Apr 6, 2017 in Computer Networks by LavTheRawkstar Active (3.8k points) | 297 views

0 votes

1 answer

27

distance vector routing table and least cost ?

asked Apr 6, 2017 in Computer Networks by LavTheRawkstar Active (3.8k points) | 245 views

0 votes

1 answer

28

find least cost by drawing the distance vector routing table

asked Apr 5, 2017 in Computer Networks by LavTheRawkstar Active (3.8k points) | 183 views

0 votes

1 answer

29

distance vector routing query
Consider a network system having 4 routers P,Q,R AND S as shownbelow.initially, the routersise Distance vector routing and use number of hops as distance metric. Initially, link p-q was down and all other routers agree p is unreachable.thr ... "count to infinity" problem as all routers are sending the information at the same instant. How to solve this ques?

asked Feb 3, 2017 in Computer Networks by khushtak Loyal (7.1k points) | 377 views

0 votes

1 answer

30

Routing algorithm
Consider a router based on DV algorithm.Consider a five-node network given in figure. Assume all nodes building distance from that node to A.After initial setup suddenly either A goes down or link between A and B is cut.What are values at router B,C,D,E which they will find to distance A from that node after 3rd transmission ??

asked Dec 18, 2016 in Computer Networks by Prabhanjan_1 Boss (12.6k points) | 526 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged distance-vector-routing

Recent Posts

Recent Blog Comments