lec21 - UCI University of California, Irvine EECS 161 -...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
EECS 161 - Introduction to Computer Networking Scott Jordan Performance UCI University of California, Irvine A Model of Packet Arrivals We want to model the times at which packets arrive at a router: Idea: split time into small intervals Suppose that a packet arrives in a small time interval with probability . To simulate this, flip a coin with -- Heads = packet arrival in this time interval, Tails = no packet arrival in this time interval. x xx T 1 T 2 T 3 t t h λ h PH () λ h =
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
EECS 161 - Introduction to Computer Networking Scott Jordan Performance UCI University of California, Irvine A Model of Packet Arrivals Flip a coin with -- Heads = packet arrival in this time interval, Tails = no packet arrival in this time interval. What is the distribution of time until the first packet arrives, i.e. what is ? Approach -- Consider the number of coin flips until you get Heads. This is a random variable with an Geometric distribution. The time until the first packet arrives is equal to the number of coin flips, times h .
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/28/2009 for the course CSE 120A taught by Professor Healey during the Spring '08 term at UC Irvine.

Page1 / 9

lec21 - UCI University of California, Irvine EECS 161 -...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online