22. Sliding window analysis, Little's law

From the creator

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

Published 2014-03-18 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.