MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Problem Solving on Routing

Assume that s...

Question

Assume that source S and destination D are connected though two intermediate routers labels R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission form S to D.

A

Network layer -4 times and Data link layer -3 times

No worries! We‘ve got your back. Try BYJU‘S free classes today!

B

Network layer -4 times and Data link layer -4 times

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

Network layer -2 times and Data link layer -6 times

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

Network layer -4 times and Data link layer -6 times

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Open in App

Solution

The correct option is D Network layer -4 times and Data link layer -6 times
In the layered architecture sender and receiver uses all the 5 layers and router do processing upto the network layer.

So network layer is visited 4 times and data link layer is visited 6 times.

Suggest Corrections

thumbs-up

0

Similar questions

Q. Consider three networks A,B and C. Host

H_{A}

in network A sends messages each containing 180 bytes of application data to a host

H_{C}

in network C. The TCP layer prefixes a 20 byte header to the message. This passes through an intermediate network B. The maximum packet size, including 20 byte IP header, in each network is
A: 1000 bytes
B: 100 bytes
C: 1000 bytes
The network A and B are connected through a 1 Mbps link, while B and C are connected by a 512 Kbps link (bps=bits per second)

Assuming that the packets are correctly delivered, how many bytes, including headers, are delivered to the IP layer at the destination for one application message, in the best case? Consider only data packets.

Q. In a packet switching network, packets are routed form source to destination along a single path having two intermediate nodes. If the message size is 24 bytes and each packet contains a header of 3 bytes, then the optimum packet size is

Q. Consider a source computer (S) transmitting a file of size

10^{6}

bits to a destination computer (D) over a network of (

two routers R_{1} a n d R_{2} and three links

(L_{1}, L_{2} a n d L_{3}) . L_{1} connects S to

R_{1}; L_{2} c o n n e c t s R_{1} t o R_{2}; a n d

L_{3} c o n n e c t s R_{2} t o D .

Let each link be of length 100 km.Assume signals travel over each link at a speed of

10^{8}

meters per second. Assume that the link bandwidth on each link is 1 Mbps. Let the file be broken down into 1000 packets each of size 1000 bits. Find the total sum of transmission and propagation delays in transmitting the file from S to D?

Q. Consider the following statements:
1. IP packets fronm the same source to the same destination can take different routers in the network.
2 A computer can have multiple MAG address

Q. Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is as shown below.

The objective is to find the shortest -cost path from the router R to routers P and Q. Assume that R does not initially know the shortest routes to P and Q. Assume that R has three neighbouring routers denoted as X,Y and Z. During one iteration , R measures its distance to its neighbours X,Y and Z as 3,2 and 5. respectively. Router R gets routing vectors from its neighbours that indicate that the distance to router P from routers X, Y and Z are 7,6 and 5, respectively.
The routing vector also indicates that the distance to router Q form routers X, Y and Z are 4,6 and 8, respectively. Which of the following statement(s) is/are correct with respect to the new routing table of R, after updating during this iteration?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Problem Solving on Routing

OTHER

Watch in App

explore_more_icon

Explore more

Problem Solving on Routing

Join BYJU'S Learning Program

CrossIcon