{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

132B_1_Sec08_Info_Stream_Traffic_Proc_090710A

132B_1_Sec08_Info_Stream_Traffic_Proc_090710A - Information...

Info icon This preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Information Streams and Traffic Processes Professor Izhak Rubin Electrical Engineering Department UCLA © 2010-2011 by Izhak Rubin
Image of page 1

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

View Full Document Right Arrow Icon
(c) Prof. Izhak Rubin 2 Arrival Point Processes (1) z Messages arrive at the system in accordance with a stochastic point process : where A n denotes the arrival time of n th message, n 1. We generally set A 0 =0. z Associated with the arrival process A is the arrival counting process . where N t N(t) denotes the arrival count at t, expressing the number of messages arriving at the system during (0, t]. { } (1) , 1 . . , 1 , 1 p w A A n A A n n n > = + { } (2) , 0 , 0 , 0 = = N t N N t N(t) t A 0 A 1 A 2 A 3 1 2 0 T 2 T 3 T 1
Image of page 2