menu
search
Log In

GO Book for GATECSE 2022GATE Overflow Book for GATE CSE 2022

Quick search syntax
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

Subjects


GATE Overflow
Recent questions tagged routing

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Materials:

Recent questions tagged routing

3 votes
3 answers
2
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
Consider the following statements about the functionality of an $\textsf{IP}$ based router. A router does not modify the $\textsf{IP}$ packets during forwarding. It is not necessary for a router to implement any routing protocol. A router should reassemble $\textsf{IP}$ fragments if the ... $\text{IP}$ packet. Which of the above statements is/are TRUE? I and II only I only II and III only II only
asked Feb 12, 2020 in Computer Networks Arjun 3.9k views
1 vote
3 answers
3
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/hops?
asked Jan 2, 2019 in Computer Networks Gurdeep Saini 567 views
1 vote
1 answer
4
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$
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 Ruturaj Mohanty 659 views
0 votes
2 answers
5
Fragmentation of packet
Which of the following statements are True ?
Which of the following statements are True ?
asked Dec 2, 2018 in Computer Networks Na462 578 views
0 votes
0 answers
7
self doubt
i understand that distance vector routing is adaptive but what about link state routing is it adaptive??
i understand that distance vector routing is adaptive but what about link state routing is it adaptive??
asked Nov 26, 2018 in Computer Networks CHïntän ÞäTël 115 views
0 votes
0 answers
8
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.
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, what are the costs ... of a new 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 John Doe 510 views
0 votes
0 answers
9
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 ?
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 Gurdeep Saini 304 views
0 votes
1 answer
10
Self doubt
RIP and OSPF are which layer protocols ?
RIP and OSPF are which layer protocols ?
asked Oct 8, 2018 in Computer Networks jatin khachane 1 136 views
0 votes
1 answer
11
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
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 jatin khachane 1 99 views
0 votes
0 answers
12
Self doubt
asked Sep 28, 2018 in Computer Networks jatin khachane 1 101 views
0 votes
0 answers
13
Flooding
asked Sep 23, 2018 in Computer Networks Sambhrant Maurya 131 views
0 votes
0 answers
14
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 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 Parimal Paritosh 369 views
1 vote
1 answer
15
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
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 bts 845 views
0 votes
1 answer
16
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
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 shraddha priya 269 views
3 votes
1 answer
17
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
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 the weight of link goes 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 Rishabh Gupta 2 1.2k views
0 votes
1 answer
18
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
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 Kalpataru Bose 744 views
4 votes
3 answers
20
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
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 or the link between $A$ and $B$ is cut. What are the distance ... $(C) B - 4, C - 5, D - 4, E - 5$ $(D)$ None
asked Nov 12, 2017 in Computer Networks Na462 684 views
0 votes
1 answer
21
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)
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 mahalakshmi r 2.3k views
0 votes
0 answers
22
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
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 Shivi rao 205 views
2 votes
1 answer
23
general conceptual question
Can split horizon alone prevent count to infinity problem or we must use poison reverse with split horizon ?
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 ♥_Less 263 views
3 votes
1 answer
24
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.
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 junaid ahmad 195 views
2 votes
1 answer
25
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.
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. Screen shot of above theory:- Now I also ... in understanding what is split horizon. In the line saying: "Node B can still advertise the value for X......." till last line.
asked Aug 27, 2017 in Computer Networks Shubhanshu 505 views
0 votes
1 answer
26
CN by Andrew S. Tanenbaum
what are the properties that routing protocol should satisfy?
what are the properties that routing protocol should satisfy?
asked May 3, 2017 in Computer Networks iarnav 293 views
2 votes
1 answer
27
DVRP and LINK STATE
asked Apr 26, 2017 in Computer Networks student2018 515 views
0 votes
2 answers
28
Internetworking Routing
waht happens in internetworking routing somebody please tell please
waht happens in internetworking routing somebody please tell please
asked Apr 9, 2017 in Computer Networks LavTheRawkstar 3.4k views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...