Advanced Computer NetworksLecture 1. Logistics and Introduction

Husheng Li

Min Kao Department of Electrical Engineering and Computer ScienceUniversity of Tennessee, Knoxville

Spring, 2016

1/5

Syllabus

Homework: 4 problems each week; hand in your homework after oneweek. 20%

Midterm and Final Exames: 50%

Project: 30%

2/5

Goal of This Course

Understand the underling math for analyzing networks — Markovprocesses.

Understand the math theory for networks — queuing theory

Understand various aspects of networking — stability and scheduling

Study the math theory of some typical networks — Internet, TCP/IP andP2P networks.

We do not introduce detailed networking protocols. We are almostmathematicians.

3/5

Outline

Lecture 1. Markov Processes

Lecture 2. Model of Queuing

Lecture 3. Single Server Queuing Theory

Lecture 4. Multiple Server Queuing Theory

Lecture 5. Scheduling of Queues

Lecture 6. Workload of Queues

Lecture 7. Stability of Queues

Lecture 8. Math Modeling of Internet

Lecture 9. Network Protocols

Lecture 10. Peer-to-peer Networks

4/5

Textbooks

S. Meyn, Control Techniques for Complex Networks, CambridgeUniversity Press, 2007.

S. Asmussen, Applied Probability and Queues, Springer 2003.

R. Srikant and L. Ying, Communication Networks, Cambridge UniversityPress, 2013.

5/5