retagged by
866 views
2 2 votes
Consider sending a large file of $360,000$ bits from Host $A$ to Host $B$, connected through a router. Assume that there is no queuing and propagation delay, and the router has sufficient buffer space. Host $A$ splits the file into segments of $S$ bits each and adds $36$ bits of header to each segment, forming packets of $(36 + S)$ bits. Each link has a transmission rate of $R$ bps. Find the value of $S$ that minimizes the time needed to move the file from Host $A$ to Host $B$.

1 Answer

Best answer
1 1 vote
Time taken by $1^{st}$ packet to reach the destination is $((36 + S)/R )*2$, After this one packet is received at the destination in

$(36+S)/R$ because packets are transferred back to back by host $A$.

 

Assumed $360,000$ be $F$ for easier calculation

 

Let $total \ delay$ be $T$

 

So, the delay in sending the whole file is

 

$T = time \ to \ send \ 1 \ packet \ + \ time \  to \  send \  remaining \ (F/S - 1) \ packets $

 

$T = ((36 + S)/R )*2 + (F/S - 1)*(36+S)/R $

 

To calculate the minimum value of $S$, we need to take derivative and equate it to $0$

 

$dT/dS = 0$

 

$T = ((36 + S)/R )*2 + (F/S - 1)*(36+S)/R $

 

$T = (36 + S)/R )*(F/S + 1) $

 

$dT/dS = -36.F/(R.S^2) + 1/R = 0$

 

             $ -36.F/S^2 + 1 = 0$

 

             $ 36.F/S^2 = 1$

 

             $ 36.F = S^2$

 

             $S = \sqrt{36.F}$

 

$S = \sqrt{36.360000} = 3600$

 

$S = 3600 \ bits $
selected by
Position:
Show:

Related questions

13 13 votes
4 answers 4 answers
1.9k
1.9k views
Devasish Ghosh asked Mar 8, 2017
1,938 views
You are given a array $A$ of size $n$. Your are told that $A$ comprises three consecutive runs - first a run of $a$'s, then a run of $b$'s and finally a run of $c$'s. Mor...
0 0 votes
0 0 answers
426
426 views
MiNiPanda asked May 10, 2018
426 views
The CPU of a system having an execution rate of 1 million instructions per second needs 4 machine cycles on an average for executing an instruction. On an average, 50% of...
1 1 vote
0 0 answers
431
431 views
vidhyuth asked Apr 26, 2017
431 views
S[1 . . . n] is a sorted array of n integers, where n is even. A newarray S′ is generated by swapping some elements in odd-numberedpositions in the first half of S with s...
3 3 votes
1 1 answer
391
391 views
ASHIS 1 asked Apr 13, 2025
391 views
C11. Consider a bit stuffing framing method where both the start and the end of a frame are indicated by the flag \(01^k0\) where \(1^k\) denotes k consecutive ones.Recal...