22. Sliding window analysis, Little's law
MIT 6.02 Introduction to EECS II: Digital Communication Systems, Fall 2012 View the complete course: http://ocw.mit.edu/6-02F12 Instructor: Hari Balakrishnan This lecture continues with an analysis of sliding window protocol and how it handles packet loss. Little's Law is introduced to relate the average number of packets to the average service rate and average delay of a stable system. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
▶︎
23. A brief history of the Internet
▶︎
Sliding Window Technique - Algorithmic Mental Models
▶︎
24. History of the Internet cont'd, course summary
▶︎
Understanding Signal Integrity
▶︎
How to Speak
▶︎
The Professor Who Taught People How To Think (1962)
▶︎
The Obsessive Engineering of Precision Linear Motion
▶︎
Is the AfD a threat to Germany? Mehdi Hasan & Maximilian Krah | Head to Head
▶︎
1 - TCP Windows and Sliding Windows
▶︎
Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup
▶︎
The Big Short (2015): The Jenga Scene – Explaining the Financial Collapse
▶︎
26. Chernobyl — How It Happened
▶︎
Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker
▶︎
Something is jamming GPS over Europe. Here's what we found
▶︎
The World's Most Important Machine
▶︎
Billionaire's WARNING: I'm SELLING. The Crash Is Already Here!
▶︎
JANITOR vs THE BIGGEST GUYS IN THE GYM. They Didn’t Expect THAT
▶︎
Lecture 1: Introduction to Superposition
▶︎
The Mind Behind Linux | Linus Torvalds | TED
▶︎