This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: d prop = m s (b) d trans = L R (c) d end-end = d prop + d trans = m s + L R (d) at t = d trans , the last bit is still at the beginning of the link, host A. (e) at t = d trans < d prop , the ﬁrst bit is on the link, in between hosts A and B. (f) at t = d trans > d prop , the ﬁrst bit is already at the end of the link, host B. (g) L = 100 bit , R= 28 × 10 3 bit/s , s= 2 . 5 × 10 8 m/s , m = ? given d trans = d prop m s = L R m = sL R ≈ 893 km 1 22. Form an expression for delay d trans in terms of segment size S , take the derivative with respect to S, and set it to 0 to ﬁnd the minimum. Total ﬁle size F = M × S , where M is the number of packets. Total packet size L = S + H , where H is header size (in this case 40). Since there is one router in between the hosts, the total delay is d trans = ( M + 1) L R = ( F S + 1) H + S R = F + S S H + S R = HF SR + F + H + S R ∂d ∂S =-HF S 2 R + 1 R = 0 S 2 = HF S = l √ HF m 2...
View Full Document
- Spring '09
- ﬁrst bit, transL mission delay, store-and-forward packet-switching network