These courses are part of the post-graduate lectures on wireless networks provided by the Department of Communications Engineering of the University of Oulu.

 

QoS Management & Queueing Theory 2011

Telecommunication Laboratory and Center for Wireless Communications organize the course QoS Management & Queueing Theory

The expected overall number of credit points is 12.

This time, the course will be organized in two parts. The first part of the course, containing the queueing theory, will be organized by
prof. Andrei Gurtov and prof. Evsey Morozov.
Date: 6.-14.Dec 2010. (more detailed information of the schedule will be announced later)

Queueing Theory Lectures
? Main objectives and notions of queueing theory (1 h)
? Discrete-time Markov chains: main results (2 h )
? Continuous-time Markov processes (1 h)
? M/M/1 queue: stationary distribution and main characteristics (1 h)
? The Birth-Death (BD) process (1 h)
? Application of the BD process to multiserver M/M/m queue (1 h)
? M/G/1 and G/M/1 queues: embedded Markov chain method (1 h)
? Jackson (exponential) stochastic networks: stationary distribution (1 h)
? Regenerative queueing processes: definitions and asymptotic results (1 h)
? Little?s formula: connection between average workload and queue size (1 h)
? Pollaczek-Khinchin formula (1 h)
? Waiting time paradox (1 h)
? Effective bandwidth (1 h)
? Rare event estimation in communication networks (2 h)
? Regenerative simulation (2 h)
and will include the reading of http://www.wiley.com//legacy/wileychi/glisic/supp/Appendix_A.pdf

The second part of the course will be organized in spring 2011.

Topics for the second part
? Conventional Routing
? Advanced Routing & Network Coding
? Routing and Network Stability
? Time varying network with queuing
? Network Delay
? Lyapunov Drift and Network Stability
? Lagrangian Decomposition of Multicomodity Flow Optimization Problem
? Flow Optimization in Heterogeneous Networks
? Protocol Optimization with Infinite Buffers
? Lyapunov Drift Analysis of Enhanced Dynamic Routing Algorithm (EDRA)
? Optimization of EDRA with Finite Buffers
? Dynamic Resource Allocation in Computing Clouds

There will be separate exams for parts I and II.

Lecture notes are avalilable here

More information: Prof. Savo Glisic