Lecture 10 Flashcards

1
Q

What is the near-far problem in CDMA? How does UMTS and HSDPA handle it?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Please explain Kendall’s notation. (What do each of the five characters mean?)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is an Erlang-C model for?

A

an M/M/c queue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is an Erlang C model?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is the inspection paradox?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is length biasing?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What happens to the expected waiting time as variablity increases?

A

That goes up, see the formula (but no need to remember it)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is a M/G/1 Queue with priorities? What are the two types?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly