Lecture 12

# Recall our discussion at the end of chapter 1 we

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: m m 1 1 +a, This can also be computed iteratively: Write E a m = 1=da m: Then, da m = m da m , 1=a + 1: Thus, the iteration to compute blocking given offered load of a erlangs and the number of channel, m, is: procedure erlangb (a, m) d=1 for j = 1 ::: m d = j  d=a + 1 endfor b = 1=d return (b) Note that here the offered load (trafﬁc) is given in a erlangs. Recall our discussion at the end of chapter 1. We stated there that typically for telephone networks, we provide offered trafﬁc as Offered Load = Number of call attempts/ hour * average call holding time On close scrutiny, this is =, where 1= = average call holding time. Again note that the assumption of arrival is Poisson. Further, we assume call holding time to be exponentially distributed. Example # 4: Suppose that the call arrival rate is on average 10 per hour, and the average duration of calls is 6 minutes, then the offered load in erlangs is a = 10=60  6 = 1erl. If now the link capacity is 1 (= m), then the call blocking probability is E 1 1 = 1=1...
View Full Document

Ask a homework question - tutors are online