Recent questions tagged routing

0 votes

1 answer

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 in Computer Networks by Gurdeep Saini Loyal (9.5k points) | 70 views

0 votes

2 answers

2

Fragmentation of packet
Which of the following statements are True ?

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

0 votes

1 answer

3

Distance vector routing Algorithm
D.

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

0 votes

0 answers

4

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 (211 points) | 32 views

0 votes

0 answers

5

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 (5 points) | 76 views

0 votes

0 answers

6

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 Loyal (9.5k points) | 90 views

0 votes

2 answers

7

GATEBOOK-2019-CN2-1
Consider the network of shown below. 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, 4)$. The cost of the links from C to B, D, and E, ... out going lines are (A, B, -, D, E, B) $(11, 6, 0, 3, 5, 8)$ and the out going lines are (B, B, -, D, E, B)

asked Oct 28, 2018 in Computer Networks by GATEBOOK Boss (11.4k points) | 251 views

+1 vote

2 answers

8

GATEBOOK-2019-CN2-2
A datagram network allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either ... is the mean number of hops a packet makes per transmission? $p^2-3p+3$ $p^2+3$ $3p+3$ $p+3$

asked Oct 28, 2018 in Computer Networks by GATEBOOK Boss (11.4k points) | 230 views

0 votes

1 answer

9

GATEBOOK-2019-CN2-5
Suppose that host A is connected to a router R1, R1 is connected to another router R2, and R2 is connected to host B. Suppose that a TCP message that contains $900$ bytes of data and $20$ bytes of TCP header is passed to the IP code at host A for ... header. The sum of length field values of all packets which are received at B related to this message? $900$ $940$ $920$ $960$

asked Oct 28, 2018 in Computer Networks by GATEBOOK Boss (11.4k points) | 259 views

0 votes

1 answer

10

GATEBOOK-2019-CN2-10
A router has the following (CIDR) entries in its routing table: Address/mask Next hop $135.46.56.0/22$ Interface 0 $135.46.60.0/22$ Interface 1 $192.53.40.0/23$ Router 1 default Router 2 For each of the following IP addresses, the packets are routed ... 1, Router 2 Interface 1, Interface 0, Router 2, Router 1, Router 2 Interface 1, Interface 1, Interface 2, Router 1, Router 2

asked Oct 28, 2018 in Computer Networks by GATEBOOK Boss (11.4k points) | 175 views

+2 votes

1 answer

11

GATEBOOK-2019-CN2-20
An IP datagram has arrived with the following partial information in the header (in hexadecimal): $^{**}45000054 \: 00030000 \: 2006 \dots ^{**}$ How many more routers can the packet travel to? $32$ $64$ $0$ $5$

asked Oct 28, 2018 in Computer Networks by GATEBOOK Boss (11.4k points) | 280 views

0 votes

1 answer

12

Self doubt
RIP and OSPF are which layer protocols ?

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

0 votes

0 answers

13

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

0 votes

0 answers

14

Self doubt

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

0 votes

0 answers

15

Flooding

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

0 votes

0 answers

16

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 (213 points) | 126 views

+1 vote

1 answer

17

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 (119 points) | 246 views

0 votes

1 answer

18

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

+1 vote

1 answer

19

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

0 votes

1 answer

20

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 (349 points) | 148 views

0 votes

0 answers

21

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

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

0 votes

1 answer

22

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

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

+2 votes

2 answers

23

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

0 votes

1 answer

24

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

25

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 (523 points) | 135 views

+2 votes

1 answer

26

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 (933 points) | 146 views

+3 votes

1 answer

27

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.4k points) | 117 views

+2 votes

1 answer

28

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

0 votes

1 answer

29

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) | 175 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