Problem%20Set%203%202007%20Practice%20Problems

Problem%20Set%203%202007%20Practice%20Problems - Simon...

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

View Full Document Right Arrow Icon
Simon Fraser University School of Engineering Science Engineering Science 427 Semester 20 0 7 -1 Problem Set 3 Date: April 16 200 7 , Practice Problems, do not hand in Question 1: Consider a 1Mbps satellite channel. Frame length is 1000 bits (50 bits of overhead and the remainder user data) and the probability of an unsuccessful frame transmission is p . Assume that the errors on different frames are independent. Neglect the acknowledgement transmission time and receiver processing time, and assume a go-back- N method of error control. Assume p = 0.01 and t p = 350 ms. (a) What is the average number of transmissions per frame? (b) What is the maximum possible throughput for this go-back- N channel, in frames per second? (c) Repeat parts (a) and (b) assuming a selective repeat error control scheme with an assumed infinite reordering buffer. Question 2: In the packet network shown in the attached Figure, all arrivals at all nodes are assumed Poisson
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.

Page1 / 2

Problem%20Set%203%202007%20Practice%20Problems - Simon...

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