TSIN01 Information Networks
Introduction
The course aims to provide understanding of how a packet-oriented information network works and how the choice of multiple access communication protocol can affect its performance. The course intends to give good knowledge of the fundamental methods for multiple-access and routing in communication networks.
Lecture Content
- Introduction and Layered Network Architecture
- Queueing Models - Little’s Theorem
- The M/M/1 Queueing System
- Slotted Multiaccess and the Aloha System
- Splitting Algorithms
- Carrier Sensing
- Multiaccess Reservations
- Packet Radio Networks
- Routing Introduction
- Network Algorithms and Shortest Path Routing
Instructors
- Course director and lecturer: Zheng Chen
- Assistants: Zakir Hussain Shaik
Course Literature
The recommended course book is Data Networks by Dimitri Bertsekas and Robert G. Gallager, second edition, 1992, ISBN 9780132009164 (paperback). The book can be obtained by the university bookstore Bokakademin at a reasonable price. A scanned copy of the book can be downloaded from the author’s webpage.
Prerequisites
- Linear algebra, probability theory, and general mathematical maturity.
- Programming skills.
Information for enrolled students
For detailed lecture, tutorial and lab plans, see the course room in