Dear students,

The course ELL 894, Network Performance analysis and modeling, is offered in this
semester.

Those who wish to build up background knowledge on advanced queueing systems with
computer simulations, and either stochastic bounds and scheduling or Markov decision
process are encourage to attend.

Please, take a look at the following reading assignment (some are subject to change). Those
who are interested in understanding these papers as the first year of Ph. D students or, Master
research and M. Tech for some projects, can learn theoretical background. They are exposed
to some classical research areas and have some chances of reading well-written papers. Note
that before giving this reading assignment, I will explain how the theory is applied in these
topics. Thus, students will learn some background of wireless mobile/computer networking
protocols as well.

Since this course is advanced one, grading is more based on assignment, i.e., self-study.

The following would be a candidate list of reading assignments in this course, which will be
given from middle of February. These papers show some applications of probability theory,
Markov and queueing processes.

For Markov and queueing process:

1. Lin, Y.-B., Mohan, S., and A. Noerpel, “Analyzing Queueing Priority Channel
Assignment Strategies for Hand-off and Initial Access for a PCS Network” IEEE
Transactions on Vehicular Technology, 43(3):704-712, 1994.

[Link]

2. Lin, Y.-B., “Reducing Location update cost in a PCS network,” IEEE Trans.
Networking, 5(1):25-33, 1997.

[Link]
[Link]

3. J. Mo and J. Walrand, “Fair End-to-End Window-Based Congestion Control,” IEEE

Trans. Networking, 8(5):556-567, 2000.
[Link]

4. S. Qi Li, “Overload control in a finite message storage buffer,” IEEE Trans. Comm.,
37(12): 1330-1338, 1989.

[Link]

5. M. J. Karol, “Input versus Output Queueing on a Space-Division Packet Switch,” IEEE

Trans. Comm., 35(12): 1347-1356, 1987.

[Link]

6. M. Neely et al., “Dynamic Power Allocation and Routing for Time-Varying Wireless
Networks,” IEEE J. on Selected Areas in Comm., 23(1): 89-103, 2005.

[Link]

For effective capacity:

7. J. S. Evans and D. Everitt, “Effective Bandwidth-Based Admission Control for

Multiservice CDMA Cellular Networks,” IEEE Transactions on Vehicular Technology,
48(1):36-46, 1999.

[Link]

8. D. Wu and R. Negi, “Effective Capacity: A Wireless Link Model for Support of Quality
of Service,” IEEE Trans. Wireless comm. 2(4), 2003.

[Link]

9. R. Guerin et al, “Equivalent Capacity and its application to bandwidth allocation in High
speed Networks,” IEEE J. on Selected Areas in Comm., 9(7): 968-981, 1991.

[Link]

For Markov decision process:

10. Q. Zhao et al., “Decentralized Cognitive MAC for Opportunistic Spectrum Access in Ad
Hoc Networks: A POMDP Framework,” IEEE J. on Selected Areas in Comm., 25(3): 589-
600, 2007.

[Link]

11. S. Singh, V. Krishnamurthy, and V. Poor, “Integrated Voice/Data Call Admission

Control for Wireless DS-CDMA Systems,” IEEE Trans. Signal processing, 50(6), June 2002.
[Link]

The course will start from the very basic background needed and deal with the following
topics: (T) indicates theory and (P) does computer practice (assignment will be given).

1. Review on probability, Markov process and elementary queueing theories.

- Refresher on elementary probability (T)

- Continuous- and discrete time Markov processes (T)

- Embedded Markov process (T)

- Elementary queueing systems (T)

- Probability generating function (T) & Gauss-Seidel iteration (P)

- Computer simulation of queueing systems (P)

2. Advanced queueing systems & computational probabilities:

- Markov-modulated Poisson process (T)

- Modeling and analysis using Absorbing Markov processes (T)

- Censored Markov process (T)

- Quasi-Birth and Death process (QBD): Matrix geometric approach (T/P)

One of the following (either 3 or 4) will be taught. If time is allowed, both can be taught.

3. Network performance analysis (stochastic bounds)

- Effective bandwidth and capacity (T): examples, ATM and wireless channels

: Gaussian approximation and Chernoff bound.

 - Lyapunov stability (or Foster theorem or Parkes Lemma) and stochastic
dominance of queueing systems (T)

- Max-Weight scheduling (T)

4. Markov Decision process

- Markov reward/decision process (T)

- Value-iteration, Policy improvement and Linear programming approach (T/P)

- (Optionally) Partially observable Markov decision process (T)