Date & Time Room Topic Remark
12 January (Thursday), 09:15-11:00 Arthur
Course Briefing Assignment 1: Preparation of a presentation on own research focus and identify a topic that is hopefully related to own research and will be used for the report. Deadline is before the presentation.
Assignment 2: A list of concepts / models / approaches is given below with reference(s) for each of them. An earlier version of the list can be found here: Assignment 2
17 Feb, 09:15-10:00 TBD Presentations of your research focuses
(course participants)
Each is given 15 minutes.
17 Feb, 10:15-12:00

24 Feb, 09:15-11:00
TBD Overall picture
Try to give an overall picture of the topics in the course. Concepts include QoE/QoS, circuit/packet switching, Internet QoS architectures, TSpec/RSpec, scheduling, state transition diagram based analysis, mean value based analysis, queuing principles, GR model, network calculus, effective bandwidth.
24 Feb, 11:15-12:00 TBD Brief Presentations of Given Topics
(course participants)
Note: The focus is on introducing what you plan to include in your lectures and in the final report.
Teletraffic Theory Overview
This is to give an overview of Teletraffic Theory (TTM4155) that is a prerequisite for the course.
Main reference:
M. Zukerman. Introduction to Queueing Theory and Stochastic Teletraffic Theory. Lecture Notes. 2010. (
See also:
Villy B. Iversen “Teletraffic Engineering and Network Planning”, 2006. ( (Ch.5.3, 7.1-7.4, 10.1-10.3, 12.1-12.5.3,13.1-13.3.1, 13.4.1-13.4.3,14.1-14.3)
Internet QoS Architectures (self-study) Content:
Integrated Services (IntServ); Differentiated Services (DiffServ)
Main reference:
J. F. Kurose and K. W. Ross. Computer Networking: A Top-Down Approach . Pearson Education 2009. Chapter 7-Multimedia Networking
See also:
IntServ: RFC1633, RFC2210, RFC2211, RFC2212
DiffServ: RFC2475, RFC3246, RFC2597
TBD TBD Scheduling AlgorithmsContent:
Introduction to scheduling algorithms, including: FIFO / FCFS, (Strict) Priority, Round Robin (RR), Deficit Round Robin (DRR), Packet Generalized processor sharing (GPS), Weighted Fair Queuing (WFQ) / GPS (PGPS), Start-time Fair Queueing (SFQ), Earliest Due Date First (EDD / EDF)
Main references:
Hui Zhang. Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks. Proceedings of the IEEE. 1995.
M. Shreedhar and G. Varghese. Efficient Fair Queuing Using Deficit Round-Robin. IEEE/ACM Trans. on Networking. 1996.
Recommend to read:
A. K. Parekh, “A generalized processor sharing aproach to flow control in integrated services networks,” Ph.D. thesis, Dept. of Elect. Eng. and Comput. Sci., M.I.T., Feb. 1992.
Pawan Goyal, Harrick M. Vin, Haichen Cheng. Start-time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks. ACM SIGCOMM 1996.
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko: A probabilistic priority scheduling discipline for multi-service networks. Computer Communications 25(13): 1243-1254 (2002)
TBD TBD Scheduling in Wireless Networks Content:
Random multiple access, Central-controled access, Cross-layer optimization and opportunistic scheduling
Contention-based multi-access:
R. Rom and M. Sidi. Multiple Access Protocols: Performance and Analysis. Springer-Verlag, 1990. ( (Ch.3, Ch.4)
Yaxin Cao and Victor O. K. Li. Scheduling Algorithms in Broad-Band Wireless Networks. Proceedings of the IEEE. 2001.
Cross-layer optimization and opportunistic scheduling:
Xiaojun Lin, Ness B. Shroff, and R. Srikant. A Tutorial on Cross-Layer Optimization in Wireless Networks. IEEE JSAC 2006.
Recommend to read:
Dmitri Moltchanov. Performance models for wireless channels. Computer Science Review, 2010.
TBD TBD Multi-Channel/Server Scheduling Content:
Fork-join systems (Multi-channel/server scheduling)
Main reference:
Markus Fidler, Yuming Jiang. Non-asymptotic delay bounds for (k, l) fork-join systems and multi-stage fork-join networks. IEEE INFOCOM 2016. (Extended version on arXiv.)
Recommend to read:
Multichannel load balancing/striping): H. Adisshu, G. Parulkar, G. Varghese, A reliable and scalable striping protocol. ACM SIGCOMM, 1996.
Multichannel scheduling: Josep M. Blanquer, Banu Ozden, Fair queueing for aggregated multiple links, in: Proceedings of the ACM SIGCOMM, 2001.
See also:
H. Xiao, Y. Jiang, Analysis of multi-server round robin scheduling disciplines. IEICE Transactions on Communications E87-B (12), 2004.
J. Cobb, M. Lin, A theory of multi-channel schedulers for quality of service. Journal of High Speed Networks 12 (12), 2002.
* Guaranteed Rate (GR) & Packet Scale Rate Guarantee (PSRG) (for self-interest) Content:
GR and PSRG Models; Scheduling algorithms belonging to them; Delay analysis
Main references:
P. Goyal, S. S. Lam, and H. M. Vin. Determining end-to-end delay bounds in heterogeneous networks. Multimedia System, 5(3): 157-163, May 1997.
J. C. R. Bennett, K. Benson, A. Charny, W. F. Courtney, and J.-Y. Le Boudec. Delay jitter bounds and packet scale rate guarantee for Expedited Forwarding. IEEE/ACM Trans. Networking. 2002.
See also:
Y. Jiang. Internet Quality of Service: Architectures, Approaches and Analysis. Lecture Notes. NTNU. 2007. (
P. Goyal and H. M. Vin. Generalized guaranteed rate scheduling algorithms: A framework. IEEE/ACM Trans. on Networking. 1997.
Recommend: See how IntServ and DiffServ are related to: IntServ Guaranteed Service; DiffServ Expedited Forwarding
* Dynamic Packet State & Core-Stateless Fair Queueing (For self-interest) Content:
Dynamic Packet State and Core-Stateless Fair Queueing
Main reference:
Ion Stoica. Stateless Core: A Scalable Approach for Quality of Service in the Internet. PhD thesis. Carnegie Mellon University. 2000. (
TBD TBD Deterministic Network Calculus Basics Content:
Traffic models; Server models; Basic properties
Main reference:
Y. Jiang and Y. Liu. Stochastic Network Calculus. Springer 2008. (Ch.1 and 2)
Recommend to read:
V. Firoiu, J. Y. L. Boudec, D. Towsley and Z. L. Zhang. Theories and models for Internet Quality of Service. Proceedings of the IEEE, Special issue on Internet Technology, 90(9): 1565-1591, Aug. 2002.
See also:
J.-Y. Le Boudec and P. Thiran. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer-Verlag 2001. (On-line: (Ch.1, 2, 6 and 7. )
C.-S. Chang. Performance Guarantees in Communication Networks. Springer-Verlag 2000.
TBD TBD Stochastic Network Calculus Basics Content:
Traffic models; Server models; Basic properties
Main reference:
Markus Fidler, Amr Rizk. A Guide to the Stochastic Network Calculus. IEEE Communications Surveys and Tutorials 17(1): 92-105 (2015).
Recommend to read:
Y. Jiang and Y. Liu. Stochastic Network Calculus. Springer 2008. (Ch.3, 4, 5 and 6).
See also:
C.-S. Chang. Performance Guarantees in Communication Networks. Springer-Verlag 2000.
TBD TBD Robust Queueing Theory Content:
Robust Queueing Theory
Main reference:
Chaithanya Bandi, Dimitris Bertsimas, Nataly Youssef. Robust Queueing Theory. Operations Research Operations Research 63 (3), 676-700, 2015.
Recommend to read:
Stavros Lopatatzidis, Jasper De Bock, Gert de Cooman, Stijn De Vuyst, Joris Walraevens. Robust queueing theory: an initial study using imprecise probabilities. Queueing Systems, 82(1), 2016.
Ward Whitt, Wei You. Using Robust Queueing to Expose the Impact of Dependence in Single-Server Queues. Submitted, 2016.
TBD TBD Effective Bandwidth and Effective Capacity Content:
Effective Bandwidth & Effective Capacity
Main references:
F.P. Kelly. Notes on effective bandwidths. In Stochastic Networks: Theory and Applications (Editors F.P. Kelly, S. Zachary and I.B. Ziedins) Oxford University Press, 1996. (
Dapeng Wu and R. Negi, “Effective Capacity: A Wireless Link Model for Support of Quality of Service,” IEEE Transactions on Wireless Communications, 2(4), pp. 630-643, 2003.
Recommend to read:
C.-S. Chang. Performance Guarantees in Communication Networks. Springer-Verlag 2000. (Ch. 8 and 9)
C. Courcoubetis, V.A. Siris, and G.D. Stamoulis. ``Application and Evaluation of Large Deviation Techniques for Traffic Engineering in Broadband Networks''. In Proc. of ACM SIGMETRICS '98/ PERFORMANCE '98
* Stochastic Geometry (for self-interest) Content:
Stochastic geometry and its application in analysis of wireless networks
Main reference:
Martin Haenggi, Jeffrey G. Andrews, Francois Baccelli, Olivier Dousse, and Massimo Franceschetti. Stochastic Geometry and Random Graphs for the Analysis and Design of Wireless Networks. IEEE JSAC 2009.
See also:
F. Baccelli and B. Blaszczyszyn. Stochastic Geometry and Wireless Networks (Volume I: Theory; Volume II: Applications). Fundations and Trends in Netwking. 2009.
* TCP Throughput (for self-interest) Content:
TCP throughput analysis
Main references:
Matthew Mathis , Jeffrey Semke , Jamshid Mahdavi , Teunis Ott, The macroscopic behavior of the TCP congestion avoidance algorithm, ACM SIGCOMM Computer Communication Review 1997
Jitendra Padhye, Victor Firoiu, Don Towsley, and Jim Kurose. Modeling TCP throughput: a simple model and its empirical validation. ACM SIGCOMM 1998
See also:
Eitan Altman , Konstantin Avrachenkov , Chadi Barakat, A stochastic model of TCP/IP with stationary random losses. IEEE/ACM Transactions on Networking (TON), 2005

Remark: Topics marked with “*” are for self-interest, not required in the final report.