ps1_ee550_fall08

# ps1_ee550_fall08 - UNIVERSITY OF SOUTHERN CALIFORNIA FALL...

This preview shows pages 1–2. Sign up to view the full content.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: UNIVERSITY OF SOUTHERN CALIFORNIA, FALL 2008 1 EE 550: Problem Set # 1 Due: Wednesday Sept. 3, 2008 I. LINK UTILIZATION Consider Fig. 1.5 in the textbook, where message i ∈ { 1 , 2 , 3 ... } are sent, with transmission times { X 1 ,X 2 ,X 3 ,... } . Define X as the average transmission time: X , lim n →∞ 1 n ∑ n i =1 X i . a) Let N ( t ) represent the number of fully transmitted messages up to time t. Argue from Fig. 1.5 that ∑ N ( t ) i =1 X i ≤ t (for all t ). b) Define λ , lim t →∞ N ( t ) t as the message arrival rate . Derive a bound on λ in terms of X , using part (a). c) Define ρ , λ X as the system utilization . Give a brief explanation of why this is a meaningful and intuitive definition of utilization. II. VIRTUAL CIRCUIT VERSUS DATAGRAM When using a virtual circuit (VC), some time is taken to set up the circuit before the actual transmission of packets may begin. As a consequence, the transmission time of a packet may be reduced because the VC number will simplify the routing algorithm. This problem is aimed at demonstrating this idea....
View Full Document

## This note was uploaded on 12/21/2010 for the course EE 550 taught by Professor Neely during the Fall '08 term at USC.

### Page1 / 2

ps1_ee550_fall08 - UNIVERSITY OF SOUTHERN CALIFORNIA FALL...

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

View Full Document
Ask a homework question - tutors are online