TCOM 501: Networking Theory & Fundamentals. Lecture 2 January 22, 2003 Prof. Yannis A. Korilis. Topics. Delay in Packet Networks Introduction to Queueing Theory Review of Probability Theory The Poisson Process Little’s Theorem Proof and Intuitive Explanation Applications.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
January 22, 2003
Prof. Yannis A. Korilis
If limits Nt→N, Tt→T,λt→λexist, Little’s formula follows
We will relax the last assumption
FCFS system, N(0)=0
(t) and b(t): staircase graphs
N(t) = (t)- b(t)
Shaded area between graphs
T1Proof of Little’s Theorem for FCFS