Recent questions tagged routing

0 votes

2 answers

1

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?

asked Jan 2, 2019 in Computer Networks by Gurdeep Saini Boss (10.6k points) | 123 views

0 votes

1 answer

2

GO2019-FLT1-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$

asked Dec 27, 2018 in Computer Networks by Ruturaj Mohanty Active (2.7k points) | 225 views

0 votes

2 answers

3

Fragmentation of packet
Which of the following statements are True ?

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

0 votes

1 answer

4

Distance vector routing Algorithm
D.

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

0 votes

0 answers

5

self doubt
i understand that distance vector routing is adaptive but what about link state routing is it adaptive??

asked Nov 26, 2018 in Computer Networks by CHïntän ÞäTël (217 points) | 40 views

0 votes

0 answers

6

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) | 121 views

0 votes

0 answers

7

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) | 117 views

0 votes

1 answer

8

Self doubt
RIP and OSPF are which layer protocols ?

asked Oct 8, 2018 in Computer Networks by jatin khachane 1 Loyal (7.4k points) | 67 views

0 votes

0 answers

9

Self doubt
Routing Protocols RIP and OSPF are implemented At APPLICATION LAYER.(Correct me if I am wrong) But the work of routing - Creating table which decides upon optimum paths among available path. It is done at router right ? How this protocols works till Application layer

asked Oct 5, 2018 in Computer Networks by jatin khachane 1 Loyal (7.4k points) | 34 views

0 votes

0 answers

10

Self doubt

asked Sep 28, 2018 in Computer Networks by jatin khachane 1 Loyal (7.4k points) | 49 views

0 votes

0 answers

11

Flooding

asked Sep 23, 2018 in Computer Networks by Sambhrant Maurya Active (3.9k points) | 45 views

0 votes

0 answers

12

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 (235 points) | 156 views

+1 vote

1 answer

13

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, 2018 in Computer Networks by bts (129 points) | 310 views

0 votes

1 answer

14

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, 2018 in Computer Networks by shraddha priya Active (4k points) | 102 views

+1 vote

1 answer

15

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 (17.7k points) | 507 views

0 votes

1 answer

16

MadeEasy Test Series: Computer Networks - Routing
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 (413 points) | 177 views

0 votes

0 answers

17

MadeEasy Subject Test: Computer Networks - Routing
some one please explain the answer

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

0 votes

1 answer

18

MadeEasy Subject Test: Computer Networks - Routing
please explain the answer thnx.

asked Nov 19, 2017 in Computer Networks by nikkey123 Active (1.2k points) | 107 views

+2 votes

2 answers

19

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 (7k points) | 301 views

0 votes

1 answer

20

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 (67 points) | 1.3k views

0 votes

0 answers

21

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 (537 points) | 149 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 ?

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

+3 votes

1 answer

23

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 (8.6k points) | 132 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.

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

0 votes

1 answer

25

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

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

+2 votes

1 answer

26

DVRP and LINK STATE

asked Apr 26, 2017 in Computer Networks by student2018 Junior (947 points) | 352 views

0 votes

2 answers

27

Internetworking Routing
waht happens in internetworking routing somebody please tell please

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

0 votes

1 answer

28

distance vector routing table and least cost ?

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

+24 votes

5 answers

29

GATE2017-2-09
Consider the following statements about the routing protocols. Routing Information Protocol (RIP) and Open 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.1k points) | 4.1k views

+5 votes

1 answer

30

Packet Fragmentation on Routers [GateBook]

asked Jan 24, 2017 in Computer Networks by biranchi Active (1.3k points) | 346 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