Recent questions tagged routing

Recent questions tagged routing

0 votes

1 answer

1

punjab lect exam
.In which routing algorithm each router exchanges information about the entire network with neighbouring routers at regular intervals a) Link state Routing b) Distance vector C) Form state d) Dalagram link

Sanjay Sharma asked in Computer Networks 6 days ago

by Sanjay Sharma

42 views

0 votes

0 answers

2

Network Layer - Computer Networks - Tanenbaum
The question states - An IP datagram using Strict source routing option has to be fragmented. Do you think the option is copied into each fragment, or is it sufficient to just put it in the first fragment? Explain your answer. My thinking ... every fragment. I doubt this reasoning and don't see any flaws in my own answer. Where is my answer lacking?

atulcse asked in Computer Networks Sep 16

84 views

1 vote

1 answer

3

NIELIT 2017 DEC Scientific Assistant A - Section B: 32
Which NetWare protocol provides link - state routing ? $NLSP$ $RIP$ $SAP$ $NCP$

Lakshman Patel RJIT asked in Computer Networks Mar 31, 2020

by Lakshman Patel RJIT

600 views

4 votes

3 answers

4

GATE CSE 2020 | Question: 15
Consider the following statements about the functionality of an $\textsf{IP}$ based router. A router does not modify the $\textsf{IP}$ ... packet. Which of the above statements is/are TRUE? I and II only I only II and III only II only

Arjun asked in Computer Networks Feb 12, 2020

by Arjun

4.7k views

1 vote

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?

Gurdeep Saini asked in Computer Networks Jan 2, 2019

by Gurdeep Saini

760 views

1 vote

1 answer

6

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$

Ruturaj Mohanty asked in Computer Networks Dec 27, 2018

by Ruturaj Mohanty

779 views

0 votes

2 answers

7

Fragmentation of packet
Which of the following statements are True ?

Na462 asked in Computer Networks Dec 2, 2018

by Na462

705 views

1 vote

1 answer

8

Distance vector routing Algorithm
D.

Na462 asked in Computer Networks Dec 2, 2018

by Na462

1.8k views

0 votes

0 answers

9

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

CHïntän ÞäTël asked in Computer Networks Nov 26, 2018

by CHïntän ÞäTël

162 views

0 votes

0 answers

10

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.

John Doe asked in Computer Networks Nov 24, 2018

673 views

0 votes

0 answers

11

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 ?

Gurdeep Saini asked in Computer Networks Nov 9, 2018

by Gurdeep Saini

377 views

0 votes

2 answers

12

Self doubt
RIP and OSPF are which layer protocols ?

jatin khachane 1 asked in Computer Networks Oct 8, 2018

by jatin khachane 1

220 views

0 votes

1 answer

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

jatin khachane 1 asked in Computer Networks Oct 5, 2018

by jatin khachane 1

150 views

0 votes

0 answers

14

jatin khachane 1 asked in Computer Networks Sep 28, 2018

by jatin khachane 1

127 views

0 votes

0 answers

15

Sambhrant Maurya asked in Computer Networks Sep 23, 2018

by Sambhrant Maurya

173 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?

Parimal Paritosh asked in Computer Networks Jul 3, 2018

by Parimal Paritosh

438 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

bts asked in Computer Networks Jun 15, 2018

by bts

1k 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

shraddha priya asked in Computer Networks May 30, 2018

by shraddha priya

313 views

3 votes

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

Rishabh Gupta 2 asked in Computer Networks Jan 5, 2018

by Rishabh Gupta 2

1.5k 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

Kalpataru Bose asked in Computer Networks Dec 26, 2017

by Kalpataru Bose

989 views

0 votes

2 answers

21

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

nikkey123 asked in Computer Networks Nov 19, 2017

356 views

4 votes

3 answers

22

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

Na462 asked in Computer Networks Nov 12, 2017

by Na462

785 views

0 votes

1 answer

23

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)

mahalakshmi r asked in CBSE/UGC NET Nov 6, 2017

by mahalakshmi r

2.5k views

0 votes

0 answers

24

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

Shivi rao asked in Computer Networks Oct 25, 2017

239 views

2 votes

1 answer

25

general conceptual question
Can split horizon alone prevent count to infinity problem or we must use poison reverse with split horizon ?

♥_Less asked in Computer Networks Oct 8, 2017

320 views

3 votes

1 answer

26

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.

junaid ahmad asked in Computer Networks Oct 5, 2017

by junaid ahmad

223 views

2 votes

1 answer

27

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.

Shubhanshu asked in Computer Networks Aug 27, 2017

568 views

0 votes

1 answer

28

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

iarnav asked in Computer Networks May 3, 2017

by iarnav

329 views

Page:

1
2
3
next »

Follow @gateoverflow

GATE Overflow

Recent questions tagged routing

Search GATE Overflow