Recent questions tagged routing

0 votes

0 answers

1

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 in Computer Networks by Parimal Paritosh (213 points) | 48 views

0 votes

1 answer

2

Forwarding by router
Consider the following routing table of a router. Consider the following three IP addresses. How are the packets with above three destination IP addresses are forwarded? (A) 1->D, 2->B, 3->B (B) 1->D, 2->B, 3->D (C) 1->B, 2->D, 3->D (D) 1->D, 2->D, 3->D

asked Jun 15 in Computer Networks by bts (137 points) | 67 views

0 votes

1 answer

3

Routing
A router has $3$ interfaces on which $3$ IP addresses are configured. How many route entry would it have on it’s routing table. None Based on the number of networks configured $3$ directly connected networks None of the above

asked May 30 in Computer Networks by shraddha priya Active (3.1k points) | 51 views

+1 vote

0 answers

4

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 in Computer Networks by Rishabh Gupta 2 Boss (14.4k points) | 181 views

0 votes

1 answer

5

test series
Which of the following is TRUE ? S1: Non adaptive algorithms do not take into account the traffic and change in topology S2: Dynamic algorithm reflect their routing and decisions to reflect change in topology S3: link state and flooding are Non adaptive algorithms S4: Shortest path routing is adaptive routing

asked Dec 26, 2017 in Computer Networks by Kalpataru Bose (367 points) | 88 views

0 votes

0 answers

6

made easy
some one please explain the answer

asked Nov 20, 2017 in Computer Networks by nikkey123 Active (1.5k points) | 106 views

+1 vote

1 answer

7

Virtual Gate
Consider a router is working based on Distance Vector Routing Algorithm. Consider the five-node network of 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 or the link between A and B is cut. What are the distance values at ... 5, C - 4, D - 5, E - 4 (C) B - 4, C - 5, D - 4, E - 5 (D) None

asked Nov 12, 2017 in Computer Networks by Na462 Active (4.5k points) | 104 views

0 votes

1 answer

8

UGC NET-PaperIII Nov2017(74)
74.Which of the following routing technique/ techniques is /are used in distributed systems? (a)Fixed Routing (b) Virtual Routing (c)Dynamic Routing Code: (a) only (a) and (b) only (c)only All (a),(b),(c)

asked Nov 6, 2017 in CBSE/UGC NET by mahalakshmi r (95 points) | 977 views

0 votes

0 answers

9

Routing
Consider hierarchal routing with 4800 routers, they are divided in hierarchal as clusters, regions, routers. What is the minimum size of routing for three level hierarchal? 5,48,20 3,80,20 15,16,20 5,24,40

asked Oct 25, 2017 in Computer Networks by Shivi rao Junior (785 points) | 100 views

+2 votes

1 answer

10

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 Active (1k points) | 110 views

+3 votes

1 answer

11

ROUTER
In S4 it is given that Router forwards the packet to higher hop on the path to destination. I just want to know what do they mean by higher hop.AFAIK router always choose the best path for the forwarding packet which i think is the shortest path.

asked Oct 5, 2017 in Computer Networks by junaid ahmad Loyal (9k points) | 88 views

+2 votes

1 answer

12

Computer Networks: Split horizon with Poisson Reverse Frouzan

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

0 votes

1 answer

13

CN by Andrew S. Tanenbaum
what are the properties that routing protocol should satisfy?

asked May 3, 2017 in Computer Networks by iarnav Loyal (7.9k points) | 148 views

+2 votes

1 answer

14

DVRP and LINK STATE

asked Apr 26, 2017 in Computer Networks by student2018 Active (1.1k points) | 231 views

0 votes

2 answers

15

Internetworking Routing
waht happens in internetworking routing somebody please tell please

asked Apr 9, 2017 in Computer Networks by LavTheRawkstar Active (5.1k points) | 870 views

0 votes

1 answer

16

distance vector routing table and least cost ?

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

+15 votes

4 answers

17

GATE2017-2-09
Consider the following statements about the routing protocols. Routing Information Protocol (RIP) and Oprn Shortest Path First (OSPF) in an IPv4 network. RIP uses distance vector routing RIP packets are sent using UDP OSPF packets are sent using TCP OSPF operation is based on link-state ... statements are CORRECT? I and IV only I, II and III only I, II and IV only II, III and IV only

asked Feb 14, 2017 in Computer Networks by khushtak Loyal (7.6k points) | 2.6k views

+5 votes

1 answer

18

Packet Fragmentation on Routers [GateBook]

asked Jan 24, 2017 in Computer Networks by biranchi Active (1.5k points) | 291 views

+2 votes

2 answers

19

MADE EASY
When a strict routing has been specified by the source but can’t be followed by the intermediate routers, such events will be reported by ICMP???

asked Jan 10, 2017 in Computer Networks by yankur9 Active (2.2k points) | 215 views

+5 votes

2 answers

20

split horizon
Assume that network shown in below diagram uses distance vector routing with forwarding tables at each node. If each node periodically announces their vectors to the neighbour using the split-horizon strategy, what is the distance vector routing advertised from A to B after stabilization?

asked Jan 3, 2017 in Computer Networks by Debashish Deka Veteran (56.9k points) | 411 views

0 votes

1 answer

21

NW-Router-Packet Forwarding

asked Dec 10, 2016 in Computer Networks by KISHALAY DAS Loyal (6.5k points) | 124 views

+3 votes

3 answers

22

UGCNET-June2012-II-41
What is the routing algorithm used by RIP and IGRP? OSPF Link-state Dynamic Dijikstra vector

asked Jul 5, 2016 in Computer Networks by jothee Veteran (99.8k points) | 1k views

+3 votes

3 answers

23

UGCNET-June2012-II-17
In which routing method do all the routers have a common database? Distance vector Link state Link vector Dijikstra method

asked Jul 5, 2016 in Computer Networks by jothee Veteran (99.8k points) | 953 views

+5 votes

4 answers

24

ISRO2016-68
Dynamic routing protocol enable routers to Dynamically discover and maintain routes Distribute routing updates to other routers Reach agreement with other routers about the network topology All of the above

asked Jul 4, 2016 in Computer Networks by Desert_Warrior Loyal (8.6k points) | 1.9k views

+4 votes

5 answers

25

ISRO2014-16
What is routing algorithm used by OSPF routing protocol? Distance vector Flooding Path vector Link state

asked Jun 24, 2016 in Computer Networks by Anuanu (343 points) | 1.8k views

+1 vote

4 answers

26

Link state routing
Why TTL field is Used in link state packet in link state routing?? please explain

asked Jun 16, 2016 in Computer Networks by indrajeet Active (2k points) | 476 views

+8 votes

3 answers

27

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

asked Jun 10, 2016 in Computer Networks by jothee Veteran (99.8k points) | 2.1k views

+3 votes

1 answer

28

UGCNET-Dec2015-III-12
Consider a subnet with 720 routers. If a three level hierarchy is choosen with 8 clusters, each containing9 regions of 10 routers, then total number of entries in the routing table is_______ 25 27 53 72

asked Jun 5, 2016 in Computer Networks by Alok12 (117 points) | 2k views

+1 vote

0 answers

29

ISI2014-CS-6b
In a LAN, $n^2$ routers are connected in an $n \times n$ mesh such that $R(i, j)$ represents a router in the $i$-th row and $j$-th column of the mesh. Find how many distinct shortest paths exist between two routers $R(i_1, j_1)$ and $R( ... many of these distinct shortest paths will be node disjoint, i.e., with no common node except the source and the destination? Justify your answer.

asked May 31, 2016 in Computer Networks by jothee Veteran (99.8k points) | 143 views

+24 votes

4 answers

30

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

asked Apr 21, 2016 in Computer Networks by jothee Veteran (99.8k points) | 2.2k 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 routing

Materials:

Recent Posts

Recent Blog Comments