{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture21

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

This preview shows pages 1–5. 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 Lecture 21 21

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

View Full Document
Purdue University Optimal packet length Optimal packet length ¾ Packet length: l + l’ where l’ = header Packet length ¾ Assume P b = bit error probability is independent from bit to bit ¾ The larger the value of l, the higher the probability of that frame is in error ¾ The larger the value of l, the less the overhead
Purdue University Optimal packet length Optimal packet length ¾ P = probability of frames in error = 1 – (1-p b ) l+l’ If (l + l’) p b << 1 then we can use p ~ (l + l’) p b (using Taylor expansion) L bits (log scale) D ¾ ( H.W .) D= Ave. max data rate in each scheme? ¾ Find l such that D is maximized

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

View Full Document
Purdue University ¾ ¾ Regulate the packet injection rate at the source so that the
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 10

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

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

View Full Document
Ask a homework question - tutors are online