Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged link-state-routing
2
votes
1
answer
1
GO Classes 2023 | IIITH Mock Test 1 | Question: 22
Consider the network given below with routers $\text{A, B, C, D}$ and $\text{E}.$ If the network follows link state routing algorithm to determine next hop for least cost path then which constraints on $x$ and $y$ guarantee traffic from $\text{B}$ to $\text{C}$ will always flow through node $\text{A}?$ $x>4$ $y+x<6$ $y+x<4$ $x<4$
Consider the network given below with routers $\text{A, B, C, D}$ and $\text{E}.$If the network follows link state routing algorithm to determine next hop for least cost ...
GO Classes
590
views
GO Classes
asked
Mar 26, 2023
Computer Networks
goclasses2023-iiith-mock-1
goclasses
computer-networks
link-state-routing
1-mark
+
–
1
votes
0
answers
2
GATE CSE 2023 | Memory Based Question: 47
Which of the following is incorrect in the case of OSPF protocol? OSPF uses the Dijkstra algorithm shortest path algorithm to implement the least cost path routing OSPF uses the Bellman-Ford algorithm to determine the shortest path. OSPF uses an inter-domain routing protocol OSPF employs hierarchical routing
Which of the following is incorrect in the case of OSPF protocol?OSPF uses the Dijkstra algorithm shortest path algorithm to implement the least cost path routingOSPF use...
GO Classes
1.4k
views
GO Classes
asked
Feb 5, 2023
Computer Networks
memorybased-gatecse2023
goclasses
computer-networks
link-state-routing
multiple-selects
+
–
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
900
views
Souvik33
asked
Oct 25, 2022
Computer Networks
computer-networks
routing
distance-vector-routing
link-state-routing
+
–
0
votes
3
answers
4
UGC NET CSE | January 2017 | Part 2 | Question: 30
In link state routing algorithm after construction of link state packets, new routes are computed using : DES algorithm Dijkstra's algorithm RSA algorithm Packets
In link state routing algorithm after construction of link state packets, new routes are computed using :DES algorithmDijkstra's algorithmRSA algorithmPackets
go_editor
2.3k
views
go_editor
asked
Mar 24, 2020
Computer Networks
ugcnetjan2017ii
computer-networks
link-state-routing
+
–
1
votes
3
answers
5
Link state routing
True / False ) LSR uses dijkstra algorithm ? ) LSR working is similar to dijkstra algorithm ? ) DVR uses bellman algorithm for finding the shortest distance to other routers/hops?
True / False) LSR uses dijkstra algorithm ?) LSR working is similar to dijkstra algorithm ?) DVR uses bellman algorithm for finding the shortest distance to other routers...
Gurdeep Saini
1.6k
views
Gurdeep Saini
asked
Jan 2, 2019
Computer Networks
computer-networks
routing
link-state-routing
+
–
1
votes
2
answers
6
LSP Packets
Which of the following is true about link state routing ? A) LSP Packets contains information of the network. B) LSP Packets are forwarded using flooding algorithm. C) Routers in the network converted into tree before forwarding LSP Packet. D) All ... but partially according to me as each LSP packet contains distances only not all network information such as topology etc. explain pls.
Which of the following is true about link state routing ?A) LSP Packets contains information of the network.B) LSP Packets are forwarded using flooding algorithm.C) Route...
Ashwani Yadav
2.9k
views
Ashwani Yadav
asked
Dec 31, 2018
Computer Networks
computer-networks
link-state-routing
+
–
1
votes
2
answers
7
GATE Overflow | Mock GATE | Test 1 | Question: 31
Let $N$ be the number of nodes and $M$ be the number of edges. For Link state routing how many message exchanges (roughly, explained as a function of the above parameters) need to be exchanged to build the topology at each and every node in the network? $\text{Min } (N+M, N*M)$ $\text{Max } (N+M, N*M)$ $N*M$ $N+M$
Let $N$ be the number of nodes and $M$ be the number of edges. For Link state routing how many message exchanges (roughly, explained as a function of the above parameters...
Ruturaj Mohanty
1.8k
views
Ruturaj Mohanty
asked
Dec 27, 2018
Computer Networks
go-mockgate-1
network-layer
routing
link-state-routing
computer-networks
+
–
1
votes
0
answers
8
ISI2016-PCB-CS-2
Consider sending a large file of $360,000$ bits from Host $A$ to Host $B,$ connected through a router, as shown in the below figure $2.$ Assume that there is no queuing and propagation delay, and the router has sufficient buffer space. Host ... transferring one byte involves $4$ operations: in-status, check-status, branch and read/write in memory, each requiring one machine cycle.
Consider sending a large file of $360,000$ bits from Host $A$ to Host $B,$ connected through a router, as shown in the below figure $2.$ Assume that there is no queuing a...
go_editor
539
views
go_editor
asked
Sep 18, 2018
Computer Networks
isi2016-pcb-cs
link-state-routing
dma
non-gate
descriptive
+
–
0
votes
0
answers
9
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
964
views
Parimal Paritosh
asked
Jul 2, 2018
Computer Networks
computer-networks
routing
link-state-routing
distance-vector-routing
+
–
0
votes
1
answer
10
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
376
views
Jaydeep gupta 1
asked
May 21, 2018
Computer Networks
computer-networks
distance-vector-routing
link-state-routing
+
–
0
votes
0
answers
11
Open Shortest Path First
Parshu gate
719
views
Parshu gate
asked
Nov 28, 2017
Computer Networks
shortest-path
link-state-routing
computer-networks
+
–
5
votes
4
answers
12
Interrupt
GATE -2009 A CPU generally handles an interrupt by executing an interrupt service routine As soon as an interrupt is raised. By checking the interrupt register at the end of fetch cycle. By checking the interrupt register after finishing the execution of the ... am having confusion between option A and C... For hardware interrupt option A is suitable and for software interrupt option C
GATE -2009 A CPU generally handles an interrupt by executing an interrupt service routineAs soon as an interrupt is raised.By checking the interrupt register at the end o...
#Rahul
2.7k
views
#Rahul
asked
Oct 25, 2017
CO and Architecture
co-and-architecture
interrupts
link-state-routing
+
–
1
votes
0
answers
13
Gateforum Correspondence Course ( Page# 148, Q# 8)
A problem that can arise when a link state algorithm is used in a network with link costs equal to load is the infinite reverse count to infinity the poisoned reverse oscillation The answer given is B, but how can a link state algorithm can have count to infinity problem ??
A problem that can arise when a link state algorithm is used in a network with link costs equal to load isthe infinite reversecount to infinitythe poisoned reverseoscilla...
Payal Rastogi
461
views
Payal Rastogi
asked
Jul 19, 2016
Computer Networks
computer-networks
link-state-routing
+
–
0
votes
0
answers
14
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
891
views
Archies09
asked
Jun 23, 2016
Computer Networks
link-state-routing
distance-vector-routing
peterson-davie
computer-networks
+
–
2
votes
4
answers
15
Link state routing
Why TTL field is Used in link state packet in link state routing?? please explain
Why TTL field is Used in link state packet in link state routing??please explain
indrajeet
2.6k
views
indrajeet
asked
Jun 15, 2016
Computer Networks
computer-networks
routing
link-state-routing
+
–
11
votes
3
answers
16
ISRO2007-26
If there are five routers and six networks in intranet using link state routing, how many routing tables are there? $1$ $5$ $6$ $11$
If there are five routers and six networks in intranet using link state routing, how many routing tables are there?$1$$5$$6$$11$
go_editor
7.3k
views
go_editor
asked
Jun 10, 2016
Computer Networks
isro2007
computer-networks
routing
link-state-routing
+
–
49
votes
5
answers
17
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.4k
views
go_editor
asked
Sep 26, 2014
Computer Networks
gatecse-2014-set1
computer-networks
routing
distance-vector-routing
link-state-routing
normal
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register