Which of the following statement(s) is/are true for transparent fragmentation? a. The subsequent networks are aware that the fragmentation has occurred. b. It is required to route all packet to the same exit router in a network. C. Each fragment is treated as an independent packet. d. All fragmented packets are reassembled by host system. e. All fragmented packets are reassembled by the exit router.
Question
Which of the following statement(s) is/are true for transparent fragmentation? a. The subsequent networks are aware that the fragmentation has occurred. b. It is required to route all packet to the same exit router in a network. C. Each fragment is treated as an independent packet. d. All fragmented packets are reassembled by host system. e. All fragmented packets are reassembled by the exit router.
Solution
The statements c and d are true for transparent fragmentation.
c. Each fragment is treated as an independent packet. This is true because once a packet is fragmented, each piece is sent independently of the others.
d. All fragmented packets are reassembled by the host system. This is also true. The receiving system is responsible for reassembling the fragments into the original packet.
The other statements are not generally true for transparent fragmentation.
a. The subsequent networks are not necessarily aware that fragmentation has occurred.
b. It is not required to route all packets to the same exit router in a network.
e. All fragmented packets are not reassembled by the exit router. The reassembly is typically done by the receiving system, not the router.
Similar Questions
An IP packet arrives at the final destination with the D flag set as 1. Which of the following statement is true about the packet? a. The packet has not been fragmented. b. The packet has been fragmented and it is the first fragment. c. The packet has been fragmented and it is the last fragment. d. None of these.
What is the process of dividing a packet into multiple fragments called? A. Encapsulation B. Fragmentation C. Reassembly D. Data Transmission
6.3-1. Channel partitioning protocols. Which of the following statements is true about channel partitioning protocols?Group of answer choicesChannel partitioning protocols can achieve 100% channel utilization, in the case that all nodes always have frames to send.Channel partitioning protocol can achieve 100% utilization, in the case that there is only one node that always has frames to sendThere can be simultaneous transmissions resulting in collisions.There can be times when the channel is idle, when a node has a frame to send, but is prevented from doing so by the medium access proto
6.3-1. Channel partitioning protocols. Which of the following statements is true about channel partitioning protocols?Group of answer choicesChannel partitioning protocol can achieve 100% utilization, in the case that there is only one node that always has frames to sendChannel partitioning protocols can achieve 100% channel utilization, in the case that all nodes always have frames to send.There can be simultaneous transmissions resulting in collisions.There can be times when the channel is idle, when a node has a frame to send, but is prevented from doing so by the medium access protocol.
6.3-1. Channel partitioning protocols. Which of the following statements is true about channel partitioning protocols?Group of answer choicesChannel partitioning protocols can achieve 100% channel utilization, in the case that all nodes always have frames to send.Channel partitioning protocol can achieve 100% utilization, in the case that there is only one node that always has frames to sendThere can be simultaneous transmissions resulting in collisions.There can be times when the channel is idle, when a node has a frame to send, but is prevented from doing so by the medium access protocol.
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.