Performance of Reliable Data Transfer - Transport Layer | Computer Networks Ep. 3.4.2 | Kurose, Ross
HTML-код
- Опубликовано: 12 июн 2024
- Describing the performance constraints incurred by stop-and-wait vs. pipelined algorithms. This is setting the stage for discussing the TCP transport protocol in future videos.
Based on Computer Networking: A Top-Down Approach 8th edition, Chapter 3, Section 4.2, 4.3, and 4.4.
Slides are copyright 1996-2020 J.F. Kurose, K.W. Ross All Rights Reserved., and freely available here: gaia.cs.umass.edu/kurose_ross...
Background music: www.epidemicsound.com/referra... Наука
this is better to follow than reading word for word with the book. i'm happy i found you, i wouldn't be able to read this so clearly.
Glad it was helpful!
I'll surely recommend this channel to my fellow classmates. Very Nice and Apt Explanation. Helped in my exams, to study and review fast. Thanks a Lot!
That's great! Glad the videos are helpful!
Great explanation of the Go-Back-N and Selective Repeat algorithms.
Glad it was helpful!
I might be wrong but in your example, at 1:58 I think the utilizing speed should be 270 Kb/s. If we multiply (0.00027*10^9)/1000 = 270 Kb/s but you said 33 Kb/s. Did I understand it wrong? How the utilizing speed is 33 Kb/s ?
I misspoke. It should be 33 kB/s, not 33 kb/s.
@@EpicNetworks Yes, so I was right. it was 270 kbits/s which is 33.75 kbytes/s. Thank you for clarifying it.
Also, at 2:56, instead of 0.024 you wrote "0.0024". Also 0.024/30.008 = 0.00079978 which rounds up to 0.0008 not "0.00081"
These are the Kurose & Ross slides, I didn't write them.
@@EpicNetworks ok so the slides are wrong.
It sure is a bot
Very bad teaching