ans4-6 - INWK6211 Mathematics for Internetworking Spring...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: INWK6211 Mathematics for Internetworking Spring 2010 Tutorial Problem Answers For Chapters 4 to 6 1) 3 13 2) a) For a clear day being state 1 and a rainy day being state 2: P = bracketleftBigg . 9 . 1 . 3 . 7 bracketrightBigg b) 1 = 0 . 75, 2 = 0 . 25 c) P (3) 11 = 0 . 804 d) f (2) 12 = 0 . 09 e) 22 = 4 days. 3) If state 1 is a zero, and state 2 is a one, then P = bracketleftBigg p 1 p 1 p p bracketrightBigg and the steady-state probabilities are 1 = 0 . 5 2 = 0 . 5 4) This is a 4-server problem with maximum number in system of 4. For this problem, we must solve the balance equations. a) The fraction of time idle is = 0 . 5355. b) The fraction of users lost is 4 = 0 . 003405. 5) We can approximate this as an infinite server problem (see Higgins and McNulty, pg 315 for the results relating to this problem), in which case r = t = arrival rate service rate = 60 / 9 1 / 5 = 100 3 Since the mean number of users is r = 100 / 3 = 33 . 3 << 150, the assumption of an infinite server model is...
View Full Document

Page1 / 3

ans4-6 - INWK6211 Mathematics for Internetworking Spring...

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