Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged distance-vector-routing
1
votes
2
answers
31
[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
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 ...
techbrk3
1.8k
views
techbrk3
asked
Jan 5, 2018
Computer Networks
computer-networks
distance-vector-routing
network
+
–
4
votes
3
answers
32
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
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 fro...
Na462
1.5k
views
Na462
asked
Nov 11, 2017
Computer Networks
computer-networks
routing
distance-vector-routing
virtual-gate-test-series
+
–
0
votes
0
answers
33
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 ... ;s Routing vector specifies a field with less distance then what i already have(yea by calculating from my position)" Am i right?
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 specif...
Na462
436
views
Na462
asked
Nov 9, 2017
Computer Networks
computer-networks
distance-vector-routing
+
–
2
votes
1
answer
34
general conceptual question
Can split horizon alone prevent count to infinity problem or we must use poison reverse with split horizon ?
Can split horizon alone prevent count to infinity problem or we must use poison reverse with split horizon ?
♥_Less
832
views
♥_Less
asked
Oct 8, 2017
Computer Networks
distance-vector-routing
routing
split-horizon
count-to-infinity
+
–
2
votes
1
answer
35
split horizon
suppose C-D link is broken then what will be the vector of D instantaneously ??
suppose C-D link is broken then what will be the vector of D instantaneously ??
Sunil8860
613
views
Sunil8860
asked
Sep 16, 2017
Computer Networks
split-horizon
distance-vector-routing
+
–
2
votes
1
answer
36
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.
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 ...
Shubhanshu
824
views
Shubhanshu
asked
Aug 27, 2017
Computer Networks
computer-networks
routing
network
split-horizon
distance-vector-routing
+
–
1
votes
1
answer
37
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?
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 R...
Jatin18
448
views
Jatin18
asked
Aug 20, 2017
Computer Networks
computer-networks
distance-vector-routing
rip
+
–
3
votes
0
answers
38
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.
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 ...
rahul sharma 5
1.3k
views
rahul sharma 5
asked
Aug 17, 2017
Computer Networks
computer-networks
distance-vector-routing
count-to-infinity
+
–
0
votes
0
answers
39
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?
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 i...
prasoon raghav
1.0k
views
prasoon raghav
asked
May 22, 2017
Computer Networks
computer-networks
distance-vector-routing
+
–
1
votes
0
answers
40
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?
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 info...
prasoon raghav
483
views
prasoon raghav
asked
May 13, 2017
Computer Networks
peterson-davie
distance-vector-routing
+
–
7
votes
2
answers
41
ISRO2017-34
Match with the suitable one : ... $\text{A-3, B-4, C-1, D-2}$ $\text{A-3, B-1, C-4, D-2}$
Match with the suitable one :$\begin{array} {clcl} & \textbf{List-1} & & \textbf{List-2} \\ \text{(A)} & \text{Multicast group membership }& \text{1.} & \text{Distance V...
sh!va
4.4k
views
sh!va
asked
May 7, 2017
Computer Networks
isro2017
computer-networks
distance-vector-routing
+
–
2
votes
1
answer
42
CN:Routing Table using RIP Protocol
LavTheRawkstar
1.1k
views
LavTheRawkstar
asked
Apr 6, 2017
Computer Networks
computer-networks
network-layering
distance-vector-routing
rip
+
–
0
votes
1
answer
43
distance vector routing table and least cost ?
LavTheRawkstar
846
views
LavTheRawkstar
asked
Apr 6, 2017
Computer Networks
computer-networks
distance-vector-routing
routing
+
–
0
votes
1
answer
44
find least cost by drawing the distance vector routing table
LavTheRawkstar
1.4k
views
LavTheRawkstar
asked
Apr 5, 2017
Computer Networks
computer-networks
distance-vector-routing
+
–
2
votes
1
answer
45
Test by Bikram | Mock GATE | Test 3 | Question: 40
Consider the subnet given in the below diagram. Here, distance vector routing algorithm is used. The following vectors have just come in to router $C$: from $B$: $\left ( 3, 0, 6, 5, 3, 8, 3 \right )$; from $D$: $\left ( 1,5, 3, 0, 8, 6, 3 \right )$ ... $\left (5, 4, 0, 3, 5, 6, 6\right )$ $\left (4, 2, 0, 2, 1, 5, 5\right )$
Consider the subnet given in the below diagram. Here, distance vector routing algorithm is used.The following vectors have just come in to router $C$:from $B$: $\left ( 3...
Bikram
835
views
Bikram
asked
Feb 9, 2017
GATE
tbb-mockgate-3
computer-networks
network-layer
routing
distance-vector-routing
+
–
1
votes
2
answers
46
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?
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...
khushtak
1.8k
views
khushtak
asked
Feb 3, 2017
Computer Networks
computer-networks
distance-vector-routing
count-to-infinity
+
–
0
votes
1
answer
47
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 ??
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 e...
Prabhanjan_1
1.2k
views
Prabhanjan_1
asked
Dec 18, 2016
Computer Networks
computer-networks
distance-vector-routing
+
–
4
votes
1
answer
48
MadeEasyTestSeries:CN-Distance Vector Routing
KISHALAY DAS
1.4k
views
KISHALAY DAS
asked
Dec 15, 2016
Computer Networks
computer-networks
distance-vector-routing
+
–
1
votes
1
answer
49
Gateforum Correspondence Course ( Page# 149, Q# 5)
If delays are recorded as 8-bit numbers in a 50-router network, and delay vectors are exchanged twice a second, how much bandwidth per (full-duplex) line is chewed up by the distributed routing algorithm? Assume that each router has three lines to other routers 400 bps 800 bps 1200 bps None of these
If delays are recorded as 8-bit numbers in a 50-router network, and delay vectors are exchanged twice a second, how much bandwidth per (full-duplex) line is chewed up by ...
Payal Rastogi
486
views
Payal Rastogi
asked
Jul 19, 2016
Computer Networks
computer-networks
distance-vector-routing
+
–
0
votes
0
answers
50
Peterson Davie Q.15,17
Graph links are given as A-C=3,A-D=8,B-E=2,C-F=6,C-E=1,D-E=2 (A)Give global distance vector table (B)Routing table at node D by Link State algorithm (C) Suppose the forwarding tables are all established as in (A) and then the C–E ... have reported the news. (ii) The tables of A and D after their next mutual exchange. (iii) The table of C after A exchanges with it.
Graph links are given as A-C=3,A-D=8,B-E=2,C-F=6,C-E=1,D-E=2 (A)Give global distance vector table (B)Routing table at node D by Link State algorithm (C) Suppose the forwa...
Archies09
931
views
Archies09
asked
Jun 23, 2016
Computer Networks
link-state-routing
distance-vector-routing
peterson-davie
computer-networks
+
–
0
votes
0
answers
51
Question on the effects of alteration in the cost of link onto the routing tables.
I have a little confusion about some concepts in Distance Vector Routing. Please help. Is it correct to say the following, with regard to Distance Vector routing: 1. Any finite change to the cost of a link will be ... in the next round of exchange, will contain the new values due to the change in cost of the link.
I have a little confusion about some concepts in Distance Vector Routing. Please help. Is it correct to say the following, with regard to Distance Vector routing:1. Any f...
rickeshjohn
530
views
rickeshjohn
asked
Jun 8, 2016
Computer Networks
computer-networks
distance-vector-routing
+
–
40
votes
8
answers
52
GATE CSE 2010 | Question: 55
Consider a network with $6$ routers $R1$ to $R6$ connected with links having weights as shown in the following diagram. Suppose the weights of all unused links are changed to $2$ and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused? $0$ $1$ $2$ $3$
Consider a network with $6$ routers $R1$ to $R6$ connected with links having weights as shown in the following diagram.Suppose the weights of all unused links are changed...
go_editor
13.1k
views
go_editor
asked
Apr 21, 2016
Computer Networks
gatecse-2010
computer-networks
routing
distance-vector-routing
normal
+
–
57
votes
6
answers
53
GATE CSE 2011 | Question: 53
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ ... the NEXT ROUND of update, what will be the cost to $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$
Consider a network with five nodes, $N1$ to $N5$, as shown as below.The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distanc...
go_editor
23.8k
views
go_editor
asked
Apr 21, 2016
Computer Networks
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
+
–
4
votes
2
answers
54
Distance vector
In distance vector routing how the distance vectors are update when two paths have same cost eg. Initial Distance vector of A B C D are A- [0 ∞ 1 2] B- [∞ 0 3 2] C- [1 3 0 ∞] D- [2 2 ∞ 0] what will be distance vector of A after 1 iteration. Please mention via node and why u choose that node??
In distance vector routing how the distance vectors are update when two paths have same costeg. Initial Distance vector of A B C D areA- [0 ∞ 1 2]B- [∞ 0 3...
Abhishekcs10
1.2k
views
Abhishekcs10
asked
Jan 16, 2016
Computer Networks
computer-networks
distance-vector-routing
+
–
0
votes
1
answer
55
Distance vector routing
prathams
1.8k
views
prathams
asked
Jan 4, 2016
Computer Networks
computer-networks
distance-vector-routing
+
–
15
votes
3
answers
56
GATE IT 2005 | Question: 29
Count to infinity is a problem associated with: link state routing protocol. distance vector routing protocol DNS while resolving host name TCP for congestion control
Count to infinity is a problem associated with:link state routing protocol.distance vector routing protocolDNS while resolving host nameTCP for congestion control
Ishrat Jahan
6.0k
views
Ishrat Jahan
asked
Nov 3, 2014
Computer Networks
gateit-2005
computer-networks
routing
distance-vector-routing
normal
+
–
41
votes
4
answers
57
GATE IT 2007 | Question: 60
For the network given in the figure below, the routing tables of the four nodes $A$, $E$, $D$ and $G$ are shown. Suppose that $F$ has estimated its delay to its neighbors, $A$, $E$, $D$ and $G$ as $8$, $10$, $12$ and $6$ msecs respectively and updates its ...
For the network given in the figure below, the routing tables of the four nodes $A$, $E$, $D$ and $G$ are shown. Suppose that $F$ has estimated its delay to its neighbors...
Ishrat Jahan
9.4k
views
Ishrat Jahan
asked
Oct 30, 2014
Computer Networks
gateit-2007
computer-networks
distance-vector-routing
normal
+
–
61
votes
7
answers
58
GATE CSE 2010 | Question: 54
Consider a network with $6$ routers $\textbf{R1}$ to $\textbf{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 ... stabilize, how many links in the network will never be used for carrying any data? $4$ $3$ $2$ $1$
Consider a network with $6$ routers $\textbf{R1}$ to $\textbf{R6}$ connected with links having weights as shown in the following diagram.All the routers use the distance ...
go_editor
23.8k
views
go_editor
asked
Sep 30, 2014
Computer Networks
gatecse-2010
computer-networks
routing
distance-vector-routing
normal
+
–
48
votes
4
answers
59
GATE CSE 2011 | Question: 52
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ N3: $(7, 6, 0, 2, 6)$ ... $N3$? $(3, 2, 0, 2, 5)$ $(3, 2, 0, 2, 6)$ $(7, 2, 0, 2, 5)$ $(7, 2, 0, 2, 6)$
Consider a network with five nodes, $N1$ to $N5$, as shown as below.The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distanc...
go_editor
23.9k
views
go_editor
asked
Sep 29, 2014
Computer Networks
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
+
–
49
votes
5
answers
60
GATE CSE 2014 Set 1 | Question: 23
Consider the following three statements about link state and distance vector routing protocols, for a large network with $500$ network nodes and $4000$ links. [S1]: The computational overhead in link state protocols is higher than in distance vector protocols. [S2]: A distance ... $S2$ are true, but $S3$ is false. $S1$ and $S3$ are true, but $S2$ is false.
Consider the following three statements about link state and distance vector routing protocols, for a large network with $500$ network nodes and $4000$ links. [S1]: The c...
go_editor
15.7k
views
go_editor
asked
Sep 26, 2014
Computer Networks
gatecse-2014-set1
computer-networks
routing
distance-vector-routing
link-state-routing
normal
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register