Lecture21_2up

Lecture21_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 21 21 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
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 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 Purdue University ¾ ¾ Regulate the packet injection rate at the source so that the
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.

Page1 / 5

Lecture21_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