Theory of Digital Networks

Contents

The lecture describes and analyzes the basic functions of protocols and explains the most important algorithms and methods, which are used in communication systems. The exercises complement the lecture by applying the theoretic knowledge to special problems.

The lecture usually includes an excursion to a working telecommunication network. The lecture is intended for Master students in electrical engineering, possibly also for students in computer science and mathematics.

Topics
  • Concepts and definitions of digital communication networks
  • Data transmission from point-to-point
  • Synchronization aspects
  • Multi-access protocols
  • ALOHA protocols (slotted, unslotted) and collision resolving strategies
  • Carrier-Sensing (with and without collision detection)
  • Techniques for reliable data transmission (ARQ- and hybrid-ARQ techniques)
  • Routing algorithms, flow in graphs, shortest path routing
  • Markov-chains
  • Queuing theory
  • Lossless and lossy queuing systems
  • Project orientated lab: ARQ, Markov chains, simulation of queuing systems
References
  • Bossert, M., Breitbach, M., Digitale Netze, Teubner Verlag, 1999
  • Bertsekas, D., Gallager, R., Data Networks, Prentice Hall, 1992
  • Tanenbaum, A., Computer Networks, Pearson, 2011
Formulary
  • The institute's formulary: PDF (updated 2011-05-23)
Additional Slides
  • Introduction Stochastic: PDF
  • ALOHA Protocol: PDF
  • Collision Resolution Strategies: PDF
Exercises
  1. Point-to-Point transmissions, bit stuffing: PDF
  2. Probability Theory, ALOHA: PDF
  3. ALOHA, Collision resolution: PDF
  4. CSMA: PDF
  5. ARQ: PDF
  6. ARQ: PDF
  7. Routing: PDF
  8. Markov Chains: PDF
  9. Queuing Theory: PDF
  10. Queuing Theory: PDF (corrected 2011-08-10)
Solutions
  1. Point-to-point transmissions, bit stuffing: PDF
  2. Probability Theory, ALOHA: PDF
  3. ALOHA, Collision resolution: PDF
  4. CSMA: PDF
  5. ARQ: PDF
  6. ARQ: PDF
  7. Routing: PDF
  8. Markov Chains: PDF
  9. Queuing Theory: PDF
  10. Queuing Theory: PDF (corrected 2011-08-10)
Lab Courses

ARQ Lab

  • The ARQ Lab will be introduced during Exercise 5.
  • Description ARQ-Lab PDF
  • Throughput (Solution) JPG

Queuing Lab

  • The Queuing Lab will be introduced during Exercise 11.
  • Description Queuing-Lab PDF
  • Basic Source-Code TAR.GZ
Important News

Please check this site regularly for any last-minute changes and announcements!

Summer Term 2011

Lecture:Wednesday, 10:15 - 12:45,
H45.1
Exercise:Tuesday, 8:30 - 10:00,
H45.1

Contact

Lecturers:
Prof. Dr.-Ing. Martin Bossert
Supervisors:
Dipl.-Ing. Henning Zörlein

Language

English

Requirements

Bachelor

Exams

Usualy written exam of 120min duration, otherwise oral exam.

More Informations

Hours per Week:  3V + 2Ü + 1P
8 ECTS Credits
LSF - ENGJ 8020