EE444HW2.sln.corr - EE 444 INTRODUCTION TO COMPUTER...

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

View Full Document Right Arrow Icon
EE 444 INTRODUCTION TO COMPUTER NETWORKS Spring 2009 HOMEWORK #2 Answers Deadline: March 27 2009 @ 23:59 (No late submission is allowed.) Posted on March 20 2009. Question # 1 Is it possible to apply Little’s Law in a finite buffer M/M/1/m queue? If it is possible, then apply Little’s Law to find the average time a packet spends in an M/M/1/m queue in terms of arrival rate λ , departure rate μ and m? If it is not possible, explain why. Answer # 1 Yes, it is possible to apply Little’s Law in a finite buffer M/M/1/m queue. Yet, the drop rates should be taken into consideration. Let be the probability of packet drop. Net arrival rate to the system is . d P () 1 – P d λ From previous homework, we have 1 1 1 i i m p ρ + = and 1 (1 ) ) m d m P + = . 1 11 1 [] ( ) 1 mm i i m jj EN ip i + == ∑∑ . After some algebraic manipulations, 1 1 ( 1( 1 ) ) )(1 ) m m m ρρ + + =+ −− + . So, ) d ET P = 1 ( 1 ) ) m ) μρ + +− + = Question # 2 5 stations are sharing a 10 Kbits/s communication channel. The stations are generating Poisson traffic and the packet sizes are distributed exponentially with average of 100 bits. Stations generate packets with rates
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/09/2010 for the course EE ee444 taught by Professor Akan during the Spring '10 term at Middle East Technical University.

Page1 / 2

EE444HW2.sln.corr - EE 444 INTRODUCTION TO COMPUTER...

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

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