0
$\begingroup$

In a computer network, the store and forward mechanism is used. In this mechanism, the packet is sent from one system to the next along the network path, and in the second system, the complete packet received is checked and then sent to the next system in the network. This mechanism is quite similar to the behavior of a pipeline in computer architecture. In other words, each jump (distance from one system to the next system in the network) can be considered as a stage that its task must be done and systems along the path can be considered similar to buffers that must store the result of the stages. Accordingly, answer the following questions.

Considering a network consisting of 2 source and destination systems and 3 intermediate routers. The transfer rate in all parts of this network is 10 Mbps. We plan to send a 100 MB file as a message from the source system to the destination system on this network.

Based on the formulas in the pipeline and with the help of basic network calculations for transmission delay,

I want to show that to send this message, fragmenting the message to the size of 1500 bytes and then sending them, how much acceleration in transmitting this file from the source system will be the destination system, depending on when the whole file is sent at once. In this case, suppose the fragmentation of the message does not involve additional costs and overheads (header or trailer).

$\endgroup$
7
  • $\begingroup$ (I can't understand how much acceleration in transmitting [a 100 MB] file from the source system will be the destination system, depending on when the whole file is sent at once, even substituting depending on by as compared to: how can any amount of acceleration be a system?) (If your "native tongue" isn't English, try having a phrase you're not sure about translated to your favourite language. And or vice-versa.) $\endgroup$
    – greybeard
    Nov 18, 2021 at 9:43
  • $\begingroup$ When a message is fragmented, each fragment needs an information overhead in the form of multiple headers in the network. Suppose each packet adds x bytes of data overhead. $\endgroup$ Nov 18, 2021 at 9:54
  • $\begingroup$ In this case, what is the optimal size of packets (including headers and data payloads) for transmission in this network? The most optimal mode is the minimum delay of complete file / message transfer from the source system to the destination system $\endgroup$ Nov 18, 2021 at 9:55
  • $\begingroup$ Suppose each packet adds x bytes of data overhead contradicts suppose the fragmentation of the message does not involve additional costs and overheads in the question body: is this one more question, a separate one? $\endgroup$
    – greybeard
    Nov 18, 2021 at 10:15
  • $\begingroup$ yes it is i aim second one. $\endgroup$ Nov 18, 2021 at 10:39

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.