{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture15

# Lecture15 - ECE-547 Introduction to Computer Communication...

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

Purdue University ECE ECE - - 547 547 Introduction to Computer Introduction to Computer Communication Networks Communication Networks Instructor: Instructor: Xiaojun Xiaojun Lin Lin Lecture 15 Lecture 15

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

View Full Document
Purdue University Example Example Example: Calculate γ ( throughput ), E[N], and E[T] in an M/M/1 and M/M/1/N queueing systems. ¾ Solution: ρ μ λ = = = = = = < = = = = 1 1 ) ( ) ( , 1 ) 1 ( ) 1 ( ) ( 1 ), 1 ( 1 1 1 1 N E T E Now n n nP N E P n n n n n n n n
Purdue University Example Example ¾ Example (cont): ¾ γ↑ means E[T] (bad). Want to operate below the “knee” of the curve. 0.2 0.4 0.6 1.0 delay normalized t E T E ] [ 1 ] [ μ = ρ 1 1 delay

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

View Full Document
Purdue University Example Example ¾ Finite Buffer (M/M/1/N) P L ρ→ 1 ), 1 ( 1 ) 1 ( 1 << = + N N N N L for P ρ 1 1 1 1 + N
Purdue University Example Example ¾ Also, λ Maximize γ such that P L < ε 1 , E[T]< ε 2 1 1 + = N N μ γ

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

View Full Document
Purdue University Two servers versus one server? Two servers versus one server? ± Example: Compare the M/M/1 with service rate 2 μ and an M/M/2 system with each servers having rate μ .
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 17

Lecture15 - ECE-547 Introduction to Computer Communication...

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

View Full Document
Ask a homework question - tutors are online