Lecture18_2up

Lecture18_2up - ECE-547 Introduction to Computer...

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

View Full Document Right Arrow Icon
1 Purdue University ECE ECE -547 547 Introduction to Computer Introduction to Computer Communication Networks Communication Networks Instructor: Instructor: Xiaojun Xiaojun Lin Lin Lecture Lecture 18 18 Purdue University Non Non -preemptive priority queue preemptive priority queue ¾ E(T k )= (Expected # of class k customers arriving during the wait time of class p-customer) × (expected service time of each class k customers) ' 2 0 1 () ( ) ( ) ( 4 ) Now : ( ) show for hw. 2 kp k kn p r k n k Ew E ET E λ τ ρ = = = −−− =
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Purdue University Non Non -preemptive priority queue preemptive priority queue ¾ Combine (3), (4), (5) and solve recursively to get: = = = 1 1 1 0 1 1 ) ( ) ( p i i p i i p T E w E ρ Also show for HW Purdue University Summary Summary ¾ Completed our discussion on queueing. ¾ We have shown that it can be used for admission control, to dimension link capacities, buffer sizes, etc.
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 01/06/2010 for the course ECE 547 taught by Professor Xiaojunlin during the Spring '09 term at Purdue.

Page1 / 6

Lecture18_2up - ECE-547 Introduction to Computer...

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