ட ರೆ ಅಂ ---

b. Source Packet switch Packet switch Destination ٠.

End-to-end message transport (a) without message segmentation; (b) with message segmentation

(i)Consider sending the message from source to destination without message segmentation.
Hdw long does it take to move the message from the source host to the first packet switch?
Keep in mind that each packet switch uses a store and forward packet switching. What is
the total time to move the message from the source host to the destination host? (2)

(11) Now suppose that the message is segmented into 5,000 packets, with each packet
being ISOO bits long. How long does it take to move the first packet from the source host
to the first packet switch? (2)

(111) How long does it take to move the file from the source host to the destination host when
message segmentation is used? (1) (iv) Discuss the drawbacks of message segmentation.
3. (a) Explain the four categories of routers in the context of OSPF areas. (3)

(b) An organization has been assingned the prefix 212.1.1.0/24 and wants to form
subnets for four departments, with hosts as follows:

A : 75 hosts
B : 35 hosts
C : 20 hosts

D : 18 hosts
Total of 148 hosts

(1) Give a possible arrangement of subnet masks to make this possible (4)

(ii) Suggest what the organization might do if department D grows co 32
hosts.

(2)
Part B

4. (a) Explain the silly window syndrome with proper example. What is the solution for the
SWS problem. (6)

(b) (i) Suppose this is a datagram network. Show the forwarding table in router
A, such that all traffic from HI to H3 is forwarded through interface 3 and all
traffic from H2 to H3 are forwarded through interface 4 (3)