Dark Mode

Recent questions tagged routing

2 votes

1 answer

1

GATE CSE 2023 | Question: 15
Which of the following statements is/are $\text{INCORRECT}$ about the $\textsf{OSPF (Open Shortest Path First)}$ routing protocol used in the Internet? $\textsf{OSPF}$ implements Bellman-Ford algorithm to find shortest paths. $\textsf{OSPF}$ ... path routing. $\textsf{OSPF}$ is used as an inter-domain routing protocol. $\textsf{OSPF}$ implements hierarchical routing.

admin asked in Computer Networks Feb 15

by admin

1.2k views

0 votes

0 answers

2

U = set-up time for circuit switch (seconds) Y = transmission delay per link (seconds) (also called “transfer delay”) L = message length (bits) >0 R = transmission rate (bits per second) >0 (also called “placement rate”) H = header size (bits) =>0 P = packet size (bits) >H (note that this is the total packet size, i.e. header + data) X = decision time per packet (also called “packet routing delay”) 1. If L=1000, Y=1, R=4000 and U=1, choose a value of X. What is the total transmission time in the circuit switch network and packet switched network? Consider P=125 and H=25. (3 marks)

ruchibhandari3107 asked in Computer Networks Nov 27, 2022

by ruchibhandari3107

112 views

0 votes

1 answer

3

Computer Networks (Routing Algorithm)
St.No. Routing Protocols Persistent looping Count to infinity problem I Distance vector routing protocol (DVRP) Yes Yes II Split horizon in DVR No Yes III Split horizon with poison reverse in DVR No No IV Link State Routing Protocol (LSRP) No No Which ... as Persistent looping and count to infinity are the same thing. Only IV II and IV All of I,II,III and IV

Souvik33 asked in Computer Networks Oct 26, 2022

296 views

18 votes

2 answers

4

GATE CSE 2022 | Question: 47
Consider a network with three routers $\text{P, Q, R}$ shown in the figure below. All the links have cost of unity. The routers exchange distance vector routing information and have converged on the routing tables, after which the link $\text{Q-R}$ ... off to one decimal place) between $\text{P}$ and $\text{Q},$ leading to count-to-infinity problem, is _______________.

Arjun asked in Computer Networks Feb 15, 2022

by Arjun

4.8k views

0 votes

1 answer

5

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 Nov 24, 2021

by Sanjay Sharma

384 views

1 vote

0 answers

6

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, 2021

338 views

1 vote

1 answer

7

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

1.1k views

7 votes

4 answers

8

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

7.1k views

1 vote

1 answer

9

Applied Course | Mock GATE | Test 1 | Question: 31
Which of the following statement is/are correct? A Router has a physical and logical(IP) address for each of its interfaces. A router acts only on those packets in which the link-layer destination address matches the address of ... changes the link-layer address of the packet (both source and destination) when it forwards the packet. All the above

Applied Course asked in Computer Networks Jan 16, 2019

by Applied Course

430 views

3 votes

1 answer

10

Applied Course | Mock GATE | Test 1 | Question: 63
Suppose there are $4$ routers connected between two systems $S_1$ and $S_2$. $S_1$ wants to send a python file of size $8 \:KB$ to $S_2$ ... the time to transfer $1$ bit from $S_1$ to $S_2$ is $32$ sec and there is no traffic between these two systems)

Applied Course asked in Computer Networks Jan 16, 2019

by Applied Course

487 views

1 vote

3 answers

11

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

1.3k views

1 vote

2 answers

12

GATE Overflow | Mock GATE | Test 1 | Question: 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

1.3k views

0 votes

2 answers

13

Fragmentation of packet
Which of the following statements are True ?

Na462 asked in Computer Networks Dec 2, 2018

by Na462

1.0k views

1 vote

1 answer

14

Distance vector routing Algorithm
D.

Na462 asked in Computer Networks Dec 2, 2018

by Na462

2.5k views

0 votes

0 answers

15

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

273 views

0 votes

0 answers

16

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

1.0k views

1 vote

0 answers

17

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

577 views

0 votes

2 answers

18

Self doubt
RIP and OSPF are which layer protocols ?

jatin khachane 1 asked in Computer Networks Oct 8, 2018

by jatin khachane 1

461 views

0 votes

1 answer

19

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

262 views

Page:

1
2
3
next »

Recent questions tagged routing